Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r211-tajo-159033477300330.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is ShieldIIPt-PT-030A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033477300330
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 324K
-rw-r--r-- 1 mcc users 3.1K May 14 01:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 14 01:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 18:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 13 18:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K May 14 10:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 14 10:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 14 10:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.2K May 13 13:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K May 13 13:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 13 08:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 08:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 159K May 12 20:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME 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 1591299050415

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 19:30:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 19:30:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 19:30:52] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2020-06-04 19:30:52] [INFO ] Transformed 573 places.
[2020-06-04 19:30:52] [INFO ] Transformed 423 transitions.
[2020-06-04 19:30:52] [INFO ] Found NUPN structural information;
[2020-06-04 19:30:52] [INFO ] Parsed PT model containing 573 places and 423 transitions in 122 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 636 ms. (steps per millisecond=157 ) properties seen :[0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1]
// Phase 1: matrix 422 rows 573 cols
[2020-06-04 19:30:52] [INFO ] Computed 271 place invariants in 27 ms
[2020-06-04 19:30:53] [INFO ] [Real]Absence check using 271 positive place invariants in 143 ms returned sat
[2020-06-04 19:30:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:30:53] [INFO ] [Real]Absence check using state equation in 646 ms returned sat
[2020-06-04 19:30:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:30:54] [INFO ] [Nat]Absence check using 271 positive place invariants in 94 ms returned sat
[2020-06-04 19:30:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:30:54] [INFO ] [Nat]Absence check using state equation in 542 ms returned sat
[2020-06-04 19:30:54] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 39 ms.
[2020-06-04 19:30:59] [INFO ] Added : 416 causal constraints over 86 iterations in 5022 ms. Result :sat
[2020-06-04 19:31:00] [INFO ] [Real]Absence check using 271 positive place invariants in 91 ms returned sat
[2020-06-04 19:31:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:31:00] [INFO ] [Real]Absence check using state equation in 552 ms returned sat
[2020-06-04 19:31:00] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 37 ms.
[2020-06-04 19:31:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:31:00] [INFO ] [Nat]Absence check using 271 positive place invariants in 121 ms returned sat
[2020-06-04 19:31:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:31:01] [INFO ] [Nat]Absence check using state equation in 724 ms returned sat
[2020-06-04 19:31:01] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 36 ms.
[2020-06-04 19:31:04] [INFO ] Added : 405 causal constraints over 83 iterations in 3205 ms. Result :sat
[2020-06-04 19:31:05] [INFO ] [Real]Absence check using 271 positive place invariants in 8 ms returned unsat
[2020-06-04 19:31:05] [INFO ] [Real]Absence check using 271 positive place invariants in 128 ms returned sat
[2020-06-04 19:31:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:31:05] [INFO ] [Real]Absence check using state equation in 686 ms returned sat
[2020-06-04 19:31:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:31:06] [INFO ] [Nat]Absence check using 271 positive place invariants in 124 ms returned sat
[2020-06-04 19:31:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:31:06] [INFO ] [Nat]Absence check using state equation in 576 ms returned sat
[2020-06-04 19:31:06] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 26 ms.
[2020-06-04 19:31:10] [INFO ] Added : 406 causal constraints over 83 iterations in 3252 ms. Result :sat
[2020-06-04 19:31:10] [INFO ] [Real]Absence check using 271 positive place invariants in 129 ms returned sat
[2020-06-04 19:31:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:31:10] [INFO ] [Real]Absence check using state equation in 675 ms returned sat
[2020-06-04 19:31:11] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 28 ms.
[2020-06-04 19:31:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:31:11] [INFO ] [Nat]Absence check using 271 positive place invariants in 126 ms returned sat
[2020-06-04 19:31:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:31:12] [INFO ] [Nat]Absence check using state equation in 678 ms returned sat
[2020-06-04 19:31:12] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 31 ms.
[2020-06-04 19:31:15] [INFO ] Added : 414 causal constraints over 85 iterations in 2993 ms. Result :sat
[2020-06-04 19:31:15] [INFO ] [Real]Absence check using 271 positive place invariants in 122 ms returned sat
[2020-06-04 19:31:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:31:15] [INFO ] [Real]Absence check using state equation in 691 ms returned sat
[2020-06-04 19:31:16] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 22 ms.
[2020-06-04 19:31:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:31:16] [INFO ] [Nat]Absence check using 271 positive place invariants in 128 ms returned sat
[2020-06-04 19:31:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:31:16] [INFO ] [Nat]Absence check using state equation in 683 ms returned sat
[2020-06-04 19:31:17] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 25 ms.
[2020-06-04 19:31:20] [INFO ] Added : 404 causal constraints over 81 iterations in 3888 ms. Result :sat
[2020-06-04 19:31:21] [INFO ] [Real]Absence check using 271 positive place invariants in 133 ms returned sat
[2020-06-04 19:31:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:31:21] [INFO ] [Real]Absence check using state equation in 715 ms returned sat
[2020-06-04 19:31:21] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 43 ms.
[2020-06-04 19:31:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:31:22] [INFO ] [Nat]Absence check using 271 positive place invariants in 145 ms returned sat
[2020-06-04 19:31:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:31:23] [INFO ] [Nat]Absence check using state equation in 735 ms returned sat
[2020-06-04 19:31:23] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 34 ms.
[2020-06-04 19:31:25] [INFO ] Added : 419 causal constraints over 86 iterations in 2672 ms. Result :sat
[2020-06-04 19:31:26] [INFO ] [Real]Absence check using 271 positive place invariants in 136 ms returned sat
[2020-06-04 19:31:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:31:26] [INFO ] [Real]Absence check using state equation in 716 ms returned sat
[2020-06-04 19:31:26] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 36 ms.
[2020-06-04 19:31:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:31:27] [INFO ] [Nat]Absence check using 271 positive place invariants in 128 ms returned sat
[2020-06-04 19:31:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:31:27] [INFO ] [Nat]Absence check using state equation in 716 ms returned sat
[2020-06-04 19:31:27] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 29 ms.
[2020-06-04 19:31:31] [INFO ] Added : 402 causal constraints over 81 iterations in 3282 ms. Result :sat
[2020-06-04 19:31:31] [INFO ] [Real]Absence check using 271 positive place invariants in 134 ms returned sat
[2020-06-04 19:31:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:31:32] [INFO ] [Real]Absence check using state equation in 690 ms returned sat
[2020-06-04 19:31:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:31:32] [INFO ] [Nat]Absence check using 271 positive place invariants in 200 ms returned sat
[2020-06-04 19:31:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:31:33] [INFO ] [Nat]Absence check using state equation in 751 ms returned sat
[2020-06-04 19:31:33] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 51 ms.
[2020-06-04 19:31:37] [INFO ] Added : 405 causal constraints over 83 iterations in 4370 ms. Result :sat
[2020-06-04 19:31:37] [INFO ] [Real]Absence check using 271 positive place invariants in 129 ms returned sat
[2020-06-04 19:31:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:31:38] [INFO ] [Real]Absence check using state equation in 687 ms returned sat
[2020-06-04 19:31:38] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 31 ms.
[2020-06-04 19:31:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:31:38] [INFO ] [Nat]Absence check using 271 positive place invariants in 127 ms returned sat
[2020-06-04 19:31:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:31:39] [INFO ] [Nat]Absence check using state equation in 644 ms returned sat
[2020-06-04 19:31:39] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 43 ms.
[2020-06-04 19:31:43] [INFO ] Added : 413 causal constraints over 84 iterations in 4436 ms. Result :sat
[2020-06-04 19:31:44] [INFO ] [Real]Absence check using 271 positive place invariants in 130 ms returned sat
[2020-06-04 19:31:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:31:44] [INFO ] [Real]Absence check using state equation in 707 ms returned sat
[2020-06-04 19:31:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:31:45] [INFO ] [Nat]Absence check using 271 positive place invariants in 128 ms returned sat
[2020-06-04 19:31:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:31:46] [INFO ] [Nat]Absence check using state equation in 750 ms returned sat
[2020-06-04 19:31:46] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 28 ms.
[2020-06-04 19:31:49] [INFO ] Added : 411 causal constraints over 83 iterations in 3119 ms. Result :sat
[2020-06-04 19:31:49] [INFO ] [Real]Absence check using 271 positive place invariants in 131 ms returned sat
[2020-06-04 19:31:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:31:50] [INFO ] [Real]Absence check using state equation in 679 ms returned sat
[2020-06-04 19:31:50] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 26 ms.
[2020-06-04 19:31:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:31:50] [INFO ] [Nat]Absence check using 271 positive place invariants in 140 ms returned sat
[2020-06-04 19:31:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:31:50] [INFO ] [Nat]Absence check using state equation in 544 ms returned sat
[2020-06-04 19:31:51] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 24 ms.
[2020-06-04 19:31:53] [INFO ] Added : 417 causal constraints over 85 iterations in 2981 ms. Result :sat
[2020-06-04 19:31:54] [INFO ] [Real]Absence check using 271 positive place invariants in 125 ms returned sat
[2020-06-04 19:31:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:31:54] [INFO ] [Real]Absence check using state equation in 712 ms returned sat
[2020-06-04 19:31:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:31:55] [INFO ] [Nat]Absence check using 271 positive place invariants in 125 ms returned sat
[2020-06-04 19:31:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:31:55] [INFO ] [Nat]Absence check using state equation in 669 ms returned sat
[2020-06-04 19:31:55] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 26 ms.
[2020-06-04 19:31:59] [INFO ] Added : 418 causal constraints over 84 iterations in 3183 ms. Result :sat
[2020-06-04 19:31:59] [INFO ] [Real]Absence check using 271 positive place invariants in 130 ms returned sat
[2020-06-04 19:31:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:32:00] [INFO ] [Real]Absence check using state equation in 691 ms returned sat
[2020-06-04 19:32:00] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 28 ms.
[2020-06-04 19:32:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:32:00] [INFO ] [Nat]Absence check using 271 positive place invariants in 132 ms returned sat
[2020-06-04 19:32:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:32:01] [INFO ] [Nat]Absence check using state equation in 725 ms returned sat
[2020-06-04 19:32:01] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 27 ms.
[2020-06-04 19:32:04] [INFO ] Added : 418 causal constraints over 86 iterations in 3839 ms. Result :sat
[2020-06-04 19:32:05] [INFO ] [Real]Absence check using 271 positive place invariants in 93 ms returned sat
[2020-06-04 19:32:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:32:05] [INFO ] [Real]Absence check using state equation in 561 ms returned sat
[2020-06-04 19:32:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:32:06] [INFO ] [Nat]Absence check using 271 positive place invariants in 126 ms returned sat
[2020-06-04 19:32:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:32:06] [INFO ] [Nat]Absence check using state equation in 698 ms returned sat
[2020-06-04 19:32:06] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 33 ms.
[2020-06-04 19:32:10] [INFO ] Added : 415 causal constraints over 84 iterations in 3396 ms. Result :sat
[2020-06-04 19:32:10] [INFO ] [Real]Absence check using 271 positive place invariants in 132 ms returned sat
[2020-06-04 19:32:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:32:11] [INFO ] [Real]Absence check using state equation in 711 ms returned sat
[2020-06-04 19:32:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:32:11] [INFO ] [Nat]Absence check using 271 positive place invariants in 133 ms returned sat
[2020-06-04 19:32:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:32:12] [INFO ] [Nat]Absence check using state equation in 690 ms returned sat
[2020-06-04 19:32:12] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 22 ms.
[2020-06-04 19:32:15] [INFO ] Added : 413 causal constraints over 84 iterations in 3595 ms. Result :sat
[2020-06-04 19:32:15] [INFO ] [Real]Absence check using 271 positive place invariants in 131 ms returned sat
[2020-06-04 19:32:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:32:16] [INFO ] [Real]Absence check using state equation in 685 ms returned sat
[2020-06-04 19:32:16] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 26 ms.
[2020-06-04 19:32:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:32:16] [INFO ] [Nat]Absence check using 271 positive place invariants in 129 ms returned sat
[2020-06-04 19:32:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:32:17] [INFO ] [Nat]Absence check using state equation in 675 ms returned sat
[2020-06-04 19:32:17] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 50 ms.
[2020-06-04 19:32:20] [INFO ] Added : 414 causal constraints over 85 iterations in 3166 ms. Result :sat
[2020-06-04 19:32:21] [INFO ] [Real]Absence check using 271 positive place invariants in 127 ms returned sat
[2020-06-04 19:32:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:32:21] [INFO ] [Real]Absence check using state equation in 710 ms returned sat
[2020-06-04 19:32:21] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 25 ms.
[2020-06-04 19:32:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:32:22] [INFO ] [Nat]Absence check using 271 positive place invariants in 130 ms returned sat
[2020-06-04 19:32:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:32:22] [INFO ] [Nat]Absence check using state equation in 544 ms returned sat
[2020-06-04 19:32:22] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 30 ms.
[2020-06-04 19:32:26] [INFO ] Added : 405 causal constraints over 83 iterations in 3901 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-04 19:32:26] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-04 19:32:26] [INFO ] Flatten gal took : 94 ms
FORMULA ShieldIIPt-PT-030A-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 19:32:26] [INFO ] Applying decomposition
[2020-06-04 19:32:27] [INFO ] Flatten gal took : 40 ms
[2020-06-04 19:32:27] [INFO ] Decomposing Gal with order
[2020-06-04 19:32:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-04 19:32:27] [INFO ] Removed a total of 120 redundant transitions.
[2020-06-04 19:32:27] [INFO ] Flatten gal took : 72 ms
[2020-06-04 19:32:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 17 ms.
[2020-06-04 19:32:27] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2020-06-04 19:32:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 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-01 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-05 FALSE 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

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-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-030A-08 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-02 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 CANNOT_COMPUTE 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-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1365
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",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 19:32:27 2020
",
"timelimit": 3570
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"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 <= p175) AND (1 <= p188)))",
"processed_size": 33,
"rewrites": 71
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"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": 273
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (((1 <= p565)))",
"processed_size": 17,
"rewrites": 71
},
"result":
{
"edges": 4982,
"markings": 4982,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 296
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (X (F (((1 <= p565)))))",
"processed_size": 25,
"rewrites": 71
},
"result":
{
"edges": 8366,
"markings": 8366,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 273
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 1,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G (F (((X (((1 <= p326) AND (1 <= p343))) U ((1 <= p366) AND (1 <= p377))) AND ((1 <= p263)))))",
"processed_size": 95,
"rewrites": 71
},
"result":
{
"edges": 5009,
"markings": 5009,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 296
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 296
},
"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 <= p65) AND (1 <= p76))",
"processed_size": 27,
"rewrites": 71
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 323
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 2,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"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": "(((1 <= p431) AND (1 <= p437) AND (1 <= p439)) U X (X (G (((p158 <= 0) OR (p167 <= 0))))))",
"processed_size": 91,
"rewrites": 71
},
"result":
{
"edges": 4982,
"markings": 4982,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 323
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 1,
"X": 1,
"aconj": 4,
"adisj": 2,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(X (G ((F ((F (((p73 <= 0))) OR ((1 <= p244)))) AND (((p73 <= 0)) AND (((1 <= p195)) AND ((1 <= p206))))))) U ((1 <= p331) AND (1 <= p342)))",
"processed_size": 140,
"rewrites": 71
},
"result":
{
"edges": 4982,
"markings": 4982,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 359
},
"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": "((p402 <= 0) OR (p419 <= 0))",
"processed_size": 29,
"rewrites": 73
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 6,
"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": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 477
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G (((p415 <= 0))))",
"processed_size": 21,
"rewrites": 71
},
"result":
{
"edges": 9772121,
"markings": 9771870,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 535
},
"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 (((p413 <= 0) OR (p428 <= 0)))",
"processed_size": 33,
"rewrites": 71
},
"result":
{
"edges": 9772249,
"markings": 9771999,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 625
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G (((p429 <= 0) OR ((1 <= p335) AND ((p429 <= 0) OR (p433 <= 0) OR (p439 <= 0)) AND (1 <= p360)) OR (p433 <= 0) OR (p439 <= 0)))",
"processed_size": 133,
"rewrites": 71
},
"result":
{
"edges": 10381759,
"markings": 10377848,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 603
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 2,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(((p375 <= 0) OR (p390 <= 0)) AND ((p405 <= 0) OR (p414 <= 0)))",
"processed_size": 65,
"rewrites": 72
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 804
},
"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 <= p405) AND (1 <= p414))",
"processed_size": 29,
"rewrites": 73
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1206
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 0,
"aneg": 4,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (((((p375 <= 0) OR (p390 <= 0)) R ((p83 <= 0) OR (p85 <= 0))) OR (((p375 <= 0)) OR ((p390 <= 0)))))",
"processed_size": 103,
"rewrites": 71
},
"result":
{
"edges": 1613,
"markings": 1585,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 13,
"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": 11,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 804
},
"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 <= p50) AND (1 <= p75))",
"processed_size": 27,
"rewrites": 71
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1206
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (F ((F (G (((p396 <= 0)))) OR ((1 <= p184) AND (1 <= p190) AND (1 <= p192)))))",
"processed_size": 80,
"rewrites": 71
},
"result":
{
"edges": 1513,
"markings": 1308,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 13,
"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": 12,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1206
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F (((1 <= p106) AND (1 <= p110) AND (1 <= p116))))",
"processed_size": 53,
"rewrites": 71
},
"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": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2412
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G (((1 <= p117) AND (1 <= p134) AND (1 <= p407) AND (1 <= p418))))",
"processed_size": 69,
"rewrites": 71
},
"result":
{
"edges": 10,
"markings": 9,
"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": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2412
},
"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": "((p31 <= 0) OR (p56 <= 0))",
"processed_size": 27,
"rewrites": 73
},
"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": 14,
"type": "boolean"
}
},

{
"child":
[

{
"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": "((p31 <= 0) OR (p56 <= 0))",
"processed_size": 27,
"rewrites": 73
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(F (((1 <= p31) AND (1 <= p56))) U ((1 <= p31) AND (1 <= p56)))",
"processed_size": 63,
"rewrites": 71
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 18,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 17,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3988,
"runtime": 2205.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X((G(**) OR G(**))) : (X(X(F(**))) OR (G(**) OR X(**))) : (G(F((F(G(*)) OR *))) OR **) : G(F(((X(**) U **) AND **))) : (G(F(**)) OR F(G(**))) : ((** U X(X(G(**)))) OR **) : X(F((X(F((G(*) OR **))) AND (** AND **)))) : (X(G((F((F(**) OR **)) AND (** AND (** AND **))))) U **) : (G(**) OR G(*)) : (G(((* R *) OR (* OR *))) AND (F(*) AND (** AND **))) : ((F(**) U **) OR (G(F(**)) AND F(**))) : (F(**) AND X(X(X(F(*))))) : F(G(*)) : (X(X((** U **))) R *) : X(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 unknown no no no no no no unknown no ",
"value": "no no no no no no unknown 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: 18336
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: (p120 <= 1)
lola: LP says that atomic proposition is always true: (p129 <= 1)
lola: LP says that atomic proposition is always true: (p138 <= 1)
lola: LP says that atomic proposition is always true: (p149 <= 1)
lola: LP says that atomic proposition is always true: (p565 <= 1)
lola: LP says that atomic proposition is always true: (p175 <= 1)
lola: LP says that atomic proposition is always true: (p188 <= 1)
lola: LP says that atomic proposition is always true: (p565 <= 1)
lola: LP says that atomic proposition is always true: (p396 <= 1)
lola: LP says that atomic proposition is always true: (p184 <= 1)
lola: LP says that atomic proposition is always true: (p190 <= 1)
lola: LP says that atomic proposition is always true: (p192 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p75 <= 1)
lola: LP says that atomic proposition is always true: (p326 <= 1)
lola: LP says that atomic proposition is always true: (p343 <= 1)
lola: LP says that atomic proposition is always true: (p366 <= 1)
lola: LP says that atomic proposition is always true: (p377 <= 1)
lola: LP says that atomic proposition is always true: (p263 <= 1)
lola: LP says that atomic proposition is always true: (p106 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p116 <= 1)
lola: LP says that atomic proposition is always true: (p117 <= 1)
lola: LP says that atomic proposition is always true: (p134 <= 1)
lola: LP says that atomic proposition is always true: (p407 <= 1)
lola: LP says that atomic proposition is always true: (p418 <= 1)
lola: LP says that atomic proposition is always true: (p431 <= 1)
lola: LP says that atomic proposition is always true: (p437 <= 1)
lola: LP says that atomic proposition is always true: (p439 <= 1)
lola: LP says that atomic proposition is always true: (p158 <= 1)
lola: LP says that atomic proposition is always true: (p167 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p407 <= 1)
lola: LP says that atomic proposition is always true: (p418 <= 1)
lola: LP says that atomic proposition is always true: (p407 <= 1)
lola: LP says that atomic proposition is always true: (p418 <= 1)
lola: LP says that atomic proposition is always true: (p73 <= 1)
lola: LP says that atomic proposition is always true: (p244 <= 1)
lola: LP says that atomic proposition is always true: (p73 <= 1)
lola: LP says that atomic proposition is always true: (p195 <= 1)
lola: LP says that atomic proposition is always true: (p206 <= 1)
lola: LP says that atomic proposition is always true: (p331 <= 1)
lola: LP says that atomic proposition is always true: (p342 <= 1)
lola: LP says that atomic proposition is always true: (p429 <= 1)
lola: LP says that atomic proposition is always true: (p433 <= 1)
lola: LP says that atomic proposition is always true: (p439 <= 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: (p429 <= 1)
lola: LP says that atomic proposition is always true: (p433 <= 1)
lola: LP says that atomic proposition is always true: (p439 <= 1)
lola: LP says that atomic proposition is always true: (p413 <= 1)
lola: LP says that atomic proposition is always true: (p428 <= 1)
lola: LP says that atomic proposition is always true: (p375 <= 1)
lola: LP says that atomic proposition is always true: (p390 <= 1)
lola: LP says that atomic proposition is always true: (p83 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p375 <= 1)
lola: LP says that atomic proposition is always true: (p390 <= 1)
lola: LP says that atomic proposition is always true: (p405 <= 1)
lola: LP says that atomic proposition is always true: (p414 <= 1)
lola: LP says that atomic proposition is always true: (p375 <= 1)
lola: LP says that atomic proposition is always true: (p390 <= 1)
lola: LP says that atomic proposition is always true: (p405 <= 1)
lola: LP says that atomic proposition is always true: (p414 <= 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: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 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: (p402 <= 1)
lola: LP says that atomic proposition is always true: (p419 <= 1)
lola: LP says that atomic proposition is always true: (p77 <= 1)
lola: LP says that atomic proposition is always true: (p402 <= 1)
lola: LP says that atomic proposition is always true: (p419 <= 1)
lola: LP says that atomic proposition is always true: (p415 <= 1)
lola: LP says that atomic proposition is always true: (p296 <= 1)
lola: LP says that atomic proposition is always true: (p300 <= 1)
lola: LP says that atomic proposition is always true: (p306 <= 1)
lola: LP says that atomic proposition is always true: (p282 <= 1)
lola: LP says that atomic proposition is always true: (p498 <= 1)
lola: LP says that atomic proposition is always true: (p511 <= 1)
lola: LP says that atomic proposition is always true: (p81 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p343 <= 1)
lola: X ((G (((1 <= p120) AND (1 <= p129))) OR G (((1 <= p138) AND (1 <= p149))))) : ((F (X (X (((0 <= 0) U ((1 <= p565)))))) OR G (((1 <= p175) AND (1 <= p188)))) OR X (((1 <= p565)))) : (NOT(F (G ((F (G (F (((1 <= p396))))) AND ((p184 <= 0) OR (p190 <= 0) OR (p192 <= 0)))))) OR ((1 <= p50) AND (1 <= p75))) : G (X (F (((X (((1 <= p326) AND (1 <= p343))) U ((1 <= p366) AND (1 <= p377))) AND ((1 <= p263)))))) : (G (F (((1 <= p106) AND (1 <= p110) AND (1 <= p116)))) OR G (X (F (G (X (((1 <= p117) AND (1 <= p134) AND (1 <= p407) AND (1 <= p418)))))))) : ((((1 <= p431) AND (1 <= p437) AND (1 <= p439)) U G (X (X (((p158 <= 0) OR (p167 <= 0)))))) OR ((1 <= p65) AND (1 <= p76))) : F (X (((F (X ((NOT(F (((1 <= p64) AND (1 <= p66)))) OR ((1 <= p407) AND (1 <= p418))))) AND ((1 <= p407))) AND ((1 <= p418))))) : (G (X ((((F ((F (((p73 <= 0))) OR ((1 <= p244)))) AND ((p73 <= 0))) AND ((1 <= p195))) AND ((1 <= p206))))) U ((1 <= p331) AND (1 <= p342))) : (G (((p429 <= 0) OR ((1 <= p335) AND ((p429 <= 0) OR (p433 <= 0) OR (p439 <= 0)) AND (1 <= p360)) OR (p433 <= 0) OR (p439 <= 0))) OR NOT(F (((1 <= p413) AND (1 <= p428))))) : (((NOT(F ((((((1 <= p375) AND (1 <= p390)) U ((1 <= p83) AND (1 <= p85))) AND ((1 <= p375))) AND ((1 <= p390))))) AND NOT(G (((1 <= p405) AND (1 <= p414))))) AND ((p375 <= 0) OR (p390 <= 0))) AND ((p405 <= 0) OR (p414 <= 0))) : (G (F (((1 <= p31) AND (1 <= p56)))) U (F (((1 <= p31) AND (1 <= p56))) U ((1 <= p31) AND (1 <= p56)))) : (F (((1 <= p402) AND (1 <= p419))) AND X (F (X (NOT(X (((1 <= p77) AND (1 <= p402) AND (1 <= p419)))))))) : NOT(G (X (G (F (((1 <= p415))))))) : NOT((X (NOT(X ((((1 <= p296) AND (1 <= p300) AND (1 <= p306)) U ((1 <= p282)))))) U ((1 <= p498) AND (1 <= p511) AND (1 <= p81) AND (1 <= p92)))) : F (X (((1 <= p343))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:374
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:338
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:297
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: 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:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (((1 <= p120) AND (1 <= p129))) OR G (((1 <= p138) AND (1 <= p149)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (((1 <= p120) AND (1 <= p129))) OR G (((1 <= p138) AND (1 <= p149)))))
lola: processed formula length: 76
lola: 71 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4982 markings, 4982 edges
lola: ========================================
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (F (((1 <= p565))))) OR (G (((1 <= p175) AND (1 <= p188))) OR X (((1 <= p565)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p175) AND (1 <= p188)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p175) AND (1 <= p188)))
lola: processed formula length: 33
lola: 71 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 2 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((1 <= p565)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((1 <= p565)))
lola: processed formula length: 17
lola: 71 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: subprocess 3 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F (((1 <= p565)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F (((1 <= p565)))))
lola: processed formula length: 25
lola: 71 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: 8366 markings, 8366 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((X (((1 <= p326) AND (1 <= p343))) U ((1 <= p366) AND (1 <= p377))) AND ((1 <= p263)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((X (((1 <= p326) AND (1 <= p343))) U ((1 <= p366) AND (1 <= p377))) AND ((1 <= p263)))))
lola: processed formula length: 95
lola: 71 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5009 markings, 5009 edges
lola: ========================================
lola: subprocess 3 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p431) AND (1 <= p437) AND (1 <= p439)) U X (X (G (((p158 <= 0) OR (p167 <= 0)))))) OR ((1 <= p65) AND (1 <= p76)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p65) AND (1 <= p76))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p65) AND (1 <= p76))
lola: processed formula length: 27
lola: 71 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 4 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p431) AND (1 <= p437) AND (1 <= p439)) U X (X (G (((p158 <= 0) OR (p167 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p431) AND (1 <= p437) AND (1 <= p439)) U X (X (G (((p158 <= 0) OR (p167 <= 0))))))
lola: processed formula length: 91
lola: 71 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4982 markings, 4982 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((X (F ((G (((p64 <= 0) OR (p66 <= 0))) OR ((1 <= p407) AND (1 <= p418))))) AND (((1 <= p407)) AND ((1 <= p418))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((X (F ((G (((p64 <= 0) OR (p66 <= 0))) OR ((1 <= p407) AND (1 <= p418))))) AND (((1 <= p407)) AND ((1 <= p418))))))
lola: processed formula length: 122
lola: 71 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 934550 markings, 1777888 edges, 186910 markings/sec, 0 secs
lola: 1782520 markings, 3527987 edges, 169594 markings/sec, 5 secs
lola: 2571987 markings, 5190535 edges, 157893 markings/sec, 10 secs
lola: 3309461 markings, 6785175 edges, 147495 markings/sec, 15 secs
lola: 4017812 markings, 8339368 edges, 141670 markings/sec, 20 secs
lola: 4702187 markings, 9857184 edges, 136875 markings/sec, 25 secs
lola: 5345085 markings, 11296019 edges, 128580 markings/sec, 30 secs
lola: 5986870 markings, 12718711 edges, 128357 markings/sec, 35 secs
lola: 6624959 markings, 14154100 edges, 127618 markings/sec, 40 secs
lola: 7250874 markings, 15556048 edges, 125183 markings/sec, 45 secs
lola: 7855819 markings, 16925150 edges, 120989 markings/sec, 50 secs
lola: 8463247 markings, 18307123 edges, 121486 markings/sec, 55 secs
lola: 9070937 markings, 19696803 edges, 121538 markings/sec, 60 secs
lola: 9650424 markings, 21019095 edges, 115897 markings/sec, 65 secs
lola: 10239073 markings, 22368927 edges, 117730 markings/sec, 70 secs
lola: 10838976 markings, 23744774 edges, 119981 markings/sec, 75 secs
lola: 11428057 markings, 25105657 edges, 117816 markings/sec, 80 secs
lola: 12028839 markings, 26483305 edges, 120156 markings/sec, 85 secs
lola: 12607565 markings, 27823416 edges, 115745 markings/sec, 90 secs
lola: 13193282 markings, 29174823 edges, 117143 markings/sec, 95 secs
lola: 13762298 markings, 30504735 edges, 113803 markings/sec, 100 secs
lola: 14334153 markings, 31839236 edges, 114371 markings/sec, 105 secs
lola: 14904571 markings, 33170860 edges, 114084 markings/sec, 110 secs
lola: 15466496 markings, 34483247 edges, 112385 markings/sec, 115 secs
lola: 15996761 markings, 35726312 edges, 106053 markings/sec, 120 secs
lola: 16544304 markings, 36999787 edges, 109509 markings/sec, 125 secs
lola: 17083811 markings, 38278850 edges, 107901 markings/sec, 130 secs
lola: 17634652 markings, 39567862 edges, 110168 markings/sec, 135 secs
lola: 18174912 markings, 40837670 edges, 108052 markings/sec, 140 secs
lola: 18725340 markings, 42137210 edges, 110086 markings/sec, 145 secs
lola: 19270176 markings, 43429137 edges, 108967 markings/sec, 150 secs
lola: 19814521 markings, 44717455 edges, 108869 markings/sec, 155 secs
lola: 20360529 markings, 46004529 edges, 109202 markings/sec, 160 secs
lola: 20911561 markings, 47306471 edges, 110206 markings/sec, 165 secs
lola: 21451314 markings, 48587914 edges, 107951 markings/sec, 170 secs
lola: 21994409 markings, 49879341 edges, 108619 markings/sec, 175 secs
lola: 22528334 markings, 51155016 edges, 106785 markings/sec, 180 secs
lola: 23087518 markings, 52473355 edges, 111837 markings/sec, 185 secs
lola: 23627641 markings, 53753969 edges, 108025 markings/sec, 190 secs
lola: 24171843 markings, 55051068 edges, 108840 markings/sec, 195 secs
lola: 24716112 markings, 56347368 edges, 108854 markings/sec, 200 secs
lola: 25258639 markings, 57639212 edges, 108505 markings/sec, 205 secs
lola: 25792214 markings, 58919603 edges, 106715 markings/sec, 210 secs
lola: 26328021 markings, 60202294 edges, 107161 markings/sec, 215 secs
lola: 26822206 markings, 61400835 edges, 98837 markings/sec, 220 secs
lola: 27345809 markings, 62658009 edges, 104721 markings/sec, 225 secs
lola: 27886254 markings, 63948026 edges, 108089 markings/sec, 230 secs
lola: 28422783 markings, 65237083 edges, 107306 markings/sec, 235 secs
lola: 28953891 markings, 66516769 edges, 106222 markings/sec, 240 secs
lola: 29483532 markings, 67797144 edges, 105928 markings/sec, 245 secs
lola: 30010069 markings, 69072519 edges, 105307 markings/sec, 250 secs
lola: 30536639 markings, 70348648 edges, 105314 markings/sec, 255 secs
lola: 31085269 markings, 71667157 edges, 109726 markings/sec, 260 secs
lola: 31616089 markings, 72948672 edges, 106164 markings/sec, 265 secs
lola: 32151389 markings, 74241505 edges, 107060 markings/sec, 270 secs
lola: 32685001 markings, 75526559 edges, 106722 markings/sec, 275 secs
lola: 33226260 markings, 76829569 edges, 108252 markings/sec, 280 secs
lola: 33754696 markings, 78112008 edges, 105687 markings/sec, 285 secs
lola: 34307548 markings, 79434791 edges, 110570 markings/sec, 290 secs
lola: 34851144 markings, 80743401 edges, 108719 markings/sec, 295 secs
lola: 35387991 markings, 82041767 edges, 107369 markings/sec, 300 secs
lola: 35945818 markings, 83377364 edges, 111565 markings/sec, 305 secs
lola: 36491336 markings, 84689554 edges, 109104 markings/sec, 310 secs
lola: 37026478 markings, 85988806 edges, 107028 markings/sec, 315 secs
lola: local time limit reached - aborting
lola:
preliminary result: no no unknown no unknown no unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 8913176 KB
lola: time consumption: 335 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((F ((F (((p73 <= 0))) OR ((1 <= p244)))) AND (((p73 <= 0)) AND (((1 <= p195)) AND ((1 <= p206))))))) U ((1 <= p331) AND (1 <= p342)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (G ((F ((F (((p73 <= 0))) OR ((1 <= p244)))) AND (((p73 <= 0)) AND (((1 <= p195)) AND ((1 <= p206))))))) U ((1 <= p331) AND (1 <= p342)))
lola: processed formula length: 140
lola: 71 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4982 markings, 4982 edges
lola: ========================================
lola: subprocess 6 will run for 359 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p402) AND (1 <= p419))) AND X (X (X (F (((p77 <= 0) OR (p402 <= 0) OR (p419 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 359 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p402) AND (1 <= p419)))
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: ((p402 <= 0) OR (p419 <= 0))
lola: processed formula length: 29
lola: 73 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: subprocess 7 will run for 404 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X ((((1 <= p296) AND (1 <= p300) AND (1 <= p306)) U ((1 <= p282))))) R ((p498 <= 0) OR (p511 <= 0) OR (p81 <= 0) OR (p92 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (X ((((1 <= p296) AND (1 <= p300) AND (1 <= p306)) U ((1 <= p282))))) R ((p498 <= 0) OR (p511 <= 0) OR (p81 <= 0) OR (p92 <= 0)))
lola: processed formula length: 135
lola: 71 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1147307 markings, 1377823 edges, 229461 markings/sec, 0 secs
lola: 2192808 markings, 2659823 edges, 209100 markings/sec, 5 secs
lola: 3180353 markings, 3888423 edges, 197509 markings/sec, 10 secs
lola: 4143682 markings, 5086280 edges, 192666 markings/sec, 15 secs
lola: 5049791 markings, 6226013 edges, 181222 markings/sec, 20 secs
lola: 5962805 markings, 7382047 edges, 182603 markings/sec, 25 secs
lola: 6861400 markings, 8517611 edges, 179719 markings/sec, 30 secs
lola: 7760400 markings, 9658674 edges, 179800 markings/sec, 35 secs
lola: 8649041 markings, 10794655 edges, 177728 markings/sec, 40 secs
lola: 9492737 markings, 11871171 edges, 168739 markings/sec, 45 secs
lola: 10350887 markings, 12969518 edges, 171630 markings/sec, 50 secs
lola: 11206519 markings, 14070449 edges, 171126 markings/sec, 55 secs
lola: 12026372 markings, 15119821 edges, 163971 markings/sec, 60 secs
lola: 12918054 markings, 16266073 edges, 178336 markings/sec, 65 secs
lola: 13760966 markings, 17351192 edges, 168582 markings/sec, 70 secs
lola: 14549564 markings, 18369525 edges, 157720 markings/sec, 75 secs
lola: 15368495 markings, 19431002 edges, 163786 markings/sec, 80 secs
lola: 16212814 markings, 20524401 edges, 168864 markings/sec, 85 secs
lola: 17036311 markings, 21590899 edges, 164699 markings/sec, 90 secs
lola: 17858635 markings, 22653488 edges, 164465 markings/sec, 95 secs
lola: 18692800 markings, 23728599 edges, 166833 markings/sec, 100 secs
lola: 19576714 markings, 24872485 edges, 176783 markings/sec, 105 secs
lola: 20449496 markings, 26007212 edges, 174556 markings/sec, 110 secs
lola: 21262201 markings, 27065084 edges, 162541 markings/sec, 115 secs
lola: 22062797 markings, 28111990 edges, 160119 markings/sec, 120 secs
lola: 22863993 markings, 29154062 edges, 160239 markings/sec, 125 secs
lola: 23706006 markings, 30253429 edges, 168403 markings/sec, 130 secs
lola: 24504043 markings, 31293901 edges, 159607 markings/sec, 135 secs
lola: 25347549 markings, 32401866 edges, 168701 markings/sec, 140 secs
lola: 26144304 markings, 33450426 edges, 159351 markings/sec, 145 secs
lola: 26952702 markings, 34512840 edges, 161680 markings/sec, 150 secs
lola: 27724662 markings, 35529033 edges, 154392 markings/sec, 155 secs
lola: 28529516 markings, 36591820 edges, 160971 markings/sec, 160 secs
lola: 29343093 markings, 37664456 edges, 162715 markings/sec, 165 secs
lola: 30138515 markings, 38712338 edges, 159084 markings/sec, 170 secs
lola: 30891417 markings, 39705750 edges, 150580 markings/sec, 175 secs
lola: 31711730 markings, 40780850 edges, 164063 markings/sec, 180 secs
lola: 32487713 markings, 41796872 edges, 155197 markings/sec, 185 secs
lola: 33320163 markings, 42889403 edges, 166490 markings/sec, 190 secs
lola: 34103000 markings, 43929476 edges, 156567 markings/sec, 195 secs
lola: 34887136 markings, 44967552 edges, 156827 markings/sec, 200 secs
lola: 35694474 markings, 46021720 edges, 161468 markings/sec, 205 secs
lola: 36474305 markings, 47059706 edges, 155966 markings/sec, 210 secs
lola: 37247722 markings, 48086320 edges, 154683 markings/sec, 215 secs
lola: 38033158 markings, 49129271 edges, 157087 markings/sec, 220 secs
lola: 38817026 markings, 50171911 edges, 156774 markings/sec, 225 secs
lola: 39596107 markings, 51218263 edges, 155816 markings/sec, 230 secs
lola: 40377840 markings, 52249402 edges, 156347 markings/sec, 235 secs
lola: 41168645 markings, 53298469 edges, 158161 markings/sec, 240 secs
lola: 42044604 markings, 54449095 edges, 175192 markings/sec, 245 secs
lola: 42882973 markings, 55561664 edges, 167674 markings/sec, 250 secs
lola: 43724549 markings, 56672506 edges, 168315 markings/sec, 255 secs
lola: 44681571 markings, 57925484 edges, 191404 markings/sec, 260 secs
lola: 45500327 markings, 59021541 edges, 163751 markings/sec, 265 secs
lola: 46246503 markings, 60011670 edges, 149235 markings/sec, 270 secs
lola: 46940142 markings, 60935413 edges, 138728 markings/sec, 275 secs
lola: 47656776 markings, 61885665 edges, 143327 markings/sec, 280 secs
lola: 48302785 markings, 62739501 edges, 129202 markings/sec, 285 secs
lola: 48998590 markings, 63660918 edges, 139161 markings/sec, 290 secs
lola: 49666484 markings, 64548404 edges, 133579 markings/sec, 295 secs
lola: 50287159 markings, 65375282 edges, 124135 markings/sec, 300 secs
lola: 50999295 markings, 66319406 edges, 142427 markings/sec, 305 secs
lola: 51577800 markings, 67108073 edges, 115701 markings/sec, 310 secs
lola: 52274564 markings, 68039484 edges, 139353 markings/sec, 315 secs
lola: 52986307 markings, 68988337 edges, 142349 markings/sec, 320 secs
lola: 53608423 markings, 69822366 edges, 124423 markings/sec, 325 secs
lola: 54283158 markings, 70725141 edges, 134947 markings/sec, 330 secs
lola: 54958176 markings, 71627622 edges, 135004 markings/sec, 335 secs
lola: 55571841 markings, 72448395 edges, 122733 markings/sec, 340 secs
lola: 56212017 markings, 73310956 edges, 128035 markings/sec, 345 secs
lola: 56880011 markings, 74203241 edges, 133599 markings/sec, 350 secs
lola: 57072752 markings, 74460695 edges, 38548 markings/sec, 355 secs
lola: 57075836 markings, 74464583 edges, 617 markings/sec, 360 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 409 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((1 <= p343))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((1 <= p343))))
lola: processed formula length: 21
lola: 71 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: 1125 markings, 1125 edges
lola: ========================================
lola: subprocess 9 will run for 477 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p415 <= 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 (((p415 <= 0))))
lola: processed formula length: 21
lola: 71 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: 262298 markings, 262336 edges, 52460 markings/sec, 0 secs
lola: 526268 markings, 526313 edges, 52794 markings/sec, 5 secs
lola: 775107 markings, 775158 edges, 49768 markings/sec, 10 secs
lola: 1043830 markings, 1043886 edges, 53745 markings/sec, 15 secs
lola: 1316467 markings, 1316530 edges, 54527 markings/sec, 20 secs
lola: 1579184 markings, 1579253 edges, 52543 markings/sec, 25 secs
lola: 1842806 markings, 1842881 edges, 52724 markings/sec, 30 secs
lola: 2096088 markings, 2096168 edges, 50656 markings/sec, 35 secs
lola: 2355462 markings, 2355548 edges, 51875 markings/sec, 40 secs
lola: 2610843 markings, 2610935 edges, 51076 markings/sec, 45 secs
lola: 2855660 markings, 2855756 edges, 48963 markings/sec, 50 secs
lola: 3150129 markings, 3150234 edges, 58894 markings/sec, 55 secs
lola: 3416217 markings, 3416327 edges, 53218 markings/sec, 60 secs
lola: 3699060 markings, 3699176 edges, 56569 markings/sec, 65 secs
lola: 3976132 markings, 3976253 edges, 55414 markings/sec, 70 secs
lola: 4253701 markings, 4253829 edges, 55514 markings/sec, 75 secs
lola: 4531938 markings, 4532073 edges, 55647 markings/sec, 80 secs
lola: 4805117 markings, 4805258 edges, 54636 markings/sec, 85 secs
lola: 5056493 markings, 5056638 edges, 50275 markings/sec, 90 secs
lola: 5323247 markings, 5323398 edges, 53351 markings/sec, 95 secs
lola: 5601969 markings, 5602127 edges, 55744 markings/sec, 100 secs
lola: 5856118 markings, 5856283 edges, 50830 markings/sec, 105 secs
lola: 6113215 markings, 6113384 edges, 51419 markings/sec, 110 secs
lola: 6356856 markings, 6357030 edges, 48728 markings/sec, 115 secs
lola: 6617564 markings, 6617743 edges, 52142 markings/sec, 120 secs
lola: 6887287 markings, 6887473 edges, 53945 markings/sec, 125 secs
lola: 7149041 markings, 7149233 edges, 52351 markings/sec, 130 secs
lola: 7412804 markings, 7413001 edges, 52753 markings/sec, 135 secs
lola: 7687390 markings, 7687593 edges, 54917 markings/sec, 140 secs
lola: 7954870 markings, 7955079 edges, 53496 markings/sec, 145 secs
lola: 8221608 markings, 8221824 edges, 53348 markings/sec, 150 secs
lola: 8480918 markings, 8481139 edges, 51862 markings/sec, 155 secs
lola: 8742182 markings, 8742409 edges, 52253 markings/sec, 160 secs
lola: 9007714 markings, 9007946 edges, 53106 markings/sec, 165 secs
lola: 9266740 markings, 9266978 edges, 51805 markings/sec, 170 secs
lola: 9524082 markings, 9524326 edges, 51468 markings/sec, 175 secs
lola: 9771359 markings, 9771607 edges, 49455 markings/sec, 180 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: 9771870 markings, 9772121 edges
lola: ========================================
lola: subprocess 10 will run for 535 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((p429 <= 0) OR ((1 <= p335) AND ((p429 <= 0) OR (p433 <= 0) OR (p439 <= 0)) AND (1 <= p360)) OR (p433 <= 0) OR (p439 <= 0))) OR G (((p413 <= 0) OR (p428 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 535 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p413 <= 0) OR (p428 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p413 <= 0) OR (p428 <= 0)))
lola: processed formula length: 33
lola: 71 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: 274920 markings, 274958 edges, 54984 markings/sec, 0 secs
lola: 559430 markings, 559475 edges, 56902 markings/sec, 5 secs
lola: 827845 markings, 827897 edges, 53683 markings/sec, 10 secs
lola: 1124479 markings, 1124538 edges, 59327 markings/sec, 15 secs
lola: 1410712 markings, 1410777 edges, 57247 markings/sec, 20 secs
lola: 1692396 markings, 1692468 edges, 56337 markings/sec, 25 secs
lola: 1966541 markings, 1966619 edges, 54829 markings/sec, 30 secs
lola: 2239810 markings, 2239893 edges, 54654 markings/sec, 35 secs
lola: 2510924 markings, 2511013 edges, 54223 markings/sec, 40 secs
lola: 2777179 markings, 2777274 edges, 53251 markings/sec, 45 secs
lola: 3066867 markings, 3066969 edges, 57938 markings/sec, 50 secs
lola: 3367388 markings, 3367497 edges, 60104 markings/sec, 55 secs
lola: 3660659 markings, 3660775 edges, 58654 markings/sec, 60 secs
lola: 3948567 markings, 3948688 edges, 57582 markings/sec, 65 secs
lola: 4235670 markings, 4235797 edges, 57421 markings/sec, 70 secs
lola: 4526977 markings, 4527110 edges, 58261 markings/sec, 75 secs
lola: 4812240 markings, 4812381 edges, 57053 markings/sec, 80 secs
lola: 5092854 markings, 5093000 edges, 56123 markings/sec, 85 secs
lola: 5375618 markings, 5375771 edges, 56553 markings/sec, 90 secs
lola: 5663613 markings, 5663772 edges, 57599 markings/sec, 95 secs
lola: 5947806 markings, 5947972 edges, 56839 markings/sec, 100 secs
lola: 6230778 markings, 6230950 edges, 56594 markings/sec, 105 secs
lola: 6504873 markings, 6505052 edges, 54819 markings/sec, 110 secs
lola: 6782502 markings, 6782685 edges, 55526 markings/sec, 115 secs
lola: 7057662 markings, 7057852 edges, 55032 markings/sec, 120 secs
lola: 7323641 markings, 7323835 edges, 53196 markings/sec, 125 secs
lola: 7612411 markings, 7612613 edges, 57754 markings/sec, 130 secs
lola: 7891042 markings, 7891251 edges, 55726 markings/sec, 135 secs
lola: 8165479 markings, 8165693 edges, 54887 markings/sec, 140 secs
lola: 8435316 markings, 8435536 edges, 53967 markings/sec, 145 secs
lola: 8703501 markings, 8703726 edges, 53637 markings/sec, 150 secs
lola: 8979816 markings, 8980048 edges, 55263 markings/sec, 155 secs
lola: 9221931 markings, 9222169 edges, 48423 markings/sec, 160 secs
lola: 9467031 markings, 9467274 edges, 49020 markings/sec, 165 secs
lola: 9725210 markings, 9725457 edges, 51636 markings/sec, 170 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: 9771999 markings, 9772249 edges
lola: ========================================
lola: subprocess 11 will run for 625 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p429 <= 0) OR ((1 <= p335) AND ((p429 <= 0) OR (p433 <= 0) OR (p439 <= 0)) AND (1 <= p360)) OR (p433 <= 0) OR (p439 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p429 <= 0) OR ((1 <= p335) AND ((p429 <= 0) OR (p433 <= 0) OR (p439 <= 0)) AND (1 <= p360)) OR (p433 <= 0) OR (p439 <= 0)))
lola: processed formula length: 133
lola: 71 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: 555456 markings, 557163 edges, 111091 markings/sec, 0 secs
lola: 1158502 markings, 1160218 edges, 120609 markings/sec, 5 secs
lola: 1762166 markings, 1763896 edges, 120733 markings/sec, 10 secs
lola: 2354826 markings, 2356571 edges, 118532 markings/sec, 15 secs
lola: 2883196 markings, 2884952 edges, 105674 markings/sec, 20 secs
lola: 3444929 markings, 3446698 edges, 112347 markings/sec, 25 secs
lola: 4035892 markings, 4037673 edges, 118193 markings/sec, 30 secs
lola: 4625276 markings, 4627704 edges, 117877 markings/sec, 35 secs
lola: 5230364 markings, 5232807 edges, 121018 markings/sec, 40 secs
lola: 5829871 markings, 5832327 edges, 119901 markings/sec, 45 secs
lola: 6426644 markings, 6429112 edges, 119355 markings/sec, 50 secs
lola: 7019393 markings, 7021874 edges, 118550 markings/sec, 55 secs
lola: 7616540 markings, 7619035 edges, 119429 markings/sec, 60 secs
lola: 8154496 markings, 8157003 edges, 107591 markings/sec, 65 secs
lola: 8709916 markings, 8712436 edges, 111084 markings/sec, 70 secs
lola: 9270419 markings, 9272947 edges, 112101 markings/sec, 75 secs
lola: 9851497 markings, 9854039 edges, 116216 markings/sec, 80 secs
lola: 10377848 markings, 10381759 edges, 105270 markings/sec, 85 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: 10377848 markings, 10381759 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 603 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((((p375 <= 0) OR (p390 <= 0)) R ((p83 <= 0) OR (p85 <= 0))) OR (((p375 <= 0)) OR ((p390 <= 0))))) AND (F (((p405 <= 0) OR (p414 <= 0))) AND (((p375 <= 0) OR (p390 <= 0)) AND ((p405 <= 0) OR (p414 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 603 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p375 <= 0) OR (p390 <= 0)) AND ((p405 <= 0) OR (p414 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: (((p375 <= 0) OR (p390 <= 0)) AND ((p405 <= 0) OR (p414 <= 0)))
lola: processed formula length: 65
lola: 72 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 4 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 12 will run for 804 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((p405 <= 0) OR (p414 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: ((1 <= p405) AND (1 <= p414))
lola: processed formula length: 29
lola: 73 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 1206 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((((p375 <= 0) OR (p390 <= 0)) R ((p83 <= 0) OR (p85 <= 0))) OR (((p375 <= 0)) OR ((p390 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((((p375 <= 0) OR (p390 <= 0)) R ((p83 <= 0) OR (p85 <= 0))) OR (((p375 <= 0)) OR ((p390 <= 0)))))
lola: processed formula length: 103
lola: 71 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1585 markings, 1613 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 804 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F ((F (G (((p396 <= 0)))) OR ((1 <= p184) AND (1 <= p190) AND (1 <= p192))))) OR ((1 <= p50) AND (1 <= p75)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 804 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p50) AND (1 <= p75))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p50) AND (1 <= p75))
lola: processed formula length: 27
lola: 71 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 13 will run for 1206 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((F (G (((p396 <= 0)))) OR ((1 <= p184) AND (1 <= p190) AND (1 <= p192)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((F (G (((p396 <= 0)))) OR ((1 <= p184) AND (1 <= p190) AND (1 <= p192)))))
lola: processed formula length: 80
lola: 71 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: 1308 markings, 1513 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 1206 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F (((1 <= p106) AND (1 <= p110) AND (1 <= p116)))) OR F (G (((1 <= p117) AND (1 <= p134) AND (1 <= p407) AND (1 <= p418)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1206 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p106) AND (1 <= p110) AND (1 <= p116))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((1 <= p106) AND (1 <= p110) AND (1 <= p116))))
lola: processed formula length: 53
lola: 71 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 2412 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p117) AND (1 <= p134) AND (1 <= p407) AND (1 <= p418))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((1 <= p117) AND (1 <= p134) AND (1 <= p407) AND (1 <= p418))))
lola: processed formula length: 69
lola: 71 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: 9 markings, 10 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 14 will run for 2412 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F (((1 <= p31) AND (1 <= p56))) U ((1 <= p31) AND (1 <= p56))) OR (G (F (((1 <= p31) AND (1 <= p56)))) AND F (((1 <= p31) AND (1 <= p56)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 2412 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p31) AND (1 <= p56)))
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: ((p31 <= 0) OR (p56 <= 0))
lola: processed formula length: 27
lola: 73 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: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (F ((X (F ((G (((p64 <= 0) OR (p66 <= 0))) OR ((1 <= p407) AND (1 <= p418))))) AND (((1 <= p407)) AND ((1 <= p418))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((X (F ((G (((p64 <= 0) OR (p66 <= 0))) OR ((1 <= p407) AND (1 <= p418))))) AND (((1 <= p407)) AND ((1 <= p418))))))
lola: processed formula length: 122
lola: 71 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 918452 markings, 1746420 edges, 183690 markings/sec, 0 secs
lola: 1810352 markings, 3588364 edges, 178380 markings/sec, 5 secs
lola: 2660381 markings, 5378649 edges, 170006 markings/sec, 10 secs
lola: 3429627 markings, 7045919 edges, 153849 markings/sec, 15 secs
lola: 4121783 markings, 8569637 edges, 138431 markings/sec, 20 secs
lola: 4856421 markings, 10201252 edges, 146928 markings/sec, 25 secs
lola: 5606171 markings, 11879577 edges, 149950 markings/sec, 30 secs
lola: 6305304 markings, 13434341 edges, 139827 markings/sec, 35 secs
lola: 7005558 markings, 15007752 edges, 140051 markings/sec, 40 secs
lola: 7725660 markings, 16641593 edges, 144020 markings/sec, 45 secs
lola: 8460507 markings, 18300694 edges, 146969 markings/sec, 50 secs
lola: 9188863 markings, 19952087 edges, 145671 markings/sec, 55 secs
lola: 9896049 markings, 21582410 edges, 141437 markings/sec, 60 secs
lola: 10617721 markings, 23235972 edges, 144334 markings/sec, 65 secs
lola: 11328204 markings, 24871262 edges, 142097 markings/sec, 70 secs
lola: 12022022 markings, 26467759 edges, 138764 markings/sec, 75 secs
lola: 12694467 markings, 28025245 edges, 134489 markings/sec, 80 secs
lola: 13340751 markings, 29518893 edges, 129257 markings/sec, 85 secs
lola: 14021832 markings, 31117084 edges, 136216 markings/sec, 90 secs
lola: 14713732 markings, 32723674 edges, 138380 markings/sec, 95 secs
lola: 15397293 markings, 34320543 edges, 136712 markings/sec, 100 secs
lola: 16069713 markings, 35898440 edges, 134484 markings/sec, 105 secs
lola: 16747218 markings, 37483470 edges, 135501 markings/sec, 110 secs
lola: 17420749 markings, 39060344 edges, 134706 markings/sec, 115 secs
lola: 18086761 markings, 40632158 edges, 133202 markings/sec, 120 secs
lola: 18748119 markings, 42192417 edges, 132272 markings/sec, 125 secs
lola: 19403915 markings, 43745626 edges, 131159 markings/sec, 130 secs
lola: 20055302 markings, 45292576 edges, 130277 markings/sec, 135 secs
lola: 20715609 markings, 46845408 edges, 132061 markings/sec, 140 secs
lola: 21372306 markings, 48401572 edges, 131339 markings/sec, 145 secs
lola: 22023943 markings, 49948852 edges, 130327 markings/sec, 150 secs
lola: 22665097 markings, 51481049 edges, 128231 markings/sec, 155 secs
lola: 23321461 markings, 53030569 edges, 131273 markings/sec, 160 secs
lola: 23964463 markings, 54559881 edges, 128600 markings/sec, 165 secs
lola: 24616893 markings, 56108056 edges, 130486 markings/sec, 170 secs
lola: 25256826 markings, 57634719 edges, 127987 markings/sec, 175 secs
lola: 25889812 markings, 59154431 edges, 126597 markings/sec, 180 secs
lola: 26520824 markings, 60671653 edges, 126202 markings/sec, 185 secs
lola: 27143947 markings, 62173338 edges, 124625 markings/sec, 190 secs
lola: 27674598 markings, 63440586 edges, 106130 markings/sec, 195 secs
lola: 28228997 markings, 64770468 edges, 110880 markings/sec, 200 secs
lola: 28764627 markings, 66065066 edges, 107126 markings/sec, 205 secs
lola: 29305813 markings, 67365452 edges, 108237 markings/sec, 210 secs
lola: 29835405 markings, 68648672 edges, 105918 markings/sec, 215 secs
lola: 30361187 markings, 69926877 edges, 105156 markings/sec, 220 secs
lola: 30914302 markings, 71251672 edges, 110623 markings/sec, 225 secs
lola: 31446924 markings, 72538262 edges, 106524 markings/sec, 230 secs
lola: 31977435 markings, 73824450 edges, 106102 markings/sec, 235 secs
lola: 32519473 markings, 75125937 edges, 108408 markings/sec, 240 secs
lola: 33060890 markings, 76428809 edges, 108283 markings/sec, 245 secs
lola: 33589529 markings, 77710348 edges, 105728 markings/sec, 250 secs
lola: 34124670 markings, 79003031 edges, 107028 markings/sec, 255 secs
lola: 34669036 markings, 80309874 edges, 108873 markings/sec, 260 secs
lola: 35216499 markings, 81626945 edges, 109493 markings/sec, 265 secs
lola: 35766914 markings, 82948604 edges, 110083 markings/sec, 270 secs
lola: 36300906 markings, 84243099 edges, 106798 markings/sec, 275 secs
lola: 36849038 markings, 85558046 edges, 109626 markings/sec, 280 secs
lola: 37373333 markings, 86834042 edges, 104859 markings/sec, 285 secs
lola: 37932435 markings, 88191140 edges, 111820 markings/sec, 290 secs
lola: 38534590 markings, 89652075 edges, 120431 markings/sec, 295 secs
lola: 39133919 markings, 91118050 edges, 119866 markings/sec, 300 secs
lola: 39734051 markings, 92584724 edges, 120026 markings/sec, 305 secs
lola: 40346887 markings, 94070883 edges, 122567 markings/sec, 310 secs
lola: 40959104 markings, 95559250 edges, 122443 markings/sec, 315 secs
lola: 41566616 markings, 97043322 edges, 121502 markings/sec, 320 secs
lola: 42180887 markings, 98540906 edges, 122854 markings/sec, 325 secs
lola: 42776131 markings, 99999503 edges, 119049 markings/sec, 330 secs
lola: 43346918 markings, 101387831 edges, 114157 markings/sec, 335 secs
lola: 43935575 markings, 102825614 edges, 117731 markings/sec, 340 secs
lola: 44542693 markings, 104312571 edges, 121424 markings/sec, 345 secs
lola: 45149019 markings, 105799301 edges, 121265 markings/sec, 350 secs
lola: 45752638 markings, 107282454 edges, 120724 markings/sec, 355 secs
lola: 46357327 markings, 108763175 edges, 120938 markings/sec, 360 secs
lola: 46952060 markings, 110227909 edges, 118947 markings/sec, 365 secs
lola: 47566405 markings, 111733819 edges, 122869 markings/sec, 370 secs
lola: 48192055 markings, 113259695 edges, 125130 markings/sec, 375 secs
lola: 48764517 markings, 114660438 edges, 114492 markings/sec, 380 secs
lola: 49340149 markings, 116080245 edges, 115126 markings/sec, 385 secs
lola: 49953215 markings, 117583299 edges, 122613 markings/sec, 390 secs
lola: 50528559 markings, 119002729 edges, 115069 markings/sec, 395 secs
lola: 51100640 markings, 120415012 edges, 114416 markings/sec, 400 secs
lola: 51689193 markings, 121868173 edges, 117711 markings/sec, 405 secs
lola: 52278552 markings, 123324879 edges, 117872 markings/sec, 410 secs
lola: 52877408 markings, 124808769 edges, 119771 markings/sec, 415 secs
lola: 53488898 markings, 126313014 edges, 122298 markings/sec, 420 secs
lola: 54094177 markings, 127805521 edges, 121056 markings/sec, 425 secs
lola: 54696077 markings, 129291331 edges, 120380 markings/sec, 430 secs
lola: 55302351 markings, 130786746 edges, 121255 markings/sec, 435 secs
lola: 55857593 markings, 132161583 edges, 111048 markings/sec, 440 secs
lola: 56418657 markings, 133554886 edges, 112213 markings/sec, 445 secs
lola: 57005622 markings, 135009143 edges, 117393 markings/sec, 450 secs
lola: 57614104 markings, 136504279 edges, 121696 markings/sec, 455 secs
lola: 58199693 markings, 137965389 edges, 117118 markings/sec, 460 secs
lola: 58769272 markings, 139371953 edges, 113916 markings/sec, 465 secs
lola: 59332745 markings, 140769981 edges, 112695 markings/sec, 470 secs
lola: 59929039 markings, 142255855 edges, 119259 markings/sec, 475 secs
lola: 60471482 markings, 143605987 edges, 108489 markings/sec, 480 secs
lola: 61045315 markings, 145028450 edges, 114767 markings/sec, 485 secs
lola: 61638551 markings, 146494761 edges, 118647 markings/sec, 490 secs
lola: 62202189 markings, 147900492 edges, 112728 markings/sec, 495 secs
lola: 62773104 markings, 149324272 edges, 114183 markings/sec, 500 secs
lola: 63373600 markings, 150809051 edges, 120099 markings/sec, 505 secs
lola: 63974324 markings, 152299445 edges, 120145 markings/sec, 510 secs
lola: 64568621 markings, 153779563 edges, 118859 markings/sec, 515 secs
lola: 65173676 markings, 155279712 edges, 121011 markings/sec, 520 secs
lola: 65781842 markings, 156791361 edges, 121633 markings/sec, 525 secs
lola: 66383151 markings, 158285937 edges, 120262 markings/sec, 530 secs
lola: 66976371 markings, 159770355 edges, 118644 markings/sec, 535 secs
lola: 67567949 markings, 161250079 edges, 118316 markings/sec, 540 secs
lola: 68122087 markings, 162635587 edges, 110828 markings/sec, 545 secs
lola: 68657221 markings, 163961802 edges, 107027 markings/sec, 550 secs
lola: 69179091 markings, 165267681 edges, 104374 markings/sec, 555 secs
lola: 69714188 markings, 166592838 edges, 107019 markings/sec, 560 secs
lola: 70157192 markings, 167700112 edges, 88601 markings/sec, 565 secs
lola: 70619261 markings, 168850150 edges, 92414 markings/sec, 570 secs
lola: 71043975 markings, 169901487 edges, 84943 markings/sec, 575 secs
lola: 71517962 markings, 171074429 edges, 94797 markings/sec, 580 secs
lola: 72096666 markings, 172528237 edges, 115741 markings/sec, 585 secs
lola: 72653442 markings, 173917742 edges, 111355 markings/sec, 590 secs
lola: 73216494 markings, 175330213 edges, 112610 markings/sec, 595 secs
lola: 73808061 markings, 176798599 edges, 118313 markings/sec, 600 secs
lola: 74606534 markings, 178479540 edges, 159695 markings/sec, 605 secs
lola: 75175685 markings, 179894282 edges, 113830 markings/sec, 610 secs
lola: 75707802 markings, 181227830 edges, 106423 markings/sec, 615 secs
lola: 76301724 markings, 182702608 edges, 118784 markings/sec, 620 secs
lola: 76902115 markings, 184204995 edges, 120078 markings/sec, 625 secs
lola: 77418620 markings, 185493793 edges, 103301 markings/sec, 630 secs
lola: 77959902 markings, 186863401 edges, 108256 markings/sec, 635 secs
lola: 78501519 markings, 188228785 edges, 108323 markings/sec, 640 secs
lola: 79075101 markings, 189674270 edges, 114716 markings/sec, 645 secs
lola: 79618745 markings, 191041696 edges, 108729 markings/sec, 650 secs
lola: 80150308 markings, 192373241 edges, 106313 markings/sec, 655 secs
lola: 80632634 markings, 193585672 edges, 96465 markings/sec, 660 secs
lola: 81111060 markings, 194786016 edges, 95685 markings/sec, 665 secs
lola: 81590744 markings, 195983493 edges, 95937 markings/sec, 670 secs
lola: 82059066 markings, 197163691 edges, 93664 markings/sec, 675 secs
lola: 82502003 markings, 198281607 edges, 88587 markings/sec, 680 secs
lola: 82968123 markings, 199455247 edges, 93224 markings/sec, 685 secs
lola: 83431354 markings, 200620608 edges, 92646 markings/sec, 690 secs
lola: 83899534 markings, 201805744 edges, 93636 markings/sec, 695 secs
lola: 84362675 markings, 202971199 edges, 92628 markings/sec, 700 secs
lola: 84666152 markings, 203733197 edges, 60695 markings/sec, 705 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (X (X ((((1 <= p296) AND (1 <= p300) AND (1 <= p306)) U ((1 <= p282))))) R ((p498 <= 0) OR (p511 <= 0) OR (p81 <= 0) OR (p92 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (X ((((1 <= p296) AND (1 <= p300) AND (1 <= p306)) U ((1 <= p282))))) R ((p498 <= 0) OR (p511 <= 0) OR (p81 <= 0) OR (p92 <= 0)))
lola: processed formula length: 135
lola: 71 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1133325 markings, 1360575 edges, 226665 markings/sec, 0 secs
lola: 2209446 markings, 2680421 edges, 215224 markings/sec, 5 secs
lola: 3213558 markings, 3930486 edges, 200822 markings/sec, 10 secs
lola: 4286068 markings, 5268834 edges, 214502 markings/sec, 15 secs
lola: 5312014 markings, 6558877 edges, 205189 markings/sec, 20 secs
lola: 6361848 markings, 7884465 edges, 209967 markings/sec, 25 secs
lola: 7405146 markings, 9203433 edges, 208660 markings/sec, 30 secs
lola: 8420823 markings, 10499766 edges, 203135 markings/sec, 35 secs
lola: 9399948 markings, 11751638 edges, 195825 markings/sec, 40 secs
lola: 10368029 markings, 12992082 edges, 193616 markings/sec, 45 secs
lola: 11341591 markings, 14243881 edges, 194712 markings/sec, 50 secs
lola: 12274406 markings, 15438308 edges, 186563 markings/sec, 55 secs
lola: 13266417 markings, 16717081 edges, 198402 markings/sec, 60 secs
lola: 14238654 markings, 17961888 edges, 194447 markings/sec, 65 secs
lola: 15186106 markings, 19192503 edges, 189490 markings/sec, 70 secs
lola: 16148271 markings, 20440280 edges, 192433 markings/sec, 75 secs
lola: 17087272 markings, 21656418 edges, 187800 markings/sec, 80 secs
lola: 18040209 markings, 22882874 edges, 190587 markings/sec, 85 secs
lola: 18985386 markings, 24107721 edges, 189035 markings/sec, 90 secs
lola: 19972611 markings, 25382406 edges, 197445 markings/sec, 95 secs
lola: 20907690 markings, 26603027 edges, 187016 markings/sec, 100 secs
lola: 21828948 markings, 27799193 edges, 184252 markings/sec, 105 secs
lola: 22742268 markings, 28995629 edges, 182664 markings/sec, 110 secs
lola: 23687743 markings, 30228934 edges, 189095 markings/sec, 115 secs
lola: 24599794 markings, 31421505 edges, 182410 markings/sec, 120 secs
lola: 25533996 markings, 32647800 edges, 186840 markings/sec, 125 secs
lola: 26438700 markings, 33836867 edges, 180941 markings/sec, 130 secs
lola: 27345079 markings, 35030048 edges, 181276 markings/sec, 135 secs
lola: 28255526 markings, 36226143 edges, 182089 markings/sec, 140 secs
lola: 29173556 markings, 37439813 edges, 183606 markings/sec, 145 secs
lola: 30081732 markings, 38636309 edges, 181635 markings/sec, 150 secs
lola: 30943722 markings, 39773141 edges, 172398 markings/sec, 155 secs
lola: 31865596 markings, 40984004 edges, 184375 markings/sec, 160 secs
lola: 32750070 markings, 42142445 edges, 176895 markings/sec, 165 secs
lola: 33684944 markings, 43372313 edges, 186975 markings/sec, 170 secs
lola: 34573565 markings, 44547674 edges, 177724 markings/sec, 175 secs
lola: 35498165 markings, 45763014 edges, 184920 markings/sec, 180 secs
lola: 36383232 markings, 46937248 edges, 177013 markings/sec, 185 secs
lola: 37262912 markings, 48106274 edges, 175936 markings/sec, 190 secs
lola: 38148809 markings, 49283069 edges, 177179 markings/sec, 195 secs
lola: 39043247 markings, 50474400 edges, 178888 markings/sec, 200 secs
lola: 39922142 markings, 51647928 edges, 175779 markings/sec, 205 secs
lola: 40779978 markings, 52784891 edges, 171567 markings/sec, 210 secs
lola: 41678404 markings, 53973072 edges, 179685 markings/sec, 215 secs
lola: 42596952 markings, 55180473 edges, 183710 markings/sec, 220 secs
lola: 43468911 markings, 56335437 edges, 174392 markings/sec, 225 secs
lola: 44455297 markings, 57624638 edges, 197277 markings/sec, 230 secs
lola: 45321727 markings, 58782849 edges, 173286 markings/sec, 235 secs
lola: 46016987 markings, 59707113 edges, 139052 markings/sec, 240 secs
lola: 46654846 markings, 60557471 edges, 127572 markings/sec, 245 secs
lola: 47332204 markings, 61455658 edges, 135472 markings/sec, 250 secs
lola: 48089569 markings, 62455808 edges, 151473 markings/sec, 255 secs
lola: 48759334 markings, 63348538 edges, 133953 markings/sec, 260 secs
lola: 49410924 markings, 64208260 edges, 130318 markings/sec, 265 secs
lola: 50101665 markings, 65127386 edges, 138148 markings/sec, 270 secs
lola: 50781195 markings, 66027838 edges, 135906 markings/sec, 275 secs
lola: 51427980 markings, 66902332 edges, 129357 markings/sec, 280 secs
lola: 52051885 markings, 67741318 edges, 124781 markings/sec, 285 secs
lola: 52663557 markings, 68555860 edges, 122334 markings/sec, 290 secs
lola: 53430657 markings, 69585603 edges, 153420 markings/sec, 295 secs
lola: 54038404 markings, 70402585 edges, 121549 markings/sec, 300 secs
lola: 54668069 markings, 71241496 edges, 125933 markings/sec, 305 secs
lola: 55236013 markings, 71999306 edges, 113589 markings/sec, 310 secs
lola: 55869255 markings, 72846455 edges, 126648 markings/sec, 315 secs
lola: 56503798 markings, 73701632 edges, 126909 markings/sec, 320 secs
lola: 57031001 markings, 74406012 edges, 105441 markings/sec, 325 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: ((F (((1 <= p31) AND (1 <= p56))) U ((1 <= p31) AND (1 <= p56))) OR (G (F (((1 <= p31) AND (1 <= p56)))) AND F (((1 <= p31) AND (1 <= p56)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: F (((1 <= p31) AND (1 <= p56)))
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: ((p31 <= 0) OR (p56 <= 0))
lola: processed formula length: 27
lola: 73 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: ========================================
lola: ...considering subproblem: (F (((1 <= p31) AND (1 <= p56))) U ((1 <= p31) AND (1 <= p56)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F (((1 <= p31) AND (1 <= p56))) U ((1 <= p31) AND (1 <= p56)))
lola: processed formula length: 63
lola: 71 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no unknown no no no no no no unknown no
lola:
preliminary result: no no no no no no unknown no no no no no no unknown no
lola: memory consumption: 3988 KB
lola: time consumption: 2205 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="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is 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 r211-tajo-159033477300330"
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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;