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-162089432400009.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r189-tajo-162089432400009
=====================================================================

--------------------
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 1621408743808

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, LTLCardinality, -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) : 693 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 28 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 12 ms.
[2021-05-19 07:19:06] [INFO ] Unfolded HLPN properties in 1 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 39 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 9834 resets, run finished after 619 ms. (steps per millisecond=161 ) properties seen :[0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1]
// Phase 1: matrix 116 rows 270 cols
[2021-05-19 07:19:07] [INFO ] Computed 155 place invariants in 23 ms
[2021-05-19 07:19:07] [INFO ] [Real]Absence check using 11 positive place invariants in 25 ms returned sat
[2021-05-19 07:19:07] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 45 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 174 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 15 ms returned sat
[2021-05-19 07:19:07] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 49 ms returned sat
[2021-05-19 07:19:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:07] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2021-05-19 07:19:07] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 11 ms.
[2021-05-19 07:19:07] [INFO ] Added : 50 causal constraints over 10 iterations in 146 ms. Result :sat
[2021-05-19 07:19:08] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2021-05-19 07:19:08] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 34 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 138 ms returned sat
[2021-05-19 07:19:08] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2021-05-19 07:19:08] [INFO ] Added : 41 causal constraints over 9 iterations in 113 ms. Result :sat
[2021-05-19 07:19:08] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned unsat
[2021-05-19 07:19:08] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2021-05-19 07:19:08] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 35 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 170 ms returned sat
[2021-05-19 07:19:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 07:19:08] [INFO ] [Nat]Absence check using 11 positive place invariants in 11 ms returned sat
[2021-05-19 07:19:08] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 37 ms returned sat
[2021-05-19 07:19:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:08] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2021-05-19 07:19:08] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 14 ms.
[2021-05-19 07:19:09] [INFO ] Added : 46 causal constraints over 10 iterations in 173 ms. Result :sat
[2021-05-19 07:19:09] [INFO ] [Real]Absence check using 11 positive place invariants in 23 ms returned sat
[2021-05-19 07:19:09] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 70 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 188 ms returned sat
[2021-05-19 07:19:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 07:19:09] [INFO ] [Nat]Absence check using 11 positive place invariants in 12 ms returned sat
[2021-05-19 07:19:09] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 43 ms returned sat
[2021-05-19 07:19:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:09] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2021-05-19 07:19:09] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2021-05-19 07:19:09] [INFO ] Added : 42 causal constraints over 9 iterations in 91 ms. Result :sat
[2021-05-19 07:19:09] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2021-05-19 07:19:09] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 35 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 160 ms returned sat
[2021-05-19 07:19:09] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2021-05-19 07:19:10] [INFO ] Added : 41 causal constraints over 9 iterations in 102 ms. Result :sat
[2021-05-19 07:19:10] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2021-05-19 07:19:10] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 40 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 162 ms returned sat
[2021-05-19 07:19:10] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 10 ms.
[2021-05-19 07:19:10] [INFO ] Added : 61 causal constraints over 13 iterations in 139 ms. Result :sat
[2021-05-19 07:19:10] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned unsat
[2021-05-19 07:19:10] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned unsat
[2021-05-19 07:19:10] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2021-05-19 07:19:10] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 38 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 268 ms returned sat
[2021-05-19 07:19:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 07:19:10] [INFO ] [Nat]Absence check using 11 positive place invariants in 13 ms returned sat
[2021-05-19 07:19:10] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 34 ms returned sat
[2021-05-19 07:19:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:11] [INFO ] [Nat]Absence check using state equation in 198 ms returned sat
[2021-05-19 07:19:11] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 7 ms.
[2021-05-19 07:19:11] [INFO ] Added : 33 causal constraints over 7 iterations in 67 ms. Result :sat
[2021-05-19 07:19:11] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2021-05-19 07:19:11] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 49 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 197 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 : 39 causal constraints over 8 iterations in 97 ms. Result :sat
[2021-05-19 07:19:11] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned unsat
[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 33 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 175 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:12] [INFO ] Added : 38 causal constraints over 8 iterations in 79 ms. Result :sat
[2021-05-19 07:19:12] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2021-05-19 07:19:12] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 35 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 152 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 10 ms returned sat
[2021-05-19 07:19:12] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 35 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 152 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 : 20 causal constraints over 4 iterations in 41 ms. Result :sat
[2021-05-19 07:19:12] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned unsat
[2021-05-19 07:19:12] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned unsat
[2021-05-19 07:19:12] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2021-05-19 07:19:12] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 36 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 155 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 20 ms returned sat
[2021-05-19 07:19:12] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 58 ms returned sat
[2021-05-19 07:19:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:13] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2021-05-19 07:19:13] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 7 ms.
[2021-05-19 07:19:13] [INFO ] Added : 20 causal constraints over 4 iterations in 50 ms. Result :sat
[2021-05-19 07:19:13] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2021-05-19 07:19:13] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 40 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 165 ms returned sat
[2021-05-19 07:19:13] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 7 ms.
[2021-05-19 07:19:13] [INFO ] Added : 50 causal constraints over 10 iterations in 98 ms. Result :sat
[2021-05-19 07:19:13] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2021-05-19 07:19:13] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 42 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 235 ms returned sat
[2021-05-19 07:19:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 07:19:13] [INFO ] [Nat]Absence check using 11 positive place invariants in 10 ms returned sat
[2021-05-19 07:19:13] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 35 ms returned sat
[2021-05-19 07:19:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:14] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2021-05-19 07:19:14] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 7 ms.
[2021-05-19 07:19:14] [INFO ] Added : 25 causal constraints over 5 iterations in 49 ms. Result :sat
[2021-05-19 07:19:14] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned unsat
[2021-05-19 07:19:14] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2021-05-19 07:19:14] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 40 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 167 ms returned sat
[2021-05-19 07:19:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 07:19:14] [INFO ] [Nat]Absence check using 11 positive place invariants in 21 ms returned sat
[2021-05-19 07:19:14] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 37 ms returned sat
[2021-05-19 07:19:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:14] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2021-05-19 07:19:14] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2021-05-19 07:19:14] [INFO ] Added : 47 causal constraints over 10 iterations in 94 ms. Result :sat
[2021-05-19 07:19:14] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned unsat
Successfully simplified 8 atomic propositions for a total of 9 simplifications.
[2021-05-19 07:19:14] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2021-05-19 07:19:14] [INFO ] Flatten gal took : 59 ms
FORMULA QuasiCertifProtocol-COL-06-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-06-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-06-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-06-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-06-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 07:19:14] [INFO ] Applying decomposition
[2021-05-19 07:19:14] [INFO ] Flatten gal took : 35 ms
[2021-05-19 07:19:15] [INFO ] Decomposing Gal with order
[2021-05-19 07:19:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 07:19:15] [INFO ] Removed a total of 104 redundant transitions.
[2021-05-19 07:19:15] [INFO ] Flatten gal took : 52 ms
[2021-05-19 07:19:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 8 ms.
[2021-05-19 07:19:15] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2021-05-19 07:19:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ QuasiCertifProtocol-COL-06 @ 3570 seconds

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

FORMULA QuasiCertifProtocol-COL-06-03 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-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-12 TRUE 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-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-06-10 TRUE 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

FORMULA QuasiCertifProtocol-COL-06-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3285
rslt: Output for LTLCardinality @ 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=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed May 19 07:19:15 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 1,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 70,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 66,
"visible_transitions": 0
},
"processed": "X (G ((F ((p262 <= p258)) AND (X (F ((((p193 + p194 + p195 + p196 + p197 + p198 + p199 <= p88 + p100 + p101 + p81 + p74 + p67 + p60 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p61 + p62 + p63 + p64 + p65 + p66 + p68 + p69 + p70 + p71 + p72 + p73 + p75 + p76 + p77 + p78 + p79 + p80 + p82 + p83 + p84 + p85 + p86 + p87 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) U G ((p262 <= p258))) OR X ((p151 + p152 + p153 + p154 + p155 + p156 + p157 <= p2))))) OR (p262 <= p258)))))",
"processed_size": 493,
"rewrites": 45
},
"result":
{
"edges": 63,
"markings": 63,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 21,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 21,
"visible_transitions": 0
},
"processed": "F ((X ((p200 + p205 + p206 + p204 + p203 + p202 + p201 <= p179 + p180 + p181 + p182 + p183 + p184 + p185)) OR (3 <= p263 + p264 + p265 + p266 + p267 + p268 + p269)))",
"processed_size": 165,
"rewrites": 45
},
"result":
{
"edges": 14,
"markings": 14,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 63,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 63,
"visible_transitions": 0
},
"processed": "X (G (((p213 + p212 + p211 + p210 + p209 + p208 + p207 <= p88 + p100 + p101 + p81 + p74 + p67 + p60 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p61 + p62 + p63 + p64 + p65 + p66 + p68 + p69 + p70 + p71 + p72 + p73 + p75 + p76 + p77 + p78 + p79 + p80 + p82 + p83 + p84 + p85 + p86 + p87 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) OR (1 <= p248 + p247 + p246 + p245 + p244 + p243 + p242))))",
"processed_size": 413,
"rewrites": 45
},
"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"
}
}
],
"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": 1,
"G": 3,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 168,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 56,
"visible_transitions": 0
},
"processed": "X (G (((p88 + p100 + p101 + p81 + p74 + p67 + p60 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p61 + p62 + p63 + p64 + p65 + p66 + p68 + p69 + p70 + p71 + p72 + p73 + p75 + p76 + p77 + p78 + p79 + p80 + p82 + p83 + p84 + p85 + p86 + p87 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + 1 <= p241 + p240 + p239 + p238 + p237 + p236 + p235) AND (G ((p88 + p100 + p101 + p81 + p74 + p67 + p60 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p61 + p62 + p63 + p64 + p65 + p66 + p68 + p69 + p70 + p71 + p72 + p73 + p75 + p76 + p77 + p78 + p79 + p80 + p82 + p83 + p84 + p85 + p86 + p87 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + 1 <= p241 + p240 + p239 + p238 + p237 + p236 + p235)) OR G (F ((p88 + p100 + p101 + p81 + p74 + p67 + p60 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p61 + p62 + p63 + p64 + p65 + p66 + p68 + p69 + p70 + p71 + p72 + p73 + p75 + p76 + p77 + p78 + p79 + p80 + p82 + p83 + p84 + p85 + p86 + p87 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + 1 <= p241 + p240 + p239 + p238 + p237 + p236 + p235)))))))",
"processed_size": 1080,
"rewrites": 45
},
"result":
{
"edges": 123416,
"markings": 54397,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "F (G ((X ((X (G ((p151 + p152 + p153 + p154 + p155 + p156 + p157 <= p257))) AND (p258 <= p257))) OR G (F ((p261 <= 0))))))",
"processed_size": 122,
"rewrites": 45
},
"result":
{
"edges": 215223805,
"markings": 13615774,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 15
},
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 477
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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 + p178 + p177 + p176 + p175 + p174 + p173 <= p193 + p194 + p195 + p196 + p197 + p198 + p199)))",
"processed_size": 106,
"rewrites": 45
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 556
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "F (G ((F ((p260 <= p165 + p166 + p167 + p168 + p169 + p170 + p171)) AND X ((p260 <= p165 + p166 + p167 + p168 + p169 + p170 + p171)))))",
"processed_size": 135,
"rewrites": 45
},
"result":
{
"edges": 32258355,
"markings": 4560366,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 661
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 24,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "X (G ((X (F ((G (F ((p165 + p166 + p167 + p168 + p169 + p170 + p171 + 1 <= p2))) OR (p165 + p166 + p167 + p168 + p169 + p170 + p171 + 1 <= p2)))) AND (p165 + p166 + p167 + p168 + p169 + p170 + p171 + 1 <= p2))))",
"processed_size": 211,
"rewrites": 45
},
"result":
{
"edges": 63,
"markings": 63,
"produced_by": "LTL model checker",
"value": false
},
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 826
},
"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": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "(p254 + p253 + p252 + p251 + p250 + p249 + p255 <= 0)",
"processed_size": 53,
"rewrites": 47
},
"result":
{
"edges": 18,
"markings": 19,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 7
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1102
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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": "G (F ((p257 <= p234 + p233 + p232 + p231 + p230 + p229 + p228)))",
"processed_size": 64,
"rewrites": 45
},
"result":
{
"edges": 17425486,
"markings": 2187254,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1642
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 22,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "G ((F ((2 <= p248 + p247 + p246 + p245 + p244 + p243 + p242)) AND (F ((p220 + p219 + p218 + p217 + p216 + p215 + p214 + 1 <= p257)) OR (2 <= p248 + p247 + p246 + p245 + p244 + p243 + p242))))",
"processed_size": 191,
"rewrites": 45
},
"result":
{
"edges": 19,
"markings": 19,
"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": 3285
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 50,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 50,
"visible_transitions": 0
},
"processed": "G ((p258 <= p102 + p103 + p104 + p105 + p106 + p107 + p109 + p116 + p123 + p130 + p137 + p144 + p150 + p149 + p148 + p147 + p146 + p145 + p143 + p142 + p141 + p140 + p139 + p138 + p136 + p135 + p134 + p133 + p132 + p131 + p129 + p128 + p127 + p126 + p125 + p124 + p122 + p121 + p120 + p119 + p118 + p117 + p115 + p114 + p113 + p112 + p111 + p110 + p108))",
"processed_size": 354,
"rewrites": 45
},
"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"
}
}
],
"exit":
{
"error": null,
"memory": 22520,
"runtime": 285.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(**) : X(G((F(**) AND (X(F(((** U G(**)) OR X(**)))) OR **)))) : (F((X(**) OR **)) OR X(G(**))) : X(G((* AND (G(*) OR G(F(*)))))) : F(G((X((X(G(**)) AND **)) OR G(F(**))))) : X(F(**)) : G(F(**)) : G((F(**) AND (F(**) OR **))) : F(G((F(**) AND X(**)))) : G(**) : X(G((X(F((G(F(*)) OR *))) AND *)))"
},
"net":
{
"arcs": 659,
"conflict_clusters": 32,
"places": 270,
"places_significant": 115,
"singleton_clusters": 0,
"transitions": 116
},
"result":
{
"preliminary_value": "no no no no yes yes yes no yes no no ",
"value": "no no no no yes yes yes no yes 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 LTLCardinality.xml
lola: F ((1 <= p254 + p253 + p252 + p251 + p250 + p249 + p255)) : G (X ((X (((0 <= 0) U F ((((p193 + p194 + p195 + p196 + p197 + p198 + p199 <= p88 + p100 + p101 + p81 + p74 + p67 + p60 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p61 + p62 + p63 + p64 + p65 + p66 + p68 + p69 + p70 + p71 + p72 + p73 + p75 + p76 + p77 + p78 + p79 + p80 + p82 + p83 + p84 + p85 + p86 + p87 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) U G ((p262 <= p258))) OR X ((p151 + p152 + p153 + p154 + p155 + p156 + p157 <= p2)))))) U (p262 <= p258)))) : (F ((X ((p200 + p205 + p206 + p204 + p203 + p202 + p201 <= p179 + p180 + p181 + p182 + p183 + p184 + p185)) OR (3 <= p263 + p264 + p265 + p266 + p267 + p268 + p269))) OR X (G (((p213 + p212 + p211 + p210 + p209 + p208 + p207 <= p88 + p100 + p101 + p81 + p74 + p67 + p60 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p61 + p62 + p63 + p64 + p65 + p66 + p68 + p69 + p70 + p71 + p72 + p73 + p75 + p76 + p77 + p78 + p79 + p80 + p82 + p83 + p84 + p85 + p86 + p87 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) OR (1 <= p248 + p247 + p246 + p245 + p244 + p243 + p242))))) : G (X (NOT((F (F (G ((p241 + p240 + p239 + p238 + p237 + p236 + p235 <= p88 + p100 + p101 + p81 + p74 + p67 + p60 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p61 + p62 + p63 + p64 + p65 + p66 + p68 + p69 + p70 + p71 + p72 + p73 + p75 + p76 + p77 + p78 + p79 + p80 + p82 + p83 + p84 + p85 + p86 + p87 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)))) U (p241 + p240 + p239 + p238 + p237 + p236 + p235 <= p88 + p100 + p101 + p81 + p74 + p67 + p60 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p61 + p62 + p63 + p64 + p65 + p66 + p68 + p69 + p70 + p71 + p72 + p73 + p75 + p76 + p77 + p78 + p79 + p80 + p82 + p83 + p84 + p85 + p86 + p87 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99))))) : F (G ((X ((X (G ((p151 + p152 + p153 + p154 + p155 + p156 + p157 <= p257))) AND (p258 <= p257))) OR G (F ((p261 <= 0)))))) : F (X ((p172 + p178 + p177 + p176 + p175 + p174 + p173 <= p193 + p194 + p195 + p196 + p197 + p198 + p199))) : G (F ((p257 <= p234 + p233 + p232 + p231 + p230 + p229 + p228))) : G ((((0 <= 0) U (p220 + p219 + p218 + p217 + p216 + p215 + p214 + 1 <= p257)) U (2 <= p248 + p247 + p246 + p245 + p244 + p243 + p242))) : G (F (G ((X (F ((p260 <= p165 + p166 + p167 + p168 + p169 + p170 + p171))) AND X (X ((p260 <= p165 + p166 + p167 + p168 + p169 + p170 + p171))))))) : ((G ((p248 + p247 + p246 + p245 + p244 + p243 + p242 <= p2)) U (1 <= 0)) OR G ((p258 <= p102 + p103 + p104 + p105 + p106 + p107 + p109 + p116 + p123 + p130 + p137 + p144 + p150 + p149 + p148 + p147 + p146 + p145 + p143 + p142 + p141 + p140 + p139 + p138 + p136 + p135 + p134 + p133 + p132 + p131 + p129 + p128 + p127 + p126 + p125 + p124 + p122 + p121 + p120 + p119 + p118 + p117 + p115 + p114 + p113 + p112 + p111 + p110 + p108))) : NOT(X (F ((G (X ((F (G ((p2 <= p165 + p166 + p167 + p168 + p169 + p170 + p171))) AND (p2 <= p165 + p166 + p167 + p168 + p169 + p170 + p171)))) OR (p2 <= p165 + p166 + p167 + p168 + p169 + p170 + p171)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:347
lola: rewrite Frontend/Parser/formula_rewrite.k:428
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((F ((p262 <= p258)) AND (X (F ((((p193 + p194 + p195 + p196 + p197 + p198 + p199 <= p88 + p100 + p101 + p81 + p74 + p67 + p60 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p61 + p62 + p63 + p64 + p65 + p66 + p68 + p69 + p70 + p71 + p72 + p73 + p75 + p76 + p77 + p78 + p79 + p80 + p82 + p83 + p84 + p85 + p86 + p87 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) U G ((p262 <= p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F ((p262 <= p258)) AND (X (F ((((p193 + p194 + p195 + p196 + p197 + p198 + p199 <= p88 + p100 + p101 + p81 + p74 + p67 + p60 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p61 + p62 + p63 + p64 + p65 + p66 + p68 + p69 + p70 + p71 + p72 + p73 + p75 + p76 + p77 + p78 + p79 + p80 + p82 + p83 + p84 + p85 + p86 + p87 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) U G ((p262 <= p... (shortened)
lola: processed formula length: 493
lola: 45 rewrites
lola: closed formula file LTLCardinality.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 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((X ((p200 + p205 + p206 + p204 + p203 + p202 + p201 <= p179 + p180 + p181 + p182 + p183 + p184 + p185)) OR (3 <= p263 + p264 + p265 + p266 + p267 + p268 + p269))) OR X (G (((p213 + p212 + p211 + p210 + p209 + p208 + p207 <= p88 + p100 + p101 + p81 + p74 + p67 + p60 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p61 + p62 + p63 + p64 + p65 + p66 + p68 + p69 + p70 + p71 + p72 + p73 + p75 + p76 + p7... (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: F ((X ((p200 + p205 + p206 + p204 + p203 + p202 + p201 <= p179 + p180 + p181 + p182 + p183 + p184 + p185)) OR (3 <= p263 + p264 + p265 + p266 + p267 + p268 + p269)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X ((p200 + p205 + p206 + p204 + p203 + p202 + p201 <= p179 + p180 + p181 + p182 + p183 + p184 + p185)) OR (3 <= p263 + p264 + p265 + p266 + p267 + p268 + p269)))
lola: processed formula length: 165
lola: 45 rewrites
lola: closed formula file LTLCardinality.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: 14 markings, 14 edges
lola: ========================================
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((p213 + p212 + p211 + p210 + p209 + p208 + p207 <= p88 + p100 + p101 + p81 + p74 + p67 + p60 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p61 + p62 + p63 + p64 + p65 + p66 + p68 + p69 + p70 + p71 + p72 + p73 + p75 + p76 + p77 + p78 + p79 + p80 + p82 + p83 + p84 + p85 + p86 + p87 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) OR (1 <= p248 + p247 + p246 + p245 + p244 + p2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((p213 + p212 + p211 + p210 + p209 + p208 + p207 <= p88 + p100 + p101 + p81 + p74 + p67 + p60 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p61 + p62 + p63 + p64 + p65 + p66 + p68 + p69 + p70 + p71 + p72 + p73 + p75 + p76 + p77 + p78 + p79 + p80 + p82 + p83 + p84 + p85 + p86 + p87 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) OR (1 <= p248 + p247 + p246 + p245 + p244 + p2... (shortened)
lola: processed formula length: 413
lola: 45 rewrites
lola: closed formula file LTLCardinality.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 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((p88 + p100 + p101 + p81 + p74 + p67 + p60 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p61 + p62 + p63 + p64 + p65 + p66 + p68 + p69 + p70 + p71 + p72 + p73 + p75 + p76 + p77 + p78 + p79 + p80 + p82 + p83 + p84 + p85 + p86 + p87 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + 1 <= p241 + p240 + p239 + p238 + p237 + p236 + p235) AND (G ((p88 + p100 + p101 + p81 + p74 + p6... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((p88 + p100 + p101 + p81 + p74 + p67 + p60 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p61 + p62 + p63 + p64 + p65 + p66 + p68 + p69 + p70 + p71 + p72 + p73 + p75 + p76 + p77 + p78 + p79 + p80 + p82 + p83 + p84 + p85 + p86 + p87 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + 1 <= p241 + p240 + p239 + p238 + p237 + p236 + p235) AND (G ((p88 + p100 + p101 + p81 + p74 + p6... (shortened)
lola: processed formula length: 1080
lola: 45 rewrites
lola: closed formula file LTLCardinality.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: 54397 markings, 123416 edges
lola: ========================================
lola: subprocess 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X ((X (G ((p151 + p152 + p153 + p154 + p155 + p156 + p157 <= p257))) AND (p258 <= p257))) OR G (F ((p261 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X ((X (G ((p151 + p152 + p153 + p154 + p155 + p156 + p157 <= p257))) AND (p258 <= p257))) OR G (F ((p261 <= 0))))))
lola: processed formula length: 122
lola: 45 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 15 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: 433152 markings, 4386378 edges, 86630 markings/sec, 0 secs
lola: 828086 markings, 8838971 edges, 78987 markings/sec, 5 secs
lola: 1237603 markings, 13460377 edges, 81903 markings/sec, 10 secs
lola: 1574657 markings, 17823592 edges, 67411 markings/sec, 15 secs
lola: 1930139 markings, 22328345 edges, 71096 markings/sec, 20 secs
lola: 2292027 markings, 26532238 edges, 72378 markings/sec, 25 secs
lola: 2652142 markings, 31064008 edges, 72023 markings/sec, 30 secs
lola: 3019190 markings, 35725957 edges, 73410 markings/sec, 35 secs
lola: 3412117 markings, 40576571 edges, 78585 markings/sec, 40 secs
lola: 3750303 markings, 45698673 edges, 67637 markings/sec, 45 secs
lola: 4075986 markings, 50796214 edges, 65137 markings/sec, 50 secs
lola: 4341065 markings, 55323606 edges, 53016 markings/sec, 55 secs
lola: 4614874 markings, 60153558 edges, 54762 markings/sec, 60 secs
lola: 4909818 markings, 64971669 edges, 58989 markings/sec, 65 secs
lola: 5190085 markings, 69790408 edges, 56053 markings/sec, 70 secs
lola: 5460289 markings, 74526529 edges, 54041 markings/sec, 75 secs
lola: 5755227 markings, 79339327 edges, 58988 markings/sec, 80 secs
lola: 6046724 markings, 84422622 edges, 58299 markings/sec, 85 secs
lola: 6334904 markings, 89477029 edges, 57636 markings/sec, 90 secs
lola: 6622997 markings, 94542113 edges, 57619 markings/sec, 95 secs
lola: 6873351 markings, 99314918 edges, 50071 markings/sec, 100 secs
lola: 7119266 markings, 104128719 edges, 49183 markings/sec, 105 secs
lola: 7368221 markings, 109113836 edges, 49791 markings/sec, 110 secs
lola: 7652614 markings, 114191320 edges, 56879 markings/sec, 115 secs
lola: 7897059 markings, 118821859 edges, 48889 markings/sec, 120 secs
lola: 8140048 markings, 123620402 edges, 48598 markings/sec, 125 secs
lola: 8376722 markings, 128288192 edges, 47335 markings/sec, 130 secs
lola: 8666536 markings, 133190621 edges, 57963 markings/sec, 135 secs
lola: 8934617 markings, 137848098 edges, 53616 markings/sec, 140 secs
lola: 9212005 markings, 142690403 edges, 55478 markings/sec, 145 secs
lola: 9494507 markings, 147647708 edges, 56500 markings/sec, 150 secs
lola: 9759144 markings, 152657872 edges, 52927 markings/sec, 155 secs
lola: 10011688 markings, 157631992 edges, 50509 markings/sec, 160 secs
lola: 10260673 markings, 162596874 edges, 49797 markings/sec, 165 secs
lola: 10542609 markings, 167643021 edges, 56387 markings/sec, 170 secs
lola: 10808322 markings, 172673155 edges, 53143 markings/sec, 175 secs
lola: 11062141 markings, 177666254 edges, 50764 markings/sec, 180 secs
lola: 11310594 markings, 182637445 edges, 49691 markings/sec, 185 secs
lola: 11625850 markings, 187683388 edges, 63051 markings/sec, 190 secs
lola: 11994161 markings, 192624098 edges, 73662 markings/sec, 195 secs
lola: 12320889 markings, 197019791 edges, 65346 markings/sec, 200 secs
lola: 12642108 markings, 201543962 edges, 64244 markings/sec, 205 secs
lola: 12965377 markings, 206207581 edges, 64654 markings/sec, 210 secs
lola: 13259148 markings, 210496410 edges, 58754 markings/sec, 215 secs
lola: 13576991 markings, 214833751 edges, 63569 markings/sec, 220 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: 13615774 markings, 215223805 edges
lola: ========================================
lola: subprocess 4 will run for 477 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p172 + p178 + p177 + p176 + p175 + p174 + p173 <= p193 + p194 + p195 + p196 + p197 + p198 + p199)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p172 + p178 + p177 + p176 + p175 + p174 + p173 <= p193 + p194 + p195 + p196 + p197 + p198 + p199)))
lola: processed formula length: 106
lola: 45 rewrites
lola: closed formula file LTLCardinality.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 5 will run for 556 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((p260 <= p165 + p166 + p167 + p168 + p169 + p170 + p171)) AND X ((p260 <= p165 + p166 + p167 + p168 + p169 + p170 + p171)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((p260 <= p165 + p166 + p167 + p168 + p169 + p170 + p171)) AND X ((p260 <= p165 + p166 + p167 + p168 + p169 + p170 + p171)))))
lola: processed formula length: 135
lola: 45 rewrites
lola: closed formula file LTLCardinality.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: 770734 markings, 4950870 edges, 154147 markings/sec, 0 secs
lola: 1501990 markings, 9825962 edges, 146251 markings/sec, 5 secs
lola: 2146974 markings, 14452017 edges, 128997 markings/sec, 10 secs
lola: 2732652 markings, 19077299 edges, 117136 markings/sec, 15 secs
lola: 3307634 markings, 23515540 edges, 114996 markings/sec, 20 secs
lola: 3865818 markings, 27970118 edges, 111637 markings/sec, 25 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: 4560366 markings, 32258355 edges
lola: ========================================
lola: subprocess 6 will run for 661 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X (F ((G (F ((p165 + p166 + p167 + p168 + p169 + p170 + p171 + 1 <= p2))) OR (p165 + p166 + p167 + p168 + p169 + p170 + p171 + 1 <= p2)))) AND (p165 + p166 + p167 + p168 + p169 + p170 + p171 + 1 <= p2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X (F ((G (F ((p165 + p166 + p167 + p168 + p169 + p170 + p171 + 1 <= p2))) OR (p165 + p166 + p167 + p168 + p169 + p170 + p171 + 1 <= p2)))) AND (p165 + p166 + p167 + p168 + p169 + p170 + p171 + 1 <= p2))))
lola: processed formula length: 211
lola: 45 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 63 markings, 63 edges
lola: ========================================
lola: subprocess 7 will run for 826 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p254 + p253 + p252 + p251 + p250 + p249 + p255))
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: (p254 + p253 + p252 + p251 + p250 + p249 + p255 <= 0)
lola: processed formula length: 53
lola: 47 rewrites
lola: closed formula file LTLCardinality.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: subprocess 8 will run for 1102 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p257 <= p234 + p233 + p232 + p231 + p230 + p229 + p228)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((p257 <= p234 + p233 + p232 + p231 + p230 + p229 + p228)))
lola: processed formula length: 64
lola: 45 rewrites
lola: closed formula file LTLCardinality.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: 617795 markings, 3908161 edges, 123559 markings/sec, 0 secs
lola: 1142836 markings, 7690505 edges, 105008 markings/sec, 5 secs
lola: 1629197 markings, 11839529 edges, 97272 markings/sec, 10 secs
lola: 2063273 markings, 16570623 edges, 86815 markings/sec, 15 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: 2187254 markings, 17425486 edges
lola: ========================================
lola: subprocess 9 will run for 1642 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((2 <= p248 + p247 + p246 + p245 + p244 + p243 + p242)) AND (F ((p220 + p219 + p218 + p217 + p216 + p215 + p214 + 1 <= p257)) OR (2 <= p248 + p247 + p246 + p245 + p244 + p243 + p242))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((2 <= p248 + p247 + p246 + p245 + p244 + p243 + p242)) AND (F ((p220 + p219 + p218 + p217 + p216 + p215 + p214 + 1 <= p257)) OR (2 <= p248 + p247 + p246 + p245 + p244 + p243 + p242))))
lola: processed formula length: 191
lola: 45 rewrites
lola: closed formula file LTLCardinality.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: 19 markings, 19 edges
lola: ========================================
lola: subprocess 10 will run for 3285 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p258 <= p102 + p103 + p104 + p105 + p106 + p107 + p109 + p116 + p123 + p130 + p137 + p144 + p150 + p149 + p148 + p147 + p146 + p145 + p143 + p142 + p141 + p140 + p139 + p138 + p136 + p135 + p134 + p133 + p132 + p131 + p129 + p128 + p127 + p126 + p125 + p124 + p122 + p121 + p120 + p119 + p118 + p117 + p115 + p114 + p113 + p112 + p111 + p110 + p108))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p258 <= p102 + p103 + p104 + p105 + p106 + p107 + p109 + p116 + p123 + p130 + p137 + p144 + p150 + p149 + p148 + p147 + p146 + p145 + p143 + p142 + p141 + p140 + p139 + p138 + p136 + p135 + p134 + p133 + p132 + p131 + p129 + p128 + p127 + p126 + p125 + p124 + p122 + p121 + p120 + p119 + p118 + p117 + p115 + p114 + p113 + p112 + p111 + p110 + p108))
lola: processed formula length: 354
lola: 45 rewrites
lola: closed formula file LTLCardinality.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: RESULT
lola:
SUMMARY: no no no no yes yes yes no yes no no
lola:
preliminary result: no no no no yes yes yes no yes no no
lola: memory consumption: 22520 KB
lola: time consumption: 285 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.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="LTLCardinality"
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 LTLCardinality"
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-162089432400009"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;