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-162089432400038.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-PT-06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r189-tajo-162089432400038
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 60K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 430K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 25K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 167K 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 8.2K Mar 28 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Mar 28 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 28 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Mar 27 09:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 27 09:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Mar 25 13:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 25 13:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 22 08:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Mar 22 08:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 153K 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-PT-06-00
FORMULA_NAME QuasiCertifProtocol-PT-06-01
FORMULA_NAME QuasiCertifProtocol-PT-06-02
FORMULA_NAME QuasiCertifProtocol-PT-06-03
FORMULA_NAME QuasiCertifProtocol-PT-06-04
FORMULA_NAME QuasiCertifProtocol-PT-06-05
FORMULA_NAME QuasiCertifProtocol-PT-06-06
FORMULA_NAME QuasiCertifProtocol-PT-06-07
FORMULA_NAME QuasiCertifProtocol-PT-06-08
FORMULA_NAME QuasiCertifProtocol-PT-06-09
FORMULA_NAME QuasiCertifProtocol-PT-06-10
FORMULA_NAME QuasiCertifProtocol-PT-06-11
FORMULA_NAME QuasiCertifProtocol-PT-06-12
FORMULA_NAME QuasiCertifProtocol-PT-06-13
FORMULA_NAME QuasiCertifProtocol-PT-06-14
FORMULA_NAME QuasiCertifProtocol-PT-06-15

=== Now, execution of the tool begins

BK_START 1621408845668

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 07:20:47] [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:20:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 07:20:47] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2021-05-19 07:20:47] [INFO ] Transformed 270 places.
[2021-05-19 07:20:47] [INFO ] Transformed 116 transitions.
[2021-05-19 07:20:47] [INFO ] Parsed PT model containing 270 places and 116 transitions in 101 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 9835 resets, run finished after 449 ms. (steps per millisecond=222 ) properties seen :[0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1]
// Phase 1: matrix 116 rows 270 cols
[2021-05-19 07:20:48] [INFO ] Computed 155 place invariants in 16 ms
[2021-05-19 07:20:48] [INFO ] [Real]Absence check using 3 positive place invariants in 20 ms returned sat
[2021-05-19 07:20:48] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 77 ms returned sat
[2021-05-19 07:20:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:48] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2021-05-19 07:20:48] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 11 ms.
[2021-05-19 07:20:48] [INFO ] Added : 21 causal constraints over 5 iterations in 91 ms. Result :sat
[2021-05-19 07:20:48] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2021-05-19 07:20:48] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 43 ms returned sat
[2021-05-19 07:20:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:49] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2021-05-19 07:20:49] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 10 ms.
[2021-05-19 07:20:49] [INFO ] Added : 50 causal constraints over 10 iterations in 110 ms. Result :sat
[2021-05-19 07:20:49] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-19 07:20:49] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 42 ms returned sat
[2021-05-19 07:20:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:49] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2021-05-19 07:20:49] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 7 ms.
[2021-05-19 07:20:49] [INFO ] Added : 50 causal constraints over 10 iterations in 103 ms. Result :sat
[2021-05-19 07:20:49] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2021-05-19 07:20:49] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 42 ms returned sat
[2021-05-19 07:20:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:49] [INFO ] [Real]Absence check using state equation in 141 ms returned unsat
[2021-05-19 07:20:49] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-19 07:20:49] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 37 ms returned sat
[2021-05-19 07:20:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:50] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2021-05-19 07:20:50] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2021-05-19 07:20:50] [INFO ] Added : 18 causal constraints over 4 iterations in 45 ms. Result :sat
[2021-05-19 07:20:50] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2021-05-19 07:20:50] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 35 ms returned sat
[2021-05-19 07:20:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:50] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2021-05-19 07:20:50] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 11 ms.
[2021-05-19 07:20:50] [INFO ] Added : 25 causal constraints over 5 iterations in 56 ms. Result :sat
[2021-05-19 07:20:50] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-19 07:20:50] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 67 ms returned sat
[2021-05-19 07:20:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:50] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2021-05-19 07:20:50] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 9 ms.
[2021-05-19 07:20:50] [INFO ] Added : 25 causal constraints over 5 iterations in 63 ms. Result :sat
[2021-05-19 07:20:50] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2021-05-19 07:20:50] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 56 ms returned sat
[2021-05-19 07:20:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:51] [INFO ] [Real]Absence check using state equation in 212 ms returned sat
[2021-05-19 07:20:51] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2021-05-19 07:20:51] [INFO ] Added : 17 causal constraints over 4 iterations in 56 ms. Result :sat
[2021-05-19 07:20:51] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2021-05-19 07:20:51] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 67 ms returned sat
[2021-05-19 07:20:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:51] [INFO ] [Real]Absence check using state equation in 207 ms returned sat
[2021-05-19 07:20:51] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 9 ms.
[2021-05-19 07:20:51] [INFO ] Added : 21 causal constraints over 5 iterations in 63 ms. Result :sat
[2021-05-19 07:20:51] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2021-05-19 07:20:51] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 51 ms returned sat
[2021-05-19 07:20:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:51] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2021-05-19 07:20:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 07:20:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2021-05-19 07:20:51] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 49 ms returned sat
[2021-05-19 07:20:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:52] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2021-05-19 07:20:52] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 7 ms.
[2021-05-19 07:20:52] [INFO ] Added : 17 causal constraints over 4 iterations in 92 ms. Result :sat
[2021-05-19 07:20:52] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2021-05-19 07:20:52] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 52 ms returned sat
[2021-05-19 07:20:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:52] [INFO ] [Real]Absence check using state equation in 187 ms returned unsat
[2021-05-19 07:20:52] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2021-05-19 07:20:52] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 54 ms returned sat
[2021-05-19 07:20:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:52] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2021-05-19 07:20:52] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 6 ms.
[2021-05-19 07:20:52] [INFO ] Added : 50 causal constraints over 10 iterations in 148 ms. Result :sat
[2021-05-19 07:20:52] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2021-05-19 07:20:53] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 61 ms returned sat
[2021-05-19 07:20:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:53] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2021-05-19 07:20:53] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2021-05-19 07:20:53] [INFO ] Added : 33 causal constraints over 7 iterations in 115 ms. Result :sat
[2021-05-19 07:20:53] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2021-05-19 07:20:53] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 66 ms returned sat
[2021-05-19 07:20:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:53] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2021-05-19 07:20:53] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 7 ms.
[2021-05-19 07:20:53] [INFO ] Added : 27 causal constraints over 6 iterations in 68 ms. Result :sat
[2021-05-19 07:20:53] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2021-05-19 07:20:53] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 46 ms returned sat
[2021-05-19 07:20:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:53] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2021-05-19 07:20:53] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 7 ms.
[2021-05-19 07:20:54] [INFO ] Added : 27 causal constraints over 6 iterations in 77 ms. Result :sat
[2021-05-19 07:20:54] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2021-05-19 07:20:54] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 61 ms returned sat
[2021-05-19 07:20:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:54] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2021-05-19 07:20:54] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 6 ms.
[2021-05-19 07:20:54] [INFO ] Added : 27 causal constraints over 6 iterations in 85 ms. Result :sat
[2021-05-19 07:20:54] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2021-05-19 07:20:54] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 54 ms returned sat
[2021-05-19 07:20:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:54] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2021-05-19 07:20:54] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 7 ms.
[2021-05-19 07:20:54] [INFO ] Added : 28 causal constraints over 6 iterations in 70 ms. Result :sat
[2021-05-19 07:20:54] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2021-05-19 07:20:54] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 64 ms returned sat
[2021-05-19 07:20:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:55] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2021-05-19 07:20:55] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 7 ms.
[2021-05-19 07:20:55] [INFO ] Added : 27 causal constraints over 6 iterations in 75 ms. Result :sat
[2021-05-19 07:20:55] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2021-05-19 07:20:55] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 50 ms returned sat
[2021-05-19 07:20:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:55] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2021-05-19 07:20:55] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2021-05-19 07:20:55] [INFO ] Added : 27 causal constraints over 6 iterations in 96 ms. Result :sat
[2021-05-19 07:20:55] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2021-05-19 07:20:55] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 62 ms returned sat
[2021-05-19 07:20:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:55] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2021-05-19 07:20:56] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 9 ms.
[2021-05-19 07:20:56] [INFO ] Added : 27 causal constraints over 6 iterations in 85 ms. Result :sat
[2021-05-19 07:20:56] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2021-05-19 07:20:56] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 62 ms returned sat
[2021-05-19 07:20:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:56] [INFO ] [Real]Absence check using state equation in 281 ms returned sat
[2021-05-19 07:20:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 07:20:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2021-05-19 07:20:56] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 60 ms returned sat
[2021-05-19 07:20:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:56] [INFO ] [Nat]Absence check using state equation in 228 ms returned sat
[2021-05-19 07:20:56] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 17 ms.
[2021-05-19 07:20:57] [INFO ] Added : 34 causal constraints over 7 iterations in 279 ms. Result :sat
[2021-05-19 07:20:57] [INFO ] [Real]Absence check using 3 positive place invariants in 35 ms returned sat
[2021-05-19 07:20:57] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 78 ms returned sat
[2021-05-19 07:20:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:57] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2021-05-19 07:20:57] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 18 ms.
[2021-05-19 07:20:57] [INFO ] Added : 24 causal constraints over 5 iterations in 78 ms. Result :sat
[2021-05-19 07:20:57] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2021-05-19 07:20:57] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 41 ms returned sat
[2021-05-19 07:20:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:57] [INFO ] [Real]Absence check using state equation in 89 ms returned unsat
[2021-05-19 07:20:57] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2021-05-19 07:20:57] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 33 ms returned sat
[2021-05-19 07:20:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:57] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2021-05-19 07:20:58] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 5 ms.
[2021-05-19 07:20:58] [INFO ] Added : 49 causal constraints over 10 iterations in 84 ms. Result :sat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2021-05-19 07:20:58] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2021-05-19 07:20:58] [INFO ] Flatten gal took : 91 ms
FORMULA QuasiCertifProtocol-PT-06-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 07:20:58] [INFO ] Flatten gal took : 19 ms
[2021-05-19 07:20:58] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2021-05-19 07:20:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 5 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ QuasiCertifProtocol-PT-06 @ 3570 seconds

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

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

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

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

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

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

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

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

FORMULA QuasiCertifProtocol-PT-06-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA QuasiCertifProtocol-PT-06-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3455
rslt: Output for LTLFireability @ QuasiCertifProtocol-PT-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:20:58 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"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 <= p60)) OR ((((1 <= p36) AND (1 <= p240)) OR ((1 <= p35) AND (1 <= p239)) OR ((1 <= p33) AND (1 <= p237)) OR ((1 <= p34) AND (1 <= p238)) OR ((1 <= p39) AND (1 <= p256)) OR ((1 <= p30) AND (1 <= p242)) OR ((1 <= p29) AND (1 <= p241))) AND X (G ((1 <= p60)))))) OR ((p60 <= 0) AND ((p47 <= 0) OR (p208 <= 0)) AND ((p48 <= 0) OR (p207 <= 0)) AND ((p50 <= 0) OR (p232 <= 0)) AND ((p46 <= 0) OR (p236 <= 0)) AND ((p45 <= 0) OR (p235 <= 0)) AND ((p51 <= 0) OR (p233 <= 0)) AND ((p52 <= 0) OR (p234 <= 0)))))",
"processed_size": 530,
"rewrites": 65
},
"result":
{
"edges": 10,
"markings": 10,
"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": 356
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"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 (((p16 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0)))",
"processed_size": 105,
"rewrites": 65
},
"result":
{
"edges": 623391,
"markings": 137422,
"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": 396
},
"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 <= p60) AND (1 <= p225) AND (1 <= p226) AND (1 <= p227) AND (1 <= p228) AND (1 <= p229) AND (1 <= p230) AND (1 <= p231))) AND (1 <= p60))))",
"processed_size": 153,
"rewrites": 65
},
"result":
{
"edges": 13,
"markings": 12,
"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": 445
},
"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 <= p16) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14)))))",
"processed_size": 113,
"rewrites": 65
},
"result":
{
"edges": 10,
"markings": 10,
"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": 396
},
"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 <= p54)))",
"processed_size": 18,
"rewrites": 65
},
"result":
{
"edges": 10,
"markings": 10,
"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": 445
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"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 <= p253)",
"processed_size": 11,
"rewrites": 65
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"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 <= p47) AND (1 <= p208)) OR ((1 <= p48) AND (1 <= p207)) OR ((1 <= p50) AND (1 <= p232)) OR ((1 <= p46) AND (1 <= p236)) OR ((1 <= p45) AND (1 <= p235)) OR ((1 <= p51) AND (1 <= p233)) OR ((1 <= p52) AND (1 <= p234)))))",
"processed_size": 236,
"rewrites": 65
},
"result":
{
"edges": 10,
"markings": 10,
"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": 509
},
"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 <= p36) AND (1 <= p240)) OR ((1 <= p35) AND (1 <= p239)) OR ((1 <= p33) AND (1 <= p237)) OR ((1 <= p34) AND (1 <= p238)) OR ((1 <= p39) AND (1 <= p256)) OR ((1 <= p30) AND (1 <= p242)) OR ((1 <= p29) AND (1 <= p241)))) AND (((1 <= p0) AND (1 <= p36)) OR ((1 <= p0) AND (1 <= p39)) OR ((1 <= p0) AND (1 <= p33)) OR ((1 <= p0) AND (1 <= p35)) OR ((1 <= p0) AND (1 <= p34)) OR ((1 <= p0) AND (1 <= p29)) OR ((1 <= p0) AND (1 <= p30))))) AND (((1 <= p0) AND (1 <= p36)) OR ((1 <= p0) AND (1 <= p39)) OR ((1 <= p0) AND (1 <= p33)) OR ((1 <= p0) AND (1 <= p35)) OR ((1 <= p0) AND (1 <= p34)) OR ((1 <= p0) AND (1 <= p29)) OR ((1 <= p0) AND (1 <= p30))))))))",
"processed_size": 694,
"rewrites": 65
},
"result":
{
"edges": 10,
"markings": 10,
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"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": "X (F (((1 <= p60) AND (1 <= p225) AND (1 <= p226) AND (1 <= p227) AND (1 <= p228) AND (1 <= p229) AND (1 <= p230) AND (1 <= p231))))",
"processed_size": 132,
"rewrites": 65
},
"result":
{
"edges": 10,
"markings": 10,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (G ((p53 <= 0)))",
"processed_size": 18,
"rewrites": 65
},
"result":
{
"edges": 72433,
"markings": 14653,
"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"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"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 <= p49)",
"processed_size": 10,
"rewrites": 65
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (X ((p60 <= 0)))",
"processed_size": 18,
"rewrites": 65
},
"result":
{
"edges": 17,
"markings": 17,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 2,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((F ((p49 <= 0)) AND G ((F (((p0 <= 0) OR (p3 <= 0))) AND ((1 <= p11) OR ((p0 <= 0) OR (p3 <= 0)))))))",
"processed_size": 106,
"rewrites": 65
},
"result":
{
"edges": 85600537,
"markings": 10194351,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 8,
"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": 1730
},
"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 <= p44) AND (1 <= p251)) OR ((1 <= p38) AND (1 <= p222)) OR ((1 <= p40) AND (1 <= p224)) OR ((1 <= p37) AND (1 <= p223)) OR ((1 <= p42) AND (1 <= p249)) OR ((1 <= p43) AND (1 <= p221)) OR ((1 <= p41) AND (1 <= p252)))) AND (((1 <= p55) AND (1 <= p243) AND (1 <= p244) AND (1 <= p245) AND (1 <= p246) AND (1 <= p247) AND (1 <= p248) AND (1 <= p250)) OR (((1 <= p44) AND (1 <= p251)) OR ((1 <= p38) AND (1 <= p222)) OR ((1 <= p40) AND (1 <= p224)) OR ((1 <= p37) AND (1 <= p223)) OR ((1 <= p42) AND (1 <= p249)) OR ((1 <= p43) AND (1 <= p221)) OR ((1 <= p41) AND (1 <= p252)))))))",
"processed_size": 605,
"rewrites": 65
},
"result":
{
"edges": 13,
"markings": 12,
"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": 3461
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3461
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G ((p54 <= 0))",
"processed_size": 14,
"rewrites": 65
},
"result":
{
"edges": 52805,
"markings": 15610,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G ((p54 <= 0))",
"processed_size": 14,
"rewrites": 65
},
"result":
{
"edges": 52805,
"markings": 15610,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(G ((1 <= p54)) R ((p11 <= 0) AND (F ((p54 <= 0)) OR G ((p11 <= 0)))))",
"processed_size": 70,
"rewrites": 65
},
"result":
{
"edges": 4412872,
"markings": 368214,
"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"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 46844,
"runtime": 115.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 **))))) : ((G(**) R (* AND (F(*) OR G(*)))) OR G(*)) : X(F(**)) : X(G(*)) : F((F(*) AND G((F(**) AND (** OR **))))) : (** OR ((F(**) AND F(G(*))) OR X(X(*))))"
},
"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 no no no yes no ",
"value": "no no no no 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: 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 (((((p36 <= 0) OR (p240 <= 0)) AND ((p35 <= 0) OR (p239 <= 0)) AND ((p33 <= 0) OR (p237 <= 0)) AND ((p34 <= 0) OR (p238 <= 0)) AND ((p39 <= 0) OR (p256 <= 0)) AND ((p30 <= 0) OR (p242 <= 0)) AND ((p29 <= 0) OR (p241 <= 0))) U NOT(X (G ((1 <= p60))))))) OR ((p60 <= 0) AND ((p47 <= 0) OR (p208 <= 0)) AND ((p48 <= 0) OR (p207 <= 0)) AND ((p50 <= 0) OR (p232 <= 0)) AND ((p46 <= 0) OR (p236 <= 0)) AND ((p45 <= 0) OR (p235 <= 0)) AND ((p51 <= 0) OR (p233 <= 0)) AND ((p52 <= 0) OR (p234 <= 0))))) : (F (G ((G (((1 <= p60) AND (1 <= p225) AND (1 <= p226) AND (1 <= p227) AND (1 <= p228) AND (1 <= p229) AND (1 <= p230) AND (1 <= p231))) AND (1 <= p60)))) OR (G (((p16 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0))) U X (X (G (((1 <= p16) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))))))) : G (X ((1 <= p54))) : (G (X ((((1 <= p47) AND (1 <= p208)) OR ((1 <= p48) AND (1 <= p207)) OR ((1 <= p50) AND (1 <= p232)) OR ((1 <= p46) AND (1 <= p236)) OR ((1 <= p45) AND (1 <= p235)) OR ((1 <= p51) AND (1 <= p233)) OR ((1 <= p52) AND (1 <= p234))))) AND (1 <= p253)) : G (F (X (G (X (X ((((1 <= p55) AND (1 <= p243) AND (1 <= p244) AND (1 <= p245) AND (1 <= p246) AND (1 <= p247) AND (1 <= p248) AND (1 <= p250)) U (((1 <= p44) AND (1 <= p251)) OR ((1 <= p38) AND (1 <= p222)) OR ((1 <= p40) AND (1 <= p224)) OR ((1 <= p37) AND (1 <= p223)) OR ((1 <= p42) AND (1 <= p249)) OR ((1 <= p43) AND (1 <= p221)) OR ((1 <= p41) AND (1 <= p252)))))))))) : X (X (X (G ((G ((X ((((1 <= p36) AND (1 <= p240)) OR ((1 <= p35) AND (1 <= p239)) OR ((1 <= p33) AND (1 <= p237)) OR ((1 <= p34) AND (1 <= p238)) OR ((1 <= p39) AND (1 <= p256)) OR ((1 <= p30) AND (1 <= p242)) OR ((1 <= p29) AND (1 <= p241)))) AND (((1 <= p0) AND (1 <= p36)) OR ((1 <= p0) AND (1 <= p39)) OR ((1 <= p0) AND (1 <= p33)) OR ((1 <= p0) AND (1 <= p35)) OR ((1 <= p0) AND (1 <= p34)) OR ((1 <= p0) AND (1 <= p29)) OR ((1 <= p0) AND (1 <= p30))))) AND (((1 <= p0) AND (1 <= p36)) OR ((1 <= p0) AND (1 <= p39)) OR ((1 <= p0) AND (1 <= p33)) OR ((1 <= p0) AND (1 <= p35)) OR ((1 <= p0) AND (1 <= p34)) OR ((1 <= p0) AND (1 <= p29)) OR ((1 <= p0) AND (1 <= p30)))))))) : (NOT((NOT(G ((1 <= p54))) U (G ((1 <= p54)) U (1 <= p11)))) OR NOT(F ((1 <= p54)))) : F (X (((1 <= p60) AND (1 <= p225) AND (1 <= p226) AND (1 <= p227) AND (1 <= p228) AND (1 <= p229) AND (1 <= p230) AND (1 <= p231)))) : X (NOT(F ((1 <= p53)))) : F ((NOT(G ((1 <= p49))) AND G (((1 <= p11) U ((p0 <= 0) OR (p3 <= 0)))))) : ((NOT(G (F (((1 <= p0) AND (1 <= p43))))) U (1 <= p49)) OR X (NOT(X ((1 <= p60)))))
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
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:318
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
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:428
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((G ((1 <= p60)) OR ((((1 <= p36) AND (1 <= p240)) OR ((1 <= p35) AND (1 <= p239)) OR ((1 <= p33) AND (1 <= p237)) OR ((1 <= p34) AND (1 <= p238)) OR ((1 <= p39) AND (1 <= p256)) OR ((1 <= p30) AND (1 <= p242)) OR ((1 <= p29) AND (1 <= p241))) AND X (G ((1 <= p60)))))) OR ((p60 <= 0) AND ((p47 <= 0) OR (p208 <= 0)) AND ((p48 <= 0) OR (p207 <= 0)) AND ((p50 <= 0) OR (p232 <= 0)) AND ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((G ((1 <= p60)) OR ((((1 <= p36) AND (1 <= p240)) OR ((1 <= p35) AND (1 <= p239)) OR ((1 <= p33) AND (1 <= p237)) OR ((1 <= p34) AND (1 <= p238)) OR ((1 <= p39) AND (1 <= p256)) OR ((1 <= p30) AND (1 <= p242)) OR ((1 <= p29) AND (1 <= p241))) AND X (G ((1 <= p60)))))) OR ((p60 <= 0) AND ((p47 <= 0) OR (p208 <= 0)) AND ((p48 <= 0) OR (p207 <= 0)) AND ((p50 <= 0) OR (p232 <= 0)) AND ... (shortened)
lola: processed formula length: 530
lola: 65 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: 10 markings, 10 edges
lola: ========================================
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((G (((1 <= p60) AND (1 <= p225) AND (1 <= p226) AND (1 <= p227) AND (1 <= p228) AND (1 <= p229) AND (1 <= p230) AND (1 <= p231))) AND (1 <= p60)))) OR (X (X (G (((1 <= p16) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))))) OR (G (((p16 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0))) AND F (G (((1 <= ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p16 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p16 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0)))
lola: processed formula length: 105
lola: 65 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: 137422 markings, 623391 edges
lola: ========================================
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((G (((1 <= p60) AND (1 <= p225) AND (1 <= p226) AND (1 <= p227) AND (1 <= p228) AND (1 <= p229) AND (1 <= p230) AND (1 <= p231))) AND (1 <= p60))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((G (((1 <= p60) AND (1 <= p225) AND (1 <= p226) AND (1 <= p227) AND (1 <= p228) AND (1 <= p229) AND (1 <= p230) AND (1 <= p231))) AND (1 <= p60))))
lola: processed formula length: 153
lola: 65 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: 12 markings, 13 edges
lola: ========================================
lola: subprocess 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G (((1 <= p16) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((1 <= p16) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14)))))
lola: processed formula length: 113
lola: 65 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: 10 markings, 10 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((1 <= p54)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((1 <= p54)))
lola: processed formula length: 18
lola: 65 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: 10 markings, 10 edges
lola: ========================================
lola: subprocess 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((((1 <= p47) AND (1 <= p208)) OR ((1 <= p48) AND (1 <= p207)) OR ((1 <= p50) AND (1 <= p232)) OR ((1 <= p46) AND (1 <= p236)) OR ((1 <= p45) AND (1 <= p235)) OR ((1 <= p51) AND (1 <= p233)) OR ((1 <= p52) AND (1 <= p234))))) AND (1 <= p253))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p253)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p253)
lola: processed formula length: 11
lola: 65 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 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((1 <= p47) AND (1 <= p208)) OR ((1 <= p48) AND (1 <= p207)) OR ((1 <= p50) AND (1 <= p232)) OR ((1 <= p46) AND (1 <= p236)) OR ((1 <= p45) AND (1 <= p235)) OR ((1 <= p51) AND (1 <= p233)) OR ((1 <= p52) AND (1 <= p234)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((1 <= p47) AND (1 <= p208)) OR ((1 <= p48) AND (1 <= p207)) OR ((1 <= p50) AND (1 <= p232)) OR ((1 <= p46) AND (1 <= p236)) OR ((1 <= p45) AND (1 <= p235)) OR ((1 <= p51) AND (1 <= p233)) OR ((1 <= p52) AND (1 <= p234)))))
lola: processed formula length: 236
lola: 65 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: 10 markings, 10 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (G ((G ((X ((((1 <= p36) AND (1 <= p240)) OR ((1 <= p35) AND (1 <= p239)) OR ((1 <= p33) AND (1 <= p237)) OR ((1 <= p34) AND (1 <= p238)) OR ((1 <= p39) AND (1 <= p256)) OR ((1 <= p30) AND (1 <= p242)) OR ((1 <= p29) AND (1 <= p241)))) AND (((1 <= p0) AND (1 <= p36)) OR ((1 <= p0) AND (1 <= p39)) OR ((1 <= p0) AND (1 <= p33)) OR ((1 <= p0) AND (1 <= p35)) OR ((1 <= p0) AND (1 <= ... (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 <= p36) AND (1 <= p240)) OR ((1 <= p35) AND (1 <= p239)) OR ((1 <= p33) AND (1 <= p237)) OR ((1 <= p34) AND (1 <= p238)) OR ((1 <= p39) AND (1 <= p256)) OR ((1 <= p30) AND (1 <= p242)) OR ((1 <= p29) AND (1 <= p241)))) AND (((1 <= p0) AND (1 <= p36)) OR ((1 <= p0) AND (1 <= p39)) OR ((1 <= p0) AND (1 <= p33)) OR ((1 <= p0) AND (1 <= p35)) OR ((1 <= p0) AND (1 <= ... (shortened)
lola: processed formula length: 694
lola: 65 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: 10 markings, 10 edges
lola: ========================================
lola: subprocess 5 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((1 <= p60) AND (1 <= p225) AND (1 <= p226) AND (1 <= p227) AND (1 <= p228) AND (1 <= p229) AND (1 <= p230) AND (1 <= p231))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((1 <= p60) AND (1 <= p225) AND (1 <= p226) AND (1 <= p227) AND (1 <= p228) AND (1 <= p229) AND (1 <= p230) AND (1 <= p231))))
lola: processed formula length: 132
lola: 65 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: 10 markings, 10 edges
lola: ========================================
lola: subprocess 6 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p53 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p53 <= 0)))
lola: processed formula length: 18
lola: 65 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: 14653 markings, 72433 edges
lola: ========================================
lola: subprocess 7 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p49) OR ((F ((1 <= p49)) AND F (G (((p0 <= 0) OR (p43 <= 0))))) OR X (X ((p60 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p49))
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: (p49 <= 0)
lola: processed formula length: 10
lola: 67 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: 11 markings, 10 edges
lola: ========================================
lola: subprocess 8 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p49)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p49)
lola: processed formula length: 10
lola: 65 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 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 9 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((p60 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((p60 <= 0)))
lola: processed formula length: 18
lola: 65 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: 17 markings, 17 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F ((p49 <= 0)) AND G ((F (((p0 <= 0) OR (p3 <= 0))) AND ((1 <= p11) OR ((p0 <= 0) OR (p3 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F ((p49 <= 0)) AND G ((F (((p0 <= 0) OR (p3 <= 0))) AND ((1 <= p11) OR ((p0 <= 0) OR (p3 <= 0)))))))
lola: processed formula length: 106
lola: 65 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: 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: 716146 markings, 3850547 edges, 143229 markings/sec, 0 secs
lola: 1006767 markings, 7745193 edges, 58124 markings/sec, 5 secs
lola: 1356486 markings, 12066088 edges, 69944 markings/sec, 10 secs
lola: 1782800 markings, 16321340 edges, 85263 markings/sec, 15 secs
lola: 2395307 markings, 20303633 edges, 122501 markings/sec, 20 secs
lola: 2712086 markings, 24399445 edges, 63356 markings/sec, 25 secs
lola: 2998549 markings, 28369938 edges, 57293 markings/sec, 30 secs
lola: 3411379 markings, 32284601 edges, 82566 markings/sec, 35 secs
lola: 3861173 markings, 36115743 edges, 89959 markings/sec, 40 secs
lola: 4698855 markings, 39842555 edges, 167536 markings/sec, 45 secs
lola: 5416095 markings, 43914685 edges, 143448 markings/sec, 50 secs
lola: 5657687 markings, 48555300 edges, 48318 markings/sec, 55 secs
lola: 6400173 markings, 52885269 edges, 148497 markings/sec, 60 secs
lola: 6882664 markings, 57306978 edges, 96498 markings/sec, 65 secs
lola: 7391734 markings, 61544365 edges, 101814 markings/sec, 70 secs
lola: 7713061 markings, 65946428 edges, 64265 markings/sec, 75 secs
lola: 8411543 markings, 70293762 edges, 139696 markings/sec, 80 secs
lola: 8923625 markings, 74660007 edges, 102416 markings/sec, 85 secs
lola: 9468523 markings, 78899121 edges, 108980 markings/sec, 90 secs
lola: 9863676 markings, 82635739 edges, 79031 markings/sec, 95 secs
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: 10194351 markings, 85600537 edges
lola: ========================================
lola: subprocess 9 will run for 1730 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((((1 <= p44) AND (1 <= p251)) OR ((1 <= p38) AND (1 <= p222)) OR ((1 <= p40) AND (1 <= p224)) OR ((1 <= p37) AND (1 <= p223)) OR ((1 <= p42) AND (1 <= p249)) OR ((1 <= p43) AND (1 <= p221)) OR ((1 <= p41) AND (1 <= p252)))) AND (((1 <= p55) AND (1 <= p243) AND (1 <= p244) AND (1 <= p245) AND (1 <= p246) AND (1 <= p247) AND (1 <= p248) AND (1 <= p250)) OR (((1 <= p44) AND (1 <= p251... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((((1 <= p44) AND (1 <= p251)) OR ((1 <= p38) AND (1 <= p222)) OR ((1 <= p40) AND (1 <= p224)) OR ((1 <= p37) AND (1 <= p223)) OR ((1 <= p42) AND (1 <= p249)) OR ((1 <= p43) AND (1 <= p221)) OR ((1 <= p41) AND (1 <= p252)))) AND (((1 <= p55) AND (1 <= p243) AND (1 <= p244) AND (1 <= p245) AND (1 <= p246) AND (1 <= p247) AND (1 <= p248) AND (1 <= p250)) OR (((1 <= p44) AND (1 <= p251... (shortened)
lola: processed formula length: 605
lola: 65 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: 12 markings, 13 edges
lola: ========================================
lola: subprocess 10 will run for 3461 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((G ((1 <= p54)) R ((p11 <= 0) AND (F ((p54 <= 0)) OR G ((p11 <= 0))))) OR G ((p54 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 3461 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p54 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p54 <= 0))
lola: processed formula length: 14
lola: 65 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: 15610 markings, 52805 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: ((G ((1 <= p54)) R ((p11 <= 0) AND (F ((p54 <= 0)) OR G ((p11 <= 0))))) OR G ((p54 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: G ((p54 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p54 <= 0))
lola: processed formula length: 14
lola: 65 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: 15610 markings, 52805 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (G ((1 <= p54)) R ((p11 <= 0) AND (F ((p54 <= 0)) OR G ((p11 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (G ((1 <= p54)) R ((p11 <= 0) AND (F ((p54 <= 0)) OR G ((p11 <= 0)))))
lola: processed formula length: 70
lola: 65 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: 348525 markings, 4113152 edges, 69705 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 368214 markings, 4412872 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no no no yes no
lola:
preliminary result: no no no no no no no no no yes no
lola: memory consumption: 46844 KB
lola: time consumption: 115 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-PT-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-PT-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-162089432400038"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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