fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r211-tajo-159033477300346
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for ShieldIIPt-PT-040A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15736.840 3600000.00 438697.00 247.00 FFFFTFFFFFFFFFTF normal

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-159033477300346.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-040A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033477300346
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 380K
-rw-r--r-- 1 mcc users 3.4K May 14 01:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 14 01:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 13 18:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 13 18:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 14 10:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 14 10:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 2.8K May 13 13:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K May 13 13:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 13 08:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 08:16 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 212K 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-040A-00
FORMULA_NAME ShieldIIPt-PT-040A-01
FORMULA_NAME ShieldIIPt-PT-040A-02
FORMULA_NAME ShieldIIPt-PT-040A-03
FORMULA_NAME ShieldIIPt-PT-040A-04
FORMULA_NAME ShieldIIPt-PT-040A-05
FORMULA_NAME ShieldIIPt-PT-040A-06
FORMULA_NAME ShieldIIPt-PT-040A-07
FORMULA_NAME ShieldIIPt-PT-040A-08
FORMULA_NAME ShieldIIPt-PT-040A-09
FORMULA_NAME ShieldIIPt-PT-040A-10
FORMULA_NAME ShieldIIPt-PT-040A-11
FORMULA_NAME ShieldIIPt-PT-040A-12
FORMULA_NAME ShieldIIPt-PT-040A-13
FORMULA_NAME ShieldIIPt-PT-040A-14
FORMULA_NAME ShieldIIPt-PT-040A-15

=== Now, execution of the tool begins

BK_START 1591300397796

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 19:53:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 19:53:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 19:53:19] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2020-06-04 19:53:19] [INFO ] Transformed 763 places.
[2020-06-04 19:53:19] [INFO ] Transformed 563 transitions.
[2020-06-04 19:53:19] [INFO ] Found NUPN structural information;
[2020-06-04 19:53:19] [INFO ] Parsed PT model containing 763 places and 563 transitions in 128 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 33 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 773 ms. (steps per millisecond=129 ) properties seen :[0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0]
// Phase 1: matrix 562 rows 763 cols
[2020-06-04 19:53:20] [INFO ] Computed 361 place invariants in 18 ms
[2020-06-04 19:53:20] [INFO ] [Real]Absence check using 361 positive place invariants in 218 ms returned sat
[2020-06-04 19:53:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:53:21] [INFO ] [Real]Absence check using state equation in 1025 ms returned sat
[2020-06-04 19:53:22] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 53 ms.
[2020-06-04 19:53:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:53:22] [INFO ] [Nat]Absence check using 361 positive place invariants in 142 ms returned sat
[2020-06-04 19:53:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:53:23] [INFO ] [Nat]Absence check using state equation in 874 ms returned sat
[2020-06-04 19:53:23] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 50 ms.
[2020-06-04 19:53:32] [INFO ] Added : 556 causal constraints over 113 iterations in 8669 ms. Result :sat
[2020-06-04 19:53:32] [INFO ] [Real]Absence check using 361 positive place invariants in 229 ms returned sat
[2020-06-04 19:53:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:53:33] [INFO ] [Real]Absence check using state equation in 1089 ms returned sat
[2020-06-04 19:53:33] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 35 ms.
[2020-06-04 19:53:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:53:34] [INFO ] [Nat]Absence check using 361 positive place invariants in 182 ms returned sat
[2020-06-04 19:53:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:53:35] [INFO ] [Nat]Absence check using state equation in 1663 ms returned sat
[2020-06-04 19:53:35] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 37 ms.
[2020-06-04 19:53:43] [INFO ] Added : 552 causal constraints over 112 iterations in 7903 ms. Result :sat
[2020-06-04 19:53:44] [INFO ] [Real]Absence check using 361 positive place invariants in 372 ms returned sat
[2020-06-04 19:53:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:53:45] [INFO ] [Real]Absence check using state equation in 1635 ms returned sat
[2020-06-04 19:53:46] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 47 ms.
[2020-06-04 19:53:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:53:46] [INFO ] [Nat]Absence check using 361 positive place invariants in 579 ms returned sat
[2020-06-04 19:53:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:53:48] [INFO ] [Nat]Absence check using state equation in 1447 ms returned sat
[2020-06-04 19:53:48] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 41 ms.
[2020-06-04 19:53:59] [INFO ] Added : 559 causal constraints over 113 iterations in 11684 ms. Result :sat
[2020-06-04 19:54:00] [INFO ] [Real]Absence check using 361 positive place invariants in 456 ms returned sat
[2020-06-04 19:54:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:54:01] [INFO ] [Real]Absence check using state equation in 1020 ms returned sat
[2020-06-04 19:54:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:54:02] [INFO ] [Nat]Absence check using 361 positive place invariants in 215 ms returned sat
[2020-06-04 19:54:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:54:03] [INFO ] [Nat]Absence check using state equation in 1257 ms returned sat
[2020-06-04 19:54:03] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 48 ms.
[2020-06-04 19:54:10] [INFO ] Added : 551 causal constraints over 111 iterations in 7423 ms. Result :sat
[2020-06-04 19:54:11] [INFO ] [Real]Absence check using 361 positive place invariants in 196 ms returned sat
[2020-06-04 19:54:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:54:12] [INFO ] [Real]Absence check using state equation in 1118 ms returned sat
[2020-06-04 19:54:12] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 36 ms.
[2020-06-04 19:54:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:54:12] [INFO ] [Nat]Absence check using 361 positive place invariants in 338 ms returned sat
[2020-06-04 19:54:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:54:14] [INFO ] [Nat]Absence check using state equation in 1169 ms returned sat
[2020-06-04 19:54:14] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 45 ms.
[2020-06-04 19:54:22] [INFO ] Added : 549 causal constraints over 111 iterations in 8295 ms. Result :sat
[2020-06-04 19:54:22] [INFO ] [Real]Absence check using 361 positive place invariants in 234 ms returned sat
[2020-06-04 19:54:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:54:23] [INFO ] [Real]Absence check using state equation in 1004 ms returned sat
[2020-06-04 19:54:23] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 40 ms.
[2020-06-04 19:54:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:54:24] [INFO ] [Nat]Absence check using 361 positive place invariants in 206 ms returned sat
[2020-06-04 19:54:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:54:25] [INFO ] [Nat]Absence check using state equation in 1300 ms returned sat
[2020-06-04 19:54:25] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 37 ms.
[2020-06-04 19:54:34] [INFO ] Added : 552 causal constraints over 113 iterations in 8666 ms. Result :sat
[2020-06-04 19:54:35] [INFO ] [Real]Absence check using 361 positive place invariants in 525 ms returned sat
[2020-06-04 19:54:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:54:36] [INFO ] [Real]Absence check using state equation in 1895 ms returned sat
[2020-06-04 19:54:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:54:37] [INFO ] [Nat]Absence check using 361 positive place invariants in 198 ms returned sat
[2020-06-04 19:54:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:54:38] [INFO ] [Nat]Absence check using state equation in 1037 ms returned sat
[2020-06-04 19:54:38] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 40 ms.
[2020-06-04 19:54:45] [INFO ] Added : 557 causal constraints over 112 iterations in 7060 ms. Result :sat
[2020-06-04 19:54:45] [INFO ] [Real]Absence check using 361 positive place invariants in 214 ms returned sat
[2020-06-04 19:54:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:54:46] [INFO ] [Real]Absence check using state equation in 1076 ms returned sat
[2020-06-04 19:54:47] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 39 ms.
[2020-06-04 19:54:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:54:47] [INFO ] [Nat]Absence check using 361 positive place invariants in 503 ms returned sat
[2020-06-04 19:54:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:54:49] [INFO ] [Nat]Absence check using state equation in 1163 ms returned sat
[2020-06-04 19:54:49] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 31 ms.
[2020-06-04 19:54:56] [INFO ] Added : 549 causal constraints over 111 iterations in 7746 ms. Result :sat
[2020-06-04 19:54:57] [INFO ] [Real]Absence check using 361 positive place invariants in 232 ms returned sat
[2020-06-04 19:54:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:54:58] [INFO ] [Real]Absence check using state equation in 1286 ms returned sat
[2020-06-04 19:54:58] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 34 ms.
[2020-06-04 19:54:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:54:58] [INFO ] [Nat]Absence check using 361 positive place invariants in 149 ms returned sat
[2020-06-04 19:54:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:54:59] [INFO ] [Nat]Absence check using state equation in 915 ms returned sat
[2020-06-04 19:54:59] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 33 ms.
[2020-06-04 19:55:05] [INFO ] Added : 557 causal constraints over 114 iterations in 5950 ms. Result :sat
[2020-06-04 19:55:06] [INFO ] [Real]Absence check using 361 positive place invariants in 651 ms returned sat
[2020-06-04 19:55:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:55:07] [INFO ] [Real]Absence check using state equation in 1348 ms returned sat
[2020-06-04 19:55:08] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 41 ms.
[2020-06-04 19:55:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:55:08] [INFO ] [Nat]Absence check using 361 positive place invariants in 399 ms returned sat
[2020-06-04 19:55:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:55:09] [INFO ] [Nat]Absence check using state equation in 987 ms returned sat
[2020-06-04 19:55:09] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 30 ms.
[2020-06-04 19:55:18] [INFO ] Added : 555 causal constraints over 111 iterations in 8429 ms. Result :sat
[2020-06-04 19:55:18] [INFO ] [Real]Absence check using 361 positive place invariants in 193 ms returned sat
[2020-06-04 19:55:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:55:21] [INFO ] [Real]Absence check using state equation in 3055 ms returned sat
[2020-06-04 19:55:21] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 42 ms.
[2020-06-04 19:55:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:55:22] [INFO ] [Nat]Absence check using 361 positive place invariants in 322 ms returned sat
[2020-06-04 19:55:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:55:25] [INFO ] [Nat]Absence check using state equation in 2917 ms returned sat
[2020-06-04 19:55:25] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 52 ms.
[2020-06-04 19:55:36] [INFO ] Added : 556 causal constraints over 113 iterations in 11042 ms. Result :sat
[2020-06-04 19:55:36] [INFO ] [Real]Absence check using 361 positive place invariants in 211 ms returned sat
[2020-06-04 19:55:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:55:37] [INFO ] [Real]Absence check using state equation in 1185 ms returned sat
[2020-06-04 19:55:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:55:38] [INFO ] [Nat]Absence check using 361 positive place invariants in 230 ms returned sat
[2020-06-04 19:55:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:55:39] [INFO ] [Nat]Absence check using state equation in 1114 ms returned sat
[2020-06-04 19:55:39] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 61 ms.
[2020-06-04 19:55:47] [INFO ] Added : 548 causal constraints over 110 iterations in 8366 ms. Result :sat
[2020-06-04 19:55:50] [INFO ] [Real]Absence check using 361 positive place invariants in 2393 ms returned sat
[2020-06-04 19:55:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:55:56] [INFO ] [Real]Absence check using state equation in 6490 ms returned sat
[2020-06-04 19:55:56] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 39 ms.
[2020-06-04 19:55:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:55:57] [INFO ] [Nat]Absence check using 361 positive place invariants in 256 ms returned sat
[2020-06-04 19:55:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:55:59] [INFO ] [Nat]Absence check using state equation in 2283 ms returned sat
[2020-06-04 19:55:59] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 39 ms.
[2020-06-04 19:56:12] [INFO ] Added : 559 causal constraints over 113 iterations in 12323 ms. Result :sat
[2020-06-04 19:56:12] [INFO ] [Real]Absence check using 361 positive place invariants in 199 ms returned sat
[2020-06-04 19:56:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:56:15] [INFO ] [Real]Absence check using state equation in 2634 ms returned sat
[2020-06-04 19:56:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:56:15] [INFO ] [Nat]Absence check using 361 positive place invariants in 198 ms returned sat
[2020-06-04 19:56:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:56:17] [INFO ] [Nat]Absence check using state equation in 2425 ms returned sat
[2020-06-04 19:56:18] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 45 ms.
[2020-06-04 19:56:27] [INFO ] Added : 555 causal constraints over 113 iterations in 9636 ms. Result :sat
[2020-06-04 19:56:28] [INFO ] [Real]Absence check using 361 positive place invariants in 217 ms returned sat
[2020-06-04 19:56:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:56:29] [INFO ] [Real]Absence check using state equation in 1074 ms returned sat
[2020-06-04 19:56:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:56:30] [INFO ] [Nat]Absence check using 361 positive place invariants in 683 ms returned sat
[2020-06-04 19:56:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:56:33] [INFO ] [Nat]Absence check using state equation in 3345 ms returned sat
[2020-06-04 19:56:33] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 45 ms.
[2020-06-04 19:56:43] [INFO ] Added : 556 causal constraints over 114 iterations in 10383 ms. Result :sat
[2020-06-04 19:56:44] [INFO ] [Real]Absence check using 361 positive place invariants in 601 ms returned sat
[2020-06-04 19:56:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:56:45] [INFO ] [Real]Absence check using state equation in 973 ms returned sat
[2020-06-04 19:56:45] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 58 ms.
[2020-06-04 19:56:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:56:46] [INFO ] [Nat]Absence check using 361 positive place invariants in 265 ms returned sat
[2020-06-04 19:56:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:56:48] [INFO ] [Nat]Absence check using state equation in 2135 ms returned sat
[2020-06-04 19:56:48] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 44 ms.
[2020-06-04 19:56:58] [INFO ] Added : 559 causal constraints over 115 iterations in 10181 ms. Result :sat
[2020-06-04 19:56:58] [INFO ] [Real]Absence check using 361 positive place invariants in 196 ms returned sat
[2020-06-04 19:56:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:56:59] [INFO ] [Real]Absence check using state equation in 1034 ms returned sat
[2020-06-04 19:56:59] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 40 ms.
[2020-06-04 19:57:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:57:00] [INFO ] [Nat]Absence check using 361 positive place invariants in 144 ms returned sat
[2020-06-04 19:57:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:57:02] [INFO ] [Nat]Absence check using state equation in 1661 ms returned sat
[2020-06-04 19:57:02] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 76 ms.
[2020-06-04 19:57:10] [INFO ] Added : 559 causal constraints over 114 iterations in 8579 ms. Result :sat
[2020-06-04 19:57:11] [INFO ] [Real]Absence check using 361 positive place invariants in 186 ms returned sat
[2020-06-04 19:57:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:57:11] [INFO ] [Real]Absence check using state equation in 930 ms returned sat
[2020-06-04 19:57:12] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 18 ms.
[2020-06-04 19:57:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:57:12] [INFO ] [Nat]Absence check using 361 positive place invariants in 378 ms returned sat
[2020-06-04 19:57:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:57:13] [INFO ] [Nat]Absence check using state equation in 1016 ms returned sat
[2020-06-04 19:57:13] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 38 ms.
[2020-06-04 19:57:22] [INFO ] Added : 554 causal constraints over 112 iterations in 8727 ms. Result :sat
[2020-06-04 19:57:22] [INFO ] [Real]Absence check using 361 positive place invariants in 213 ms returned sat
[2020-06-04 19:57:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:57:26] [INFO ] [Real]Absence check using state equation in 3274 ms returned sat
[2020-06-04 19:57:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:57:26] [INFO ] [Nat]Absence check using 361 positive place invariants in 159 ms returned sat
[2020-06-04 19:57:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:57:27] [INFO ] [Nat]Absence check using state equation in 981 ms returned sat
[2020-06-04 19:57:27] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 33 ms.
[2020-06-04 19:57:34] [INFO ] Added : 548 causal constraints over 112 iterations in 6712 ms. Result :sat
[2020-06-04 19:57:35] [INFO ] [Real]Absence check using 361 positive place invariants in 1040 ms returned sat
[2020-06-04 19:57:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:57:37] [INFO ] [Real]Absence check using state equation in 2586 ms returned sat
[2020-06-04 19:57:38] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 48 ms.
[2020-06-04 19:57:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:57:38] [INFO ] [Nat]Absence check using 361 positive place invariants in 531 ms returned sat
[2020-06-04 19:57:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:57:40] [INFO ] [Nat]Absence check using state equation in 1120 ms returned sat
[2020-06-04 19:57:40] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 31 ms.
[2020-06-04 19:57:48] [INFO ] Added : 558 causal constraints over 116 iterations in 8473 ms. Result :sat
[2020-06-04 19:57:49] [INFO ] [Real]Absence check using 361 positive place invariants in 361 ms returned sat
[2020-06-04 19:57:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:57:50] [INFO ] [Real]Absence check using state equation in 1085 ms returned sat
[2020-06-04 19:57:50] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 29 ms.
[2020-06-04 19:57:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:57:50] [INFO ] [Nat]Absence check using 361 positive place invariants in 211 ms returned sat
[2020-06-04 19:57:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:57:51] [INFO ] [Nat]Absence check using state equation in 1094 ms returned sat
[2020-06-04 19:57:51] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 32 ms.
[2020-06-04 19:57:58] [INFO ] Added : 557 causal constraints over 113 iterations in 6963 ms. Result :sat
[2020-06-04 19:57:59] [INFO ] [Real]Absence check using 361 positive place invariants in 196 ms returned sat
[2020-06-04 19:57:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:58:00] [INFO ] [Real]Absence check using state equation in 1024 ms returned sat
[2020-06-04 19:58:00] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 44 ms.
[2020-06-04 19:58:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:58:00] [INFO ] [Nat]Absence check using 361 positive place invariants in 201 ms returned sat
[2020-06-04 19:58:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:58:01] [INFO ] [Nat]Absence check using state equation in 1055 ms returned sat
[2020-06-04 19:58:01] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 42 ms.
[2020-06-04 19:58:09] [INFO ] Added : 549 causal constraints over 111 iterations in 7654 ms. Result :sat
[2020-06-04 19:58:09] [INFO ] [Real]Absence check using 361 positive place invariants in 158 ms returned sat
[2020-06-04 19:58:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:58:10] [INFO ] [Real]Absence check using state equation in 1020 ms returned sat
[2020-06-04 19:58:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:58:11] [INFO ] [Nat]Absence check using 361 positive place invariants in 156 ms returned sat
[2020-06-04 19:58:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:58:12] [INFO ] [Nat]Absence check using state equation in 990 ms returned sat
[2020-06-04 19:58:12] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 43 ms.
[2020-06-04 19:58:19] [INFO ] Added : 545 causal constraints over 110 iterations in 7271 ms. Result :sat
[2020-06-04 19:58:19] [INFO ] [Real]Absence check using 361 positive place invariants in 192 ms returned sat
[2020-06-04 19:58:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:58:20] [INFO ] [Real]Absence check using state equation in 1103 ms returned sat
[2020-06-04 19:58:20] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 35 ms.
[2020-06-04 19:58:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:58:22] [INFO ] [Nat]Absence check using 361 positive place invariants in 1070 ms returned sat
[2020-06-04 19:58:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:58:23] [INFO ] [Nat]Absence check using state equation in 1248 ms returned sat
[2020-06-04 19:58:23] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 36 ms.
[2020-06-04 19:58:32] [INFO ] Added : 549 causal constraints over 110 iterations in 8887 ms. Result :sat
[2020-06-04 19:58:32] [INFO ] [Real]Absence check using 361 positive place invariants in 222 ms returned sat
[2020-06-04 19:58:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:58:33] [INFO ] [Real]Absence check using state equation in 937 ms returned sat
[2020-06-04 19:58:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:58:34] [INFO ] [Nat]Absence check using 361 positive place invariants in 194 ms returned sat
[2020-06-04 19:58:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:58:35] [INFO ] [Nat]Absence check using state equation in 1045 ms returned sat
[2020-06-04 19:58:35] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 33 ms.
[2020-06-04 19:58:40] [INFO ] Added : 545 causal constraints over 111 iterations in 5729 ms. Result :sat
[2020-06-04 19:58:41] [INFO ] [Real]Absence check using 361 positive place invariants in 198 ms returned sat
[2020-06-04 19:58:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:58:42] [INFO ] [Real]Absence check using state equation in 1035 ms returned sat
[2020-06-04 19:58:42] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 39 ms.
[2020-06-04 19:58:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:58:42] [INFO ] [Nat]Absence check using 361 positive place invariants in 146 ms returned sat
[2020-06-04 19:58:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:58:43] [INFO ] [Nat]Absence check using state equation in 1096 ms returned sat
[2020-06-04 19:58:43] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 42 ms.
[2020-06-04 19:58:49] [INFO ] Added : 555 causal constraints over 113 iterations in 5749 ms. Result :sat
[2020-06-04 19:58:50] [INFO ] [Real]Absence check using 361 positive place invariants in 215 ms returned sat
[2020-06-04 19:58:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:58:51] [INFO ] [Real]Absence check using state equation in 910 ms returned sat
[2020-06-04 19:58:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:58:51] [INFO ] [Nat]Absence check using 361 positive place invariants in 199 ms returned sat
[2020-06-04 19:58:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:58:52] [INFO ] [Nat]Absence check using state equation in 1251 ms returned sat
[2020-06-04 19:58:52] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 61 ms.
[2020-06-04 19:59:03] [INFO ] Added : 553 causal constraints over 115 iterations in 10518 ms. Result :sat
[2020-06-04 19:59:03] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-04 19:59:03] [INFO ] Flatten gal took : 197 ms
FORMULA ShieldIIPt-PT-040A-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 19:59:03] [INFO ] Applying decomposition
[2020-06-04 19:59:03] [INFO ] Flatten gal took : 75 ms
[2020-06-04 19:59:03] [INFO ] Decomposing Gal with order
[2020-06-04 19:59:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-04 19:59:04] [INFO ] Removed a total of 160 redundant transitions.
[2020-06-04 19:59:04] [INFO ] Flatten gal took : 138 ms
[2020-06-04 19:59:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 32 ms.
[2020-06-04 19:59:04] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 15 ms.
[2020-06-04 19:59:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 18 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ ShieldIIPt-PT-040A @ 3570 seconds

FORMULA ShieldIIPt-PT-040A-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-040A-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-040A-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-040A-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-040A-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-040A-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-040A-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-040A-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-040A-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-040A-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-040A-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-040A-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3547
rslt: Output for LTLFireability @ ShieldIIPt-PT-040A

{
"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:59:04 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 295
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 1,
"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": "X ((((1 <= p235) AND (1 <= p237)) U G (((p235 <= 0) OR (p237 <= 0)))))",
"processed_size": 71,
"rewrites": 85
},
"result":
{
"edges": 8632,
"markings": 8632,
"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": 322
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 1,
"aneg": 1,
"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": 4,
"visible_transitions": 0
},
"processed": "F (G ((F ((X (((p377 <= 0))) AND ((p383 <= 0) OR (p400 <= 0)))) OR (F (((1 <= p168) AND (1 <= p377))) AND (((1 <= p383)) AND ((1 <= p400)))))))",
"processed_size": 144,
"rewrites": 85
},
"result":
{
"edges": 10578,
"markings": 10534,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 394
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "((p175 <= 0) OR (p188 <= 0))",
"processed_size": 29,
"rewrites": 85
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 443
},
"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 <= p688) AND (1 <= p701))",
"processed_size": 29,
"rewrites": 85
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 591
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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": "X (((p324 <= 0)))",
"processed_size": 17,
"rewrites": 85
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 506
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 1,
"X": 1,
"aconj": 7,
"adisj": 0,
"aneg": 4,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 3,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "((G (((1 <= p364) AND (1 <= p381))) AND (((1 <= p42)) AND ((1 <= p55)))) U G ((((p614 <= 0) OR (p623 <= 0)) AND (X (((p614 <= 0) OR (p623 <= 0))) OR (((p364 <= 0)) OR ((p381 <= 0)))))))",
"processed_size": 187,
"rewrites": 85
},
"result":
{
"edges": 8632,
"markings": 8632,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"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": 591
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 591
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"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 <= p412) AND (1 <= p418) AND (1 <= p420) AND ((p651 <= 0) OR (p662 <= 0)))",
"processed_size": 79,
"rewrites": 85
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 709
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 2,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "(G (((1 <= p412) AND (1 <= p418) AND (1 <= p420) AND (1 <= p723))) R X (G (((p584 <= 0)))))",
"processed_size": 91,
"rewrites": 85
},
"result":
{
"edges": 8632,
"markings": 8632,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 886
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 3,
"aconj": 7,
"adisj": 0,
"aneg": 7,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 2,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "G (((X (((p240 <= 0) OR (p265 <= 0))) AND (F (((p240 <= 0) OR (p265 <= 0))) OR X (G (((p240 <= 0) OR (p265 <= 0)))))) R (G ((X (((p136 <= 0) OR (p153 <= 0))) AND ((p546 <= 0) OR (p561 <= 0)))) OR (((p240 <= 0)) OR ((p265 <= 0))))))",
"processed_size": 236,
"rewrites": 85
},
"result":
{
"edges": 8684,
"markings": 8684,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 1182
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((X (F (((1 <= p400)))) OR G (((1 <= p550)))))",
"processed_size": 48,
"rewrites": 85
},
"result":
{
"edges": 2448,
"markings": 2448,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1773
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"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": "(((p25 <= 0) OR (p34 <= 0)) R F (((p25 <= 0) OR (p34 <= 0))))",
"processed_size": 63,
"rewrites": 85
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"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": 3547
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (((1 <= p347) AND (1 <= p358)))",
"processed_size": 33,
"rewrites": 85
},
"result":
{
"edges": 8632,
"markings": 8632,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 11,
"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": 10,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3547
},
"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": "((p519 <= 0) OR (p528 <= 0))",
"processed_size": 29,
"rewrites": 87
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"error": null,
"memory": 45796,
"runtime": 23.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X((** U G(*))) : F(G((F((X(*) AND **)) OR (F(**) AND (** AND **))))) : F((X(F(*)) AND (G(F(**)) AND (** AND (** AND **))))) : (F(G((F(**) AND (** OR **)))) OR (** OR (X(*) AND **))) : X(X(F((F(G(**)) AND (** AND **))))) : ((G(**) AND (** AND **)) U G((* AND (X(*) OR (* OR *))))) : ((G(*) R X(G(*))) OR **) : X(X(G(*))) : F(**) : G(((X(*) AND (F(*) OR X(G(*)))) R (G((X(*) AND *)) OR (* OR *)))) : G((X(F(*)) OR G(**))) : ((* R F(*)) AND X(**))"
},
"net":
{
"arcs": 2404,
"conflict_clusters": 283,
"places": 763,
"places_significant": 402,
"singleton_clusters": 0,
"transitions": 562
},
"result":
{
"preliminary_value": "no no no yes no no no no no no no no ",
"value": "no no no yes no no no no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 1325/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 24416
lola: finding significant places
lola: 763 places, 562 transitions, 402 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: (p235 <= 1)
lola: LP says that atomic proposition is always true: (p237 <= 1)
lola: LP says that atomic proposition is always true: (p235 <= 1)
lola: LP says that atomic proposition is always true: (p237 <= 1)
lola: LP says that atomic proposition is always true: (p235 <= 1)
lola: LP says that atomic proposition is always true: (p237 <= 1)
lola: LP says that atomic proposition is always true: (p377 <= 1)
lola: LP says that atomic proposition is always true: (p383 <= 1)
lola: LP says that atomic proposition is always true: (p400 <= 1)
lola: LP says that atomic proposition is always true: (p168 <= 1)
lola: LP says that atomic proposition is always true: (p377 <= 1)
lola: LP says that atomic proposition is always true: (p383 <= 1)
lola: LP says that atomic proposition is always true: (p400 <= 1)
lola: LP says that atomic proposition is always true: (p146 <= 1)
lola: LP says that atomic proposition is always true: (p152 <= 1)
lola: LP says that atomic proposition is always true: (p154 <= 1)
lola: LP says that atomic proposition is always true: (p472 <= 1)
lola: LP says that atomic proposition is always true: (p328 <= 1)
lola: LP says that atomic proposition is always true: (p339 <= 1)
lola: LP says that atomic proposition is always true: (p472 <= 1)
lola: LP says that atomic proposition is always true: (p375 <= 1)
lola: LP says that atomic proposition is always true: (p556 <= 1)
lola: LP says that atomic proposition is always true: (p567 <= 1)
lola: LP says that atomic proposition is always true: (p688 <= 1)
lola: LP says that atomic proposition is always true: (p701 <= 1)
lola: LP says that atomic proposition is always true: (p324 <= 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: (p650 <= 1)
lola: LP says that atomic proposition is always true: (p663 <= 1)
lola: LP says that atomic proposition is always true: (p501 <= 1)
lola: LP says that atomic proposition is always true: (p503 <= 1)
lola: LP says that atomic proposition is always true: (p364 <= 1)
lola: LP says that atomic proposition is always true: (p381 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p614 <= 1)
lola: LP says that atomic proposition is always true: (p623 <= 1)
lola: LP says that atomic proposition is always true: (p614 <= 1)
lola: LP says that atomic proposition is always true: (p623 <= 1)
lola: LP says that atomic proposition is always true: (p364 <= 1)
lola: LP says that atomic proposition is always true: (p381 <= 1)
lola: LP says that atomic proposition is always true: (p412 <= 1)
lola: LP says that atomic proposition is always true: (p418 <= 1)
lola: LP says that atomic proposition is always true: (p420 <= 1)
lola: LP says that atomic proposition is always true: (p723 <= 1)
lola: LP says that atomic proposition is always true: (p584 <= 1)
lola: LP says that atomic proposition is always true: (p412 <= 1)
lola: LP says that atomic proposition is always true: (p418 <= 1)
lola: LP says that atomic proposition is always true: (p420 <= 1)
lola: LP says that atomic proposition is always true: (p651 <= 1)
lola: LP says that atomic proposition is always true: (p662 <= 1)
lola: LP says that atomic proposition is always true: (p134 <= 1)
lola: LP says that atomic proposition is always true: (p282 <= 1)
lola: LP says that atomic proposition is always true: (p645 <= 1)
lola: LP says that atomic proposition is always true: (p282 <= 1)
lola: LP says that atomic proposition is always true: (p519 <= 1)
lola: LP says that atomic proposition is always true: (p528 <= 1)
lola: LP says that atomic proposition is always true: (p240 <= 1)
lola: LP says that atomic proposition is always true: (p265 <= 1)
lola: LP says that atomic proposition is always true: (p240 <= 1)
lola: LP says that atomic proposition is always true: (p265 <= 1)
lola: LP says that atomic proposition is always true: (p136 <= 1)
lola: LP says that atomic proposition is always true: (p153 <= 1)
lola: LP says that atomic proposition is always true: (p546 <= 1)
lola: LP says that atomic proposition is always true: (p561 <= 1)
lola: LP says that atomic proposition is always true: (p240 <= 1)
lola: LP says that atomic proposition is always true: (p265 <= 1)
lola: LP says that atomic proposition is always true: (p400 <= 1)
lola: LP says that atomic proposition is always true: (p550 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p347 <= 1)
lola: LP says that atomic proposition is always true: (p358 <= 1)
lola: X ((((1 <= p235) AND (1 <= p237)) U NOT((X (((1 <= p235) AND (1 <= p237))) U F (((1 <= p235) AND (1 <= p237))))))) : F (G ((F ((NOT(X (((1 <= p377)))) AND ((p383 <= 0) OR (p400 <= 0)))) OR ((F (((1 <= p168) AND (1 <= p377))) AND ((1 <= p383))) AND ((1 <= p400)))))) : F (((((X (NOT(G (((1 <= p146) AND (1 <= p152) AND (1 <= p154))))) AND G (X (F (X (((1 <= p472))))))) AND ((1 <= p328))) AND ((1 <= p339))) AND ((1 <= p472)))) : ((F (G ((((1 <= p375)) U ((1 <= p556) AND (1 <= p567))))) OR ((1 <= p688) AND (1 <= p701))) OR (NOT(X (((1 <= p324)))) AND ((p175 <= 0) OR (p188 <= 0)))) : X (F (X (((G (F (X (G (((1 <= p650) AND (1 <= p663)))))) AND ((1 <= p501))) AND ((1 <= p503)))))) : (((G (((1 <= p364) AND (1 <= p381))) AND ((1 <= p42))) AND ((1 <= p55))) U (NOT(F (((1 <= p614) AND (1 <= p623)))) AND NOT(F (((X (((1 <= p614) AND (1 <= p623))) AND ((1 <= p364))) AND ((1 <= p381))))))) : (NOT((F (((p412 <= 0) OR (p418 <= 0) OR (p420 <= 0) OR (p723 <= 0))) U X (F (((1 <= p584)))))) OR ((1 <= p412) AND (1 <= p418) AND (1 <= p420) AND ((p651 <= 0) OR (p662 <= 0)))) : NOT(F (X (F ((((p134 <= 0) OR (p282 <= 0)) U X ((((1 <= p645)) OR ((1 <= p282))))))))) : F (((1 <= p519) AND (1 <= p528))) : G (NOT(((G (((1 <= p240) AND (1 <= p265))) U X (((1 <= p240) AND (1 <= p265)))) U ((F ((X (((1 <= p136) AND (1 <= p153))) OR ((1 <= p546) AND (1 <= p561)))) AND ((1 <= p240))) AND ((1 <= p265)))))) : G ((F (NOT(X (((p400 <= 0))))) OR G (((1 <= p550))))) : (NOT((((1 <= p25) AND (1 <= p34)) U G (((1 <= p25) AND (1 <= p34))))) AND X (((1 <= p347) AND (1 <= p358))))
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
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: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:335
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:522
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((1 <= p235) AND (1 <= p237)) U G (((p235 <= 0) OR (p237 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((1 <= p235) AND (1 <= p237)) U G (((p235 <= 0) OR (p237 <= 0)))))
lola: processed formula length: 71
lola: 85 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: 8632 markings, 8632 edges
lola: subprocess 1 will run for 322 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((X (((p377 <= 0))) AND ((p383 <= 0) OR (p400 <= 0)))) OR (F (((1 <= p168) AND (1 <= p377))) AND (((1 <= p383)) AND ((1 <= p400)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((X (((p377 <= 0))) AND ((p383 <= 0) OR (p400 <= 0)))) OR (F (((1 <= p168) AND (1 <= p377))) AND (((1 <= p383)) AND ((1 <= p400)))))))
lola: processed formula length: 144
lola: 85 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: ========================================
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: 10534 markings, 10578 edges
lola: ========================================
lola: subprocess 2 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (F (((p146 <= 0) OR (p152 <= 0) OR (p154 <= 0)))) AND (G (F (((1 <= p472)))) AND (((1 <= p328)) AND (((1 <= p339)) AND ((1 <= p472)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (F (((p146 <= 0) OR (p152 <= 0) OR (p154 <= 0)))) AND (G (F (((1 <= p472)))) AND (((1 <= p328)) AND (((1 <= p339)) AND ((1 <= p472)))))))
lola: processed formula length: 145
lola: 85 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 12371 markings, 12371 edges
lola: ========================================
lola: subprocess 3 will run for 394 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((F (((1 <= p556) AND (1 <= p567))) AND (((1 <= p375)) OR ((1 <= p556) AND (1 <= p567)))))) OR (((1 <= p688) AND (1 <= p701)) OR (X (((p324 <= 0))) AND ((p175 <= 0) OR (p188 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 394 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p175 <= 0) OR (p188 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p175 <= 0) OR (p188 <= 0))
lola: processed formula length: 29
lola: 85 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 443 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p688) AND (1 <= p701))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p688) AND (1 <= p701))
lola: processed formula length: 29
lola: 85 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 5 will run for 506 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F (((1 <= p556) AND (1 <= p567))) AND (((1 <= p375)) OR ((1 <= p556) AND (1 <= p567))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F (((1 <= p556) AND (1 <= p567))) AND (((1 <= p375)) OR ((1 <= p556) AND (1 <= p567))))))
lola: processed formula length: 96
lola: 85 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: 9 markings, 10 edges
lola: ========================================
lola: subprocess 6 will run for 591 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p324 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p324 <= 0)))
lola: processed formula length: 17
lola: 85 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 443 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((F (G (((1 <= p650) AND (1 <= p663)))) AND (((1 <= p501)) AND ((1 <= p503)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((F (G (((1 <= p650) AND (1 <= p663)))) AND (((1 <= p501)) AND ((1 <= p503)))))))
lola: processed formula length: 89
lola: 85 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: 8633 markings, 8634 edges
lola: ========================================
lola: subprocess 5 will run for 506 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((G (((1 <= p364) AND (1 <= p381))) AND (((1 <= p42)) AND ((1 <= p55)))) U G ((((p614 <= 0) OR (p623 <= 0)) AND (X (((p614 <= 0) OR (p623 <= 0))) OR (((p364 <= 0)) OR ((p381 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((G (((1 <= p364) AND (1 <= p381))) AND (((1 <= p42)) AND ((1 <= p55)))) U G ((((p614 <= 0) OR (p623 <= 0)) AND (X (((p614 <= 0) OR (p623 <= 0))) OR (((p364 <= 0)) OR ((p381 <= 0)))))))
lola: processed formula length: 187
lola: 85 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 8632 markings, 8632 edges
lola: ========================================
lola: subprocess 6 will run for 591 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((G (((1 <= p412) AND (1 <= p418) AND (1 <= p420) AND (1 <= p723))) R X (G (((p584 <= 0))))) OR ((1 <= p412) AND (1 <= p418) AND (1 <= p420) AND ((p651 <= 0) OR (p662 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 591 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p412) AND (1 <= p418) AND (1 <= p420) AND ((p651 <= 0) OR (p662 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p412) AND (1 <= p418) AND (1 <= p420) AND ((p651 <= 0) OR (p662 <= 0)))
lola: processed formula length: 79
lola: 85 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 5 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 709 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((1 <= p412) AND (1 <= p418) AND (1 <= p420) AND (1 <= p723))) R X (G (((p584 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (G (((1 <= p412) AND (1 <= p418) AND (1 <= p420) AND (1 <= p723))) R X (G (((p584 <= 0)))))
lola: processed formula length: 91
lola: 85 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 8632 markings, 8632 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 709 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((((p645 <= 0)) AND ((p282 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((((p645 <= 0)) AND ((p282 <= 0))))))
lola: processed formula length: 45
lola: 85 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: 8632 markings, 8632 edges
lola: ========================================
lola: subprocess 8 will run for 886 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((X (((p240 <= 0) OR (p265 <= 0))) AND (F (((p240 <= 0) OR (p265 <= 0))) OR X (G (((p240 <= 0) OR (p265 <= 0)))))) R (G ((X (((p136 <= 0) OR (p153 <= 0))) AND ((p546 <= 0) OR (p561 <= 0)))) OR (((p240 <= 0)) OR ((p265 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((X (((p240 <= 0) OR (p265 <= 0))) AND (F (((p240 <= 0) OR (p265 <= 0))) OR X (G (((p240 <= 0) OR (p265 <= 0)))))) R (G ((X (((p136 <= 0) OR (p153 <= 0))) AND ((p546 <= 0) OR (p561 <= 0)))) OR (((p240 <= 0)) OR ((p265 <= 0))))))
lola: processed formula length: 236
lola: 85 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: 8684 markings, 8684 edges
lola: ========================================
lola: subprocess 9 will run for 1182 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (F (((1 <= p400)))) OR G (((1 <= p550)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (F (((1 <= p400)))) OR G (((1 <= p550)))))
lola: processed formula length: 48
lola: 85 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: 2448 markings, 2448 edges
lola: ========================================
lola: subprocess 10 will run for 1773 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p25 <= 0) OR (p34 <= 0)) R F (((p25 <= 0) OR (p34 <= 0)))) AND X (((1 <= p347) AND (1 <= p358))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 1773 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p25 <= 0) OR (p34 <= 0)) R F (((p25 <= 0) OR (p34 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((p25 <= 0) OR (p34 <= 0)) R F (((p25 <= 0) OR (p34 <= 0))))
lola: processed formula length: 63
lola: 85 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 3547 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((1 <= p347) AND (1 <= p358)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((1 <= p347) AND (1 <= p358)))
lola: processed formula length: 33
lola: 85 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: 8632 markings, 8632 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 3547 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p519) AND (1 <= p528)))
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: ((p519 <= 0) OR (p528 <= 0))
lola: processed formula length: 29
lola: 87 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: RESULT
lola:
SUMMARY: no no no yes no no no no no no no no
lola:
preliminary result: no no no yes no no no no no no no no
lola: ========================================
lola: memory consumption: 45796 KB
lola: time consumption: 23 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-040A"
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-040A, 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-159033477300346"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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