Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r189-tajo-162089432400010.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is QuasiCertifProtocol-COL-06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r189-tajo-162089432400010
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 117K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 108K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 09:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 09:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 13:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 13:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 08:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 08:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 61K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME QuasiCertifProtocol-COL-06-00
FORMULA_NAME QuasiCertifProtocol-COL-06-01
FORMULA_NAME QuasiCertifProtocol-COL-06-02
FORMULA_NAME QuasiCertifProtocol-COL-06-03
FORMULA_NAME QuasiCertifProtocol-COL-06-04
FORMULA_NAME QuasiCertifProtocol-COL-06-05
FORMULA_NAME QuasiCertifProtocol-COL-06-06
FORMULA_NAME QuasiCertifProtocol-COL-06-07
FORMULA_NAME QuasiCertifProtocol-COL-06-08
FORMULA_NAME QuasiCertifProtocol-COL-06-09
FORMULA_NAME QuasiCertifProtocol-COL-06-10
FORMULA_NAME QuasiCertifProtocol-COL-06-11
FORMULA_NAME QuasiCertifProtocol-COL-06-12
FORMULA_NAME QuasiCertifProtocol-COL-06-13
FORMULA_NAME QuasiCertifProtocol-COL-06-14
FORMULA_NAME QuasiCertifProtocol-COL-06-15

=== Now, execution of the tool begins

BK_START 1621408743499

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 07:19:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-19 07:19:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 07:19:05] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2021-05-19 07:19:06] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 614 ms
[2021-05-19 07:19:06] [INFO ] sort/places :
tsidxtsid->n9,n8,n7,
Dot->malicious_reservoir,CstopAbort,SstopAbort,AstopAbort,a5,a4,a3,a2,a1,Astart,AstopOK,
tsid->n6,n5,n4,n3,n2,n1,c1,Cstart,Sstart,s2,s3,s4,s5,s6,SstopOK,CstopOK,

[2021-05-19 07:19:06] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 270 PT places and 116.0 transition bindings in 29 ms.
[2021-05-19 07:19:06] [INFO ] Computed order based on color domains.
[2021-05-19 07:19:06] [INFO ] Unfolded HLPN to a Petri net with 270 places and 116 transitions in 16 ms.
[2021-05-19 07:19:06] [INFO ] Unfolded HLPN properties in 1 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 35 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 9832 resets, run finished after 676 ms. (steps per millisecond=147 ) properties seen :[0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 116 rows 270 cols
[2021-05-19 07:19:07] [INFO ] Computed 155 place invariants in 18 ms
[2021-05-19 07:19:07] [INFO ] [Real]Absence check using 11 positive place invariants in 28 ms returned sat
[2021-05-19 07:19:07] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 70 ms returned sat
[2021-05-19 07:19:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:07] [INFO ] [Real]Absence check using state equation in 351 ms returned sat
[2021-05-19 07:19:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 07:19:07] [INFO ] [Nat]Absence check using 11 positive place invariants in 19 ms returned sat
[2021-05-19 07:19:07] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 78 ms returned sat
[2021-05-19 07:19:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:08] [INFO ] [Nat]Absence check using state equation in 223 ms returned sat
[2021-05-19 07:19:08] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 26 ms.
[2021-05-19 07:19:08] [INFO ] Added : 19 causal constraints over 4 iterations in 192 ms. Result :sat
[2021-05-19 07:19:08] [INFO ] [Real]Absence check using 11 positive place invariants in 32 ms returned sat
[2021-05-19 07:19:08] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 74 ms returned sat
[2021-05-19 07:19:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:08] [INFO ] [Real]Absence check using state equation in 276 ms returned sat
[2021-05-19 07:19:08] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 11 ms.
[2021-05-19 07:19:08] [INFO ] Added : 48 causal constraints over 10 iterations in 182 ms. Result :sat
[2021-05-19 07:19:09] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2021-05-19 07:19:09] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 58 ms returned sat
[2021-05-19 07:19:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:09] [INFO ] [Real]Absence check using state equation in 219 ms returned sat
[2021-05-19 07:19:09] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 6 ms.
[2021-05-19 07:19:09] [INFO ] Added : 48 causal constraints over 10 iterations in 175 ms. Result :sat
[2021-05-19 07:19:09] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2021-05-19 07:19:09] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 63 ms returned sat
[2021-05-19 07:19:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:09] [INFO ] [Real]Absence check using state equation in 165 ms returned unsat
[2021-05-19 07:19:09] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2021-05-19 07:19:09] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 38 ms returned sat
[2021-05-19 07:19:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:10] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2021-05-19 07:19:10] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 14 ms.
[2021-05-19 07:19:10] [INFO ] Added : 20 causal constraints over 4 iterations in 98 ms. Result :sat
[2021-05-19 07:19:10] [INFO ] [Real]Absence check using 11 positive place invariants in 23 ms returned sat
[2021-05-19 07:19:10] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 43 ms returned sat
[2021-05-19 07:19:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:10] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2021-05-19 07:19:10] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 13 ms.
[2021-05-19 07:19:10] [INFO ] Added : 41 causal constraints over 9 iterations in 136 ms. Result :sat
[2021-05-19 07:19:10] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2021-05-19 07:19:10] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 45 ms returned sat
[2021-05-19 07:19:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:10] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2021-05-19 07:19:11] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2021-05-19 07:19:11] [INFO ] Added : 41 causal constraints over 9 iterations in 106 ms. Result :sat
[2021-05-19 07:19:11] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2021-05-19 07:19:11] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 37 ms returned sat
[2021-05-19 07:19:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:11] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2021-05-19 07:19:11] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 16 ms.
[2021-05-19 07:19:11] [INFO ] Added : 19 causal constraints over 4 iterations in 56 ms. Result :sat
[2021-05-19 07:19:11] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2021-05-19 07:19:11] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 48 ms returned sat
[2021-05-19 07:19:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:11] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2021-05-19 07:19:11] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 6 ms.
[2021-05-19 07:19:11] [INFO ] Added : 19 causal constraints over 4 iterations in 56 ms. Result :sat
[2021-05-19 07:19:11] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2021-05-19 07:19:11] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 47 ms returned sat
[2021-05-19 07:19:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:12] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2021-05-19 07:19:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 07:19:12] [INFO ] [Nat]Absence check using 11 positive place invariants in 34 ms returned sat
[2021-05-19 07:19:12] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 109 ms returned sat
[2021-05-19 07:19:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:12] [INFO ] [Nat]Absence check using state equation in 222 ms returned sat
[2021-05-19 07:19:12] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 6 ms.
[2021-05-19 07:19:12] [INFO ] Added : 17 causal constraints over 4 iterations in 47 ms. Result :sat
[2021-05-19 07:19:12] [INFO ] [Real]Absence check using 11 positive place invariants in 22 ms returned sat
[2021-05-19 07:19:12] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 45 ms returned sat
[2021-05-19 07:19:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:12] [INFO ] [Real]Absence check using state equation in 176 ms returned unsat
[2021-05-19 07:19:12] [INFO ] [Real]Absence check using 11 positive place invariants in 20 ms returned sat
[2021-05-19 07:19:12] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 49 ms returned sat
[2021-05-19 07:19:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:13] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2021-05-19 07:19:13] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 6 ms.
[2021-05-19 07:19:13] [INFO ] Added : 48 causal constraints over 10 iterations in 124 ms. Result :sat
[2021-05-19 07:19:13] [INFO ] [Real]Absence check using 11 positive place invariants in 20 ms returned sat
[2021-05-19 07:19:13] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 47 ms returned sat
[2021-05-19 07:19:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:13] [INFO ] [Real]Absence check using state equation in 249 ms returned sat
[2021-05-19 07:19:13] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 9 ms.
[2021-05-19 07:19:13] [INFO ] Added : 48 causal constraints over 10 iterations in 142 ms. Result :sat
[2021-05-19 07:19:13] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2021-05-19 07:19:13] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 57 ms returned sat
[2021-05-19 07:19:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:14] [INFO ] [Real]Absence check using state equation in 221 ms returned sat
[2021-05-19 07:19:14] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 11 ms.
[2021-05-19 07:19:14] [INFO ] Added : 20 causal constraints over 4 iterations in 61 ms. Result :sat
[2021-05-19 07:19:14] [INFO ] [Real]Absence check using 11 positive place invariants in 18 ms returned sat
[2021-05-19 07:19:14] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 64 ms returned sat
[2021-05-19 07:19:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:14] [INFO ] [Real]Absence check using state equation in 327 ms returned unsat
[2021-05-19 07:19:14] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2021-05-19 07:19:14] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 66 ms returned sat
[2021-05-19 07:19:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:15] [INFO ] [Real]Absence check using state equation in 247 ms returned sat
[2021-05-19 07:19:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 07:19:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 11 ms returned sat
[2021-05-19 07:19:15] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 48 ms returned sat
[2021-05-19 07:19:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:15] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2021-05-19 07:19:15] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 12 ms.
[2021-05-19 07:19:15] [INFO ] Added : 25 causal constraints over 5 iterations in 89 ms. Result :sat
[2021-05-19 07:19:15] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2021-05-19 07:19:15] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 49 ms returned sat
[2021-05-19 07:19:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:15] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2021-05-19 07:19:15] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 7 ms.
[2021-05-19 07:19:15] [INFO ] Added : 41 causal constraints over 9 iterations in 117 ms. Result :sat
[2021-05-19 07:19:15] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2021-05-19 07:19:15] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 45 ms returned sat
[2021-05-19 07:19:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:16] [INFO ] [Real]Absence check using state equation in 225 ms returned sat
[2021-05-19 07:19:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 07:19:16] [INFO ] [Nat]Absence check using 11 positive place invariants in 11 ms returned sat
[2021-05-19 07:19:16] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 48 ms returned sat
[2021-05-19 07:19:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:16] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2021-05-19 07:19:16] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 6 ms.
[2021-05-19 07:19:16] [INFO ] Added : 17 causal constraints over 4 iterations in 41 ms. Result :sat
[2021-05-19 07:19:16] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2021-05-19 07:19:16] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 40 ms returned sat
[2021-05-19 07:19:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:16] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2021-05-19 07:19:16] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 13 ms.
[2021-05-19 07:19:16] [INFO ] Added : 24 causal constraints over 5 iterations in 70 ms. Result :sat
[2021-05-19 07:19:16] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2021-05-19 07:19:16] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 40 ms returned sat
[2021-05-19 07:19:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:17] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2021-05-19 07:19:17] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2021-05-19 07:19:17] [INFO ] Added : 22 causal constraints over 5 iterations in 58 ms. Result :sat
[2021-05-19 07:19:17] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2021-05-19 07:19:17] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 37 ms returned sat
[2021-05-19 07:19:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:17] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2021-05-19 07:19:17] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2021-05-19 07:19:17] [INFO ] Added : 22 causal constraints over 5 iterations in 67 ms. Result :sat
[2021-05-19 07:19:17] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2021-05-19 07:19:17] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 38 ms returned sat
[2021-05-19 07:19:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:17] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2021-05-19 07:19:17] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 13 ms.
[2021-05-19 07:19:17] [INFO ] Added : 24 causal constraints over 5 iterations in 58 ms. Result :sat
[2021-05-19 07:19:17] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2021-05-19 07:19:17] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 54 ms returned sat
[2021-05-19 07:19:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:18] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2021-05-19 07:19:18] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2021-05-19 07:19:18] [INFO ] Added : 21 causal constraints over 5 iterations in 60 ms. Result :sat
[2021-05-19 07:19:18] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2021-05-19 07:19:18] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 35 ms returned sat
[2021-05-19 07:19:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:18] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2021-05-19 07:19:18] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 5 ms.
[2021-05-19 07:19:18] [INFO ] Added : 22 causal constraints over 5 iterations in 87 ms. Result :sat
[2021-05-19 07:19:18] [INFO ] [Real]Absence check using 11 positive place invariants in 19 ms returned sat
[2021-05-19 07:19:18] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 57 ms returned sat
[2021-05-19 07:19:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:18] [INFO ] [Real]Absence check using state equation in 191 ms returned sat
[2021-05-19 07:19:18] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 7 ms.
[2021-05-19 07:19:18] [INFO ] Added : 21 causal constraints over 5 iterations in 58 ms. Result :sat
[2021-05-19 07:19:18] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2021-05-19 07:19:18] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 55 ms returned sat
[2021-05-19 07:19:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:19] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2021-05-19 07:19:19] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 6 ms.
[2021-05-19 07:19:19] [INFO ] Added : 23 causal constraints over 5 iterations in 53 ms. Result :sat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2021-05-19 07:19:19] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2021-05-19 07:19:19] [INFO ] Flatten gal took : 45 ms
FORMULA QuasiCertifProtocol-COL-06-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-06-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-06-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-06-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 07:19:19] [INFO ] Applying decomposition
[2021-05-19 07:19:19] [INFO ] Flatten gal took : 29 ms
[2021-05-19 07:19:19] [INFO ] Decomposing Gal with order
[2021-05-19 07:19:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 07:19:19] [INFO ] Removed a total of 104 redundant transitions.
[2021-05-19 07:19:19] [INFO ] Flatten gal took : 57 ms
[2021-05-19 07:19:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 10 ms.
[2021-05-19 07:19:19] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 5 ms.
[2021-05-19 07:19:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ QuasiCertifProtocol-COL-06 @ 3570 seconds

FORMULA QuasiCertifProtocol-COL-06-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-06-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-06-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-06-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-06-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-06-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-06-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-06-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-06-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-06-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-06-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-06-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3564
rslt: Output for LTLFireability @ QuasiCertifProtocol-COL-06

{
"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": "Wed May 19 07:19:19 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 14,
"aneg": 1,
"comp": 31,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 31,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 29,
"visible_transitions": 0
},
"processed": "G ((F ((G ((1 <= p260)) OR ((((1 <= p158) AND (1 <= p221)) OR ((1 <= p162) AND (1 <= p225)) OR ((1 <= p159) AND (1 <= p222)) OR ((1 <= p161) AND (1 <= p224)) OR ((1 <= p163) AND (1 <= p226)) OR ((1 <= p160) AND (1 <= p223)) OR ((1 <= p164) AND (1 <= p227))) AND X (G ((1 <= p260)))))) OR ((p260 <= 0) AND ((p189 <= 0) OR (p210 <= 0)) AND ((p187 <= 0) OR (p208 <= 0)) AND ((p191 <= 0) OR (p212 <= 0)) AND ((p186 <= 0) OR (p207 <= 0)) AND ((p188 <= 0) OR (p209 <= 0)) AND ((p190 <= 0) OR (p211 <= 0)) AND ((p192 <= 0) OR (p213 <= 0)))))",
"processed_size": 547,
"rewrites": 58
},
"result":
{
"edges": 63,
"markings": 63,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 324
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "G (((p244 <= 0) AND (p245 <= 0) AND (p246 <= 0) AND (p247 <= 0) AND (p242 <= 0) AND (p243 <= 0) AND (p248 <= 0)))",
"processed_size": 113,
"rewrites": 58
},
"result":
{
"edges": 608757,
"markings": 138851,
"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": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "F (G ((G (((1 <= p179) AND (1 <= p180) AND (1 <= p181) AND (1 <= p182) AND (1 <= p183) AND (1 <= p184) AND (1 <= p185) AND (1 <= p260))) AND (1 <= p260))))",
"processed_size": 155,
"rewrites": 58
},
"result":
{
"edges": 26,
"markings": 25,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 2,
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "X (X (G (((1 <= p244) OR (1 <= p245) OR (1 <= p246) OR (1 <= p247) OR (1 <= p242) OR (1 <= p243) OR (1 <= p248)))))",
"processed_size": 121,
"rewrites": 58
},
"result":
{
"edges": 63,
"markings": 63,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 7,
"adisj": 1,
"aneg": 0,
"comp": 14,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "X (G ((((1 <= p189) AND (1 <= p210)) OR ((1 <= p187) AND (1 <= p208)) OR ((1 <= p191) AND (1 <= p212)) OR ((1 <= p186) AND (1 <= p207)) OR ((1 <= p188) AND (1 <= p209)) OR ((1 <= p190) AND (1 <= p211)) OR ((1 <= p192) AND (1 <= p213)))))",
"processed_size": 243,
"rewrites": 58
},
"result":
{
"edges": 63,
"markings": 63,
"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": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 4,
"aconj": 21,
"adisj": 3,
"aneg": 0,
"comp": 42,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 42,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "X (X (X (G ((G ((X ((((1 <= p158) AND (1 <= p221)) OR ((1 <= p162) AND (1 <= p225)) OR ((1 <= p159) AND (1 <= p222)) OR ((1 <= p161) AND (1 <= p224)) OR ((1 <= p163) AND (1 <= p226)) OR ((1 <= p160) AND (1 <= p223)) OR ((1 <= p164) AND (1 <= p227)))) AND (((1 <= p0) AND (1 <= p221)) OR ((1 <= p0) AND (1 <= p222)) OR ((1 <= p0) AND (1 <= p223)) OR ((1 <= p0) AND (1 <= p224)) OR ((1 <= p0) AND (1 <= p225)) OR ((1 <= p0) AND (1 <= p226)) OR ((1 <= p0) AND (1 <= p227))))) AND (((1 <= p0) AND (1 <= p221)) OR ((1 <= p0) AND (1 <= p222)) OR ((1 <= p0) AND (1 <= p223)) OR ((1 <= p0) AND (1 <= p224)) OR ((1 <= p0) AND (1 <= p225)) OR ((1 <= p0) AND (1 <= p226)) OR ((1 <= p0) AND (1 <= p227))))))))",
"processed_size": 715,
"rewrites": 58
},
"result":
{
"edges": 63,
"markings": 63,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 1,
"aconj": 8,
"adisj": 8,
"aneg": 0,
"comp": 29,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 29,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "X ((((((1 <= p0) AND (1 <= p193)) OR ((1 <= p0) AND (1 <= p194)) OR ((1 <= p0) AND (1 <= p195)) OR ((1 <= p0) AND (1 <= p196)) OR ((1 <= p0) AND (1 <= p197)) OR ((1 <= p0) AND (1 <= p198)) OR ((1 <= p0) AND (1 <= p199))) U (((p0 <= 0) OR (p193 <= 0)) AND ((p0 <= 0) OR (p194 <= 0)) AND ((p0 <= 0) OR (p195 <= 0)) AND ((p0 <= 0) OR (p196 <= 0)) AND ((p0 <= 0) OR (p197 <= 0)) AND ((p0 <= 0) OR (p198 <= 0)) AND ((p0 <= 0) OR (p199 <= 0)))) OR G ((1 <= p257))))",
"processed_size": 472,
"rewrites": 58
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 7,
"aneg": 0,
"comp": 14,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "X (F ((((p172 <= 0) OR (p214 <= 0)) AND ((p175 <= 0) OR (p217 <= 0)) AND ((p176 <= 0) OR (p218 <= 0)) AND ((p173 <= 0) OR (p215 <= 0)) AND ((p174 <= 0) OR (p216 <= 0)) AND ((p177 <= 0) OR (p219 <= 0)) AND ((p178 <= 0) OR (p220 <= 0)))))",
"processed_size": 243,
"rewrites": 58
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 712
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "G (F ((F ((p260 <= 0)) AND X (G (((1 <= p151) AND (1 <= p152) AND (1 <= p153) AND (1 <= p154) AND (1 <= p155) AND (1 <= p156) AND (1 <= p157) AND (1 <= p256)))))))",
"processed_size": 163,
"rewrites": 58
},
"result":
{
"edges": 63,
"markings": 63,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "F (G (((1 <= p165) AND (1 <= p166) AND (1 <= p167) AND (1 <= p168) AND (1 <= p169) AND (1 <= p170) AND (1 <= p171) AND (1 <= p258))))",
"processed_size": 133,
"rewrites": 58
},
"result":
{
"edges": 21,
"markings": 20,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 15,
"adisj": 2,
"aneg": 0,
"comp": 36,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 36,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 22,
"visible_transitions": 0
},
"processed": "F (G ((F ((((1 <= p172) AND (1 <= p214)) OR ((1 <= p175) AND (1 <= p217)) OR ((1 <= p176) AND (1 <= p218)) OR ((1 <= p173) AND (1 <= p215)) OR ((1 <= p174) AND (1 <= p216)) OR ((1 <= p177) AND (1 <= p219)) OR ((1 <= p178) AND (1 <= p220)))) AND (((1 <= p165) AND (1 <= p166) AND (1 <= p167) AND (1 <= p168) AND (1 <= p169) AND (1 <= p170) AND (1 <= p171) AND (1 <= p258)) OR (((1 <= p172) AND (1 <= p214)) OR ((1 <= p175) AND (1 <= p217)) OR ((1 <= p176) AND (1 <= p218)) OR ((1 <= p173) AND (1 <= p215)) OR ((1 <= p174) AND (1 <= p216)) OR ((1 <= p177) AND (1 <= p219)) OR ((1 <= p178) AND (1 <= p220)))))))",
"processed_size": 620,
"rewrites": 58
},
"result":
{
"edges": 25,
"markings": 24,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 0,
"aconj": 8,
"adisj": 9,
"aneg": 2,
"comp": 35,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 35,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 29,
"visible_transitions": 0
},
"processed": "G (((G ((((p0 <= 0) OR (p221 <= 0)) AND ((p0 <= 0) OR (p222 <= 0)) AND ((p0 <= 0) OR (p223 <= 0)) AND ((p0 <= 0) OR (p224 <= 0)) AND ((p0 <= 0) OR (p225 <= 0)) AND ((p0 <= 0) OR (p226 <= 0)) AND ((p0 <= 0) OR (p227 <= 0)))) R ((p244 <= 0) AND (p245 <= 0) AND (p246 <= 0) AND (p247 <= 0) AND (p242 <= 0) AND (p243 <= 0) AND (p248 <= 0))) R (((p189 <= 0) OR (p210 <= 0)) AND ((p187 <= 0) OR (p208 <= 0)) AND ((p191 <= 0) OR (p212 <= 0)) AND ((p186 <= 0) OR (p207 <= 0)) AND ((p188 <= 0) OR (p209 <= 0)) AND ((p190 <= 0) OR (p211 <= 0)) AND ((p192 <= 0) OR (p213 <= 0)))))",
"processed_size": 583,
"rewrites": 58
},
"result":
{
"edges": 19,
"markings": 19,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3564
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "((p151 <= 0) OR (p152 <= 0) OR (p153 <= 0) OR (p154 <= 0) OR (p155 <= 0) OR (p156 <= 0) OR (p157 <= 0) OR (p256 <= 0))",
"processed_size": 125,
"rewrites": 60
},
"result":
{
"edges": 18,
"markings": 19,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "((p151 <= 0) OR (p152 <= 0) OR (p153 <= 0) OR (p154 <= 0) OR (p155 <= 0) OR (p156 <= 0) OR (p157 <= 0) OR (p256 <= 0))",
"processed_size": 125,
"rewrites": 60
},
"result":
{
"edges": 18,
"markings": 19,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 7,
"adisj": 1,
"aneg": 0,
"comp": 14,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "G ((((1 <= p189) AND (1 <= p210)) OR ((1 <= p187) AND (1 <= p208)) OR ((1 <= p191) AND (1 <= p212)) OR ((1 <= p186) AND (1 <= p207)) OR ((1 <= p188) AND (1 <= p209)) OR ((1 <= p190) AND (1 <= p211)) OR ((1 <= p192) AND (1 <= p213))))",
"processed_size": 239,
"rewrites": 58
},
"result":
{
"edges": 19,
"markings": 19,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 64308,
"runtime": 6.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G((F((G(**) OR (* AND X(G(**))))) OR **)) : (F(G((G(**) AND **))) OR (X(X(G(**))) OR (G(**) AND F(G(**))))) : X(G(**)) : (X(G(**)) AND **) : F(G((F(**) AND (** OR **)))) : X(X(X(G((G((X(**) AND **)) AND **))))) : (X(((** U **) OR G(**))) AND **) : X(F(**)) : (F(**) OR G(**)) : G(((G(**) R *) R *)) : G(F((F(*) AND X(G(**))))) : F(G(**))"
},
"net":
{
"arcs": 659,
"conflict_clusters": 32,
"places": 270,
"places_significant": 115,
"singleton_clusters": 0,
"transitions": 116
},
"result":
{
"preliminary_value": "no no no no no no yes yes no no no no ",
"value": "no no no no no no yes yes no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 386/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 8640
lola: finding significant places
lola: 270 places, 116 transitions, 115 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: G ((NOT(G (((((p158 <= 0) OR (p221 <= 0)) AND ((p162 <= 0) OR (p225 <= 0)) AND ((p159 <= 0) OR (p222 <= 0)) AND ((p161 <= 0) OR (p224 <= 0)) AND ((p163 <= 0) OR (p226 <= 0)) AND ((p160 <= 0) OR (p223 <= 0)) AND ((p164 <= 0) OR (p227 <= 0))) U NOT(X (G ((1 <= p260))))))) OR ((p260 <= 0) AND ((p189 <= 0) OR (p210 <= 0)) AND ((p187 <= 0) OR (p208 <= 0)) AND ((p191 <= 0) OR (p212 <= 0)) AND ((p186 <= 0) OR (p207 <= 0)) AND ((p188 <= 0) OR (p209 <= 0)) AND ((p190 <= 0) OR (p211 <= 0)) AND ((p192 <= 0) OR (p213 <= 0))))) : (F (G ((G (((1 <= p179) AND (1 <= p180) AND (1 <= p181) AND (1 <= p182) AND (1 <= p183) AND (1 <= p184) AND (1 <= p185) AND (1 <= p260))) AND (1 <= p260)))) OR (G (((p244 <= 0) AND (p245 <= 0) AND (p246 <= 0) AND (p247 <= 0) AND (p242 <= 0) AND (p243 <= 0) AND (p248 <= 0))) U X (X (G (((1 <= p244) OR (1 <= p245) OR (1 <= p246) OR (1 <= p247) OR (1 <= p242) OR (1 <= p243) OR (1 <= p248))))))) : G (X ((1 <= p257))) : (G (X ((((1 <= p189) AND (1 <= p210)) OR ((1 <= p187) AND (1 <= p208)) OR ((1 <= p191) AND (1 <= p212)) OR ((1 <= p186) AND (1 <= p207)) OR ((1 <= p188) AND (1 <= p209)) OR ((1 <= p190) AND (1 <= p211)) OR ((1 <= p192) AND (1 <= p213))))) AND (1 <= p261)) : G (F (X (G (X (X ((((1 <= p165) AND (1 <= p166) AND (1 <= p167) AND (1 <= p168) AND (1 <= p169) AND (1 <= p170) AND (1 <= p171) AND (1 <= p258)) U (((1 <= p172) AND (1 <= p214)) OR ((1 <= p175) AND (1 <= p217)) OR ((1 <= p176) AND (1 <= p218)) OR ((1 <= p173) AND (1 <= p215)) OR ((1 <= p174) AND (1 <= p216)) OR ((1 <= p177) AND (1 <= p219)) OR ((1 <= p178) AND (1 <= p220)))))))))) : X (X (X (G ((G ((X ((((1 <= p158) AND (1 <= p221)) OR ((1 <= p162) AND (1 <= p225)) OR ((1 <= p159) AND (1 <= p222)) OR ((1 <= p161) AND (1 <= p224)) OR ((1 <= p163) AND (1 <= p226)) OR ((1 <= p160) AND (1 <= p223)) OR ((1 <= p164) AND (1 <= p227)))) AND (((1 <= p0) AND (1 <= p221)) OR ((1 <= p0) AND (1 <= p222)) OR ((1 <= p0) AND (1 <= p223)) OR ((1 <= p0) AND (1 <= p224)) OR ((1 <= p0) AND (1 <= p225)) OR ((1 <= p0) AND (1 <= p226)) OR ((1 <= p0) AND (1 <= p227))))) AND (((1 <= p0) AND (1 <= p221)) OR ((1 <= p0) AND (1 <= p222)) OR ((1 <= p0) AND (1 <= p223)) OR ((1 <= p0) AND (1 <= p224)) OR ((1 <= p0) AND (1 <= p225)) OR ((1 <= p0) AND (1 <= p226)) OR ((1 <= p0) AND (1 <= p227)))))))) : (X ((((((1 <= p0) AND (1 <= p193)) OR ((1 <= p0) AND (1 <= p194)) OR ((1 <= p0) AND (1 <= p195)) OR ((1 <= p0) AND (1 <= p196)) OR ((1 <= p0) AND (1 <= p197)) OR ((1 <= p0) AND (1 <= p198)) OR ((1 <= p0) AND (1 <= p199))) U (((p0 <= 0) OR (p193 <= 0)) AND ((p0 <= 0) OR (p194 <= 0)) AND ((p0 <= 0) OR (p195 <= 0)) AND ((p0 <= 0) OR (p196 <= 0)) AND ((p0 <= 0) OR (p197 <= 0)) AND ((p0 <= 0) OR (p198 <= 0)) AND ((p0 <= 0) OR (p199 <= 0)))) OR G ((1 <= p257)))) AND ((1 <= p256) OR (p257 <= 0))) : F (X ((((p172 <= 0) OR (p214 <= 0)) AND ((p175 <= 0) OR (p217 <= 0)) AND ((p176 <= 0) OR (p218 <= 0)) AND ((p173 <= 0) OR (p215 <= 0)) AND ((p174 <= 0) OR (p216 <= 0)) AND ((p177 <= 0) OR (p219 <= 0)) AND ((p178 <= 0) OR (p220 <= 0))))) : (F (((1 <= p151) AND (1 <= p152) AND (1 <= p153) AND (1 <= p154) AND (1 <= p155) AND (1 <= p156) AND (1 <= p157) AND (1 <= p256))) OR G ((((1 <= p189) AND (1 <= p210)) OR ((1 <= p187) AND (1 <= p208)) OR ((1 <= p191) AND (1 <= p212)) OR ((1 <= p186) AND (1 <= p207)) OR ((1 <= p188) AND (1 <= p209)) OR ((1 <= p190) AND (1 <= p211)) OR ((1 <= p192) AND (1 <= p213))))) : G (NOT(((NOT(G ((((p0 <= 0) OR (p221 <= 0)) AND ((p0 <= 0) OR (p222 <= 0)) AND ((p0 <= 0) OR (p223 <= 0)) AND ((p0 <= 0) OR (p224 <= 0)) AND ((p0 <= 0) OR (p225 <= 0)) AND ((p0 <= 0) OR (p226 <= 0)) AND ((p0 <= 0) OR (p227 <= 0))))) U ((1 <= p244) OR (1 <= p245) OR (1 <= p246) OR (1 <= p247) OR (1 <= p242) OR (1 <= p243) OR (1 <= p248))) U (((1 <= p189) AND (1 <= p210)) OR ((1 <= p187) AND (1 <= p208)) OR ((1 <= p191) AND (1 <= p212)) OR ((1 <= p186) AND (1 <= p207)) OR ((1 <= p188) AND (1 <= p209)) OR ((1 <= p190) AND (1 <= p211)) OR ((1 <= p192) AND (1 <= p213)))))) : F (G (F ((NOT(G ((1 <= p260))) AND G (X (((1 <= p151) AND (1 <= p152) AND (1 <= p153) AND (1 <= p154) AND (1 <= p155) AND (1 <= p156) AND (1 <= p157) AND (1 <= p256)))))))) : F (G (F (X (NOT(G (NOT(G (((1 <= p165) AND (1 <= p166) AND (1 <= p167) AND (1 <= p168) AND (1 <= p169) AND (1 <= p170) AND (1 <= p171) AND (1 <= p258))))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:300
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((G ((1 <= p260)) OR ((((1 <= p158) AND (1 <= p221)) OR ((1 <= p162) AND (1 <= p225)) OR ((1 <= p159) AND (1 <= p222)) OR ((1 <= p161) AND (1 <= p224)) OR ((1 <= p163) AND (1 <= p226)) OR ((1 <= p160) AND (1 <= p223)) OR ((1 <= p164) AND (1 <= p227))) AND X (G ((1 <= p260)))))) OR ((p260 <= 0) AND ((p189 <= 0) OR (p210 <= 0)) AND ((p187 <= 0) OR (p208 <= 0)) AND ((p191 <= 0) OR (p21... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((G ((1 <= p260)) OR ((((1 <= p158) AND (1 <= p221)) OR ((1 <= p162) AND (1 <= p225)) OR ((1 <= p159) AND (1 <= p222)) OR ((1 <= p161) AND (1 <= p224)) OR ((1 <= p163) AND (1 <= p226)) OR ((1 <= p160) AND (1 <= p223)) OR ((1 <= p164) AND (1 <= p227))) AND X (G ((1 <= p260)))))) OR ((p260 <= 0) AND ((p189 <= 0) OR (p210 <= 0)) AND ((p187 <= 0) OR (p208 <= 0)) AND ((p191 <= 0) OR (p21... (shortened)
lola: processed formula length: 547
lola: 58 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 63 markings, 63 edges
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((G (((1 <= p179) AND (1 <= p180) AND (1 <= p181) AND (1 <= p182) AND (1 <= p183) AND (1 <= p184) AND (1 <= p185) AND (1 <= p260))) AND (1 <= p260)))) OR (X (X (G (((1 <= p244) OR (1 <= p245) OR (1 <= p246) OR (1 <= p247) OR (1 <= p242) OR (1 <= p243) OR (1 <= p248))))) OR (G (((p244 <= 0) AND (p245 <= 0) AND (p246 <= 0) AND (p247 <= 0) AND (p242 <= 0) AND (p243 <= 0) AND (p248 <= 0)))... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p244 <= 0) AND (p245 <= 0) AND (p246 <= 0) AND (p247 <= 0) AND (p242 <= 0) AND (p243 <= 0) AND (p248 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p244 <= 0) AND (p245 <= 0) AND (p246 <= 0) AND (p247 <= 0) AND (p242 <= 0) AND (p243 <= 0) AND (p248 <= 0)))
lola: processed formula length: 113
lola: 58 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: 138851 markings, 608757 edges
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((G (((1 <= p179) AND (1 <= p180) AND (1 <= p181) AND (1 <= p182) AND (1 <= p183) AND (1 <= p184) AND (1 <= p185) AND (1 <= p260))) AND (1 <= p260))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((G (((1 <= p179) AND (1 <= p180) AND (1 <= p181) AND (1 <= p182) AND (1 <= p183) AND (1 <= p184) AND (1 <= p185) AND (1 <= p260))) AND (1 <= p260))))
lola: processed formula length: 155
lola: 58 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 25 markings, 26 edges
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G (((1 <= p244) OR (1 <= p245) OR (1 <= p246) OR (1 <= p247) OR (1 <= p242) OR (1 <= p243) OR (1 <= p248)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((1 <= p244) OR (1 <= p245) OR (1 <= p246) OR (1 <= p247) OR (1 <= p242) OR (1 <= p243) OR (1 <= p248)))))
lola: processed formula length: 121
lola: 58 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: 63 markings, 63 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((1 <= p257)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((1 <= p257)))
lola: processed formula length: 19
lola: 58 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: 63 markings, 63 edges
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((((1 <= p189) AND (1 <= p210)) OR ((1 <= p187) AND (1 <= p208)) OR ((1 <= p191) AND (1 <= p212)) OR ((1 <= p186) AND (1 <= p207)) OR ((1 <= p188) AND (1 <= p209)) OR ((1 <= p190) AND (1 <= p211)) OR ((1 <= p192) AND (1 <= p213))))) AND (1 <= p261))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p261)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p261)
lola: processed formula length: 11
lola: 58 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((1 <= p189) AND (1 <= p210)) OR ((1 <= p187) AND (1 <= p208)) OR ((1 <= p191) AND (1 <= p212)) OR ((1 <= p186) AND (1 <= p207)) OR ((1 <= p188) AND (1 <= p209)) OR ((1 <= p190) AND (1 <= p211)) OR ((1 <= p192) AND (1 <= p213)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((1 <= p189) AND (1 <= p210)) OR ((1 <= p187) AND (1 <= p208)) OR ((1 <= p191) AND (1 <= p212)) OR ((1 <= p186) AND (1 <= p207)) OR ((1 <= p188) AND (1 <= p209)) OR ((1 <= p190) AND (1 <= p211)) OR ((1 <= p192) AND (1 <= p213)))))
lola: processed formula length: 243
lola: 58 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: 63 markings, 63 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (G ((G ((X ((((1 <= p158) AND (1 <= p221)) OR ((1 <= p162) AND (1 <= p225)) OR ((1 <= p159) AND (1 <= p222)) OR ((1 <= p161) AND (1 <= p224)) OR ((1 <= p163) AND (1 <= p226)) OR ((1 <= p160) AND (1 <= p223)) OR ((1 <= p164) AND (1 <= p227)))) AND (((1 <= p0) AND (1 <= p221)) OR ((1 <= p0) AND (1 <= p222)) OR ((1 <= p0) AND (1 <= p223)) OR ((1 <= p0) AND (1 <= p224)) OR ((1 <= p0)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (G ((G ((X ((((1 <= p158) AND (1 <= p221)) OR ((1 <= p162) AND (1 <= p225)) OR ((1 <= p159) AND (1 <= p222)) OR ((1 <= p161) AND (1 <= p224)) OR ((1 <= p163) AND (1 <= p226)) OR ((1 <= p160) AND (1 <= p223)) OR ((1 <= p164) AND (1 <= p227)))) AND (((1 <= p0) AND (1 <= p221)) OR ((1 <= p0) AND (1 <= p222)) OR ((1 <= p0) AND (1 <= p223)) OR ((1 <= p0) AND (1 <= p224)) OR ((1 <= p0)... (shortened)
lola: processed formula length: 715
lola: 58 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 63 markings, 63 edges
lola: ========================================
lola: subprocess 5 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((((((1 <= p0) AND (1 <= p193)) OR ((1 <= p0) AND (1 <= p194)) OR ((1 <= p0) AND (1 <= p195)) OR ((1 <= p0) AND (1 <= p196)) OR ((1 <= p0) AND (1 <= p197)) OR ((1 <= p0) AND (1 <= p198)) OR ((1 <= p0) AND (1 <= p199))) U (((p0 <= 0) OR (p193 <= 0)) AND ((p0 <= 0) OR (p194 <= 0)) AND ((p0 <= 0) OR (p195 <= 0)) AND ((p0 <= 0) OR (p196 <= 0)) AND ((p0 <= 0) OR (p197 <= 0)) AND ((p0 <= 0... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p256) OR (p257 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p256) OR (p257 <= 0))
lola: processed formula length: 29
lola: 58 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((((1 <= p0) AND (1 <= p193)) OR ((1 <= p0) AND (1 <= p194)) OR ((1 <= p0) AND (1 <= p195)) OR ((1 <= p0) AND (1 <= p196)) OR ((1 <= p0) AND (1 <= p197)) OR ((1 <= p0) AND (1 <= p198)) OR ((1 <= p0) AND (1 <= p199))) U (((p0 <= 0) OR (p193 <= 0)) AND ((p0 <= 0) OR (p194 <= 0)) AND ((p0 <= 0) OR (p195 <= 0)) AND ((p0 <= 0) OR (p196 <= 0)) AND ((p0 <= 0) OR (p197 <= 0)) AND ((p0 <= 0)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((((1 <= p0) AND (1 <= p193)) OR ((1 <= p0) AND (1 <= p194)) OR ((1 <= p0) AND (1 <= p195)) OR ((1 <= p0) AND (1 <= p196)) OR ((1 <= p0) AND (1 <= p197)) OR ((1 <= p0) AND (1 <= p198)) OR ((1 <= p0) AND (1 <= p199))) U (((p0 <= 0) OR (p193 <= 0)) AND ((p0 <= 0) OR (p194 <= 0)) AND ((p0 <= 0) OR (p195 <= 0)) AND ((p0 <= 0) OR (p196 <= 0)) AND ((p0 <= 0) OR (p197 <= 0)) AND ((p0 <= 0)... (shortened)
lola: processed formula length: 472
lola: 58 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: 9 markings, 8 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((((p172 <= 0) OR (p214 <= 0)) AND ((p175 <= 0) OR (p217 <= 0)) AND ((p176 <= 0) OR (p218 <= 0)) AND ((p173 <= 0) OR (p215 <= 0)) AND ((p174 <= 0) OR (p216 <= 0)) AND ((p177 <= 0) OR (p219 <= 0)) AND ((p178 <= 0) OR (p220 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((p172 <= 0) OR (p214 <= 0)) AND ((p175 <= 0) OR (p217 <= 0)) AND ((p176 <= 0) OR (p218 <= 0)) AND ((p173 <= 0) OR (p215 <= 0)) AND ((p174 <= 0) OR (p216 <= 0)) AND ((p177 <= 0) OR (p219 <= 0)) AND ((p178 <= 0) OR (p220 <= 0)))))
lola: processed formula length: 243
lola: 58 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 9 markings, 8 edges
lola: ========================================
lola: subprocess 7 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((F ((p260 <= 0)) AND X (G (((1 <= p151) AND (1 <= p152) AND (1 <= p153) AND (1 <= p154) AND (1 <= p155) AND (1 <= p156) AND (1 <= p157) AND (1 <= p256)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((F ((p260 <= 0)) AND X (G (((1 <= p151) AND (1 <= p152) AND (1 <= p153) AND (1 <= p154) AND (1 <= p155) AND (1 <= p156) AND (1 <= p157) AND (1 <= p256)))))))
lola: processed formula length: 163
lola: 58 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 63 markings, 63 edges
lola: ========================================
lola: subprocess 8 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p165) AND (1 <= p166) AND (1 <= p167) AND (1 <= p168) AND (1 <= p169) AND (1 <= p170) AND (1 <= p171) AND (1 <= p258))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((1 <= p165) AND (1 <= p166) AND (1 <= p167) AND (1 <= p168) AND (1 <= p169) AND (1 <= p170) AND (1 <= p171) AND (1 <= p258))))
lola: processed formula length: 133
lola: 58 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: 20 markings, 21 edges
lola: ========================================
lola: subprocess 9 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((((1 <= p172) AND (1 <= p214)) OR ((1 <= p175) AND (1 <= p217)) OR ((1 <= p176) AND (1 <= p218)) OR ((1 <= p173) AND (1 <= p215)) OR ((1 <= p174) AND (1 <= p216)) OR ((1 <= p177) AND (1 <= p219)) OR ((1 <= p178) AND (1 <= p220)))) AND (((1 <= p165) AND (1 <= p166) AND (1 <= p167) AND (1 <= p168) AND (1 <= p169) AND (1 <= p170) AND (1 <= p171) AND (1 <= p258)) OR (((1 <= p172) AND (... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((((1 <= p172) AND (1 <= p214)) OR ((1 <= p175) AND (1 <= p217)) OR ((1 <= p176) AND (1 <= p218)) OR ((1 <= p173) AND (1 <= p215)) OR ((1 <= p174) AND (1 <= p216)) OR ((1 <= p177) AND (1 <= p219)) OR ((1 <= p178) AND (1 <= p220)))) AND (((1 <= p165) AND (1 <= p166) AND (1 <= p167) AND (1 <= p168) AND (1 <= p169) AND (1 <= p170) AND (1 <= p171) AND (1 <= p258)) OR (((1 <= p172) AND (... (shortened)
lola: processed formula length: 620
lola: 58 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 24 markings, 25 edges
lola: ========================================
lola: subprocess 10 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((G ((((p0 <= 0) OR (p221 <= 0)) AND ((p0 <= 0) OR (p222 <= 0)) AND ((p0 <= 0) OR (p223 <= 0)) AND ((p0 <= 0) OR (p224 <= 0)) AND ((p0 <= 0) OR (p225 <= 0)) AND ((p0 <= 0) OR (p226 <= 0)) AND ((p0 <= 0) OR (p227 <= 0)))) R ((p244 <= 0) AND (p245 <= 0) AND (p246 <= 0) AND (p247 <= 0) AND (p242 <= 0) AND (p243 <= 0) AND (p248 <= 0))) R (((p189 <= 0) OR (p210 <= 0)) AND ((p187 <= 0) OR (p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((G ((((p0 <= 0) OR (p221 <= 0)) AND ((p0 <= 0) OR (p222 <= 0)) AND ((p0 <= 0) OR (p223 <= 0)) AND ((p0 <= 0) OR (p224 <= 0)) AND ((p0 <= 0) OR (p225 <= 0)) AND ((p0 <= 0) OR (p226 <= 0)) AND ((p0 <= 0) OR (p227 <= 0)))) R ((p244 <= 0) AND (p245 <= 0) AND (p246 <= 0) AND (p247 <= 0) AND (p242 <= 0) AND (p243 <= 0) AND (p248 <= 0))) R (((p189 <= 0) OR (p210 <= 0)) AND ((p187 <= 0) OR (p... (shortened)
lola: processed formula length: 583
lola: 58 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: 19 markings, 19 edges
lola: ========================================
lola: subprocess 11 will run for 3564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p151) AND (1 <= p152) AND (1 <= p153) AND (1 <= p154) AND (1 <= p155) AND (1 <= p156) AND (1 <= p157) AND (1 <= p256))) OR G ((((1 <= p189) AND (1 <= p210)) OR ((1 <= p187) AND (1 <= p208)) OR ((1 <= p191) AND (1 <= p212)) OR ((1 <= p186) AND (1 <= p207)) OR ((1 <= p188) AND (1 <= p209)) OR ((1 <= p190) AND (1 <= p211)) OR ((1 <= p192) AND (1 <= p213)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 3564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p151) AND (1 <= p152) AND (1 <= p153) AND (1 <= p154) AND (1 <= p155) AND (1 <= p156) AND (1 <= p157) AND (1 <= p256)))
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: ((p151 <= 0) OR (p152 <= 0) OR (p153 <= 0) OR (p154 <= 0) OR (p155 <= 0) OR (p156 <= 0) OR (p157 <= 0) OR (p256 <= 0))
lola: processed formula length: 125
lola: 60 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 19 markings, 18 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p151) AND (1 <= p152) AND (1 <= p153) AND (1 <= p154) AND (1 <= p155) AND (1 <= p156) AND (1 <= p157) AND (1 <= p256))) OR G ((((1 <= p189) AND (1 <= p210)) OR ((1 <= p187) AND (1 <= p208)) OR ((1 <= p191) AND (1 <= p212)) OR ((1 <= p186) AND (1 <= p207)) OR ((1 <= p188) AND (1 <= p209)) OR ((1 <= p190) AND (1 <= p211)) OR ((1 <= p192) AND (1 <= p213)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: F (((1 <= p151) AND (1 <= p152) AND (1 <= p153) AND (1 <= p154) AND (1 <= p155) AND (1 <= p156) AND (1 <= p157) AND (1 <= p256)))
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: ((p151 <= 0) OR (p152 <= 0) OR (p153 <= 0) OR (p154 <= 0) OR (p155 <= 0) OR (p156 <= 0) OR (p157 <= 0) OR (p256 <= 0))
lola: processed formula length: 125
lola: 60 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 19 markings, 18 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G ((((1 <= p189) AND (1 <= p210)) OR ((1 <= p187) AND (1 <= p208)) OR ((1 <= p191) AND (1 <= p212)) OR ((1 <= p186) AND (1 <= p207)) OR ((1 <= p188) AND (1 <= p209)) OR ((1 <= p190) AND (1 <= p211)) OR ((1 <= p192) AND (1 <= p213))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((1 <= p189) AND (1 <= p210)) OR ((1 <= p187) AND (1 <= p208)) OR ((1 <= p191) AND (1 <= p212)) OR ((1 <= p186) AND (1 <= p207)) OR ((1 <= p188) AND (1 <= p209)) OR ((1 <= p190) AND (1 <= p211)) OR ((1 <= p192) AND (1 <= p213))))
lola: processed formula length: 239
lola: 58 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: 19 markings, 19 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no yes yes no no no no
lola:
preliminary result: no no no no no no yes yes no no no no
lola: memory consumption: 64308 KB
lola: time consumption: 6 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="QuasiCertifProtocol-COL-06"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is QuasiCertifProtocol-COL-06, 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 r189-tajo-162089432400010"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-06.tgz
mv QuasiCertifProtocol-COL-06 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 ;