About the Execution of 2020-gold for ShieldIIPt-PT-030A
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
16254.052 | 3600000.00 | 2253453.00 | 31286.70 | FTFFFFFFFFFFTF?F | normal |
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.r227-tall-162098231000226.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 ShieldIIPt-PT-030A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r227-tall-162098231000226
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 138K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 76K May 10 09:44 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.2K Mar 28 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 12:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 12:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 17:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 17:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 159K May 5 16:52 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 ShieldIIPt-PT-030A-00
FORMULA_NAME ShieldIIPt-PT-030A-01
FORMULA_NAME ShieldIIPt-PT-030A-02
FORMULA_NAME ShieldIIPt-PT-030A-03
FORMULA_NAME ShieldIIPt-PT-030A-04
FORMULA_NAME ShieldIIPt-PT-030A-05
FORMULA_NAME ShieldIIPt-PT-030A-06
FORMULA_NAME ShieldIIPt-PT-030A-07
FORMULA_NAME ShieldIIPt-PT-030A-08
FORMULA_NAME ShieldIIPt-PT-030A-09
FORMULA_NAME ShieldIIPt-PT-030A-10
FORMULA_NAME ShieldIIPt-PT-030A-11
FORMULA_NAME ShieldIIPt-PT-030A-12
FORMULA_NAME ShieldIIPt-PT-030A-13
FORMULA_NAME ShieldIIPt-PT-030A-14
FORMULA_NAME ShieldIIPt-PT-030A-15
=== Now, execution of the tool begins
BK_START 1621146798130
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-16 06:33:19] [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-16 06:33:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 06:33:19] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2021-05-16 06:33:19] [INFO ] Transformed 573 places.
[2021-05-16 06:33:19] [INFO ] Transformed 423 transitions.
[2021-05-16 06:33:19] [INFO ] Found NUPN structural information;
[2021-05-16 06:33:19] [INFO ] Parsed PT model containing 573 places and 423 transitions in 129 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 29 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 806 ms. (steps per millisecond=124 ) properties seen :[1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0]
// Phase 1: matrix 422 rows 573 cols
[2021-05-16 06:33:20] [INFO ] Computed 271 place invariants in 14 ms
[2021-05-16 06:33:20] [INFO ] [Real]Absence check using 271 positive place invariants in 114 ms returned sat
[2021-05-16 06:33:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 06:33:21] [INFO ] [Real]Absence check using state equation in 589 ms returned sat
[2021-05-16 06:33:21] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 27 ms.
[2021-05-16 06:33:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 06:33:21] [INFO ] [Nat]Absence check using 271 positive place invariants in 108 ms returned sat
[2021-05-16 06:33:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 06:33:22] [INFO ] [Nat]Absence check using state equation in 570 ms returned sat
[2021-05-16 06:33:22] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 25 ms.
[2021-05-16 06:33:25] [INFO ] Added : 410 causal constraints over 83 iterations in 3474 ms. Result :sat
[2021-05-16 06:33:26] [INFO ] [Real]Absence check using 271 positive place invariants in 109 ms returned sat
[2021-05-16 06:33:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 06:33:26] [INFO ] [Real]Absence check using state equation in 570 ms returned sat
[2021-05-16 06:33:26] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 25 ms.
[2021-05-16 06:33:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 06:33:27] [INFO ] [Nat]Absence check using 271 positive place invariants in 102 ms returned sat
[2021-05-16 06:33:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 06:33:27] [INFO ] [Nat]Absence check using state equation in 569 ms returned sat
[2021-05-16 06:33:27] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 25 ms.
[2021-05-16 06:33:31] [INFO ] Added : 406 causal constraints over 82 iterations in 3807 ms. Result :sat
[2021-05-16 06:33:31] [INFO ] [Real]Absence check using 271 positive place invariants in 101 ms returned sat
[2021-05-16 06:33:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 06:33:32] [INFO ] [Real]Absence check using state equation in 569 ms returned sat
[2021-05-16 06:33:32] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 26 ms.
[2021-05-16 06:33:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 06:33:32] [INFO ] [Nat]Absence check using 271 positive place invariants in 101 ms returned sat
[2021-05-16 06:33:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 06:33:33] [INFO ] [Nat]Absence check using state equation in 562 ms returned sat
[2021-05-16 06:33:33] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 23 ms.
[2021-05-16 06:33:36] [INFO ] Added : 420 causal constraints over 86 iterations in 3441 ms. Result :sat
[2021-05-16 06:33:36] [INFO ] [Real]Absence check using 271 positive place invariants in 102 ms returned sat
[2021-05-16 06:33:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 06:33:37] [INFO ] [Real]Absence check using state equation in 570 ms returned sat
[2021-05-16 06:33:37] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 21 ms.
[2021-05-16 06:33:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 06:33:37] [INFO ] [Nat]Absence check using 271 positive place invariants in 103 ms returned sat
[2021-05-16 06:33:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 06:33:38] [INFO ] [Nat]Absence check using state equation in 566 ms returned sat
[2021-05-16 06:33:38] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 21 ms.
[2021-05-16 06:33:41] [INFO ] Added : 419 causal constraints over 86 iterations in 2982 ms. Result :sat
[2021-05-16 06:33:41] [INFO ] [Real]Absence check using 271 positive place invariants in 104 ms returned sat
[2021-05-16 06:33:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 06:33:41] [INFO ] [Real]Absence check using state equation in 574 ms returned sat
[2021-05-16 06:33:41] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 23 ms.
[2021-05-16 06:33:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 06:33:42] [INFO ] [Nat]Absence check using 271 positive place invariants in 102 ms returned sat
[2021-05-16 06:33:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 06:33:42] [INFO ] [Nat]Absence check using state equation in 570 ms returned sat
[2021-05-16 06:33:42] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 21 ms.
[2021-05-16 06:33:46] [INFO ] Added : 418 causal constraints over 84 iterations in 3365 ms. Result :sat
[2021-05-16 06:33:46] [INFO ] [Real]Absence check using 271 positive place invariants in 101 ms returned sat
[2021-05-16 06:33:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 06:33:46] [INFO ] [Real]Absence check using state equation in 575 ms returned sat
[2021-05-16 06:33:46] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 20 ms.
[2021-05-16 06:33:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 06:33:47] [INFO ] [Nat]Absence check using 271 positive place invariants in 102 ms returned sat
[2021-05-16 06:33:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 06:33:47] [INFO ] [Nat]Absence check using state equation in 571 ms returned sat
[2021-05-16 06:33:47] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 20 ms.
[2021-05-16 06:33:51] [INFO ] Added : 420 causal constraints over 85 iterations in 3579 ms. Result :sat
[2021-05-16 06:33:51] [INFO ] [Real]Absence check using 271 positive place invariants in 103 ms returned sat
[2021-05-16 06:33:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 06:33:51] [INFO ] [Real]Absence check using state equation in 575 ms returned sat
[2021-05-16 06:33:52] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 20 ms.
[2021-05-16 06:33:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 06:33:52] [INFO ] [Nat]Absence check using 271 positive place invariants in 102 ms returned sat
[2021-05-16 06:33:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 06:33:52] [INFO ] [Nat]Absence check using state equation in 570 ms returned sat
[2021-05-16 06:33:52] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 18 ms.
[2021-05-16 06:33:55] [INFO ] Added : 413 causal constraints over 84 iterations in 2982 ms. Result :sat
[2021-05-16 06:33:56] [INFO ] [Real]Absence check using 271 positive place invariants in 102 ms returned sat
[2021-05-16 06:33:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 06:33:56] [INFO ] [Real]Absence check using state equation in 575 ms returned sat
[2021-05-16 06:33:56] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 20 ms.
[2021-05-16 06:33:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 06:33:56] [INFO ] [Nat]Absence check using 271 positive place invariants in 101 ms returned sat
[2021-05-16 06:33:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 06:33:57] [INFO ] [Nat]Absence check using state equation in 565 ms returned sat
[2021-05-16 06:33:57] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 20 ms.
[2021-05-16 06:34:00] [INFO ] Added : 416 causal constraints over 84 iterations in 3179 ms. Result :sat
[2021-05-16 06:34:00] [INFO ] [Real]Absence check using 271 positive place invariants in 104 ms returned sat
[2021-05-16 06:34:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 06:34:01] [INFO ] [Real]Absence check using state equation in 569 ms returned sat
[2021-05-16 06:34:01] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 19 ms.
[2021-05-16 06:34:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 06:34:01] [INFO ] [Nat]Absence check using 271 positive place invariants in 101 ms returned sat
[2021-05-16 06:34:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 06:34:02] [INFO ] [Nat]Absence check using state equation in 570 ms returned sat
[2021-05-16 06:34:02] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 20 ms.
[2021-05-16 06:34:05] [INFO ] Added : 418 causal constraints over 85 iterations in 3125 ms. Result :sat
[2021-05-16 06:34:05] [INFO ] [Real]Absence check using 271 positive place invariants in 102 ms returned sat
[2021-05-16 06:34:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 06:34:06] [INFO ] [Real]Absence check using state equation in 609 ms returned sat
[2021-05-16 06:34:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 06:34:06] [INFO ] [Nat]Absence check using 271 positive place invariants in 103 ms returned sat
[2021-05-16 06:34:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 06:34:06] [INFO ] [Nat]Absence check using state equation in 603 ms returned sat
[2021-05-16 06:34:06] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 21 ms.
[2021-05-16 06:34:10] [INFO ] Added : 413 causal constraints over 84 iterations in 3505 ms. Result :sat
[2021-05-16 06:34:10] [INFO ] [Real]Absence check using 271 positive place invariants in 102 ms returned sat
[2021-05-16 06:34:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 06:34:11] [INFO ] [Real]Absence check using state equation in 572 ms returned sat
[2021-05-16 06:34:11] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 21 ms.
[2021-05-16 06:34:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 06:34:11] [INFO ] [Nat]Absence check using 271 positive place invariants in 100 ms returned sat
[2021-05-16 06:34:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 06:34:12] [INFO ] [Nat]Absence check using state equation in 571 ms returned sat
[2021-05-16 06:34:12] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 20 ms.
[2021-05-16 06:34:15] [INFO ] Added : 409 causal constraints over 84 iterations in 3014 ms. Result :sat
[2021-05-16 06:34:15] [INFO ] [Real]Absence check using 271 positive place invariants in 104 ms returned sat
[2021-05-16 06:34:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 06:34:15] [INFO ] [Real]Absence check using state equation in 578 ms returned sat
[2021-05-16 06:34:15] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 23 ms.
[2021-05-16 06:34:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 06:34:16] [INFO ] [Nat]Absence check using 271 positive place invariants in 101 ms returned sat
[2021-05-16 06:34:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 06:34:16] [INFO ] [Nat]Absence check using state equation in 578 ms returned sat
[2021-05-16 06:34:16] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 21 ms.
[2021-05-16 06:34:20] [INFO ] Added : 416 causal constraints over 85 iterations in 3413 ms. Result :sat
[2021-05-16 06:34:20] [INFO ] [Real]Absence check using 271 positive place invariants in 102 ms returned sat
[2021-05-16 06:34:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 06:34:20] [INFO ] [Real]Absence check using state equation in 584 ms returned sat
[2021-05-16 06:34:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 06:34:21] [INFO ] [Nat]Absence check using 271 positive place invariants in 101 ms returned sat
[2021-05-16 06:34:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 06:34:21] [INFO ] [Nat]Absence check using state equation in 584 ms returned sat
[2021-05-16 06:34:21] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 21 ms.
[2021-05-16 06:34:24] [INFO ] Added : 417 causal constraints over 85 iterations in 3285 ms. Result :sat
[2021-05-16 06:34:25] [INFO ] [Real]Absence check using 271 positive place invariants in 102 ms returned sat
[2021-05-16 06:34:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 06:34:25] [INFO ] [Real]Absence check using state equation in 572 ms returned sat
[2021-05-16 06:34:25] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 20 ms.
[2021-05-16 06:34:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 06:34:25] [INFO ] [Nat]Absence check using 271 positive place invariants in 100 ms returned sat
[2021-05-16 06:34:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 06:34:26] [INFO ] [Nat]Absence check using state equation in 569 ms returned sat
[2021-05-16 06:34:26] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 21 ms.
[2021-05-16 06:34:29] [INFO ] Added : 412 causal constraints over 84 iterations in 3135 ms. Result :sat
[2021-05-16 06:34:29] [INFO ] [Real]Absence check using 271 positive place invariants in 104 ms returned sat
[2021-05-16 06:34:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 06:34:30] [INFO ] [Real]Absence check using state equation in 573 ms returned sat
[2021-05-16 06:34:30] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 24 ms.
[2021-05-16 06:34:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 06:34:30] [INFO ] [Nat]Absence check using 271 positive place invariants in 102 ms returned sat
[2021-05-16 06:34:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 06:34:31] [INFO ] [Nat]Absence check using state equation in 568 ms returned sat
[2021-05-16 06:34:31] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 23 ms.
[2021-05-16 06:34:34] [INFO ] Added : 418 causal constraints over 85 iterations in 3142 ms. Result :sat
[2021-05-16 06:34:34] [INFO ] [Real]Absence check using 271 positive place invariants in 101 ms returned sat
[2021-05-16 06:34:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 06:34:35] [INFO ] [Real]Absence check using state equation in 572 ms returned sat
[2021-05-16 06:34:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 06:34:35] [INFO ] [Nat]Absence check using 271 positive place invariants in 100 ms returned sat
[2021-05-16 06:34:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 06:34:35] [INFO ] [Nat]Absence check using state equation in 568 ms returned sat
[2021-05-16 06:34:35] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 20 ms.
[2021-05-16 06:34:39] [INFO ] Added : 416 causal constraints over 85 iterations in 3298 ms. Result :sat
[2021-05-16 06:34:39] [INFO ] [Real]Absence check using 271 positive place invariants in 101 ms returned sat
[2021-05-16 06:34:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 06:34:40] [INFO ] [Real]Absence check using state equation in 569 ms returned sat
[2021-05-16 06:34:40] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 20 ms.
[2021-05-16 06:34:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 06:34:40] [INFO ] [Nat]Absence check using 271 positive place invariants in 101 ms returned sat
[2021-05-16 06:34:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 06:34:40] [INFO ] [Nat]Absence check using state equation in 566 ms returned sat
[2021-05-16 06:34:40] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 21 ms.
[2021-05-16 06:34:43] [INFO ] Added : 413 causal constraints over 86 iterations in 2916 ms. Result :sat
[2021-05-16 06:34:43] [INFO ] [Real]Absence check using 271 positive place invariants in 100 ms returned sat
[2021-05-16 06:34:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 06:34:44] [INFO ] [Real]Absence check using state equation in 564 ms returned sat
[2021-05-16 06:34:44] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 22 ms.
[2021-05-16 06:34:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 06:34:44] [INFO ] [Nat]Absence check using 271 positive place invariants in 100 ms returned sat
[2021-05-16 06:34:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 06:34:45] [INFO ] [Nat]Absence check using state equation in 565 ms returned sat
[2021-05-16 06:34:45] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 23 ms.
[2021-05-16 06:34:48] [INFO ] Added : 415 causal constraints over 84 iterations in 3145 ms. Result :sat
[2021-05-16 06:34:48] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2021-05-16 06:34:48] [INFO ] Flatten gal took : 104 ms
FORMULA ShieldIIPt-PT-030A-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030A-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030A-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030A-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030A-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 06:34:48] [INFO ] Applying decomposition
[2021-05-16 06:34:48] [INFO ] Flatten gal took : 50 ms
[2021-05-16 06:34:48] [INFO ] Decomposing Gal with order
[2021-05-16 06:34:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 06:34:48] [INFO ] Removed a total of 120 redundant transitions.
[2021-05-16 06:34:49] [INFO ] Flatten gal took : 77 ms
[2021-05-16 06:34:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 18 ms.
[2021-05-16 06:34:49] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2021-05-16 06:34:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 5 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ ShieldIIPt-PT-030A @ 3570 seconds
FORMULA ShieldIIPt-PT-030A-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPt-PT-030A-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPt-PT-030A-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPt-PT-030A-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPt-PT-030A-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPt-PT-030A-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPt-PT-030A-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPt-PT-030A-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPt-PT-030A-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPt-PT-030A-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPt-PT-030A-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1383
rslt: Output for LTLFireability @ ShieldIIPt-PT-030A
{
"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": "Sun May 16 06:34:50 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 323
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 323
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (((p318 <= 0)))",
"processed_size": 17,
"rewrites": 86
},
"result":
{
"edges": 836721,
"markings": 836669,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 354
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"aconj": 5,
"adisj": 0,
"aneg": 5,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 4,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G ((X (X (F (((p335 <= 0) OR (p360 <= 0))))) OR (F (((p335 <= 0) OR (p360 <= 0))) OR (((p89 <= 0)) OR (((p95 <= 0)) OR ((p97 <= 0)))))))",
"processed_size": 138,
"rewrites": 86
},
"result":
{
"edges": 2951,
"markings": 2951,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 393
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 3,
"aconj": 3,
"adisj": 3,
"aneg": 2,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 1,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "(((1 <= p32) AND (1 <= p38) AND (1 <= p40)) U (X (X (G (((p32 <= 0) OR (p38 <= 0) OR (p40 <= 0))))) AND (X (F (((p554 <= 0) OR (p571 <= 0)))) OR (((p32 <= 0)) OR (((p38 <= 0)) OR ((p40 <= 0)))))))",
"processed_size": 199,
"rewrites": 86
},
"result":
{
"edges": 4982,
"markings": 4982,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 16
},
"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": 442
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 442
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "((p438 <= 0))",
"processed_size": 13,
"rewrites": 86
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 506
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (((p109 <= 0) OR (p124 <= 0)))",
"processed_size": 33,
"rewrites": 86
},
"result":
{
"edges": 805,
"markings": 776,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 590
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 2,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((X (((p82 <= 0) OR (p91 <= 0))) OR (((p109 <= 0)) OR ((p124 <= 0)))))",
"processed_size": 73,
"rewrites": 86
},
"result":
{
"edges": 4989,
"markings": 4989,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 506
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 2,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "(((p213 <= 0) OR (p226 <= 0)) U X (F (((1 <= p479) AND (1 <= p492) AND (1 <= p248)))))",
"processed_size": 87,
"rewrites": 86
},
"result":
{
"edges": 5467,
"markings": 5467,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 590
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 590
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 0,
"aneg": 3,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((G (((p565 <= 0))) OR (((p101 <= 0) OR (p110 <= 0)) AND ((p565 <= 0)))))",
"processed_size": 76,
"rewrites": 86
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 708
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"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": "((1 <= p164) AND (1 <= p189))",
"processed_size": 29,
"rewrites": 86
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 885
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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 (((1 <= p4) AND (1 <= p17)))",
"processed_size": 30,
"rewrites": 86
},
"result":
{
"edges": 4982,
"markings": 4982,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 708
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (F ((F (((1 <= p529))) OR ((1 <= p79) AND (1 <= p96)))))",
"processed_size": 58,
"rewrites": 86
},
"result":
{
"edges": 4827,
"markings": 4827,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 885
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 1,
"aneg": 4,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G ((G ((X (((p354 <= 0) OR (p379 <= 0))) OR ((1 <= p354) AND (1 <= p379)))) AND (X (((p367 <= 0) OR (p376 <= 0))) OR F (((p71 <= 0))))))",
"processed_size": 138,
"rewrites": 86
},
"result":
{
"edges": 5071,
"markings": 5071,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 1235
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 1,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 5,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "F ((G ((F ((G (((1 <= p315) AND (1 <= p319) AND (1 <= p325))) AND (((1 <= p240)) AND ((1 <= p265))))) AND (((1 <= p481)) AND ((1 <= p490))))) AND ((p240 <= 0) OR (p265 <= 0) OR (p229 <= 0))))",
"processed_size": 193,
"rewrites": 86
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2470
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2470
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"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": "((1 <= p312) AND (1 <= p323))",
"processed_size": 29,
"rewrites": 86
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"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": "G (((1 <= p31) AND (1 <= p56)))",
"processed_size": 31,
"rewrites": 86
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"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": "G (((1 <= p63) AND (1 <= p72)))",
"processed_size": 31,
"rewrites": 86
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p312 <= 0) OR (p323 <= 0))",
"processed_size": 29,
"rewrites": 88
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"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": "((1 <= p312) AND (1 <= p323))",
"processed_size": 29,
"rewrites": 86
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"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": "((1 <= p430) AND (1 <= p455))",
"processed_size": 29,
"rewrites": 86
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"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": "G (((1 <= p31) AND (1 <= p56)))",
"processed_size": 31,
"rewrites": 86
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"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": "G (((1 <= p63) AND (1 <= p72)))",
"processed_size": 31,
"rewrites": 86
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p312 <= 0) OR (p323 <= 0))",
"processed_size": 29,
"rewrites": 88
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3868,
"runtime": 2187.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X((F(*) OR (** OR **))) AND G(**)) : G((X(X(F(*))) OR (F(*) OR (* OR (* OR *))))) : (** U (X(X(G(*))) AND (X(F(*)) OR (** OR (** OR **))))) : F((G((F((G(**) AND (** AND **))) AND (** AND **))) AND **)) : ((G((X(*) OR (** OR **))) OR (G(*) AND F(G((X(*) OR (** OR **)))))) AND **) : (F(**) OR (G(**) OR (** OR (** OR (G(**) AND F((F(**) OR (G(**) OR (** OR **))))))))) : (** U X(F(*))) : (F((G(*) OR (* AND *))) AND (X(**) OR **)) : X(F((F(**) OR **))) : F(G(*)) : G((G((X(*) OR *)) AND (X(*) OR F(*))))"
},
"net":
{
"arcs": 1804,
"conflict_clusters": 213,
"places": 573,
"places_significant": 302,
"singleton_clusters": 0,
"transitions": 422
},
"result":
{
"preliminary_value": "no no no no no no no no no unknown no ",
"value": "no no no no no no no no no unknown 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: 995/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 573
lola: finding significant places
lola: 573 places, 422 transitions, 302 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: LP says that atomic proposition is always true: (p521 <= 1)
lola: LP says that atomic proposition is always true: (p532 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p104 <= 1)
lola: LP says that atomic proposition is always true: (p318 <= 1)
lola: LP says that atomic proposition is always true: (p335 <= 1)
lola: LP says that atomic proposition is always true: (p360 <= 1)
lola: LP says that atomic proposition is always true: (p335 <= 1)
lola: LP says that atomic proposition is always true: (p360 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p554 <= 1)
lola: LP says that atomic proposition is always true: (p571 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p315 <= 1)
lola: LP says that atomic proposition is always true: (p319 <= 1)
lola: LP says that atomic proposition is always true: (p325 <= 1)
lola: LP says that atomic proposition is always true: (p240 <= 1)
lola: LP says that atomic proposition is always true: (p265 <= 1)
lola: LP says that atomic proposition is always true: (p481 <= 1)
lola: LP says that atomic proposition is always true: (p490 <= 1)
lola: LP says that atomic proposition is always true: (p240 <= 1)
lola: LP says that atomic proposition is always true: (p265 <= 1)
lola: LP says that atomic proposition is always true: (p229 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p124 <= 1)
lola: LP says that atomic proposition is always true: (p82 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p124 <= 1)
lola: LP says that atomic proposition is always true: (p438 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p312 <= 1)
lola: LP says that atomic proposition is always true: (p323 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p430 <= 1)
lola: LP says that atomic proposition is always true: (p455 <= 1)
lola: LP says that atomic proposition is always true: (p312 <= 1)
lola: LP says that atomic proposition is always true: (p323 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p226 <= 1)
lola: LP says that atomic proposition is always true: (p479 <= 1)
lola: LP says that atomic proposition is always true: (p492 <= 1)
lola: LP says that atomic proposition is always true: (p248 <= 1)
lola: LP says that atomic proposition is always true: (p101 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p565 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p164 <= 1)
lola: LP says that atomic proposition is always true: (p189 <= 1)
lola: LP says that atomic proposition is always true: (p529 <= 1)
lola: LP says that atomic proposition is always true: (p79 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p220 <= 1)
lola: LP says that atomic proposition is always true: (p224 <= 1)
lola: LP says that atomic proposition is always true: (p230 <= 1)
lola: LP says that atomic proposition is always true: (p354 <= 1)
lola: LP says that atomic proposition is always true: (p379 <= 1)
lola: LP says that atomic proposition is always true: (p354 <= 1)
lola: LP says that atomic proposition is always true: (p379 <= 1)
lola: LP says that atomic proposition is always true: (p367 <= 1)
lola: LP says that atomic proposition is always true: (p376 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: (X (((NOT(G (((1 <= p521) AND (1 <= p532)))) OR ((p102 <= 0))) OR ((p104 <= 0)))) AND G (((p318 <= 0)))) : NOT(F (((((X (G (X (((1 <= p335) AND (1 <= p360))))) AND G (((1 <= p335) AND (1 <= p360)))) AND ((1 <= p89))) AND ((1 <= p95))) AND ((1 <= p97))))) : (((1 <= p32) AND (1 <= p38) AND (1 <= p40)) U (NOT(X (F (X (((1 <= p32) AND (1 <= p38) AND (1 <= p40)))))) AND (((NOT(G (X (((1 <= p554) AND (1 <= p571))))) OR ((p32 <= 0))) OR ((p38 <= 0))) OR ((p40 <= 0))))) : F ((G (((F (((G (((1 <= p315) AND (1 <= p319) AND (1 <= p325))) AND ((1 <= p240))) AND ((1 <= p265)))) AND ((1 <= p481))) AND ((1 <= p490)))) AND ((p240 <= 0) OR (p265 <= 0) OR (p229 <= 0)))) : ((NOT(F (((1 <= p109) AND (1 <= p124)))) U G (((NOT(X (((1 <= p82) AND (1 <= p91)))) OR ((p109 <= 0))) OR ((p124 <= 0))))) AND ((p438 <= 0))) : (G (((1 <= p31) AND (1 <= p56))) U (((F (((1 <= p312) AND (1 <= p323))) OR G (((1 <= p63) AND (1 <= p72)))) OR ((1 <= p430) AND (1 <= p455))) OR ((1 <= p312) AND (1 <= p323)))) : (((p213 <= 0) OR (p226 <= 0)) U F (X (F (NOT(G (((p479 <= 0) OR (p492 <= 0) OR (p248 <= 0)))))))) : (NOT(G ((((1 <= p101) AND (1 <= p110)) U ((1 <= p565))))) AND (X (((1 <= p4) AND (1 <= p17))) OR ((1 <= p164) AND (1 <= p189)))) : X (F ((F (((1 <= p529))) OR ((1 <= p79) AND (1 <= p96))))) : F (X (X (NOT(X (F (((1 <= p220) AND (1 <= p224) AND (1 <= p230)))))))) : NOT(F ((F ((X (((1 <= p354) AND (1 <= p379))) AND ((p354 <= 0) OR (p379 <= 0)))) OR (X (((1 <= p367) AND (1 <= p376))) AND G (((1 <= p71)))))))
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k: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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:431
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:431
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((F (((p521 <= 0) OR (p532 <= 0))) OR (((p102 <= 0)) OR ((p104 <= 0))))) AND G (((p318 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p318 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p318 <= 0)))
lola: processed formula length: 17
lola: 86 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: 230271 markings, 230308 edges, 46054 markings/sec, 0 secs
lola: 465262 markings, 465305 edges, 46998 markings/sec, 5 secs
lola: 694376 markings, 694425 edges, 45823 markings/sec, 10 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 836669 markings, 836721 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (X (F (((p335 <= 0) OR (p360 <= 0))))) OR (F (((p335 <= 0) OR (p360 <= 0))) OR (((p89 <= 0)) OR (((p95 <= 0)) OR ((p97 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (X (F (((p335 <= 0) OR (p360 <= 0))))) OR (F (((p335 <= 0) OR (p360 <= 0))) OR (((p89 <= 0)) OR (((p95 <= 0)) OR ((p97 <= 0)))))))
lola: processed formula length: 138
lola: 86 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: 2951 markings, 2951 edges
lola: ========================================
lola: subprocess 2 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p32) AND (1 <= p38) AND (1 <= p40)) U (X (X (G (((p32 <= 0) OR (p38 <= 0) OR (p40 <= 0))))) AND (X (F (((p554 <= 0) OR (p571 <= 0)))) OR (((p32 <= 0)) OR (((p38 <= 0)) OR ((p40 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p32) AND (1 <= p38) AND (1 <= p40)) U (X (X (G (((p32 <= 0) OR (p38 <= 0) OR (p40 <= 0))))) AND (X (F (((p554 <= 0) OR (p571 <= 0)))) OR (((p32 <= 0)) OR (((p38 <= 0)) OR ((p40 <= 0)))))))
lola: processed formula length: 199
lola: 86 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 16 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4982 markings, 4982 edges
lola: ========================================
lola: subprocess 3 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((G ((X (((p82 <= 0) OR (p91 <= 0))) OR (((p109 <= 0)) OR ((p124 <= 0))))) OR (G (((p109 <= 0) OR (p124 <= 0))) AND F (G ((X (((p82 <= 0) OR (p91 <= 0))) OR (((p109 <= 0)) OR ((p124 <= 0)))))))) AND ((p438 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p438 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p438 <= 0))
lola: processed formula length: 13
lola: 86 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 506 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p109 <= 0) OR (p124 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p109 <= 0) OR (p124 <= 0)))
lola: processed formula length: 33
lola: 86 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: 776 markings, 805 edges
lola: ========================================
lola: subprocess 5 will run for 590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (((p82 <= 0) OR (p91 <= 0))) OR (((p109 <= 0)) OR ((p124 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (((p82 <= 0) OR (p91 <= 0))) OR (((p109 <= 0)) OR ((p124 <= 0)))))
lola: processed formula length: 73
lola: 86 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: 4989 markings, 4989 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 506 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p213 <= 0) OR (p226 <= 0)) U X (F (((1 <= p479) AND (1 <= p492) AND (1 <= p248)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((p213 <= 0) OR (p226 <= 0)) U X (F (((1 <= p479) AND (1 <= p492) AND (1 <= p248)))))
lola: processed formula length: 87
lola: 86 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: 5467 markings, 5467 edges
lola: ========================================
lola: subprocess 5 will run for 590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((G (((p565 <= 0))) OR (((p101 <= 0) OR (p110 <= 0)) AND ((p565 <= 0))))) AND (X (((1 <= p4) AND (1 <= p17))) OR ((1 <= p164) AND (1 <= p189))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G (((p565 <= 0))) OR (((p101 <= 0) OR (p110 <= 0)) AND ((p565 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (((p565 <= 0))) OR (((p101 <= 0) OR (p110 <= 0)) AND ((p565 <= 0)))))
lola: processed formula length: 76
lola: 86 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 708 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p164) AND (1 <= p189))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p164) AND (1 <= p189))
lola: processed formula length: 29
lola: 86 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 885 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((1 <= p4) AND (1 <= p17)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((1 <= p4) AND (1 <= p17)))
lola: processed formula length: 30
lola: 86 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: 4982 markings, 4982 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 708 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((F (((1 <= p529))) OR ((1 <= p79) AND (1 <= p96)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((F (((1 <= p529))) OR ((1 <= p79) AND (1 <= p96)))))
lola: processed formula length: 58
lola: 86 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4827 markings, 4827 edges
lola: ========================================
lola: subprocess 7 will run for 885 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G ((X (((p354 <= 0) OR (p379 <= 0))) OR ((1 <= p354) AND (1 <= p379)))) AND (X (((p367 <= 0) OR (p376 <= 0))) OR F (((p71 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G ((X (((p354 <= 0) OR (p379 <= 0))) OR ((1 <= p354) AND (1 <= p379)))) AND (X (((p367 <= 0) OR (p376 <= 0))) OR F (((p71 <= 0))))))
lola: processed formula length: 138
lola: 86 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5071 markings, 5071 edges
lola: ========================================
lola: subprocess 8 will run for 1180 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p220 <= 0) OR (p224 <= 0) OR (p230 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((p220 <= 0) OR (p224 <= 0) OR (p230 <= 0))))
lola: processed formula length: 53
lola: 86 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: 801057 markings, 1053700 edges, 160211 markings/sec, 0 secs
lola: 1642733 markings, 2170195 edges, 168335 markings/sec, 5 secs
lola: 2359792 markings, 3121808 edges, 143412 markings/sec, 10 secs
lola: 3103962 markings, 4107728 edges, 148834 markings/sec, 15 secs
lola: 3842218 markings, 5090324 edges, 147651 markings/sec, 20 secs
lola: 4565958 markings, 6051250 edges, 144748 markings/sec, 25 secs
lola: 5243204 markings, 6947941 edges, 135449 markings/sec, 30 secs
lola: 5917530 markings, 7842223 edges, 134865 markings/sec, 35 secs
lola: 6631618 markings, 8790552 edges, 142818 markings/sec, 40 secs
lola: 7257892 markings, 9623598 edges, 125255 markings/sec, 45 secs
lola: 7961975 markings, 10559689 edges, 140817 markings/sec, 50 secs
lola: 8631353 markings, 11448725 edges, 133876 markings/sec, 55 secs
lola: 9301930 markings, 12340247 edges, 134115 markings/sec, 60 secs
lola: 9914480 markings, 13155851 edges, 122510 markings/sec, 65 secs
lola: 10562781 markings, 14018022 edges, 129660 markings/sec, 70 secs
lola: 11225550 markings, 14901393 edges, 132554 markings/sec, 75 secs
lola: 11866990 markings, 15755034 edges, 128288 markings/sec, 80 secs
lola: 12469007 markings, 16555219 edges, 120403 markings/sec, 85 secs
lola: 13154584 markings, 17465006 edges, 137115 markings/sec, 90 secs
lola: 13778013 markings, 18294744 edges, 124686 markings/sec, 95 secs
lola: 14403576 markings, 19128280 edges, 125113 markings/sec, 100 secs
lola: 15032150 markings, 19963945 edges, 125715 markings/sec, 105 secs
lola: 15632943 markings, 20763547 edges, 120159 markings/sec, 110 secs
lola: 16233831 markings, 21563869 edges, 120178 markings/sec, 115 secs
lola: 16835030 markings, 22365773 edges, 120240 markings/sec, 120 secs
lola: 17466428 markings, 23205414 edges, 126280 markings/sec, 125 secs
lola: 18127752 markings, 24085603 edges, 132265 markings/sec, 130 secs
lola: 18749340 markings, 24912631 edges, 124318 markings/sec, 135 secs
lola: 19287928 markings, 25627279 edges, 107718 markings/sec, 140 secs
lola: 19891341 markings, 26431268 edges, 120683 markings/sec, 145 secs
lola: 20534873 markings, 27285414 edges, 128706 markings/sec, 150 secs
lola: 21123761 markings, 28069775 edges, 117778 markings/sec, 155 secs
lola: 21681121 markings, 28811390 edges, 111472 markings/sec, 160 secs
lola: 22244818 markings, 29561283 edges, 112739 markings/sec, 165 secs
lola: 22835598 markings, 30350210 edges, 118156 markings/sec, 170 secs
lola: 23436832 markings, 31152135 edges, 120247 markings/sec, 175 secs
lola: 24016639 markings, 31923694 edges, 115961 markings/sec, 180 secs
lola: 24628822 markings, 32738334 edges, 122437 markings/sec, 185 secs
lola: 25277547 markings, 33598504 edges, 129745 markings/sec, 190 secs
lola: 25874653 markings, 34392636 edges, 119421 markings/sec, 195 secs
lola: 26494331 markings, 35215693 edges, 123936 markings/sec, 200 secs
lola: 27064516 markings, 35977505 edges, 114037 markings/sec, 205 secs
lola: 27671005 markings, 36786109 edges, 121298 markings/sec, 210 secs
lola: 28249714 markings, 37554412 edges, 115742 markings/sec, 215 secs
lola: 28901241 markings, 38423497 edges, 130305 markings/sec, 220 secs
lola: 29562392 markings, 39304681 edges, 132230 markings/sec, 225 secs
lola: 30201323 markings, 40155682 edges, 127786 markings/sec, 230 secs
lola: 30758419 markings, 40896606 edges, 111419 markings/sec, 235 secs
lola: 31367195 markings, 41708949 edges, 121755 markings/sec, 240 secs
lola: 31917856 markings, 42445877 edges, 110132 markings/sec, 245 secs
lola: 32565511 markings, 43309807 edges, 129531 markings/sec, 250 secs
lola: 33105192 markings, 44029080 edges, 107936 markings/sec, 255 secs
lola: 33766992 markings, 44910337 edges, 132360 markings/sec, 260 secs
lola: 34374918 markings, 45720180 edges, 121585 markings/sec, 265 secs
lola: 34985295 markings, 46532652 edges, 122075 markings/sec, 270 secs
lola: 35576505 markings, 47317532 edges, 118242 markings/sec, 275 secs
lola: 36139166 markings, 48067191 edges, 112532 markings/sec, 280 secs
lola: 36705188 markings, 48820760 edges, 113204 markings/sec, 285 secs
lola: 37241994 markings, 49539206 edges, 107361 markings/sec, 290 secs
lola: 37804949 markings, 50287160 edges, 112591 markings/sec, 295 secs
lola: 38408851 markings, 51093333 edges, 120780 markings/sec, 300 secs
lola: 38990843 markings, 51867312 edges, 116398 markings/sec, 305 secs
lola: 39584853 markings, 52658075 edges, 118802 markings/sec, 310 secs
lola: 40090960 markings, 53332443 edges, 101221 markings/sec, 315 secs
lola: 40664302 markings, 54095800 edges, 114668 markings/sec, 320 secs
lola: 41227779 markings, 54844028 edges, 112695 markings/sec, 325 secs
lola: 41849641 markings, 55677184 edges, 124372 markings/sec, 330 secs
lola: 42438466 markings, 56463554 edges, 117765 markings/sec, 335 secs
lola: 43037827 markings, 57261588 edges, 119872 markings/sec, 340 secs
lola: 43652763 markings, 58083465 edges, 122987 markings/sec, 345 secs
lola: 44242991 markings, 58875025 edges, 118046 markings/sec, 350 secs
lola: 44851050 markings, 59686117 edges, 121612 markings/sec, 355 secs
lola: 45398291 markings, 60419087 edges, 109448 markings/sec, 360 secs
lola: 45917507 markings, 61110755 edges, 103843 markings/sec, 365 secs
lola: 46427998 markings, 61791604 edges, 102098 markings/sec, 370 secs
lola: 47041420 markings, 62608259 edges, 122684 markings/sec, 375 secs
lola: 47582044 markings, 63328910 edges, 108125 markings/sec, 380 secs
lola: 48175454 markings, 64120849 edges, 118682 markings/sec, 385 secs
lola: 48753600 markings, 64890643 edges, 115629 markings/sec, 390 secs
lola: 49353972 markings, 65692598 edges, 120074 markings/sec, 395 secs
lola: 49867604 markings, 66375982 edges, 102726 markings/sec, 400 secs
lola: 50421330 markings, 67116271 edges, 110745 markings/sec, 405 secs
lola: 51021687 markings, 67918278 edges, 120071 markings/sec, 410 secs
lola: 51613888 markings, 68708009 edges, 118440 markings/sec, 415 secs
lola: 52207929 markings, 69499382 edges, 118808 markings/sec, 420 secs
lola: 52737706 markings, 70206882 edges, 105955 markings/sec, 425 secs
lola: 53267528 markings, 70914409 edges, 105964 markings/sec, 430 secs
lola: 53854208 markings, 71697463 edges, 117336 markings/sec, 435 secs
lola: 54434689 markings, 72469598 edges, 116096 markings/sec, 440 secs
lola: 54989121 markings, 73208137 edges, 110886 markings/sec, 445 secs
lola: 55557353 markings, 73965391 edges, 113646 markings/sec, 450 secs
lola: 56126735 markings, 74725153 edges, 113876 markings/sec, 455 secs
lola: 56665440 markings, 75443299 edges, 107741 markings/sec, 460 secs
lola: 57230985 markings, 76197043 edges, 113109 markings/sec, 465 secs
lola: 57832809 markings, 76999828 edges, 120365 markings/sec, 470 secs
lola: 58359090 markings, 77703215 edges, 105256 markings/sec, 475 secs
lola: 58942336 markings, 78482711 edges, 116649 markings/sec, 480 secs
lola: 59539397 markings, 79278832 edges, 119412 markings/sec, 485 secs
lola: 60108422 markings, 80038562 edges, 113805 markings/sec, 490 secs
lola: 60714635 markings, 80848351 edges, 121243 markings/sec, 495 secs
lola: 61182716 markings, 81471924 edges, 93616 markings/sec, 500 secs
lola: 61661153 markings, 82109606 edges, 95687 markings/sec, 505 secs
lola: 62150835 markings, 82763892 edges, 97936 markings/sec, 510 secs
lola: 62720200 markings, 83525346 edges, 113873 markings/sec, 515 secs
lola: 63351592 markings, 84365947 edges, 126278 markings/sec, 520 secs
lola: 63878098 markings, 85068130 edges, 105301 markings/sec, 525 secs
lola: 64420337 markings, 85792422 edges, 108448 markings/sec, 530 secs
lola: 64991123 markings, 86553135 edges, 114157 markings/sec, 535 secs
lola: 65521686 markings, 87260189 edges, 106113 markings/sec, 540 secs
lola: 66079672 markings, 88005187 edges, 111597 markings/sec, 545 secs
lola: 66601176 markings, 88703842 edges, 104301 markings/sec, 550 secs
lola: 67142549 markings, 89425492 edges, 108275 markings/sec, 555 secs
lola: 67765286 markings, 90257210 edges, 124547 markings/sec, 560 secs
lola: 68300135 markings, 90970215 edges, 106970 markings/sec, 565 secs
lola: 68916753 markings, 91788843 edges, 123324 markings/sec, 570 secs
lola: 69497461 markings, 92565334 edges, 116142 markings/sec, 575 secs
lola: 70056669 markings, 93311980 edges, 111842 markings/sec, 580 secs
lola: 70666037 markings, 94123818 edges, 121874 markings/sec, 585 secs
lola: 71227912 markings, 94873881 edges, 112375 markings/sec, 590 secs
lola: 71787049 markings, 95619487 edges, 111827 markings/sec, 595 secs
lola: 72332910 markings, 96348440 edges, 109172 markings/sec, 600 secs
lola: 72844857 markings, 97032841 edges, 102389 markings/sec, 605 secs
lola: 73337128 markings, 97690292 edges, 98454 markings/sec, 610 secs
lola: 73959676 markings, 98522704 edges, 124510 markings/sec, 615 secs
lola: 74534595 markings, 99289738 edges, 114984 markings/sec, 620 secs
lola: 75092502 markings, 100035814 edges, 111581 markings/sec, 625 secs
lola: 75605225 markings, 100720928 edges, 102545 markings/sec, 630 secs
lola: 76157173 markings, 101457361 edges, 110390 markings/sec, 635 secs
lola: 76669736 markings, 102143632 edges, 102513 markings/sec, 640 secs
lola: 77195262 markings, 102845055 edges, 105105 markings/sec, 645 secs
lola: 77673530 markings, 103483186 edges, 95654 markings/sec, 650 secs
lola: 78185181 markings, 104165772 edges, 102330 markings/sec, 655 secs
lola: 78729014 markings, 104894702 edges, 108767 markings/sec, 660 secs
lola: 79266688 markings, 105612827 edges, 107535 markings/sec, 665 secs
lola: 79750689 markings, 106259326 edges, 96800 markings/sec, 670 secs
lola: 80285273 markings, 106974201 edges, 106917 markings/sec, 675 secs
lola: 80766505 markings, 107620716 edges, 96246 markings/sec, 680 secs
lola: 81326124 markings, 108366755 edges, 111924 markings/sec, 685 secs
lola: 81931798 markings, 109175956 edges, 121135 markings/sec, 690 secs
lola: 82436597 markings, 109847613 edges, 100960 markings/sec, 695 secs
lola: 82994451 markings, 110591931 edges, 111571 markings/sec, 700 secs
lola: 83509878 markings, 111279145 edges, 103085 markings/sec, 705 secs
lola: 84015840 markings, 111953451 edges, 101192 markings/sec, 710 secs
lola: 84524285 markings, 112633115 edges, 101689 markings/sec, 715 secs
lola: 85027854 markings, 113307093 edges, 100714 markings/sec, 720 secs
lola: 85547931 markings, 114002958 edges, 104015 markings/sec, 725 secs
lola: 86088833 markings, 114725604 edges, 108180 markings/sec, 730 secs
lola: 86537366 markings, 115322926 edges, 89707 markings/sec, 735 secs
lola: 87085199 markings, 116054339 edges, 109567 markings/sec, 740 secs
lola: 87621868 markings, 116769834 edges, 107334 markings/sec, 745 secs
lola: 88208181 markings, 117549945 edges, 117263 markings/sec, 750 secs
lola: 88778980 markings, 118314643 edges, 114160 markings/sec, 755 secs
lola: 89337411 markings, 119059455 edges, 111686 markings/sec, 760 secs
lola: 89788935 markings, 119662350 edges, 90305 markings/sec, 765 secs
lola: 90305299 markings, 120353720 edges, 103273 markings/sec, 770 secs
lola: 90863885 markings, 121105277 edges, 111717 markings/sec, 775 secs
lola: 91436820 markings, 121870402 edges, 114587 markings/sec, 780 secs
lola: 91885287 markings, 122467431 edges, 89693 markings/sec, 785 secs
lola: 92301243 markings, 123021273 edges, 83191 markings/sec, 790 secs
lola: 92806826 markings, 123694251 edges, 101117 markings/sec, 795 secs
lola: 93312361 markings, 124370185 edges, 101107 markings/sec, 800 secs
lola: 93804165 markings, 125025697 edges, 98361 markings/sec, 805 secs
lola: 94237836 markings, 125605873 edges, 86734 markings/sec, 810 secs
lola: 94756774 markings, 126299957 edges, 103788 markings/sec, 815 secs
lola: 95283836 markings, 127006010 edges, 105412 markings/sec, 820 secs
lola: 95754068 markings, 127633050 edges, 94046 markings/sec, 825 secs
lola: 96213222 markings, 128246240 edges, 91831 markings/sec, 830 secs
lola: 96730170 markings, 128935532 edges, 103390 markings/sec, 835 secs
lola: 97303651 markings, 129701324 edges, 114696 markings/sec, 840 secs
lola: 97783671 markings, 130346298 edges, 96004 markings/sec, 845 secs
lola: 98321553 markings, 131066954 edges, 107576 markings/sec, 850 secs
lola: 98834541 markings, 131751582 edges, 102598 markings/sec, 855 secs
lola: 99335597 markings, 132423647 edges, 100211 markings/sec, 860 secs
lola: 99787450 markings, 133026895 edges, 90371 markings/sec, 865 secs
lola: 100285266 markings, 133692128 edges, 99563 markings/sec, 870 secs
lola: 100712532 markings, 134263280 edges, 85453 markings/sec, 875 secs
lola: 101180237 markings, 134890335 edges, 93541 markings/sec, 880 secs
lola: 101633051 markings, 135495137 edges, 90563 markings/sec, 885 secs
lola: 102103389 markings, 136125147 edges, 94068 markings/sec, 890 secs
lola: 102597127 markings, 136785801 edges, 98748 markings/sec, 895 secs
lola: 103047529 markings, 137386084 edges, 90080 markings/sec, 900 secs
lola: 103540872 markings, 138045802 edges, 98669 markings/sec, 905 secs
lola: 103996118 markings, 138654507 edges, 91049 markings/sec, 910 secs
lola: 104432259 markings, 139239713 edges, 87228 markings/sec, 915 secs
lola: 104962323 markings, 139944468 edges, 106013 markings/sec, 920 secs
lola: 105470308 markings, 140625669 edges, 101597 markings/sec, 925 secs
lola: 106001715 markings, 141333915 edges, 106281 markings/sec, 930 secs
lola: 106489720 markings, 141986583 edges, 97601 markings/sec, 935 secs
lola: 106989629 markings, 142657701 edges, 99982 markings/sec, 940 secs
lola: 107491014 markings, 143326309 edges, 100277 markings/sec, 945 secs
lola: 107925179 markings, 143905035 edges, 86833 markings/sec, 950 secs
lola: 108443491 markings, 144596026 edges, 103662 markings/sec, 955 secs
lola: 109004319 markings, 145344560 edges, 112166 markings/sec, 960 secs
lola: 109466756 markings, 145957681 edges, 92487 markings/sec, 965 secs
lola: 109905322 markings, 146542978 edges, 87713 markings/sec, 970 secs
lola: 110429788 markings, 147245554 edges, 104893 markings/sec, 975 secs
lola: 110878733 markings, 147846789 edges, 89789 markings/sec, 980 secs
lola: 111279534 markings, 148380542 edges, 80160 markings/sec, 985 secs
lola: 111790998 markings, 149062634 edges, 102293 markings/sec, 990 secs
lola: 112264825 markings, 149697428 edges, 94765 markings/sec, 995 secs
lola: 112806402 markings, 150423844 edges, 108315 markings/sec, 1000 secs
lola: 113266433 markings, 151039506 edges, 92006 markings/sec, 1005 secs
lola: 113768742 markings, 151709343 edges, 100462 markings/sec, 1010 secs
lola: 114257905 markings, 152365420 edges, 97833 markings/sec, 1015 secs
lola: 114685811 markings, 152937177 edges, 85581 markings/sec, 1020 secs
lola: 114760964 markings, 153039238 edges, 15031 markings/sec, 1025 secs
lola: 114905056 markings, 153230693 edges, 28818 markings/sec, 1030 secs
lola: 114923887 markings, 153255675 edges, 3766 markings/sec, 1035 secs
lola: 114925132 markings, 153257361 edges, 249 markings/sec, 1040 secs
lola: 114925837 markings, 153258340 edges, 141 markings/sec, 1045 secs
lola: 114926271 markings, 153258934 edges, 87 markings/sec, 1050 secs
lola: 114927888 markings, 153261105 edges, 323 markings/sec, 1055 secs
lola: 114936092 markings, 153272060 edges, 1641 markings/sec, 1060 secs
lola: 114936970 markings, 153273261 edges, 176 markings/sec, 1065 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 1235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((F ((G (((1 <= p315) AND (1 <= p319) AND (1 <= p325))) AND (((1 <= p240)) AND ((1 <= p265))))) AND (((1 <= p481)) AND ((1 <= p490))))) AND ((p240 <= 0) OR (p265 <= 0) OR (p229 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((F ((G (((1 <= p315) AND (1 <= p319) AND (1 <= p325))) AND (((1 <= p240)) AND ((1 <= p265))))) AND (((1 <= p481)) AND ((1 <= p490))))) AND ((p240 <= 0) OR (p265 <= 0) OR (p229 <= 0))))
lola: processed formula length: 193
lola: 86 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 8 markings, 8 edges
lola: ========================================
lola: subprocess 10 will run for 2470 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p312) AND (1 <= p323))) OR (G (((1 <= p63) AND (1 <= p72))) OR (((1 <= p430) AND (1 <= p455)) OR (((1 <= p312) AND (1 <= p323)) OR (G (((1 <= p31) AND (1 <= p56))) AND F ((F (((1 <= p312) AND (1 <= p323))) OR (G (((1 <= p63) AND (1 <= p72))) OR (((1 <= p430) AND (1 <= p455)) OR ((1 <= p312) AND (1 <= p323)))))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 2470 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p312) AND (1 <= p323))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p312) AND (1 <= p323))
lola: processed formula length: 29
lola: 86 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p31) AND (1 <= p56)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p31) AND (1 <= p56)))
lola: processed formula length: 31
lola: 86 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 8 markings, 8 edges
lola: ========================================
lola: subprocess 13 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p63) AND (1 <= p72)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p63) AND (1 <= p72)))
lola: processed formula length: 31
lola: 86 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 8 markings, 8 edges
lola: ========================================
lola: subprocess 14 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p312) AND (1 <= p323)))
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: ((p312 <= 0) OR (p323 <= 0))
lola: processed formula length: 29
lola: 88 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 8 markings, 8 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G (((p220 <= 0) OR (p224 <= 0) OR (p230 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((p220 <= 0) OR (p224 <= 0) OR (p230 <= 0))))
lola: processed formula length: 53
lola: 86 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: 772640 markings, 1016215 edges, 154528 markings/sec, 0 secs
lola: 1594514 markings, 2106374 edges, 164375 markings/sec, 5 secs
lola: 2285759 markings, 3023161 edges, 138249 markings/sec, 10 secs
lola: 3033919 markings, 4015502 edges, 149632 markings/sec, 15 secs
lola: 3725846 markings, 4934758 edges, 138385 markings/sec, 20 secs
lola: 4432164 markings, 5873176 edges, 141264 markings/sec, 25 secs
lola: 5090343 markings, 6745868 edges, 131636 markings/sec, 30 secs
lola: 5744899 markings, 7613195 edges, 130911 markings/sec, 35 secs
lola: 6461684 markings, 8565163 edges, 143357 markings/sec, 40 secs
lola: 7105831 markings, 9421002 edges, 128829 markings/sec, 45 secs
lola: 7758320 markings, 10288941 edges, 130498 markings/sec, 50 secs
lola: 8446897 markings, 11203280 edges, 137715 markings/sec, 55 secs
lola: 9101638 markings, 12074479 edges, 130948 markings/sec, 60 secs
lola: 9703041 markings, 12873687 edges, 120281 markings/sec, 65 secs
lola: 10326073 markings, 13704179 edges, 124606 markings/sec, 70 secs
lola: 10988296 markings, 14584428 edges, 132445 markings/sec, 75 secs
lola: 11625658 markings, 15432990 edges, 127472 markings/sec, 80 secs
lola: 12267072 markings, 16287372 edges, 128283 markings/sec, 85 secs
lola: 12887052 markings, 17110440 edges, 123996 markings/sec, 90 secs
lola: 13536200 markings, 17973543 edges, 129830 markings/sec, 95 secs
lola: 14173737 markings, 18822168 edges, 127507 markings/sec, 100 secs
lola: 14753455 markings, 19592753 edges, 115944 markings/sec, 105 secs
lola: 15404798 markings, 20459522 edges, 130269 markings/sec, 110 secs
lola: 15937481 markings, 21169578 edges, 106537 markings/sec, 115 secs
lola: 16540744 markings, 21972707 edges, 120653 markings/sec, 120 secs
lola: 17181317 markings, 22827999 edges, 128115 markings/sec, 125 secs
lola: 17813608 markings, 23667971 edges, 126458 markings/sec, 130 secs
lola: 18465060 markings, 24534368 edges, 130290 markings/sec, 135 secs
lola: 19052423 markings, 25315346 edges, 117473 markings/sec, 140 secs
lola: 19603701 markings, 26048355 edges, 110256 markings/sec, 145 secs
lola: 20162461 markings, 26792859 edges, 111752 markings/sec, 150 secs
lola: 20783170 markings, 27616183 edges, 124142 markings/sec, 155 secs
lola: 21400248 markings, 28437487 edges, 123416 markings/sec, 160 secs
lola: 21930953 markings, 29143697 edges, 106141 markings/sec, 165 secs
lola: 22497466 markings, 29899026 edges, 113303 markings/sec, 170 secs
lola: 23051778 markings, 30640275 edges, 110862 markings/sec, 175 secs
lola: 23638031 markings, 31419824 edges, 117251 markings/sec, 180 secs
lola: 24253583 markings, 32239600 edges, 123110 markings/sec, 185 secs
lola: 24847534 markings, 33028540 edges, 118790 markings/sec, 190 secs
lola: 25430567 markings, 33801928 edges, 116607 markings/sec, 195 secs
lola: 26039379 markings, 34611046 edges, 121762 markings/sec, 200 secs
lola: 26604661 markings, 35362118 edges, 113056 markings/sec, 205 secs
lola: 27174513 markings, 36125621 edges, 113970 markings/sec, 210 secs
lola: 27743960 markings, 36883084 edges, 113889 markings/sec, 215 secs
lola: 28295613 markings, 37615564 edges, 110331 markings/sec, 220 secs
lola: 28923015 markings, 38452183 edges, 125480 markings/sec, 225 secs
lola: 29556928 markings, 39297346 edges, 126783 markings/sec, 230 secs
lola: 30164872 markings, 40107116 edges, 121589 markings/sec, 235 secs
lola: 30695811 markings, 40812748 edges, 106188 markings/sec, 240 secs
lola: 31280867 markings, 41593912 edges, 117011 markings/sec, 245 secs
lola: 31829272 markings, 42327844 edges, 109681 markings/sec, 250 secs
lola: 32405746 markings, 43096200 edges, 115295 markings/sec, 255 secs
lola: 32951242 markings, 43824293 edges, 109099 markings/sec, 260 secs
lola: 33527804 markings, 44591139 edges, 115312 markings/sec, 265 secs
lola: 34114097 markings, 45373371 edges, 117259 markings/sec, 270 secs
lola: 34737216 markings, 46202670 edges, 124624 markings/sec, 275 secs
lola: 35297623 markings, 46947377 edges, 112081 markings/sec, 280 secs
lola: 35860199 markings, 47695488 edges, 112515 markings/sec, 285 secs
lola: 36374365 markings, 48380365 edges, 102833 markings/sec, 290 secs
lola: 36898637 markings, 49079731 edges, 104854 markings/sec, 295 secs
lola: 37387062 markings, 49732135 edges, 97685 markings/sec, 300 secs
lola: 37956391 markings, 50488210 edges, 113866 markings/sec, 305 secs
lola: 38490520 markings, 51201517 edges, 106826 markings/sec, 310 secs
lola: 39089231 markings, 51998093 edges, 119742 markings/sec, 315 secs
lola: 39639134 markings, 52731114 edges, 109981 markings/sec, 320 secs
lola: 40121932 markings, 53373860 edges, 96560 markings/sec, 325 secs
lola: 40660484 markings, 54090599 edges, 107710 markings/sec, 330 secs
lola: 41190362 markings, 54794041 edges, 105976 markings/sec, 335 secs
lola: 41786255 markings, 55591668 edges, 119179 markings/sec, 340 secs
lola: 42342038 markings, 56335112 edges, 111157 markings/sec, 345 secs
lola: 42907988 markings, 57088180 edges, 113190 markings/sec, 350 secs
lola: 43528066 markings, 57915190 edges, 124016 markings/sec, 355 secs
lola: 44085423 markings, 58664833 edges, 111471 markings/sec, 360 secs
lola: 44670063 markings, 59445221 edges, 116928 markings/sec, 365 secs
lola: 45177902 markings, 60124923 edges, 101568 markings/sec, 370 secs
lola: 45714106 markings, 60839197 edges, 107241 markings/sec, 375 secs
lola: 46158637 markings, 61432119 edges, 88906 markings/sec, 380 secs
lola: 46717035 markings, 62175937 edges, 111680 markings/sec, 385 secs
lola: 47303880 markings, 62957918 edges, 117369 markings/sec, 390 secs
lola: 47800490 markings, 63620773 edges, 99322 markings/sec, 395 secs
lola: 48360232 markings, 64367304 edges, 111948 markings/sec, 400 secs
lola: 48933033 markings, 65130530 edges, 114560 markings/sec, 405 secs
lola: 49478687 markings, 65858978 edges, 109131 markings/sec, 410 secs
lola: 49943452 markings, 66478484 edges, 92953 markings/sec, 415 secs
lola: 50496877 markings, 67216939 edges, 110685 markings/sec, 420 secs
lola: 51067258 markings, 67979163 edges, 114076 markings/sec, 425 secs
lola: 51634381 markings, 68735206 edges, 113425 markings/sec, 430 secs
lola: 52196907 markings, 69484402 edges, 112505 markings/sec, 435 secs
lola: 52712373 markings, 70173235 edges, 103093 markings/sec, 440 secs
lola: 53198193 markings, 70821345 edges, 97164 markings/sec, 445 secs
lola: 53759104 markings, 71569693 edges, 112182 markings/sec, 450 secs
lola: 54320552 markings, 72317558 edges, 112290 markings/sec, 455 secs
lola: 54853306 markings, 73027787 edges, 106551 markings/sec, 460 secs
lola: 55363776 markings, 73709038 edges, 102094 markings/sec, 465 secs
lola: 55914403 markings, 74441906 edges, 110125 markings/sec, 470 secs
lola: 56437891 markings, 75138668 edges, 104698 markings/sec, 475 secs
lola: 56989704 markings, 75875806 edges, 110363 markings/sec, 480 secs
lola: 57527884 markings, 76592440 edges, 107636 markings/sec, 485 secs
lola: 58063020 markings, 77306158 edges, 107027 markings/sec, 490 secs
lola: 58581684 markings, 77999678 edges, 103733 markings/sec, 495 secs
lola: 59164173 markings, 78777372 edges, 116498 markings/sec, 500 secs
lola: 59663511 markings, 79443613 edges, 99868 markings/sec, 505 secs
lola: 60231555 markings, 80202288 edges, 113609 markings/sec, 510 secs
lola: 60761757 markings, 80910492 edges, 106040 markings/sec, 515 secs
lola: 61223122 markings, 81526533 edges, 92273 markings/sec, 520 secs
lola: 61664482 markings, 82114132 edges, 88272 markings/sec, 525 secs
lola: 62117105 markings, 82719047 edges, 90525 markings/sec, 530 secs
lola: 62645293 markings, 83424946 edges, 105638 markings/sec, 535 secs
lola: 63241935 markings, 84220077 edges, 119328 markings/sec, 540 secs
lola: 63740308 markings, 84884639 edges, 99675 markings/sec, 545 secs
lola: 64230755 markings, 85539099 edges, 98089 markings/sec, 550 secs
lola: 64767598 markings, 86256448 edges, 107369 markings/sec, 555 secs
lola: 65309886 markings, 86978385 edges, 108458 markings/sec, 560 secs
lola: 65792184 markings, 87620435 edges, 96460 markings/sec, 565 secs
lola: 66277970 markings, 88271383 edges, 97157 markings/sec, 570 secs
lola: 66810094 markings, 88982734 edges, 106425 markings/sec, 575 secs
lola: 67335183 markings, 89681420 edges, 105018 markings/sec, 580 secs
lola: 67883982 markings, 90415164 edges, 109760 markings/sec, 585 secs
lola: 68446954 markings, 91164515 edges, 112594 markings/sec, 590 secs
lola: 68980822 markings, 91874750 edges, 106774 markings/sec, 595 secs
lola: 69518119 markings, 92592847 edges, 107459 markings/sec, 600 secs
lola: 70047965 markings, 93300620 edges, 105969 markings/sec, 605 secs
lola: 70632094 markings, 94078477 edges, 116826 markings/sec, 610 secs
lola: 71131555 markings, 94745388 edges, 99892 markings/sec, 615 secs
lola: 71664590 markings, 95455875 edges, 106607 markings/sec, 620 secs
lola: 72181509 markings, 96145504 edges, 103384 markings/sec, 625 secs
lola: 72687700 markings, 96823743 edges, 101238 markings/sec, 630 secs
lola: 73167444 markings, 97463405 edges, 95949 markings/sec, 635 secs
lola: 73757474 markings, 98252154 edges, 118006 markings/sec, 640 secs
lola: 74344983 markings, 99036806 edges, 117502 markings/sec, 645 secs
lola: 74903925 markings, 99783421 edges, 111788 markings/sec, 650 secs
lola: 75403431 markings, 100451040 edges, 99901 markings/sec, 655 secs
lola: 75973541 markings, 101212422 edges, 114022 markings/sec, 660 secs
lola: 76433415 markings, 101827161 edges, 91975 markings/sec, 665 secs
lola: 76971009 markings, 102545414 edges, 107519 markings/sec, 670 secs
lola: 77450802 markings, 103186702 edges, 95959 markings/sec, 675 secs
lola: 77947859 markings, 103848678 edges, 99411 markings/sec, 680 secs
lola: 78468845 markings, 104546444 edges, 104197 markings/sec, 685 secs
lola: 78983309 markings, 105234512 edges, 102893 markings/sec, 690 secs
lola: 79480187 markings, 105897727 edges, 99376 markings/sec, 695 secs
lola: 79952590 markings, 106528822 edges, 94481 markings/sec, 700 secs
lola: 80516904 markings, 107285654 edges, 112863 markings/sec, 705 secs
lola: 80971178 markings, 107893830 edges, 90855 markings/sec, 710 secs
lola: 81562285 markings, 108682693 edges, 118221 markings/sec, 715 secs
lola: 82106700 markings, 109408741 edges, 108883 markings/sec, 720 secs
lola: 82622567 markings, 110095213 edges, 103173 markings/sec, 725 secs
lola: 83152336 markings, 110803168 edges, 105954 markings/sec, 730 secs
lola: 83688100 markings, 111516444 edges, 107153 markings/sec, 735 secs
lola: 84176892 markings, 112169131 edges, 97758 markings/sec, 740 secs
lola: 84662821 markings, 112817804 edges, 97186 markings/sec, 745 secs
lola: 85173067 markings, 113502526 edges, 102049 markings/sec, 750 secs
lola: 85685086 markings, 114186689 edges, 102404 markings/sec, 755 secs
lola: 86179887 markings, 114846818 edges, 98960 markings/sec, 760 secs
lola: 86672236 markings, 115501702 edges, 98470 markings/sec, 765 secs
lola: 87200895 markings, 116208688 edges, 105732 markings/sec, 770 secs
lola: 87743683 markings, 116931308 edges, 108558 markings/sec, 775 secs
lola: 88300073 markings, 117672513 edges, 111278 markings/sec, 780 secs
lola: 88864999 markings, 118429642 edges, 112985 markings/sec, 785 secs
lola: 89390904 markings, 119130500 edges, 105181 markings/sec, 790 secs
lola: 89850101 markings, 119744015 edges, 91839 markings/sec, 795 secs
lola: 90358611 markings, 120424486 edges, 101702 markings/sec, 800 secs
lola: 90922216 markings, 121182868 edges, 112721 markings/sec, 805 secs
lola: 91446071 markings, 121882538 edges, 104771 markings/sec, 810 secs
lola: 91881876 markings, 122462966 edges, 87161 markings/sec, 815 secs
lola: 92270025 markings, 122979125 edges, 77630 markings/sec, 820 secs
lola: 92652594 markings, 123489727 edges, 76514 markings/sec, 825 secs
lola: 93164812 markings, 124173202 edges, 102444 markings/sec, 830 secs
lola: 93615819 markings, 124772958 edges, 90201 markings/sec, 835 secs
lola: 94031803 markings, 125329761 edges, 83197 markings/sec, 840 secs
lola: 94483108 markings, 125933278 edges, 90261 markings/sec, 845 secs
lola: 94870127 markings, 126450722 edges, 77404 markings/sec, 850 secs
lola: 95356545 markings, 127102468 edges, 97284 markings/sec, 855 secs
lola: 95806823 markings, 127703252 edges, 90056 markings/sec, 860 secs
lola: 96292290 markings, 128352589 edges, 97093 markings/sec, 865 secs
lola: 96769045 markings, 128987418 edges, 95351 markings/sec, 870 secs
lola: 97262068 markings, 129645443 edges, 98605 markings/sec, 875 secs
lola: 97745738 markings, 130295639 edges, 96734 markings/sec, 880 secs
lola: 98237865 markings, 130954359 edges, 98425 markings/sec, 885 secs
lola: 98649911 markings, 131505085 edges, 82409 markings/sec, 890 secs
lola: 99180032 markings, 132214269 edges, 106024 markings/sec, 895 secs
lola: 99593255 markings, 132768096 edges, 82645 markings/sec, 900 secs
lola: 100045360 markings, 133370930 edges, 90421 markings/sec, 905 secs
lola: 100486801 markings, 133960839 edges, 88288 markings/sec, 910 secs
lola: 100897687 markings, 134509836 edges, 82177 markings/sec, 915 secs
lola: 101306588 markings, 135058983 edges, 81780 markings/sec, 920 secs
lola: 101738366 markings, 135635400 edges, 86356 markings/sec, 925 secs
lola: 102269132 markings, 136347137 edges, 106153 markings/sec, 930 secs
lola: 102756337 markings, 136998481 edges, 97441 markings/sec, 935 secs
lola: 103178613 markings, 137563068 edges, 84455 markings/sec, 940 secs
lola: 103653622 markings, 138197347 edges, 95002 markings/sec, 945 secs
lola: 104096663 markings, 138790033 edges, 88608 markings/sec, 950 secs
lola: 104545149 markings, 139389647 edges, 89697 markings/sec, 955 secs
lola: 105006382 markings, 140002609 edges, 92247 markings/sec, 960 secs
lola: 105516591 markings, 140687683 edges, 102042 markings/sec, 965 secs
lola: 106005138 markings, 141338494 edges, 97709 markings/sec, 970 secs
lola: 106479097 markings, 141972516 edges, 94792 markings/sec, 975 secs
lola: 106949054 markings, 142603631 edges, 93991 markings/sec, 980 secs
lola: 107368647 markings, 143162419 edges, 83919 markings/sec, 985 secs
lola: 107836151 markings, 143786855 edges, 93501 markings/sec, 990 secs
lola: 108342013 markings, 144460540 edges, 101172 markings/sec, 995 secs
lola: 108830142 markings, 145112169 edges, 97626 markings/sec, 1000 secs
lola: 109250098 markings, 145670412 edges, 83991 markings/sec, 1005 secs
lola: 109697235 markings, 146265073 edges, 89427 markings/sec, 1010 secs
lola: 110165361 markings, 146892168 edges, 93625 markings/sec, 1015 secs
lola: 110610868 markings, 147488422 edges, 89101 markings/sec, 1020 secs
lola: 111024398 markings, 148039618 edges, 82706 markings/sec, 1025 secs
lola: 111455172 markings, 148614418 edges, 86155 markings/sec, 1030 secs
lola: 111963628 markings, 149293988 edges, 101691 markings/sec, 1035 secs
lola: 112445399 markings, 149938957 edges, 96354 markings/sec, 1040 secs
lola: 112982657 markings, 150660143 edges, 107452 markings/sec, 1045 secs
lola: 113496892 markings, 151346918 edges, 102847 markings/sec, 1050 secs
lola: 113998969 markings, 152018574 edges, 100415 markings/sec, 1055 secs
lola: 114440477 markings, 152609120 edges, 88302 markings/sec, 1060 secs
lola: 114751275 markings, 153026235 edges, 62160 markings/sec, 1065 secs
lola: 115047013 markings, 153420406 edges, 59148 markings/sec, 1070 secs
lola: 115163096 markings, 153575802 edges, 23217 markings/sec, 1075 secs
lola: 115164057 markings, 153577005 edges, 192 markings/sec, 1080 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p312) AND (1 <= p323))) OR (G (((1 <= p63) AND (1 <= p72))) OR (((1 <= p430) AND (1 <= p455)) OR (((1 <= p312) AND (1 <= p323)) OR (G (((1 <= p31) AND (1 <= p56))) AND F ((F (((1 <= p312) AND (1 <= p323))) OR (G (((1 <= p63) AND (1 <= p72))) OR (((1 <= p430) AND (1 <= p455)) OR ((1 <= p312) AND (1 <= p323)))))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= p312) AND (1 <= p323))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p312) AND (1 <= p323))
lola: processed formula length: 29
lola: 86 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((1 <= p430) AND (1 <= p455))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p430) AND (1 <= p455))
lola: processed formula length: 29
lola: 86 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (((1 <= p31) AND (1 <= p56)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p31) AND (1 <= p56)))
lola: processed formula length: 31
lola: 86 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 8 markings, 8 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (((1 <= p63) AND (1 <= p72)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p63) AND (1 <= p72)))
lola: processed formula length: 31
lola: 86 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 8 markings, 8 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (((1 <= p312) AND (1 <= p323)))
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: ((p312 <= 0) OR (p323 <= 0))
lola: processed formula length: 29
lola: 88 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 8 markings, 8 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no no no unknown no
lola:
preliminary result: no no no no no no no no no unknown no
lola: memory consumption: 3868 KB
lola: time consumption: 2187 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="ShieldIIPt-PT-030A"
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 ShieldIIPt-PT-030A, 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 r227-tall-162098231000226"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-030A.tgz
mv ShieldIIPt-PT-030A 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 '
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 ;