Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r151-tall-162089150900001.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/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 MultiwaySync-PT-none, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r151-tall-162089150900001
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 120K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 100K 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.2K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Mar 27 06:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 27 06:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 07:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 25 07:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 111K 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 MultiwaySync-PT-none-00
FORMULA_NAME MultiwaySync-PT-none-01
FORMULA_NAME MultiwaySync-PT-none-02
FORMULA_NAME MultiwaySync-PT-none-03
FORMULA_NAME MultiwaySync-PT-none-04
FORMULA_NAME MultiwaySync-PT-none-05
FORMULA_NAME MultiwaySync-PT-none-06
FORMULA_NAME MultiwaySync-PT-none-07
FORMULA_NAME MultiwaySync-PT-none-08
FORMULA_NAME MultiwaySync-PT-none-09
FORMULA_NAME MultiwaySync-PT-none-10
FORMULA_NAME MultiwaySync-PT-none-11
FORMULA_NAME MultiwaySync-PT-none-12
FORMULA_NAME MultiwaySync-PT-none-13
FORMULA_NAME MultiwaySync-PT-none-14
FORMULA_NAME MultiwaySync-PT-none-15

=== Now, execution of the tool begins

BK_START 1620980587016

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-14 08:23:08] [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-14 08:23:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 08:23:08] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2021-05-14 08:23:08] [INFO ] Transformed 222 places.
[2021-05-14 08:23:08] [INFO ] Transformed 472 transitions.
[2021-05-14 08:23:08] [INFO ] Found NUPN structural information;
[2021-05-14 08:23:08] [INFO ] Parsed PT model containing 222 places and 472 transitions in 121 ms.
Ensure Unique test removed 83 transitions
Reduce redundant transitions removed 83 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 483 ms. (steps per millisecond=207 ) properties seen :[0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1]
[2021-05-14 08:23:09] [INFO ] Flow matrix only has 384 transitions (discarded 5 similar events)
// Phase 1: matrix 384 rows 222 cols
[2021-05-14 08:23:09] [INFO ] Computed 25 place invariants in 16 ms
[2021-05-14 08:23:09] [INFO ] [Real]Absence check using 25 positive place invariants in 42 ms returned sat
[2021-05-14 08:23:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:23:09] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2021-05-14 08:23:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:23:09] [INFO ] [Nat]Absence check using 25 positive place invariants in 49 ms returned sat
[2021-05-14 08:23:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:23:10] [INFO ] [Nat]Absence check using state equation in 273 ms returned sat
[2021-05-14 08:23:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-14 08:23:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-14 08:23:10] [INFO ] Computed and/alt/rep : 388/1393/383 causal constraints in 56 ms.
[2021-05-14 08:23:12] [INFO ] Added : 352 causal constraints over 72 iterations in 2227 ms. Result :sat
[2021-05-14 08:23:12] [INFO ] [Real]Absence check using 25 positive place invariants in 22 ms returned sat
[2021-05-14 08:23:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:23:12] [INFO ] [Real]Absence check using state equation in 221 ms returned sat
[2021-05-14 08:23:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:23:12] [INFO ] [Nat]Absence check using 25 positive place invariants in 36 ms returned sat
[2021-05-14 08:23:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:23:12] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2021-05-14 08:23:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 11 ms returned sat
[2021-05-14 08:23:12] [INFO ] Computed and/alt/rep : 388/1393/383 causal constraints in 44 ms.
[2021-05-14 08:23:14] [INFO ] Added : 352 causal constraints over 71 iterations in 1851 ms. Result :sat
[2021-05-14 08:23:14] [INFO ] Deduced a trap composed of 29 places in 53 ms
[2021-05-14 08:23:14] [INFO ] Deduced a trap composed of 21 places in 17 ms
[2021-05-14 08:23:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 150 ms
[2021-05-14 08:23:14] [INFO ] [Real]Absence check using 25 positive place invariants in 13 ms returned sat
[2021-05-14 08:23:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:23:15] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2021-05-14 08:23:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:23:15] [INFO ] [Nat]Absence check using 25 positive place invariants in 10 ms returned unsat
[2021-05-14 08:23:15] [INFO ] [Real]Absence check using 25 positive place invariants in 12 ms returned sat
[2021-05-14 08:23:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:23:15] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2021-05-14 08:23:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:23:15] [INFO ] [Nat]Absence check using 25 positive place invariants in 37 ms returned sat
[2021-05-14 08:23:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:23:15] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2021-05-14 08:23:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-14 08:23:15] [INFO ] Deduced a trap composed of 21 places in 19 ms
[2021-05-14 08:23:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2021-05-14 08:23:15] [INFO ] Computed and/alt/rep : 388/1393/383 causal constraints in 48 ms.
[2021-05-14 08:23:17] [INFO ] Added : 366 causal constraints over 74 iterations in 1938 ms. Result :sat
[2021-05-14 08:23:17] [INFO ] [Real]Absence check using 25 positive place invariants in 26 ms returned sat
[2021-05-14 08:23:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:23:17] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2021-05-14 08:23:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:23:17] [INFO ] [Nat]Absence check using 25 positive place invariants in 36 ms returned sat
[2021-05-14 08:23:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:23:18] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2021-05-14 08:23:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-14 08:23:18] [INFO ] Computed and/alt/rep : 388/1393/383 causal constraints in 37 ms.
[2021-05-14 08:23:19] [INFO ] Added : 343 causal constraints over 70 iterations in 1687 ms. Result :sat
[2021-05-14 08:23:19] [INFO ] Deduced a trap composed of 22 places in 31 ms
[2021-05-14 08:23:19] [INFO ] Deduced a trap composed of 20 places in 13 ms
[2021-05-14 08:23:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 118 ms
[2021-05-14 08:23:20] [INFO ] [Real]Absence check using 25 positive place invariants in 14 ms returned sat
[2021-05-14 08:23:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:23:20] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2021-05-14 08:23:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:23:20] [INFO ] [Nat]Absence check using 25 positive place invariants in 36 ms returned sat
[2021-05-14 08:23:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:23:20] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2021-05-14 08:23:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-14 08:23:20] [INFO ] Computed and/alt/rep : 388/1393/383 causal constraints in 23 ms.
[2021-05-14 08:23:22] [INFO ] Added : 362 causal constraints over 73 iterations in 1587 ms. Result :sat
[2021-05-14 08:23:22] [INFO ] Deduced a trap composed of 22 places in 22 ms
[2021-05-14 08:23:22] [INFO ] Deduced a trap composed of 21 places in 20 ms
[2021-05-14 08:23:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 122 ms
[2021-05-14 08:23:22] [INFO ] [Real]Absence check using 25 positive place invariants in 12 ms returned sat
[2021-05-14 08:23:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:23:22] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2021-05-14 08:23:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:23:22] [INFO ] [Nat]Absence check using 25 positive place invariants in 36 ms returned sat
[2021-05-14 08:23:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:23:22] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2021-05-14 08:23:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-14 08:23:22] [INFO ] Deduced a trap composed of 21 places in 17 ms
[2021-05-14 08:23:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2021-05-14 08:23:22] [INFO ] Computed and/alt/rep : 388/1393/383 causal constraints in 19 ms.
[2021-05-14 08:23:24] [INFO ] Added : 358 causal constraints over 73 iterations in 1576 ms. Result :sat
[2021-05-14 08:23:24] [INFO ] Deduced a trap composed of 21 places in 41 ms
[2021-05-14 08:23:24] [INFO ] Deduced a trap composed of 29 places in 35 ms
[2021-05-14 08:23:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 150 ms
[2021-05-14 08:23:24] [INFO ] [Real]Absence check using 25 positive place invariants in 12 ms returned sat
[2021-05-14 08:23:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:23:24] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2021-05-14 08:23:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:23:24] [INFO ] [Nat]Absence check using 25 positive place invariants in 36 ms returned sat
[2021-05-14 08:23:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:23:24] [INFO ] [Nat]Absence check using state equation in 187 ms returned sat
[2021-05-14 08:23:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-14 08:23:24] [INFO ] Computed and/alt/rep : 388/1393/383 causal constraints in 30 ms.
[2021-05-14 08:23:26] [INFO ] Added : 358 causal constraints over 72 iterations in 1648 ms. Result :sat
[2021-05-14 08:23:26] [INFO ] Deduced a trap composed of 21 places in 34 ms
[2021-05-14 08:23:26] [INFO ] Deduced a trap composed of 20 places in 25 ms
[2021-05-14 08:23:26] [INFO ] Deduced a trap composed of 29 places in 19 ms
[2021-05-14 08:23:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 193 ms
[2021-05-14 08:23:26] [INFO ] [Real]Absence check using 25 positive place invariants in 13 ms returned sat
[2021-05-14 08:23:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:23:26] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2021-05-14 08:23:26] [INFO ] [Real]Added 1 Read/Feed constraints in 5 ms returned sat
[2021-05-14 08:23:26] [INFO ] Deduced a trap composed of 29 places in 21 ms
[2021-05-14 08:23:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2021-05-14 08:23:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:23:27] [INFO ] [Nat]Absence check using 25 positive place invariants in 36 ms returned sat
[2021-05-14 08:23:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:23:27] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2021-05-14 08:23:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-14 08:23:27] [INFO ] Deduced a trap composed of 29 places in 19 ms
[2021-05-14 08:23:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2021-05-14 08:23:27] [INFO ] Computed and/alt/rep : 388/1393/383 causal constraints in 21 ms.
[2021-05-14 08:23:28] [INFO ] Added : 356 causal constraints over 72 iterations in 1705 ms. Result :sat
[2021-05-14 08:23:29] [INFO ] Deduced a trap composed of 22 places in 14 ms
[2021-05-14 08:23:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2021-05-14 08:23:29] [INFO ] [Real]Absence check using 25 positive place invariants in 13 ms returned sat
[2021-05-14 08:23:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:23:29] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2021-05-14 08:23:29] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-14 08:23:29] [INFO ] Computed and/alt/rep : 388/1393/383 causal constraints in 19 ms.
[2021-05-14 08:23:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:23:29] [INFO ] [Nat]Absence check using 25 positive place invariants in 36 ms returned sat
[2021-05-14 08:23:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:23:29] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2021-05-14 08:23:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-14 08:23:29] [INFO ] Computed and/alt/rep : 388/1393/383 causal constraints in 48 ms.
[2021-05-14 08:23:31] [INFO ] Added : 313 causal constraints over 63 iterations in 1501 ms. Result :sat
[2021-05-14 08:23:31] [INFO ] Deduced a trap composed of 21 places in 13 ms
[2021-05-14 08:23:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2021-05-14 08:23:31] [INFO ] [Real]Absence check using 25 positive place invariants in 12 ms returned sat
[2021-05-14 08:23:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:23:31] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2021-05-14 08:23:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:23:31] [INFO ] [Nat]Absence check using 25 positive place invariants in 37 ms returned sat
[2021-05-14 08:23:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:23:31] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2021-05-14 08:23:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-14 08:23:31] [INFO ] Computed and/alt/rep : 388/1393/383 causal constraints in 28 ms.
[2021-05-14 08:23:33] [INFO ] Added : 333 causal constraints over 68 iterations in 1676 ms. Result :sat
[2021-05-14 08:23:33] [INFO ] Deduced a trap composed of 22 places in 25 ms
[2021-05-14 08:23:33] [INFO ] Deduced a trap composed of 25 places in 17 ms
[2021-05-14 08:23:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 124 ms
[2021-05-14 08:23:33] [INFO ] [Real]Absence check using 25 positive place invariants in 12 ms returned sat
[2021-05-14 08:23:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:23:33] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2021-05-14 08:23:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:23:33] [INFO ] [Nat]Absence check using 25 positive place invariants in 45 ms returned sat
[2021-05-14 08:23:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:23:33] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2021-05-14 08:23:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-14 08:23:33] [INFO ] Computed and/alt/rep : 388/1393/383 causal constraints in 19 ms.
[2021-05-14 08:23:35] [INFO ] Added : 368 causal constraints over 75 iterations in 1822 ms. Result :sat
[2021-05-14 08:23:35] [INFO ] [Real]Absence check using 25 positive place invariants in 12 ms returned sat
[2021-05-14 08:23:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:23:35] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2021-05-14 08:23:35] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-14 08:23:35] [INFO ] Computed and/alt/rep : 388/1393/383 causal constraints in 19 ms.
[2021-05-14 08:23:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:23:36] [INFO ] [Nat]Absence check using 25 positive place invariants in 35 ms returned sat
[2021-05-14 08:23:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:23:36] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2021-05-14 08:23:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-14 08:23:36] [INFO ] Computed and/alt/rep : 388/1393/383 causal constraints in 19 ms.
[2021-05-14 08:23:37] [INFO ] Added : 354 causal constraints over 71 iterations in 1664 ms. Result :sat
[2021-05-14 08:23:37] [INFO ] Deduced a trap composed of 21 places in 43 ms
[2021-05-14 08:23:38] [INFO ] Deduced a trap composed of 21 places in 40 ms
[2021-05-14 08:23:38] [INFO ] Deduced a trap composed of 21 places in 29 ms
[2021-05-14 08:23:38] [INFO ] Deduced a trap composed of 29 places in 26 ms
[2021-05-14 08:23:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 271 ms
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2021-05-14 08:23:38] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2021-05-14 08:23:38] [INFO ] Flatten gal took : 71 ms
FORMULA MultiwaySync-PT-none-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiwaySync-PT-none-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiwaySync-PT-none-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiwaySync-PT-none-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 08:23:38] [INFO ] Applying decomposition
[2021-05-14 08:23:38] [INFO ] Flatten gal took : 29 ms
[2021-05-14 08:23:38] [INFO ] Decomposing Gal with order
[2021-05-14 08:23:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 08:23:38] [INFO ] Removed a total of 273 redundant transitions.
[2021-05-14 08:23:38] [INFO ] Flatten gal took : 76 ms
[2021-05-14 08:23:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 214 labels/synchronizations in 9 ms.
[2021-05-14 08:23:38] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2021-05-14 08:23:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ MultiwaySync-PT-none @ 3570 seconds

FORMULA MultiwaySync-PT-none-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MultiwaySync-PT-none-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MultiwaySync-PT-none-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MultiwaySync-PT-none-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MultiwaySync-PT-none-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MultiwaySync-PT-none-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MultiwaySync-PT-none-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MultiwaySync-PT-none-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MultiwaySync-PT-none-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MultiwaySync-PT-none-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MultiwaySync-PT-none-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MultiwaySync-PT-none-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for LTLCardinality @ MultiwaySync-PT-none

{
"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",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri May 14 08:23:39 2021
",
"timelimit": 3570
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F (((1 <= p28))))",
"processed_size": 20,
"rewrites": 82
},
"result":
{
"edges": 36,
"markings": 36,
"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": "fairness",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 2,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G ((G (F ((((p18 <= 0)) OR ((1 <= p139))))) AND (((p18 <= 0)) OR ((1 <= p139))))))",
"processed_size": 87,
"rewrites": 82
},
"result":
{
"edges": 64,
"markings": 64,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 3,
"X": 1,
"aconj": 13,
"adisj": 5,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((F ((((p168 <= 0)) OR ((1 <= p221)))) OR (((p168 <= 0)) OR ((1 <= p221)))) U X ((((((p52 <= 0)) OR ((1 <= p202))) U ((((p168 <= 0)) OR ((1 <= p221))) AND (((p52 <= 0)) OR ((1 <= p202))))) U (((p168 <= 0)) OR ((1 <= p221))))))",
"processed_size": 231,
"rewrites": 82
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 2,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G ((F (G ((((1 <= p47)) AND ((p201 <= 0))))) AND F ((((1 <= p47)) AND ((p201 <= 0)))))))",
"processed_size": 91,
"rewrites": 82
},
"result":
{
"edges": 63,
"markings": 63,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 3,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (X (X (F ((((p176 <= 0)) OR ((1 <= p205)))))))",
"processed_size": 49,
"rewrites": 82
},
"result":
{
"edges": 151,
"markings": 151,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"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": 4,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(((p186 <= 0)) OR ((1 <= p8)) OR ((p132 <= 0)) OR ((1 <= p62)))",
"processed_size": 66,
"rewrites": 82
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 2,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((X ((((1 <= p149)) AND ((p183 <= 0)))) AND (((p89 <= 0)) OR ((1 <= p72)))))",
"processed_size": 79,
"rewrites": 82
},
"result":
{
"edges": 63,
"markings": 63,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((((p28 <= 0)) OR ((1 <= p181)))))",
"processed_size": 40,
"rewrites": 82
},
"result":
{
"edges": 63,
"markings": 63,
"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": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 7,
"adisj": 3,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(((((p185 <= 0)) OR ((1 <= p169))) AND (((p60 <= 0)) OR ((1 <= p168)))) U G ((((1 <= p60)) AND ((p168 <= 0)))))",
"processed_size": 113,
"rewrites": 82
},
"result":
{
"edges": 43,
"markings": 43,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 11,
"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": 40860,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(X(F(**))) : (X(**) AND G(F(**))) : (** U G(*)) : G(F((G(*) OR (* AND X(*))))) : X(G((G(F(**)) AND **))) : ((F(**) OR (** OR **)) U X(((** U **) U **))) : X(G((F(G(*)) AND F(*)))) : X(X(X(F(**)))) : ((X((X(**) U **)) AND F(**)) U (X(*) AND **)) : ((** OR (G(**) AND F(**))) AND G((X(*) AND **))) : X(G(((** U G(**)) OR (X(**) OR **)))) : G(F(**))"
},
"net":
{
"arcs": 1294,
"conflict_clusters": 48,
"places": 222,
"places_significant": 197,
"singleton_clusters": 0,
"transitions": 389
},
"result":
{
"preliminary_value": "yes no no no no yes no no yes no no no ",
"value": "yes no no no no yes no no yes no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 611/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 222
lola: finding significant places
lola: 222 places, 389 transitions, 197 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: LP says that atomic proposition is always true: (p124 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p169 <= 1)
lola: LP says that atomic proposition is always true: (p168 <= 1)
lola: LP says that atomic proposition is always true: (p168 <= 1)
lola: LP says that atomic proposition is always true: (p176 <= 1)
lola: LP says that atomic proposition is always true: (p176 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p221 <= 1)
lola: LP says that atomic proposition is always true: (p221 <= 1)
lola: LP says that atomic proposition is always true: (p202 <= 1)
lola: LP says that atomic proposition is always true: (p221 <= 1)
lola: LP says that atomic proposition is always true: (p202 <= 1)
lola: LP says that atomic proposition is always true: (p221 <= 1)
lola: LP says that atomic proposition is always true: (p201 <= 1)
lola: LP says that atomic proposition is always true: (p201 <= 1)
lola: LP says that atomic proposition is always true: (p205 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p162 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p183 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p122 <= 1)
lola: LP says that atomic proposition is always true: (p183 <= 1)
lola: LP says that atomic proposition is always true: (p169 <= 1)
lola: LP says that atomic proposition is always true: (p183 <= 1)
lola: LP says that atomic proposition is always true: (p181 <= 1)
lola: (NOT(((0 <= 0) U (1 <= 0))) AND F (X (X (F ((((p165 <= 0)) OR ((1 <= p124)))))))) : (X (((1 <= p28))) AND X (X (G (F (((1 <= p28))))))) : (((((p185 <= 0)) OR ((1 <= p169))) AND (((p60 <= 0)) OR ((1 <= p168)))) U G (NOT(F ((((p60 <= 0)) OR ((1 <= p168))))))) : G (F (NOT(G (X (G (((1 <= 0) U X (X (((((p184 <= 0)) OR ((1 <= p176))) U X ((((p184 <= 0)) OR ((1 <= p176)))))))))))))) : G (X ((G (X (G (F ((((p18 <= 0)) OR ((1 <= p139))))))) AND (((p18 <= 0)) OR ((1 <= p139)))))) : (((F ((((p168 <= 0)) OR ((1 <= p221)))) OR ((p168 <= 0))) OR ((1 <= p221))) U X ((((((p52 <= 0)) OR ((1 <= p202))) U ((((p168 <= 0)) OR ((1 <= p221))) AND (((p52 <= 0)) OR ((1 <= p202))))) U (((p168 <= 0)) OR ((1 <= p221)))))) : NOT(X (F ((F (X (G (F ((((p47 <= 0)) OR ((1 <= p201))))))) OR G ((((p47 <= 0)) OR ((1 <= p201)))))))) : NOT(X (X (X (NOT(F ((((p176 <= 0)) OR ((1 <= p205))))))))) : ((X ((X (((1 <= p112))) U ((1 <= p112)))) AND F (((1 <= p112)))) U (NOT(X (((1 <= p112)))) AND ((p162 <= 0)))) : ((G ((((p186 <= 0)) OR ((1 <= p8)))) U (((p186 <= 0)) OR ((1 <= p8)) OR ((p132 <= 0)) OR ((1 <= p62)))) AND G ((NOT(X ((((p149 <= 0)) OR ((1 <= p183))))) AND (((p89 <= 0)) OR ((1 <= p72)))))) : G (X (((((((p191 <= 0)) OR ((1 <= p122))) U G (((1 <= p183)))) OR X (((1 <= p169)))) OR ((1 <= p183))))) : G (((1 <= 0) U X (X (X (G (F ((((p28 <= 0)) OR ((1 <= p181))))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
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:329
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((((p165 <= 0)) OR ((1 <= p124))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((((p165 <= 0)) OR ((1 <= p124))))))
lola: processed formula length: 45
lola: 82 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 29 markings, 28 edges
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((1 <= p28))) AND G (F (((1 <= p28)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p28))))
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 (((1 <= p28))))
lola: processed formula length: 20
lola: 82 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: 36 markings, 36 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((((1 <= p184)) AND ((p176 <= 0)))) OR ((((1 <= p184)) AND ((p176 <= 0))) AND X ((((1 <= p184)) AND ((p176 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((((1 <= p184)) AND ((p176 <= 0)))) OR ((((1 <= p184)) AND ((p176 <= 0))) AND X ((((1 <= p184)) AND ((p176 <= 0))))))))
lola: processed formula length: 128
lola: 82 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: 97 markings, 97 edges
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((G (F ((((p18 <= 0)) OR ((1 <= p139))))) AND (((p18 <= 0)) OR ((1 <= p139))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((G (F ((((p18 <= 0)) OR ((1 <= p139))))) AND (((p18 <= 0)) OR ((1 <= p139))))))
lola: processed formula length: 87
lola: 82 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: 64 markings, 64 edges
lola: ========================================
lola: subprocess 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F ((((p168 <= 0)) OR ((1 <= p221)))) OR (((p168 <= 0)) OR ((1 <= p221)))) U X ((((((p52 <= 0)) OR ((1 <= p202))) U ((((p168 <= 0)) OR ((1 <= p221))) AND (((p52 <= 0)) OR ((1 <= p202))))) U (((p168 <= 0)) OR ((1 <= p221))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((F ((((p168 <= 0)) OR ((1 <= p221)))) OR (((p168 <= 0)) OR ((1 <= p221)))) U X ((((((p52 <= 0)) OR ((1 <= p202))) U ((((p168 <= 0)) OR ((1 <= p221))) AND (((p52 <= 0)) OR ((1 <= p202))))) U (((p168 <= 0)) OR ((1 <= p221))))))
lola: processed formula length: 231
lola: 82 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 5 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((F (G ((((1 <= p47)) AND ((p201 <= 0))))) AND F ((((1 <= p47)) AND ((p201 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F (G ((((1 <= p47)) AND ((p201 <= 0))))) AND F ((((1 <= p47)) AND ((p201 <= 0)))))))
lola: processed formula length: 91
lola: 82 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 6 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (F ((((p176 <= 0)) OR ((1 <= p205)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (F ((((p176 <= 0)) OR ((1 <= p205)))))))
lola: processed formula length: 49
lola: 82 rewrites
lola: closed formula file LTLCardinality.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: 151 markings, 151 edges
lola: ========================================
lola: subprocess 7 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X ((X (((1 <= p112))) U ((1 <= p112)))) AND F (((1 <= p112)))) U (X (((p112 <= 0))) AND ((p162 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((X ((X (((1 <= p112))) U ((1 <= p112)))) AND F (((1 <= p112)))) U (X (((p112 <= 0))) AND ((p162 <= 0))))
lola: processed formula length: 105
lola: 82 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 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: 4 markings, 3 edges
lola: ========================================
lola: subprocess 8 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((((p186 <= 0)) OR ((1 <= p8)) OR ((p132 <= 0)) OR ((1 <= p62))) OR (G ((((p186 <= 0)) OR ((1 <= p8)))) AND F ((((p186 <= 0)) OR ((1 <= p8)) OR ((p132 <= 0)) OR ((1 <= p62)))))) AND G ((X ((((1 <= p149)) AND ((p183 <= 0)))) AND (((p89 <= 0)) OR ((1 <= p72))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p186 <= 0)) OR ((1 <= p8)) OR ((p132 <= 0)) OR ((1 <= p62)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p186 <= 0)) OR ((1 <= p8)) OR ((p132 <= 0)) OR ((1 <= p62)))
lola: processed formula length: 66
lola: 82 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 4 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 9 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X ((((1 <= p149)) AND ((p183 <= 0)))) AND (((p89 <= 0)) OR ((1 <= p72)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X ((((1 <= p149)) AND ((p183 <= 0)))) AND (((p89 <= 0)) OR ((1 <= p72)))))
lola: processed formula length: 79
lola: 82 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 9 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((((p191 <= 0)) OR ((1 <= p122))) U G (((1 <= p183)))) OR (X (((1 <= p169))) OR ((1 <= p183))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((((p191 <= 0)) OR ((1 <= p122))) U G (((1 <= p183)))) OR (X (((1 <= p169))) OR ((1 <= p183))))))
lola: processed formula length: 105
lola: 82 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 63 markings, 63 edges
lola: ========================================
lola: subprocess 10 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((p28 <= 0)) OR ((1 <= p181)))))
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 ((((p28 <= 0)) OR ((1 <= p181)))))
lola: processed formula length: 40
lola: 82 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: 63 markings, 63 edges
lola: ========================================
lola: subprocess 11 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((((p185 <= 0)) OR ((1 <= p169))) AND (((p60 <= 0)) OR ((1 <= p168)))) U G ((((1 <= p60)) AND ((p168 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((((p185 <= 0)) OR ((1 <= p169))) AND (((p60 <= 0)) OR ((1 <= p168)))) U G ((((1 <= p60)) AND ((p168 <= 0)))))
lola: processed formula length: 113
lola: 82 rewrites
lola: closed formula file LTLCardinality.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: 43 markings, 43 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no no yes no no yes no no no
lola:
preliminary result: yes no no no no yes no no yes no no no
lola: memory consumption: 40860 KB
lola: time consumption: 3 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="MultiwaySync-PT-none"
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 MultiwaySync-PT-none, 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 r151-tall-162089150900001"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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