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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 3.2K May 14 01:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 14 01:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 13 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 13 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 14 10:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 14 10:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 14 10:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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.3K May 13 13:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 13 13:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 13 08:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K May 13 08:36 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 539K 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-100A-00
FORMULA_NAME ShieldIIPt-PT-100A-01
FORMULA_NAME ShieldIIPt-PT-100A-02
FORMULA_NAME ShieldIIPt-PT-100A-03
FORMULA_NAME ShieldIIPt-PT-100A-04
FORMULA_NAME ShieldIIPt-PT-100A-05
FORMULA_NAME ShieldIIPt-PT-100A-06
FORMULA_NAME ShieldIIPt-PT-100A-07
FORMULA_NAME ShieldIIPt-PT-100A-08
FORMULA_NAME ShieldIIPt-PT-100A-09
FORMULA_NAME ShieldIIPt-PT-100A-10
FORMULA_NAME ShieldIIPt-PT-100A-11
FORMULA_NAME ShieldIIPt-PT-100A-12
FORMULA_NAME ShieldIIPt-PT-100A-13
FORMULA_NAME ShieldIIPt-PT-100A-14
FORMULA_NAME ShieldIIPt-PT-100A-15

=== Now, execution of the tool begins

BK_START 1591302627379

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 20:30:29] [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 20:30:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 20:30:29] [INFO ] Load time of PNML (sax parser for PT used): 129 ms
[2020-06-04 20:30:29] [INFO ] Transformed 1903 places.
[2020-06-04 20:30:29] [INFO ] Transformed 1403 transitions.
[2020-06-04 20:30:29] [INFO ] Found NUPN structural information;
[2020-06-04 20:30:29] [INFO ] Parsed PT model containing 1903 places and 1403 transitions in 214 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 60 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 1676 ms. (steps per millisecond=59 ) properties seen :[0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1]
// Phase 1: matrix 1402 rows 1903 cols
[2020-06-04 20:30:31] [INFO ] Computed 901 place invariants in 36 ms
[2020-06-04 20:30:32] [INFO ] [Real]Absence check using 901 positive place invariants in 833 ms returned sat
[2020-06-04 20:30:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:30:38] [INFO ] [Real]Absence check using state equation in 6238 ms returned sat
[2020-06-04 20:30:38] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints in 97 ms.
[2020-06-04 20:30:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:30:39] [INFO ] [Nat]Absence check using 901 positive place invariants in 697 ms returned sat
[2020-06-04 20:30:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:30:46] [INFO ] [Nat]Absence check using state equation in 6511 ms returned sat
[2020-06-04 20:30:46] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints in 66 ms.
[2020-06-04 20:30:59] [INFO ] Added : 450 causal constraints over 90 iterations in 12496 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-04 20:31:00] [INFO ] [Real]Absence check using 901 positive place invariants in 909 ms returned sat
[2020-06-04 20:31:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:31:06] [INFO ] [Real]Absence check using state equation in 6079 ms returned sat
[2020-06-04 20:31:06] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints in 108 ms.
[2020-06-04 20:31:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:31:08] [INFO ] [Nat]Absence check using 901 positive place invariants in 878 ms returned sat
[2020-06-04 20:31:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:31:13] [INFO ] [Nat]Absence check using state equation in 5604 ms returned sat
[2020-06-04 20:31:13] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints in 80 ms.
[2020-06-04 20:31:26] [INFO ] Added : 505 causal constraints over 101 iterations in 13167 ms. Result :unknown
[2020-06-04 20:31:28] [INFO ] [Real]Absence check using 901 positive place invariants in 838 ms returned sat
[2020-06-04 20:31:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:31:33] [INFO ] [Real]Absence check using state equation in 5826 ms returned sat
[2020-06-04 20:31:34] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints in 59 ms.
[2020-06-04 20:31:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:31:35] [INFO ] [Nat]Absence check using 901 positive place invariants in 874 ms returned sat
[2020-06-04 20:31:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:31:41] [INFO ] [Nat]Absence check using state equation in 6398 ms returned sat
[2020-06-04 20:31:42] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints in 100 ms.
[2020-06-04 20:31:54] [INFO ] Added : 400 causal constraints over 80 iterations in 12427 ms. Result :(error "Failed to check-sat")
[2020-06-04 20:31:55] [INFO ] [Real]Absence check using 901 positive place invariants in 869 ms returned sat
[2020-06-04 20:31:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:32:01] [INFO ] [Real]Absence check using state equation in 5582 ms returned sat
[2020-06-04 20:32:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:32:02] [INFO ] [Nat]Absence check using 901 positive place invariants in 826 ms returned sat
[2020-06-04 20:32:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:32:08] [INFO ] [Nat]Absence check using state equation in 6118 ms returned sat
[2020-06-04 20:32:08] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints in 85 ms.
[2020-06-04 20:32:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (=> (> t137 0) (or (and (> t765 0) (< o765 o137)) (and (> t769 0) (< o769 o137))))") while checking expression at index 3
[2020-06-04 20:32:22] [INFO ] [Real]Absence check using 901 positive place invariants in 959 ms returned sat
[2020-06-04 20:32:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:32:28] [INFO ] [Real]Absence check using state equation in 6173 ms returned sat
[2020-06-04 20:32:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:32:29] [INFO ] [Nat]Absence check using 901 positive place invariants in 803 ms returned sat
[2020-06-04 20:32:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:32:35] [INFO ] [Nat]Absence check using state equation in 6165 ms returned sat
[2020-06-04 20:32:35] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints in 70 ms.
[2020-06-04 20:32:48] [INFO ] Added : 490 causal constraints over 98 iterations in 12798 ms. Result :unknown
[2020-06-04 20:32:49] [INFO ] [Real]Absence check using 901 positive place invariants in 893 ms returned sat
[2020-06-04 20:32:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:32:55] [INFO ] [Real]Absence check using state equation in 6030 ms returned sat
[2020-06-04 20:32:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:32:56] [INFO ] [Nat]Absence check using 901 positive place invariants in 793 ms returned sat
[2020-06-04 20:32:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:33:03] [INFO ] [Nat]Absence check using state equation in 6271 ms returned sat
[2020-06-04 20:33:03] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints in 119 ms.
[2020-06-04 20:33:15] [INFO ] Added : 445 causal constraints over 89 iterations in 12641 ms. Result :(error "Failed to check-sat")
[2020-06-04 20:33:17] [INFO ] [Real]Absence check using 901 positive place invariants in 921 ms returned sat
[2020-06-04 20:33:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:33:23] [INFO ] [Real]Absence check using state equation in 6454 ms returned sat
[2020-06-04 20:33:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:33:24] [INFO ] [Nat]Absence check using 901 positive place invariants in 687 ms returned sat
[2020-06-04 20:33:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:33:31] [INFO ] [Nat]Absence check using state equation in 6591 ms returned sat
[2020-06-04 20:33:31] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints in 91 ms.
[2020-06-04 20:33:43] [INFO ] Added : 450 causal constraints over 90 iterations in 12431 ms. Result :unknown
[2020-06-04 20:33:44] [INFO ] [Real]Absence check using 901 positive place invariants in 838 ms returned sat
[2020-06-04 20:33:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:33:51] [INFO ] [Real]Absence check using state equation in 6274 ms returned sat
[2020-06-04 20:33:51] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints in 60 ms.
[2020-06-04 20:33:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:33:52] [INFO ] [Nat]Absence check using 901 positive place invariants in 1017 ms returned sat
[2020-06-04 20:33:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:33:58] [INFO ] [Nat]Absence check using state equation in 6090 ms returned sat
[2020-06-04 20:33:59] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints in 78 ms.
[2020-06-04 20:34:11] [INFO ] Added : 440 causal constraints over 88 iterations in 12579 ms. Result :unknown
[2020-06-04 20:34:12] [INFO ] [Real]Absence check using 901 positive place invariants in 910 ms returned sat
[2020-06-04 20:34:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:34:19] [INFO ] [Real]Absence check using state equation in 6370 ms returned sat
[2020-06-04 20:34:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:34:20] [INFO ] [Nat]Absence check using 901 positive place invariants in 832 ms returned sat
[2020-06-04 20:34:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:34:26] [INFO ] [Nat]Absence check using state equation in 6543 ms returned sat
[2020-06-04 20:34:26] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints in 81 ms.
[2020-06-04 20:34:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t97 0) (and (and (> t717 0) (< o717 o97)) (and (> t716 0) (< o716 o97))))") while checking expression at index 8
[2020-06-04 20:34:40] [INFO ] [Real]Absence check using 901 positive place invariants in 868 ms returned sat
[2020-06-04 20:34:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:34:47] [INFO ] [Real]Absence check using state equation in 6692 ms returned sat
[2020-06-04 20:34:47] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints in 69 ms.
[2020-06-04 20:34:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:34:48] [INFO ] [Nat]Absence check using 901 positive place invariants in 864 ms returned sat
[2020-06-04 20:34:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:34:54] [INFO ] [Nat]Absence check using state equation in 6221 ms returned sat
[2020-06-04 20:34:55] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints in 103 ms.
[2020-06-04 20:35:07] [INFO ] Added : 465 causal constraints over 93 iterations in 12658 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-04 20:35:08] [INFO ] [Real]Absence check using 901 positive place invariants in 936 ms returned sat
[2020-06-04 20:35:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:35:14] [INFO ] [Real]Absence check using state equation in 5794 ms returned sat
[2020-06-04 20:35:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:35:15] [INFO ] [Nat]Absence check using 901 positive place invariants in 800 ms returned sat
[2020-06-04 20:35:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:35:21] [INFO ] [Nat]Absence check using state equation in 5826 ms returned sat
[2020-06-04 20:35:21] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints in 77 ms.
[2020-06-04 20:35:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t89 0) (and (and (> t773 0) (< o773 o89)) (and (> t772 0) (< o772 o89))))") while checking expression at index 10
[2020-06-04 20:35:35] [INFO ] [Real]Absence check using 901 positive place invariants in 839 ms returned sat
[2020-06-04 20:35:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:35:41] [INFO ] [Real]Absence check using state equation in 6051 ms returned sat
[2020-06-04 20:35:42] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints in 80 ms.
[2020-06-04 20:35:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:35:43] [INFO ] [Nat]Absence check using 901 positive place invariants in 763 ms returned sat
[2020-06-04 20:35:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:35:48] [INFO ] [Nat]Absence check using state equation in 5740 ms returned sat
[2020-06-04 20:35:49] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints in 108 ms.
[2020-06-04 20:36:02] [INFO ] Added : 520 causal constraints over 104 iterations in 13246 ms. Result :unknown
[2020-06-04 20:36:03] [INFO ] [Real]Absence check using 901 positive place invariants in 941 ms returned sat
[2020-06-04 20:36:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:36:09] [INFO ] [Real]Absence check using state equation in 5813 ms returned sat
[2020-06-04 20:36:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:36:10] [INFO ] [Nat]Absence check using 901 positive place invariants in 818 ms returned sat
[2020-06-04 20:36:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:36:16] [INFO ] [Nat]Absence check using state equation in 5634 ms returned sat
[2020-06-04 20:36:16] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints in 73 ms.
[2020-06-04 20:36:29] [INFO ] Added : 495 causal constraints over 99 iterations in 13296 ms. Result :unknown
[2020-06-04 20:36:30] [INFO ] [Real]Absence check using 901 positive place invariants in 832 ms returned sat
[2020-06-04 20:36:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:36:36] [INFO ] [Real]Absence check using state equation in 5709 ms returned sat
[2020-06-04 20:36:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:36:37] [INFO ] [Nat]Absence check using 901 positive place invariants in 811 ms returned sat
[2020-06-04 20:36:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:36:43] [INFO ] [Nat]Absence check using state equation in 6193 ms returned sat
[2020-06-04 20:36:43] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints in 84 ms.
[2020-06-04 20:36:56] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t747 0) (and (or (and (> t93 0) (< o93 o747)) (and (> t100 0) (< o100 o747))) (and (> t746 0) (< o746 o747))))") while checking expression at index 13
[2020-06-04 20:36:57] [INFO ] [Real]Absence check using 901 positive place invariants in 976 ms returned sat
[2020-06-04 20:36:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:37:03] [INFO ] [Real]Absence check using state equation in 5782 ms returned sat
[2020-06-04 20:37:03] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints in 101 ms.
[2020-06-04 20:37:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:37:04] [INFO ] [Nat]Absence check using 901 positive place invariants in 819 ms returned sat
[2020-06-04 20:37:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:37:10] [INFO ] [Nat]Absence check using state equation in 5999 ms returned sat
[2020-06-04 20:37:11] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints in 59 ms.
[2020-06-04 20:37:23] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (=> (> t740 0) (and (or (and (> t94 0) (< o94 o740)) (and (> t100 0) (< o100 o740))) (and (> t739 0) (< o739 o740))))") while checking expression at index 14
[2020-06-04 20:37:25] [INFO ] [Real]Absence check using 901 positive place invariants in 969 ms returned sat
[2020-06-04 20:37:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:37:30] [INFO ] [Real]Absence check using state equation in 5808 ms returned sat
[2020-06-04 20:37:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:37:32] [INFO ] [Nat]Absence check using 901 positive place invariants in 866 ms returned sat
[2020-06-04 20:37:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:37:37] [INFO ] [Nat]Absence check using state equation in 5769 ms returned sat
[2020-06-04 20:37:37] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints in 80 ms.
[2020-06-04 20:37:51] [INFO ] Added : 495 causal constraints over 99 iterations in 13133 ms. Result :(error "Failed to check-sat")
[2020-06-04 20:37:52] [INFO ] [Real]Absence check using 901 positive place invariants in 898 ms returned sat
[2020-06-04 20:37:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:37:57] [INFO ] [Real]Absence check using state equation in 5434 ms returned sat
[2020-06-04 20:37:57] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints in 70 ms.
[2020-06-04 20:37:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:37:58] [INFO ] [Nat]Absence check using 901 positive place invariants in 671 ms returned sat
[2020-06-04 20:37:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:38:04] [INFO ] [Nat]Absence check using state equation in 5879 ms returned sat
[2020-06-04 20:38:04] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints in 99 ms.
[2020-06-04 20:38:18] [INFO ] Added : 480 causal constraints over 96 iterations in 13218 ms. Result :(error "Failed to check-sat")
[2020-06-04 20:38:19] [INFO ] [Real]Absence check using 901 positive place invariants in 817 ms returned sat
[2020-06-04 20:38:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:38:24] [INFO ] [Real]Absence check using state equation in 5350 ms returned sat
[2020-06-04 20:38:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:38:25] [INFO ] [Nat]Absence check using 901 positive place invariants in 665 ms returned sat
[2020-06-04 20:38:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:38:31] [INFO ] [Nat]Absence check using state equation in 5871 ms returned sat
[2020-06-04 20:38:31] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints in 74 ms.
[2020-06-04 20:38:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t130 0) (and (> t753 0) (< o753 o130)))") while checking expression at index 17
[2020-06-04 20:38:45] [INFO ] [Real]Absence check using 901 positive place invariants in 831 ms returned sat
[2020-06-04 20:38:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:38:51] [INFO ] [Real]Absence check using state equation in 5591 ms returned sat
[2020-06-04 20:38:51] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints in 62 ms.
[2020-06-04 20:38:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:38:52] [INFO ] [Nat]Absence check using 901 positive place invariants in 859 ms returned sat
[2020-06-04 20:38:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:38:58] [INFO ] [Nat]Absence check using state equation in 5490 ms returned sat
[2020-06-04 20:38:58] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints in 72 ms.
[2020-06-04 20:39:11] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t87 0) (and (and (> t787 0) (< o787 o87)) (and (> t786 0) (< o786 o87))))") while checking expression at index 18
[2020-06-04 20:39:12] [INFO ] [Real]Absence check using 901 positive place invariants in 936 ms returned sat
[2020-06-04 20:39:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:39:18] [INFO ] [Real]Absence check using state equation in 5583 ms returned sat
[2020-06-04 20:39:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:39:19] [INFO ] [Nat]Absence check using 901 positive place invariants in 819 ms returned sat
[2020-06-04 20:39:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:39:25] [INFO ] [Nat]Absence check using state equation in 5444 ms returned sat
[2020-06-04 20:39:25] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints in 75 ms.
[2020-06-04 20:39:38] [INFO ] Added : 525 causal constraints over 105 iterations in 13483 ms. Result :(error "Failed to check-sat")
[2020-06-04 20:39:39] [INFO ] [Real]Absence check using 901 positive place invariants in 773 ms returned sat
[2020-06-04 20:39:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:39:45] [INFO ] [Real]Absence check using state equation in 6067 ms returned sat
[2020-06-04 20:39:45] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints in 68 ms.
[2020-06-04 20:39:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:39:47] [INFO ] [Nat]Absence check using 901 positive place invariants in 801 ms returned sat
[2020-06-04 20:39:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:39:52] [INFO ] [Nat]Absence check using state equation in 5607 ms returned sat
[2020-06-04 20:39:52] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints in 59 ms.
[2020-06-04 20:40:06] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t130 0) (and (> t753 0) (< o753 o130)))") while checking expression at index 20
[2020-06-04 20:40:07] [INFO ] [Real]Absence check using 901 positive place invariants in 932 ms returned sat
[2020-06-04 20:40:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:40:12] [INFO ] [Real]Absence check using state equation in 5647 ms returned sat
[2020-06-04 20:40:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:40:13] [INFO ] [Nat]Absence check using 901 positive place invariants in 668 ms returned sat
[2020-06-04 20:40:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:40:19] [INFO ] [Nat]Absence check using state equation in 5963 ms returned sat
[2020-06-04 20:40:19] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints in 80 ms.
[2020-06-04 20:40:32] [INFO ] Added : 495 causal constraints over 99 iterations in 13129 ms. Result :unknown
[2020-06-04 20:40:34] [INFO ] [Real]Absence check using 901 positive place invariants in 991 ms returned sat
[2020-06-04 20:40:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:40:39] [INFO ] [Real]Absence check using state equation in 5707 ms returned sat
[2020-06-04 20:40:40] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints in 99 ms.
[2020-06-04 20:40:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:40:41] [INFO ] [Nat]Absence check using 901 positive place invariants in 910 ms returned sat
[2020-06-04 20:40:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:40:47] [INFO ] [Nat]Absence check using state equation in 5667 ms returned sat
[2020-06-04 20:40:47] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints in 102 ms.
[2020-06-04 20:41:00] [INFO ] Added : 525 causal constraints over 105 iterations in 13119 ms. Result :unknown
[2020-06-04 20:41:01] [INFO ] [Real]Absence check using 901 positive place invariants in 826 ms returned sat
[2020-06-04 20:41:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:41:07] [INFO ] [Real]Absence check using state equation in 5577 ms returned sat
[2020-06-04 20:41:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:41:08] [INFO ] [Nat]Absence check using 901 positive place invariants in 666 ms returned sat
[2020-06-04 20:41:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:41:13] [INFO ] [Nat]Absence check using state equation in 5426 ms returned sat
[2020-06-04 20:41:13] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints in 75 ms.
[2020-06-04 20:41:27] [INFO ] Added : 510 causal constraints over 102 iterations in 13596 ms. Result :unknown
[2020-06-04 20:41:28] [INFO ] [Real]Absence check using 901 positive place invariants in 936 ms returned sat
[2020-06-04 20:41:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:41:34] [INFO ] [Real]Absence check using state equation in 5769 ms returned sat
[2020-06-04 20:41:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:41:35] [INFO ] [Nat]Absence check using 901 positive place invariants in 660 ms returned sat
[2020-06-04 20:41:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:41:41] [INFO ] [Nat]Absence check using state equation in 6053 ms returned sat
[2020-06-04 20:41:41] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints in 77 ms.
[2020-06-04 20:41:54] [INFO ] Added : 475 causal constraints over 95 iterations in 12992 ms. Result :unknown
[2020-06-04 20:41:55] [INFO ] [Real]Absence check using 901 positive place invariants in 947 ms returned sat
[2020-06-04 20:41:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:42:01] [INFO ] [Real]Absence check using state equation in 6119 ms returned sat
[2020-06-04 20:42:01] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints in 75 ms.
[2020-06-04 20:42:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:42:03] [INFO ] [Nat]Absence check using 901 positive place invariants in 830 ms returned sat
[2020-06-04 20:42:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:42:08] [INFO ] [Nat]Absence check using state equation in 5582 ms returned sat
[2020-06-04 20:42:08] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints in 74 ms.
[2020-06-04 20:42:22] [INFO ] Added : 475 causal constraints over 95 iterations in 13333 ms. Result :(error "Failed to check-sat")
[2020-06-04 20:42:23] [INFO ] [Real]Absence check using 901 positive place invariants in 945 ms returned sat
[2020-06-04 20:42:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:42:29] [INFO ] [Real]Absence check using state equation in 5633 ms returned sat
[2020-06-04 20:42:29] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints in 77 ms.
[2020-06-04 20:42:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:42:30] [INFO ] [Nat]Absence check using 901 positive place invariants in 938 ms returned sat
[2020-06-04 20:42:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:42:36] [INFO ] [Nat]Absence check using state equation in 5659 ms returned sat
[2020-06-04 20:42:36] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints in 92 ms.
[2020-06-04 20:42:49] [INFO ] Added : 485 causal constraints over 97 iterations in 13171 ms. Result :(error "Failed to check-sat")
[2020-06-04 20:42:50] [INFO ] [Real]Absence check using 901 positive place invariants in 830 ms returned sat
[2020-06-04 20:42:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:42:56] [INFO ] [Real]Absence check using state equation in 5717 ms returned sat
[2020-06-04 20:42:56] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints in 73 ms.
[2020-06-04 20:42:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:42:57] [INFO ] [Nat]Absence check using 901 positive place invariants in 767 ms returned sat
[2020-06-04 20:42:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:43:03] [INFO ] [Nat]Absence check using state equation in 5588 ms returned sat
[2020-06-04 20:43:03] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints in 75 ms.
[2020-06-04 20:43:16] [INFO ] Added : 520 causal constraints over 104 iterations in 13387 ms. Result :unknown
[2020-06-04 20:43:17] [INFO ] [Real]Absence check using 901 positive place invariants in 974 ms returned sat
[2020-06-04 20:43:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:43:23] [INFO ] [Real]Absence check using state equation in 5878 ms returned sat
[2020-06-04 20:43:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:43:24] [INFO ] [Nat]Absence check using 901 positive place invariants in 688 ms returned sat
[2020-06-04 20:43:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:43:30] [INFO ] [Nat]Absence check using state equation in 5456 ms returned sat
[2020-06-04 20:43:30] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints in 79 ms.
[2020-06-04 20:43:43] [INFO ] Added : 505 causal constraints over 101 iterations in 13660 ms. Result :(error "Failed to check-sat")
[2020-06-04 20:43:45] [INFO ] [Real]Absence check using 901 positive place invariants in 892 ms returned sat
[2020-06-04 20:43:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:43:50] [INFO ] [Real]Absence check using state equation in 5640 ms returned sat
[2020-06-04 20:43:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:43:51] [INFO ] [Nat]Absence check using 901 positive place invariants in 671 ms returned sat
[2020-06-04 20:43:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:43:57] [INFO ] [Nat]Absence check using state equation in 5419 ms returned sat
[2020-06-04 20:43:57] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints in 103 ms.
[2020-06-04 20:44:10] [INFO ] Added : 485 causal constraints over 97 iterations in 13638 ms. Result :(error "Failed to check-sat")
[2020-06-04 20:44:11] [INFO ] [Real]Absence check using 901 positive place invariants in 804 ms returned sat
[2020-06-04 20:44:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:44:17] [INFO ] [Real]Absence check using state equation in 5571 ms returned sat
[2020-06-04 20:44:17] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints in 89 ms.
[2020-06-04 20:44:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:44:19] [INFO ] [Nat]Absence check using 901 positive place invariants in 807 ms returned sat
[2020-06-04 20:44:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:44:24] [INFO ] [Nat]Absence check using state equation in 5759 ms returned sat
[2020-06-04 20:44:25] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints in 85 ms.
[2020-06-04 20:44:38] [INFO ] Added : 490 causal constraints over 98 iterations in 13051 ms. Result :(error "Failed to check-sat")
[2020-06-04 20:44:39] [INFO ] [Real]Absence check using 901 positive place invariants in 874 ms returned sat
[2020-06-04 20:44:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:44:45] [INFO ] [Real]Absence check using state equation in 6715 ms returned sat
[2020-06-04 20:44:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:44:47] [INFO ] [Nat]Absence check using 901 positive place invariants in 864 ms returned sat
[2020-06-04 20:44:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:44:53] [INFO ] [Nat]Absence check using state equation in 5962 ms returned sat
[2020-06-04 20:44:53] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints in 96 ms.
[2020-06-04 20:45:05] [INFO ] Added : 500 causal constraints over 100 iterations in 12881 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-04 20:45:07] [INFO ] [Real]Absence check using 901 positive place invariants in 913 ms returned sat
[2020-06-04 20:45:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:45:13] [INFO ] [Real]Absence check using state equation in 6084 ms returned sat
[2020-06-04 20:45:13] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints in 71 ms.
[2020-06-04 20:45:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:45:14] [INFO ] [Nat]Absence check using 901 positive place invariants in 840 ms returned sat
[2020-06-04 20:45:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:45:20] [INFO ] [Nat]Absence check using state equation in 5830 ms returned sat
[2020-06-04 20:45:20] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints in 75 ms.
[2020-06-04 20:45:33] [INFO ] Added : 570 causal constraints over 114 iterations in 13021 ms. Result :unknown
[2020-06-04 20:45:34] [INFO ] [Real]Absence check using 901 positive place invariants in 930 ms returned sat
[2020-06-04 20:45:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:45:40] [INFO ] [Real]Absence check using state equation in 5581 ms returned sat
[2020-06-04 20:45:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:45:41] [INFO ] [Nat]Absence check using 901 positive place invariants in 806 ms returned sat
[2020-06-04 20:45:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:45:47] [INFO ] [Nat]Absence check using state equation in 5491 ms returned sat
[2020-06-04 20:45:47] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints in 81 ms.
[2020-06-04 20:46:00] [INFO ] Added : 500 causal constraints over 100 iterations in 13455 ms. Result :unknown
[2020-06-04 20:46:01] [INFO ] [Real]Absence check using 901 positive place invariants in 830 ms returned sat
[2020-06-04 20:46:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:46:07] [INFO ] [Real]Absence check using state equation in 5740 ms returned sat
[2020-06-04 20:46:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:46:08] [INFO ] [Nat]Absence check using 901 positive place invariants in 818 ms returned sat
[2020-06-04 20:46:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:46:14] [INFO ] [Nat]Absence check using state equation in 5461 ms returned sat
[2020-06-04 20:46:14] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints in 77 ms.
01)
^^
(error "Incorrect format for a number - no leading zeros allowed: 01")
[2020-06-04 20:46:27] [INFO ] Added : 485 causal constraints over 97 iterations in 13499 ms. Result :(error "Failed to check-sat")
[2020-06-04 20:46:28] [INFO ] [Real]Absence check using 901 positive place invariants in 960 ms returned sat
[2020-06-04 20:46:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:46:34] [INFO ] [Real]Absence check using state equation in 5609 ms returned sat
[2020-06-04 20:46:34] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints in 93 ms.
[2020-06-04 20:46:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:46:36] [INFO ] [Nat]Absence check using 901 positive place invariants in 851 ms returned sat
[2020-06-04 20:46:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:46:42] [INFO ] [Nat]Absence check using state equation in 5983 ms returned sat
[2020-06-04 20:46:42] [INFO ] Computed and/alt/rep : 1401/4999/1401 causal constraints in 111 ms.
[2020-06-04 20:46:55] [INFO ] Added : 455 causal constraints over 91 iterations in 12809 ms. Result :unknown
[2020-06-04 20:46:55] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-04 20:46:55] [INFO ] Flatten gal took : 366 ms
FORMULA ShieldIIPt-PT-100A-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100A-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 20:46:55] [INFO ] Applying decomposition
[2020-06-04 20:46:55] [INFO ] Flatten gal took : 192 ms
[2020-06-04 20:46:55] [INFO ] Decomposing Gal with order
[2020-06-04 20:46:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-04 20:46:56] [INFO ] Removed a total of 400 redundant transitions.
[2020-06-04 20:46:56] [INFO ] Flatten gal took : 197 ms
[2020-06-04 20:46:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 211 ms.
[2020-06-04 20:46:56] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 15 ms.
[2020-06-04 20:46:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 19 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ ShieldIIPt-PT-100A @ 3570 seconds

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

FORMULA ShieldIIPt-PT-100A-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

FORMULA ShieldIIPt-PT-100A-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-100A-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA ShieldIIPt-PT-100A-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-100A-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA ShieldIIPt-PT-100A-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA ShieldIIPt-PT-100A-06 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2039
rslt: Output for LTLFireability @ ShieldIIPt-PT-100A

{
"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 20:46:57 2020
",
"timelimit": 3570
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 268
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (((1 <= p172)))",
"processed_size": 17,
"rewrites": 146
},
"result":
{
"edges": 6,
"markings": 6,
"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": 291
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 2,
"aconj": 2,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(X (X (((p1165 <= 0) OR (p1174 <= 0)))) U ((1 <= p54)))",
"processed_size": 56,
"rewrites": 146
},
"result":
{
"edges": 25,
"markings": 23,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 291
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((1 <= p1542)) AND ((1 <= p1559)))",
"processed_size": 35,
"rewrites": 147
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 317
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(((1 <= p526)) AND ((1 <= p532)) AND ((1 <= p534)))",
"processed_size": 51,
"rewrites": 149
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 349
},
"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 <= p1481)))",
"processed_size": 18,
"rewrites": 146
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 317
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"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 (F (((p1698 <= 0) OR (p1700 <= 0))))",
"processed_size": 39,
"rewrites": 146
},
"result":
{
"edges": 5161,
"markings": 3971,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"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": 349
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"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 (F (((1 <= p424) AND (1 <= p433))))",
"processed_size": 37,
"rewrites": 146
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 349
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 349
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(((1 <= p1059)) OR ((1 <= p1456) AND (1 <= p1481)))",
"processed_size": 52,
"rewrites": 148
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 393
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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": "X (G (((1 <= p1170) AND (1 <= p1174) AND (1 <= p1180))))",
"processed_size": 56,
"rewrites": 146
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"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": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 449
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "((1 <= p1229) AND (1 <= p1235) AND (1 <= p1237))",
"processed_size": 48,
"rewrites": 146
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 524
},
"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 <= p740)))",
"processed_size": 17,
"rewrites": 146
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 524
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((X (F (((1 <= p721)))) AND ((p125 <= 0) OR (p129 <= 0) OR (p135 <= 0))))",
"processed_size": 77,
"rewrites": 146
},
"result":
{
"edges": 6,
"markings": 6,
"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": 628
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 3,
"aconj": 5,
"adisj": 0,
"aneg": 5,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (F ((X (X (F ((G (((p1200 <= 0) OR (p1217 <= 0))) OR (G (((p1899 <= 0))) AND (((p1200 <= 0) OR (p1217 <= 0)) AND ((p1200 <= 0) OR (p1217 <= 0)))))))) AND ((p1200 <= 0) OR (p1217 <= 0)))))",
"processed_size": 193,
"rewrites": 146
},
"result":
{
"edges": 645,
"markings": 627,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 786
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 0,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (X ((F (((p464 <= 0) OR (p475 <= 0))) OR (G (F (((1 <= p1437) AND (1 <= p1462)))) OR ((1 <= p550))))))",
"processed_size": 105,
"rewrites": 146
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1048
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (F (((1 <= p1498) AND ((p919 <= 0) OR (p921 <= 0)))))",
"processed_size": 56,
"rewrites": 146
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1572
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 0,
"aneg": 4,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G (F (((((p1819 <= 0) OR (p1834 <= 0)) R ((p821 <= 0) OR (p834 <= 0))) AND (F (((p1270 <= 0))) OR G (((p821 <= 0) OR (p834 <= 0)))))))",
"processed_size": 137,
"rewrites": 146
},
"result":
{
"edges": 1920,
"markings": 1493,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 11
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3144
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 4,
"G": 3,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 0,
"aneg": 5,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F (G ((F (((p577 <= 0) OR (p579 <= 0))) AND ((F (((p1629 <= 0))) OR G (F (((p577 <= 0) OR (p579 <= 0))))) AND (G (((p1219 <= 0) OR (p1236 <= 0))) AND ((p577 <= 0) OR (p579 <= 0)))))))",
"processed_size": 187,
"rewrites": 146
},
"result":
{
"edges": 466,
"markings": 366,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 16
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"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": "G (((p1485 <= 0) OR (p1502 <= 0)))",
"processed_size": 35,
"rewrites": 146
},
"result":
{
"edges": 310,
"markings": 245,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 5944,
"runtime": 1531.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(X(G(**))) : ((X(X(*)) U **) OR G(**)) : (X(**) OR ((G(F(**)) AND (** AND (** AND **))) OR (F(G(*)) AND (** AND **)))) : (G(F(*)) OR X(F(**))) : G(F(((* R *) AND (F(*) OR G(*))))) : F(G((F(*) AND ((F(*) OR G(F(*))) AND (G(*) AND *))))) : (F((G(*) OR (* AND X(*)))) OR (G(**) AND F((G(*) OR (* AND X(*)))))) : (F(**) AND X(G(**))) : G((F(*) AND X(*))) : ((F(**) U X(**)) AND (X(**) OR **)) : F((X(F(**)) AND **)) : X(F((X(X(F((G(*) OR (G(*) AND (* AND *)))))) AND *))) : X(X((F(*) OR (G(F(**)) OR **)))) : X(F(**))"
},
"net":
{
"arcs": 6004,
"conflict_clusters": 703,
"places": 1903,
"places_significant": 1002,
"singleton_clusters": 0,
"transitions": 1402
},
"result":
{
"preliminary_value": "no no no no no no unknown no no no no no yes no ",
"value": "no no no no no no unknown no no no no no yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 3305/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 60896
lola: finding significant places
lola: 1903 places, 1402 transitions, 1002 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: (p1298 <= 1)
lola: LP says that atomic proposition is always true: (p1307 <= 1)
lola: LP says that atomic proposition is always true: (p1165 <= 1)
lola: LP says that atomic proposition is always true: (p1174 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p172 <= 1)
lola: LP says that atomic proposition is always true: (p1481 <= 1)
lola: LP says that atomic proposition is always true: (p1591 <= 1)
lola: LP says that atomic proposition is always true: (p1606 <= 1)
lola: LP says that atomic proposition is always true: (p526 <= 1)
lola: LP says that atomic proposition is always true: (p532 <= 1)
lola: LP says that atomic proposition is always true: (p534 <= 1)
lola: LP says that atomic proposition is always true: (p526 <= 1)
lola: LP says that atomic proposition is always true: (p532 <= 1)
lola: LP says that atomic proposition is always true: (p534 <= 1)
lola: LP says that atomic proposition is always true: (p1542 <= 1)
lola: LP says that atomic proposition is always true: (p1559 <= 1)
lola: LP says that atomic proposition is always true: (p1698 <= 1)
lola: LP says that atomic proposition is always true: (p1700 <= 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: (p424 <= 1)
lola: LP says that atomic proposition is always true: (p433 <= 1)
lola: LP says that atomic proposition is always true: (p1270 <= 1)
lola: LP says that atomic proposition is always true: (p1819 <= 1)
lola: LP says that atomic proposition is always true: (p1834 <= 1)
lola: LP says that atomic proposition is always true: (p821 <= 1)
lola: LP says that atomic proposition is always true: (p834 <= 1)
lola: LP says that atomic proposition is always true: (p1629 <= 1)
lola: LP says that atomic proposition is always true: (p577 <= 1)
lola: LP says that atomic proposition is always true: (p579 <= 1)
lola: LP says that atomic proposition is always true: (p1219 <= 1)
lola: LP says that atomic proposition is always true: (p1236 <= 1)
lola: LP says that atomic proposition is always true: (p577 <= 1)
lola: LP says that atomic proposition is always true: (p579 <= 1)
lola: LP says that atomic proposition is always true: (p1485 <= 1)
lola: LP says that atomic proposition is always true: (p1502 <= 1)
lola: LP says that atomic proposition is always true: (p1124 <= 1)
lola: LP says that atomic proposition is always true: (p1141 <= 1)
lola: LP says that atomic proposition is always true: (p1355 <= 1)
lola: LP says that atomic proposition is always true: (p1364 <= 1)
lola: LP says that atomic proposition is always true: (p1076 <= 1)
lola: LP says that atomic proposition is always true: (p1101 <= 1)
lola: LP says that atomic proposition is always true: (p1059 <= 1)
lola: LP says that atomic proposition is always true: (p1456 <= 1)
lola: LP says that atomic proposition is always true: (p1481 <= 1)
lola: LP says that atomic proposition is always true: (p1170 <= 1)
lola: LP says that atomic proposition is always true: (p1174 <= 1)
lola: LP says that atomic proposition is always true: (p1180 <= 1)
lola: LP says that atomic proposition is always true: (p1874 <= 1)
lola: LP says that atomic proposition is always true: (p1899 <= 1)
lola: LP says that atomic proposition is always true: (p1417 <= 1)
lola: LP says that atomic proposition is always true: (p1421 <= 1)
lola: LP says that atomic proposition is always true: (p1427 <= 1)
lola: LP says that atomic proposition is always true: (p1417 <= 1)
lola: LP says that atomic proposition is always true: (p1421 <= 1)
lola: LP says that atomic proposition is always true: (p1427 <= 1)
lola: LP says that atomic proposition is always true: (p1857 <= 1)
lola: LP says that atomic proposition is always true: (p1857 <= 1)
lola: LP says that atomic proposition is always true: (p1229 <= 1)
lola: LP says that atomic proposition is always true: (p1235 <= 1)
lola: LP says that atomic proposition is always true: (p1237 <= 1)
lola: LP says that atomic proposition is always true: (p740 <= 1)
lola: LP says that atomic proposition is always true: (p1229 <= 1)
lola: LP says that atomic proposition is always true: (p1235 <= 1)
lola: LP says that atomic proposition is always true: (p1237 <= 1)
lola: LP says that atomic proposition is always true: (p721 <= 1)
lola: LP says that atomic proposition is always true: (p125 <= 1)
lola: LP says that atomic proposition is always true: (p129 <= 1)
lola: LP says that atomic proposition is always true: (p135 <= 1)
lola: LP says that atomic proposition is always true: (p721 <= 1)
lola: LP says that atomic proposition is always true: (p125 <= 1)
lola: LP says that atomic proposition is always true: (p129 <= 1)
lola: LP says that atomic proposition is always true: (p135 <= 1)
lola: LP says that atomic proposition is always true: (p1899 <= 1)
lola: LP says that atomic proposition is always true: (p1200 <= 1)
lola: LP says that atomic proposition is always true: (p1217 <= 1)
lola: LP says that atomic proposition is always true: (p1200 <= 1)
lola: LP says that atomic proposition is always true: (p1217 <= 1)
lola: LP says that atomic proposition is always true: (p1200 <= 1)
lola: LP says that atomic proposition is always true: (p1217 <= 1)
lola: LP says that atomic proposition is always true: (p464 <= 1)
lola: LP says that atomic proposition is always true: (p475 <= 1)
lola: LP says that atomic proposition is always true: (p1437 <= 1)
lola: LP says that atomic proposition is always true: (p1462 <= 1)
lola: LP says that atomic proposition is always true: (p1437 <= 1)
lola: LP says that atomic proposition is always true: (p1462 <= 1)
lola: LP says that atomic proposition is always true: (p550 <= 1)
lola: LP says that atomic proposition is always true: (p919 <= 1)
lola: LP says that atomic proposition is always true: (p921 <= 1)
lola: LP says that atomic proposition is always true: (p1498 <= 1)
lola: LP says that atomic proposition is always true: (p919 <= 1)
lola: LP says that atomic proposition is always true: (p921 <= 1)
lola: G (X (X (((1 <= p1298) AND (1 <= p1307))))) : ((NOT(X (X (((1 <= p1165) AND (1 <= p1174))))) U ((1 <= p54))) OR G (((1 <= p172)))) : ((X (((1 <= p1481))) OR (((G (F (((1 <= p1591) AND (1 <= p1606)))) AND ((1 <= p526))) AND ((1 <= p532))) AND ((1 <= p534)))) OR ((NOT(G (F (((1 <= p526) AND (1 <= p532) AND (1 <= p534))))) AND ((1 <= p1542))) AND ((1 <= p1559)))) : (G (F (NOT(F (G (((1 <= p1698) AND (1 <= p1700))))))) OR F (X ((((1 <= p614) AND (1 <= p623)) U ((1 <= p424) AND (1 <= p433)))))) : G (F (NOT(X (NOT(X (NOT((G (((1 <= p1270))) U (((1 <= p1819) AND (1 <= p1834)) U ((1 <= p821) AND (1 <= p834))))))))))) : NOT(X (F (G (F ((((G (((1 <= p1629))) U G (((1 <= p577) AND (1 <= p579)))) OR F (((1 <= p1219) AND (1 <= p1236)))) OR ((1 <= p577) AND (1 <= p579)))))))) : (G (((p1485 <= 0) OR (p1502 <= 0))) U NOT(G ((((p1124 <= 0) OR (p1141 <= 0)) U X (((1 <= p1355) AND (1 <= p1364))))))) : (F ((X (X (((1 <= p1076) AND (1 <= p1101)))) U (((p1059 <= 0)) AND ((p1456 <= 0) OR (p1481 <= 0))))) AND G (X (((1 <= p1170) AND (1 <= p1174) AND (1 <= p1180))))) : G (((NOT(X (X (((1 <= p1874) AND (1 <= p1899))))) U NOT(G (((1 <= p1417) AND (1 <= p1421) AND (1 <= p1427))))) AND NOT(X (((1 <= p1417) AND (1 <= p1421) AND (1 <= p1427)))))) : ((F (((1 <= p1857))) U X (((1 <= p1229) AND ((p1857 <= 0)) AND (1 <= p1235) AND (1 <= p1237)))) AND (X (((1 <= p740))) OR ((1 <= p1229) AND (1 <= p1235) AND (1 <= p1237)))) : (F (NOT(X (NOT((((1 <= p721)) U ((1 <= p125) AND (1 <= p129) AND (1 <= p135))))))) U F ((X (F (((1 <= p721)))) AND ((p125 <= 0) OR (p129 <= 0) OR (p135 <= 0))))) : NOT(G (X (G ((X (G (X (((F (((1 <= p1899))) OR ((1 <= p1200) AND (1 <= p1217))) U ((1 <= p1200) AND (1 <= p1217)))))) OR ((1 <= p1200) AND (1 <= p1217))))))) : X (X (((NOT(G (((1 <= p464) AND (1 <= p475)))) OR G (F ((NOT(X (((1 <= p1437) AND (1 <= p1462)))) U ((1 <= p1437) AND (1 <= p1462)))))) OR ((1 <= p550))))) : F (X ((((1 <= p919) AND (1 <= p921)) U F (((1 <= p1498) AND ((p919 <= 0) OR (p921 <= 0)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:431
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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: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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 249 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G (((1 <= p1298) AND (1 <= p1307)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((1 <= p1298) AND (1 <= p1307)))))
lola: processed formula length: 43
lola: 146 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: 7 markings, 7 edges
lola: ========================================
lola: subprocess 1 will run for 268 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X (X (((p1165 <= 0) OR (p1174 <= 0)))) U ((1 <= p54))) OR G (((1 <= p172))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 268 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p172)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p172)))
lola: processed formula length: 17
lola: 146 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 2 will run for 291 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (((p1165 <= 0) OR (p1174 <= 0)))) U ((1 <= p54)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (X (((p1165 <= 0) OR (p1174 <= 0)))) U ((1 <= p54)))
lola: processed formula length: 56
lola: 146 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: 23 markings, 25 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 291 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((1 <= p1481))) OR ((G (F (((1 <= p1591) AND (1 <= p1606)))) AND (((1 <= p526)) AND (((1 <= p532)) AND ((1 <= p534))))) OR (F (G (((p526 <= 0) OR (p532 <= 0) OR (p534 <= 0)))) AND (((1 <= p1542)) AND ((1 <= p1559))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 291 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p1542)) AND ((1 <= p1559)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: (((1 <= p1542)) AND ((1 <= p1559)))
lola: processed formula length: 35
lola: 147 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 3 will run for 317 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p526)) AND (((1 <= p532)) AND ((1 <= p534))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: processed formula: (((1 <= p526)) AND ((1 <= p532)) AND ((1 <= p534)))
lola: processed formula length: 51
lola: 149 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 3 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 349 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((1 <= p1481)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((1 <= p1481)))
lola: processed formula length: 18
lola: 146 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: 6 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 317 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F (((p1698 <= 0) OR (p1700 <= 0)))) OR X (F (((1 <= p424) AND (1 <= p433)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 317 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((p1698 <= 0) OR (p1700 <= 0))))
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 (((p1698 <= 0) OR (p1700 <= 0))))
lola: processed formula length: 39
lola: 146 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: 3971 markings, 5161 edges
lola: ========================================
lola: subprocess 4 will run for 349 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((1 <= p424) AND (1 <= p433))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((1 <= p424) AND (1 <= p433))))
lola: processed formula length: 37
lola: 146 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: 6 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 349 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((G (((p1355 <= 0) OR (p1364 <= 0))) OR (((1 <= p1124) AND (1 <= p1141)) AND X (((p1355 <= 0) OR (p1364 <= 0)))))) OR (G (((p1485 <= 0) OR (p1502 <= 0))) AND F ((G (((p1355 <= 0) OR (p1364 <= 0))) OR (((1 <= p1124) AND (1 <= p1141)) AND X (((p1355 <= 0) OR (p1364 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 349 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p1485 <= 0) OR (p1502 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p1485 <= 0) OR (p1502 <= 0)))
lola: processed formula length: 35
lola: 146 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: 245 markings, 310 edges
lola: ========================================
lola: subprocess 5 will run for 388 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G (((p1355 <= 0) OR (p1364 <= 0))) OR (((1 <= p1124) AND (1 <= p1141)) AND X (((p1355 <= 0) OR (p1364 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (((p1355 <= 0) OR (p1364 <= 0))) OR (((1 <= p1124) AND (1 <= p1141)) AND X (((p1355 <= 0) OR (p1364 <= 0))))))
lola: processed formula length: 118
lola: 146 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: 484303 markings, 668137 edges, 96861 markings/sec, 0 secs
lola: 953887 markings, 1378528 edges, 93917 markings/sec, 5 secs
lola: 1415186 markings, 2090019 edges, 92260 markings/sec, 10 secs
lola: 1872575 markings, 2801774 edges, 91478 markings/sec, 15 secs
lola: 2325904 markings, 3513646 edges, 90666 markings/sec, 20 secs
lola: 2773378 markings, 4226198 edges, 89495 markings/sec, 25 secs
lola: 3197645 markings, 4895050 edges, 84853 markings/sec, 30 secs
lola: 3631439 markings, 5577384 edges, 86759 markings/sec, 35 secs
lola: 4067900 markings, 6274479 edges, 87292 markings/sec, 40 secs
lola: 4508256 markings, 6981320 edges, 88071 markings/sec, 45 secs
lola: 4947976 markings, 7692212 edges, 87944 markings/sec, 50 secs
lola: 5393947 markings, 8401260 edges, 89194 markings/sec, 55 secs
lola: 5835175 markings, 9110782 edges, 88246 markings/sec, 60 secs
lola: 6262663 markings, 9822657 edges, 85498 markings/sec, 65 secs
lola: 6687958 markings, 10534827 edges, 85059 markings/sec, 70 secs
lola: 7125693 markings, 11245274 edges, 87547 markings/sec, 75 secs
lola: 7557131 markings, 11956972 edges, 86288 markings/sec, 80 secs
lola: 8006528 markings, 12660922 edges, 89879 markings/sec, 85 secs
lola: 8435714 markings, 13368721 edges, 85837 markings/sec, 90 secs
lola: 8854740 markings, 14080537 edges, 83805 markings/sec, 95 secs
lola: 9295507 markings, 14787802 edges, 88153 markings/sec, 100 secs
lola: 9730952 markings, 15496890 edges, 87089 markings/sec, 105 secs
lola: 10154849 markings, 16205886 edges, 84779 markings/sec, 110 secs
lola: 10585702 markings, 16912072 edges, 86171 markings/sec, 115 secs
lola: 11012652 markings, 17622543 edges, 85390 markings/sec, 120 secs
lola: 11442555 markings, 18329196 edges, 85981 markings/sec, 125 secs
lola: 11865536 markings, 19039783 edges, 84596 markings/sec, 130 secs
lola: 12305426 markings, 19746369 edges, 87978 markings/sec, 135 secs
lola: 12743667 markings, 20453503 edges, 87648 markings/sec, 140 secs
lola: 13166585 markings, 21163102 edges, 84584 markings/sec, 145 secs
lola: 13582748 markings, 21870045 edges, 83233 markings/sec, 150 secs
lola: 14012272 markings, 22577779 edges, 85905 markings/sec, 155 secs
lola: 14430859 markings, 23285404 edges, 83717 markings/sec, 160 secs
lola: 14859506 markings, 23991029 edges, 85729 markings/sec, 165 secs
lola: 15298087 markings, 24698599 edges, 87716 markings/sec, 170 secs
lola: 15724232 markings, 25407238 edges, 85229 markings/sec, 175 secs
lola: 16158426 markings, 26114258 edges, 86839 markings/sec, 180 secs
lola: 16569942 markings, 26822839 edges, 82303 markings/sec, 185 secs
lola: 16992410 markings, 27530724 edges, 84494 markings/sec, 190 secs
lola: 17409566 markings, 28239515 edges, 83431 markings/sec, 195 secs
lola: 17819944 markings, 28948772 edges, 82076 markings/sec, 200 secs
lola: 18252224 markings, 29655598 edges, 86456 markings/sec, 205 secs
lola: 18675368 markings, 30362138 edges, 84629 markings/sec, 210 secs
lola: 19101700 markings, 31060310 edges, 85266 markings/sec, 215 secs
lola: 19520693 markings, 31763067 edges, 83799 markings/sec, 220 secs
lola: 19936415 markings, 32459571 edges, 83144 markings/sec, 225 secs
lola: 20303499 markings, 33081372 edges, 73417 markings/sec, 230 secs
lola: 20661209 markings, 33695439 edges, 71542 markings/sec, 235 secs
lola: 21030279 markings, 34337567 edges, 73814 markings/sec, 240 secs
lola: 21445192 markings, 35040240 edges, 82983 markings/sec, 245 secs
lola: 21874568 markings, 35744696 edges, 85875 markings/sec, 250 secs
lola: 22293357 markings, 36447826 edges, 83758 markings/sec, 255 secs
lola: 22710290 markings, 37152556 edges, 83387 markings/sec, 260 secs
lola: 23111451 markings, 37802861 edges, 80232 markings/sec, 265 secs
lola: 23503027 markings, 38445682 edges, 78315 markings/sec, 270 secs
lola: 23877896 markings, 39109446 edges, 74974 markings/sec, 275 secs
lola: 24256319 markings, 39758598 edges, 75685 markings/sec, 280 secs
lola: 24622203 markings, 40401636 edges, 73177 markings/sec, 285 secs
lola: 24987873 markings, 41042782 edges, 73134 markings/sec, 290 secs
lola: 25386005 markings, 41721548 edges, 79626 markings/sec, 295 secs
lola: 25781649 markings, 42372441 edges, 79129 markings/sec, 300 secs
lola: 26142238 markings, 42984501 edges, 72118 markings/sec, 305 secs
lola: 26521146 markings, 43620830 edges, 75782 markings/sec, 310 secs
lola: 26897044 markings, 44268953 edges, 75180 markings/sec, 315 secs
lola: 27265630 markings, 44899241 edges, 73717 markings/sec, 320 secs
lola: 27639479 markings, 45552835 edges, 74770 markings/sec, 325 secs
lola: 28032889 markings, 46216700 edges, 78682 markings/sec, 330 secs
lola: 28397620 markings, 46853475 edges, 72946 markings/sec, 335 secs
lola: 28778364 markings, 47471199 edges, 76149 markings/sec, 340 secs
lola: local time limit reached - aborting
lola: lola:
preliminary result: no no no no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown caught signal User defined signal 1 - aborting LoLA

lola:
preliminary result: no no no no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 6786828 KB
lola: time consumption: 425 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: no no no no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 6786828 KB
lola: time consumption: 425 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 349 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((((p1059 <= 0)) AND ((p1456 <= 0) OR (p1481 <= 0)))) AND X (G (((1 <= p1170) AND (1 <= p1174) AND (1 <= p1180)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 349 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((p1059 <= 0)) AND ((p1456 <= 0) OR (p1481 <= 0))))
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: (((1 <= p1059)) OR ((1 <= p1456) AND (1 <= p1481)))
lola: processed formula length: 52
lola: 148 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 6 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((1 <= p1170) AND (1 <= p1174) AND (1 <= p1180))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((1 <= p1170) AND (1 <= p1174) AND (1 <= p1180))))
lola: processed formula length: 56
lola: 146 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: 6 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F (((p1417 <= 0) OR (p1421 <= 0) OR (p1427 <= 0))) AND X (((p1417 <= 0) OR (p1421 <= 0) OR (p1427 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (((p1417 <= 0) OR (p1421 <= 0) OR (p1427 <= 0))) AND X (((p1417 <= 0) OR (p1421 <= 0) OR (p1427 <= 0)))))
lola: processed formula length: 115
lola: 146 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: 1149 markings, 1163 edges
lola: ========================================
lola: subprocess 7 will run for 449 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F (((1 <= p1857))) U X (((1 <= p1229) AND ((p1857 <= 0)) AND (1 <= p1235) AND (1 <= p1237)))) AND (X (((1 <= p740))) OR ((1 <= p1229) AND (1 <= p1235) AND (1 <= p1237))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 449 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p1229) AND (1 <= p1235) AND (1 <= p1237))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p1229) AND (1 <= p1235) AND (1 <= p1237))
lola: processed formula length: 48
lola: 146 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 3 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 8 will run for 524 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((1 <= p740)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((1 <= p740)))
lola: processed formula length: 17
lola: 146 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: 6 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 524 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (F (((1 <= p721)))) AND ((p125 <= 0) OR (p129 <= 0) OR (p135 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (F (((1 <= p721)))) AND ((p125 <= 0) OR (p129 <= 0) OR (p135 <= 0))))
lola: processed formula length: 77
lola: 146 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 9 will run for 628 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((X (X (F ((G (((p1200 <= 0) OR (p1217 <= 0))) OR (G (((p1899 <= 0))) AND (((p1200 <= 0) OR (p1217 <= 0)) AND ((p1200 <= 0) OR (p1217 <= 0)))))))) AND ((p1200 <= 0) OR (p1217 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((X (X (F ((G (((p1200 <= 0) OR (p1217 <= 0))) OR (G (((p1899 <= 0))) AND (((p1200 <= 0) OR (p1217 <= 0)) AND ((p1200 <= 0) OR (p1217 <= 0)))))))) AND ((p1200 <= 0) OR (p1217 <= 0)))))
lola: processed formula length: 193
lola: 146 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: add low 803
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: 627 markings, 645 edges
lola: ========================================
lola: subprocess 10 will run for 786 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((F (((p464 <= 0) OR (p475 <= 0))) OR (G (F (((1 <= p1437) AND (1 <= p1462)))) OR ((1 <= p550))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((F (((p464 <= 0) OR (p475 <= 0))) OR (G (F (((1 <= p1437) AND (1 <= p1462)))) OR ((1 <= p550))))))
lola: processed formula length: 105
lola: 146 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 11 will run for 1048 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((1 <= p1498) AND ((p919 <= 0) OR (p921 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((1 <= p1498) AND ((p919 <= 0) OR (p921 <= 0)))))
lola: processed formula length: 56
lola: 146 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 12 will run for 1572 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((((p1819 <= 0) OR (p1834 <= 0)) R ((p821 <= 0) OR (p834 <= 0))) AND (F (((p1270 <= 0))) OR G (((p821 <= 0) OR (p834 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((((p1819 <= 0) OR (p1834 <= 0)) R ((p821 <= 0) OR (p834 <= 0))) AND (F (((p1270 <= 0))) OR G (((p821 <= 0) OR (p834 <= 0)))))))
lola: processed formula length: 137
lola: 146 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 11 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 1493 markings, 1920 edges
lola: ========================================
lola: subprocess 13 will run for 3144 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F (((p577 <= 0) OR (p579 <= 0))) AND ((F (((p1629 <= 0))) OR G (F (((p577 <= 0) OR (p579 <= 0))))) AND (G (((p1219 <= 0) OR (p1236 <= 0))) AND ((p577 <= 0) OR (p579 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F (((p577 <= 0) OR (p579 <= 0))) AND ((F (((p1629 <= 0))) OR G (F (((p577 <= 0) OR (p579 <= 0))))) AND (G (((p1219 <= 0) OR (p1236 <= 0))) AND ((p577 <= 0) OR (p579 <= 0)))))))
lola: processed formula length: 187
lola: 146 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 16 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 366 markings, 466 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (F ((G (((p1355 <= 0) OR (p1364 <= 0))) OR (((1 <= p1124) AND (1 <= p1141)) AND X (((p1355 <= 0) OR (p1364 <= 0)))))) OR (G (((p1485 <= 0) OR (p1502 <= 0))) AND F ((G (((p1355 <= 0) OR (p1364 <= 0))) OR (((1 <= p1124) AND (1 <= p1141)) AND X (((p1355 <= 0) OR (p1364 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: G (((p1485 <= 0) OR (p1502 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p1485 <= 0) OR (p1502 <= 0)))
lola: processed formula length: 35
lola: 146 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: 245 markings, 310 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F ((G (((p1355 <= 0) OR (p1364 <= 0))) OR (((1 <= p1124) AND (1 <= p1141)) AND X (((p1355 <= 0) OR (p1364 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (((p1355 <= 0) OR (p1364 <= 0))) OR (((1 <= p1124) AND (1 <= p1141)) AND X (((p1355 <= 0) OR (p1364 <= 0))))))
lola: processed formula length: 118
lola: 146 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: 448450 markings, 617623 edges, 89690 markings/sec, 0 secs
lola: 876968 markings, 1260424 edges, 85704 markings/sec, 5 secs
lola: 1317681 markings, 1928947 edges, 88143 markings/sec, 10 secs
lola: 1724557 markings, 2567684 edges, 81375 markings/sec, 15 secs
lola: 2147238 markings, 3233883 edges, 84536 markings/sec, 20 secs
lola: 2567307 markings, 3900678 edges, 84014 markings/sec, 25 secs
lola: 3005425 markings, 4587775 edges, 87624 markings/sec, 30 secs
lola: 3450078 markings, 5297206 edges, 88931 markings/sec, 35 secs
lola: 3883494 markings, 5977802 edges, 86683 markings/sec, 40 secs
lola: 4300251 markings, 6652327 edges, 83351 markings/sec, 45 secs
lola: 4738839 markings, 7361774 edges, 87718 markings/sec, 50 secs
lola: 5171933 markings, 8048593 edges, 86619 markings/sec, 55 secs
lola: 5575845 markings, 8696263 edges, 80782 markings/sec, 60 secs
lola: 5988335 markings, 9368261 edges, 82498 markings/sec, 65 secs
lola: 6412196 markings, 10071770 edges, 84772 markings/sec, 70 secs
lola: 6833885 markings, 10784126 edges, 84338 markings/sec, 75 secs
lola: 7279490 markings, 11489406 edges, 89121 markings/sec, 80 secs
lola: 7717682 markings, 12198815 edges, 87638 markings/sec, 85 secs
lola: 8155154 markings, 12904149 edges, 87494 markings/sec, 90 secs
lola: 8577287 markings, 13615753 edges, 84427 markings/sec, 95 secs
lola: 9002841 markings, 14327149 edges, 85111 markings/sec, 100 secs
lola: 9441174 markings, 15018236 edges, 87667 markings/sec, 105 secs
lola: 9851134 markings, 15695825 edges, 81992 markings/sec, 110 secs
lola: 10241802 markings, 16355443 edges, 78134 markings/sec, 115 secs
lola: 10667218 markings, 17041481 edges, 85083 markings/sec, 120 secs
lola: 11065444 markings, 17710319 edges, 79645 markings/sec, 125 secs
lola: 11441136 markings, 18326437 edges, 75138 markings/sec, 130 secs
lola: 11825782 markings, 18978758 edges, 76929 markings/sec, 135 secs
lola: 12245782 markings, 19662785 edges, 84000 markings/sec, 140 secs
lola: 12637524 markings, 20280481 edges, 78348 markings/sec, 145 secs
lola: 13028044 markings, 20923565 edges, 78104 markings/sec, 150 secs
lola: 13409778 markings, 21587355 edges, 76347 markings/sec, 155 secs
lola: 13792150 markings, 22200503 edges, 76474 markings/sec, 160 secs
lola: 14162709 markings, 22827924 edges, 74112 markings/sec, 165 secs
lola: 14562404 markings, 23506264 edges, 79939 markings/sec, 170 secs
lola: 14968828 markings, 24159459 edges, 81285 markings/sec, 175 secs
lola: 15357514 markings, 24795865 edges, 77737 markings/sec, 180 secs
lola: 15745468 markings, 25442077 edges, 77591 markings/sec, 185 secs
lola: 16160375 markings, 26117390 edges, 82981 markings/sec, 190 secs
lola: 16569533 markings, 26822237 edges, 81832 markings/sec, 195 secs
lola: 16991871 markings, 27530051 edges, 84468 markings/sec, 200 secs
lola: 17408847 markings, 28238534 edges, 83395 markings/sec, 205 secs
lola: 17819754 markings, 28948339 edges, 82181 markings/sec, 210 secs
lola: 18251528 markings, 29654608 edges, 86355 markings/sec, 215 secs
lola: 18675271 markings, 30361941 edges, 84749 markings/sec, 220 secs
lola: 19103441 markings, 31063102 edges, 85634 markings/sec, 225 secs
lola: 19522809 markings, 31767108 edges, 83874 markings/sec, 230 secs
lola: 19945080 markings, 32474912 edges, 84454 markings/sec, 235 secs
lola: 20362781 markings, 33183431 edges, 83540 markings/sec, 240 secs
lola: 20774436 markings, 33892563 edges, 82331 markings/sec, 245 secs
lola: 21182930 markings, 34600306 edges, 81699 markings/sec, 250 secs
lola: 21577406 markings, 35261379 edges, 78895 markings/sec, 255 secs
lola: 21971072 markings, 35911522 edges, 78733 markings/sec, 260 secs
lola: 22354871 markings, 36546671 edges, 76760 markings/sec, 265 secs
lola: 22770959 markings, 37252227 edges, 83218 markings/sec, 270 secs
lola: 23197849 markings, 37952402 edges, 85378 markings/sec, 275 secs
lola: 23566967 markings, 38568997 edges, 73824 markings/sec, 280 secs
lola: 23937598 markings, 39213004 edges, 74126 markings/sec, 285 secs
lola: 24326215 markings, 39888867 edges, 77723 markings/sec, 290 secs
lola: 24728034 markings, 40586080 edges, 80364 markings/sec, 295 secs
lola: 25130065 markings, 41292667 edges, 80406 markings/sec, 300 secs
lola: 25554504 markings, 41997074 edges, 84888 markings/sec, 305 secs
lola: 25975999 markings, 42703458 edges, 84299 markings/sec, 310 secs
lola: 26400759 markings, 43407352 edges, 84952 markings/sec, 315 secs
lola: 26811792 markings, 44113196 edges, 82207 markings/sec, 320 secs
lola: 27216384 markings, 44820877 edges, 80918 markings/sec, 325 secs
lola: 27624088 markings, 45526917 edges, 81541 markings/sec, 330 secs
lola: 28042330 markings, 46232668 edges, 83648 markings/sec, 335 secs
lola: 28445483 markings, 46938969 edges, 80631 markings/sec, 340 secs
lola: 28872789 markings, 47642945 edges, 85461 markings/sec, 345 secs
lola: 29255617 markings, 48304565 edges, 76566 markings/sec, 350 secs
lola: 29675463 markings, 49009248 edges, 83969 markings/sec, 355 secs
lola: 30085290 markings, 49713096 edges, 81965 markings/sec, 360 secs
lola: 30501612 markings, 50417158 edges, 83264 markings/sec, 365 secs
lola: 30925215 markings, 51120205 edges, 84721 markings/sec, 370 secs
lola: 31316177 markings, 51762293 edges, 78192 markings/sec, 375 secs
lola: 31691392 markings, 52402550 edges, 75043 markings/sec, 380 secs
lola: 32090730 markings, 53068467 edges, 79868 markings/sec, 385 secs
lola: 32471841 markings, 53743246 edges, 76222 markings/sec, 390 secs
lola: 32859973 markings, 54414838 edges, 77626 markings/sec, 395 secs
lola: 33236326 markings, 55054988 edges, 75271 markings/sec, 400 secs
lola: 33641214 markings, 55730811 edges, 80978 markings/sec, 405 secs
lola: 34042965 markings, 56412192 edges, 80350 markings/sec, 410 secs
lola: 34419682 markings, 57075170 edges, 75343 markings/sec, 415 secs
lola: 34801320 markings, 57756912 edges, 76328 markings/sec, 420 secs
lola: 35183878 markings, 58426925 edges, 76512 markings/sec, 425 secs
lola: 35531161 markings, 59050222 edges, 69457 markings/sec, 430 secs
lola: 35909914 markings, 59696321 edges, 75751 markings/sec, 435 secs
lola: 36302692 markings, 60373035 edges, 78556 markings/sec, 440 secs
lola: 36670370 markings, 60990432 edges, 73536 markings/sec, 445 secs
lola: 37047944 markings, 61617741 edges, 75515 markings/sec, 450 secs
lola: 37411496 markings, 62247105 edges, 72710 markings/sec, 455 secs
lola: 37808158 markings, 62916305 edges, 79332 markings/sec, 460 secs
lola: 38197210 markings, 63621714 edges, 77810 markings/sec, 465 secs
lola: 38601101 markings, 64313915 edges, 80778 markings/sec, 470 secs
lola: 38962181 markings, 64960872 edges, 72216 markings/sec, 475 secs
lola: 39331461 markings, 65625599 edges, 73856 markings/sec, 480 secs
lola: 39730474 markings, 66314029 edges, 79803 markings/sec, 485 secs
lola: 40143280 markings, 67016991 edges, 82561 markings/sec, 490 secs
lola: 40558178 markings, 67720610 edges, 82980 markings/sec, 495 secs
lola: 40954490 markings, 68425841 edges, 79262 markings/sec, 500 secs
lola: 41343628 markings, 69093606 edges, 77828 markings/sec, 505 secs
lola: 41753369 markings, 69755743 edges, 81948 markings/sec, 510 secs
lola: 42121356 markings, 70410308 edges, 73597 markings/sec, 515 secs
lola: 42523926 markings, 71101118 edges, 80514 markings/sec, 520 secs
lola: 42945693 markings, 71803698 edges, 84353 markings/sec, 525 secs
lola: 43355106 markings, 72509533 edges, 81883 markings/sec, 530 secs
lola: 43774043 markings, 73213242 edges, 83787 markings/sec, 535 secs
lola: 44172318 markings, 73902437 edges, 79655 markings/sec, 540 secs
lola: 44529935 markings, 74518425 edges, 71523 markings/sec, 545 secs
lola: 44912461 markings, 75159175 edges, 76505 markings/sec, 550 secs
lola: 45322788 markings, 75860316 edges, 82065 markings/sec, 555 secs
lola: 45714169 markings, 76519333 edges, 78276 markings/sec, 560 secs
lola: 46098628 markings, 77191734 edges, 76892 markings/sec, 565 secs
lola: 46494851 markings, 77866730 edges, 79245 markings/sec, 570 secs
lola: 46868149 markings, 78529146 edges, 74660 markings/sec, 575 secs
lola: 47243839 markings, 79192517 edges, 75138 markings/sec, 580 secs
lola: 47626891 markings, 79867946 edges, 76610 markings/sec, 585 secs
lola: 48015876 markings, 80528640 edges, 77797 markings/sec, 590 secs
lola: 48409187 markings, 81205274 edges, 78662 markings/sec, 595 secs
lola: 48793668 markings, 81884936 edges, 76896 markings/sec, 600 secs
lola: 49206197 markings, 82582668 edges, 82506 markings/sec, 605 secs
lola: 49601354 markings, 83253002 edges, 79031 markings/sec, 610 secs
lola: 49992022 markings, 83929958 edges, 78134 markings/sec, 615 secs
lola: 50405559 markings, 84632692 edges, 82707 markings/sec, 620 secs
lola: 50805363 markings, 85335187 edges, 79961 markings/sec, 625 secs
lola: 51218995 markings, 86039156 edges, 82726 markings/sec, 630 secs
lola: 51622546 markings, 86741295 edges, 80710 markings/sec, 635 secs
lola: 52040038 markings, 87443536 edges, 83498 markings/sec, 640 secs
lola: 52463480 markings, 88146430 edges, 84688 markings/sec, 645 secs
lola: 52859975 markings, 88851475 edges, 79299 markings/sec, 650 secs
lola: 53268815 markings, 89555172 edges, 81768 markings/sec, 655 secs
lola: 53677096 markings, 90258375 edges, 81656 markings/sec, 660 secs
lola: 54082168 markings, 90963027 edges, 81014 markings/sec, 665 secs
lola: 54483661 markings, 91667422 edges, 80299 markings/sec, 670 secs
lola: 54897478 markings, 92367829 edges, 82763 markings/sec, 675 secs
lola: 55309180 markings, 93071027 edges, 82340 markings/sec, 680 secs
lola: 55723167 markings, 93773365 edges, 82797 markings/sec, 685 secs
lola: 56119015 markings, 94477942 edges, 79170 markings/sec, 690 secs
lola: 56529601 markings, 95181486 edges, 82117 markings/sec, 695 secs
lola: 56932436 markings, 95885125 edges, 80567 markings/sec, 700 secs
lola: 57343359 markings, 96589121 edges, 82185 markings/sec, 705 secs
lola: 57763530 markings, 97290411 edges, 84034 markings/sec, 710 secs
lola: 58158502 markings, 97995616 edges, 78994 markings/sec, 715 secs
lola: 58566496 markings, 98698461 edges, 81599 markings/sec, 720 secs
lola: 58956079 markings, 99403387 edges, 77917 markings/sec, 725 secs
lola: 59365082 markings, 100104044 edges, 81801 markings/sec, 730 secs
lola: 59779500 markings, 100805812 edges, 82884 markings/sec, 735 secs
lola: 60185953 markings, 101507636 edges, 81291 markings/sec, 740 secs
lola: 60596567 markings, 102208341 edges, 82123 markings/sec, 745 secs
lola: 60991151 markings, 102912357 edges, 78917 markings/sec, 750 secs
lola: 61399411 markings, 103614547 edges, 81652 markings/sec, 755 secs
lola: 61791426 markings, 104312278 edges, 78403 markings/sec, 760 secs
lola: 62189226 markings, 105013135 edges, 79560 markings/sec, 765 secs
lola: 62599318 markings, 105713953 edges, 82018 markings/sec, 770 secs
lola: 63006579 markings, 106417327 edges, 81452 markings/sec, 775 secs
lola: 63408118 markings, 107121177 edges, 80308 markings/sec, 780 secs
lola: 63823755 markings, 107823278 edges, 83127 markings/sec, 785 secs
lola: 64228625 markings, 108523923 edges, 80974 markings/sec, 790 secs
lola: 64639664 markings, 109225529 edges, 82208 markings/sec, 795 secs
lola: 65051130 markings, 109926612 edges, 82293 markings/sec, 800 secs
lola: 65445050 markings, 110632583 edges, 78784 markings/sec, 805 secs
lola: 65862574 markings, 111335606 edges, 83505 markings/sec, 810 secs
lola: 66286043 markings, 112038059 edges, 84694 markings/sec, 815 secs
lola: 66678455 markings, 112740492 edges, 78482 markings/sec, 820 secs
lola: 67082536 markings, 113443146 edges, 80816 markings/sec, 825 secs
lola: 67474945 markings, 114147739 edges, 78482 markings/sec, 830 secs
lola: 67868822 markings, 114852118 edges, 78775 markings/sec, 835 secs
lola: 68288003 markings, 115551985 edges, 83836 markings/sec, 840 secs
lola: 68658853 markings, 116212036 edges, 74170 markings/sec, 845 secs
lola: 69032956 markings, 116863107 edges, 74821 markings/sec, 850 secs
lola: 69341772 markings, 117402449 edges, 61763 markings/sec, 855 secs
lola: 69694646 markings, 117990000 edges, 70575 markings/sec, 860 secs
lola: 69979819 markings, 118461907 edges, 57035 markings/sec, 865 secs
lola: 70346938 markings, 119053410 edges, 73424 markings/sec, 870 secs
lola: 70680380 markings, 119616926 edges, 66688 markings/sec, 875 secs
lola: 71002054 markings, 120148015 edges, 64335 markings/sec, 880 secs
lola: 71315817 markings, 120694619 edges, 62753 markings/sec, 885 secs
lola: 71603797 markings, 121206170 edges, 57596 markings/sec, 890 secs
lola: 71940311 markings, 121785936 edges, 67303 markings/sec, 895 secs
lola: 72263759 markings, 122331717 edges, 64690 markings/sec, 900 secs
lola: 72615254 markings, 122931988 edges, 70299 markings/sec, 905 secs
lola: 72991676 markings, 123609452 edges, 75284 markings/sec, 910 secs
lola: 73318721 markings, 124187407 edges, 65409 markings/sec, 915 secs
lola: 73680261 markings, 124821074 edges, 72308 markings/sec, 920 secs
lola: 74072811 markings, 125493102 edges, 78510 markings/sec, 925 secs
lola: 74413156 markings, 126094910 edges, 68069 markings/sec, 930 secs
lola: 74754318 markings, 126660164 edges, 68232 markings/sec, 935 secs
lola: 75103638 markings, 127291116 edges, 69864 markings/sec, 940 secs
lola: 75479131 markings, 127951870 edges, 75099 markings/sec, 945 secs
lola: 75825419 markings, 128569608 edges, 69258 markings/sec, 950 secs
lola: 76148224 markings, 129144339 edges, 64561 markings/sec, 955 secs
lola: 76470450 markings, 129722153 edges, 64445 markings/sec, 960 secs
lola: 76830333 markings, 130322373 edges, 71977 markings/sec, 965 secs
lola: 77187588 markings, 130974122 edges, 71451 markings/sec, 970 secs
lola: 77538084 markings, 131605219 edges, 70099 markings/sec, 975 secs
lola: 77932481 markings, 132253357 edges, 78879 markings/sec, 980 secs
lola: 78299696 markings, 132898404 edges, 73443 markings/sec, 985 secs
lola: 78674417 markings, 133550208 edges, 74944 markings/sec, 990 secs
lola: 79048926 markings, 134194466 edges, 74902 markings/sec, 995 secs
lola: 79432547 markings, 134879647 edges, 76724 markings/sec, 1000 secs
lola: 79786842 markings, 135506172 edges, 70859 markings/sec, 1005 secs
lola: 80158977 markings, 136149044 edges, 74427 markings/sec, 1010 secs
lola: 80526541 markings, 136789672 edges, 73513 markings/sec, 1015 secs
lola: 80897144 markings, 137448005 edges, 74121 markings/sec, 1020 secs
lola: 81267179 markings, 138062495 edges, 74007 markings/sec, 1025 secs
lola: 81651251 markings, 138709919 edges, 76814 markings/sec, 1030 secs
lola: 82045963 markings, 139396935 edges, 78942 markings/sec, 1035 secs
lola: 82406371 markings, 140033382 edges, 72082 markings/sec, 1040 secs
lola: 82751771 markings, 140654091 edges, 69080 markings/sec, 1045 secs
lola: 83045534 markings, 141205459 edges, 58753 markings/sec, 1050 secs
lola: 83410351 markings, 141813630 edges, 72963 markings/sec, 1055 secs
lola: 83761093 markings, 142415771 edges, 70148 markings/sec, 1060 secs
lola: 84101486 markings, 143028290 edges, 68079 markings/sec, 1065 secs
lola: 84472164 markings, 143657329 edges, 74136 markings/sec, 1070 secs
lola: 84802956 markings, 144231175 edges, 66158 markings/sec, 1075 secs
lola: 85118085 markings, 144794511 edges, 63026 markings/sec, 1080 secs
lola: 85484734 markings, 145403943 edges, 73330 markings/sec, 1085 secs
lola: 85859369 markings, 146048969 edges, 74927 markings/sec, 1090 secs
lola: 86060559 markings, 146410676 edges, 40238 markings/sec, 1095 secs
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: RESULT
lola:
SUMMARY: no no no no no no unknown no no no no no yes no
lola:
preliminary result: no no no no no no unknown no no no no no yes no
lola: memory consumption: 5944 KB
lola: time consumption: 1531 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-100A"
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-100A, 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-159033477400378"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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