fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r189-tajo-162089432900349
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for RefineWMG-PT-100101

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16255.363 3600000.00 1435054.00 68343.70 F?FFFTFFTTF?F?F? normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 99K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.8K Mar 28 16:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 28 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K Mar 27 10:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 27 10:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 25 14:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 14:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 218K 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 RefineWMG-PT-100101-00
FORMULA_NAME RefineWMG-PT-100101-01
FORMULA_NAME RefineWMG-PT-100101-02
FORMULA_NAME RefineWMG-PT-100101-03
FORMULA_NAME RefineWMG-PT-100101-04
FORMULA_NAME RefineWMG-PT-100101-05
FORMULA_NAME RefineWMG-PT-100101-06
FORMULA_NAME RefineWMG-PT-100101-07
FORMULA_NAME RefineWMG-PT-100101-08
FORMULA_NAME RefineWMG-PT-100101-09
FORMULA_NAME RefineWMG-PT-100101-10
FORMULA_NAME RefineWMG-PT-100101-11
FORMULA_NAME RefineWMG-PT-100101-12
FORMULA_NAME RefineWMG-PT-100101-13
FORMULA_NAME RefineWMG-PT-100101-14
FORMULA_NAME RefineWMG-PT-100101-15

=== Now, execution of the tool begins

BK_START 1621429568573

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 13:06:10] [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 13:06:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 13:06:10] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2021-05-19 13:06:10] [INFO ] Transformed 504 places.
[2021-05-19 13:06:10] [INFO ] Transformed 403 transitions.
[2021-05-19 13:06:10] [INFO ] Parsed PT model containing 504 places and 403 transitions in 112 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 517 ms. (steps per millisecond=193 ) properties seen :[1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1]
// Phase 1: matrix 403 rows 504 cols
[2021-05-19 13:06:11] [INFO ] Computed 202 place invariants in 17 ms
[2021-05-19 13:06:11] [INFO ] [Real]Absence check using 202 positive place invariants in 100 ms returned sat
[2021-05-19 13:06:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:11] [INFO ] [Real]Absence check using state equation in 550 ms returned sat
[2021-05-19 13:06:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:06:12] [INFO ] [Nat]Absence check using 202 positive place invariants in 65 ms returned sat
[2021-05-19 13:06:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:12] [INFO ] [Nat]Absence check using state equation in 622 ms returned sat
[2021-05-19 13:06:12] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 33 ms.
[2021-05-19 13:06:13] [INFO ] Added : 205 causal constraints over 41 iterations in 1043 ms. Result :sat
[2021-05-19 13:06:13] [INFO ] [Real]Absence check using 202 positive place invariants in 10 ms returned unsat
[2021-05-19 13:06:13] [INFO ] [Real]Absence check using 202 positive place invariants in 68 ms returned sat
[2021-05-19 13:06:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:14] [INFO ] [Real]Absence check using state equation in 461 ms returned sat
[2021-05-19 13:06:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:06:14] [INFO ] [Nat]Absence check using 202 positive place invariants in 84 ms returned sat
[2021-05-19 13:06:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:15] [INFO ] [Nat]Absence check using state equation in 556 ms returned sat
[2021-05-19 13:06:15] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 31 ms.
[2021-05-19 13:06:15] [INFO ] Added : 78 causal constraints over 16 iterations in 381 ms. Result :sat
[2021-05-19 13:06:15] [INFO ] [Real]Absence check using 202 positive place invariants in 94 ms returned sat
[2021-05-19 13:06:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:16] [INFO ] [Real]Absence check using state equation in 608 ms returned sat
[2021-05-19 13:06:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:06:16] [INFO ] [Nat]Absence check using 202 positive place invariants in 91 ms returned sat
[2021-05-19 13:06:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:17] [INFO ] [Nat]Absence check using state equation in 640 ms returned sat
[2021-05-19 13:06:17] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 26 ms.
[2021-05-19 13:06:17] [INFO ] Added : 54 causal constraints over 11 iterations in 275 ms. Result :sat
[2021-05-19 13:06:17] [INFO ] [Real]Absence check using 202 positive place invariants in 94 ms returned sat
[2021-05-19 13:06:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:18] [INFO ] [Real]Absence check using state equation in 592 ms returned sat
[2021-05-19 13:06:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:06:18] [INFO ] [Nat]Absence check using 202 positive place invariants in 93 ms returned sat
[2021-05-19 13:06:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:19] [INFO ] [Nat]Absence check using state equation in 820 ms returned sat
[2021-05-19 13:06:19] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 45 ms.
[2021-05-19 13:06:20] [INFO ] Added : 145 causal constraints over 29 iterations in 844 ms. Result :sat
[2021-05-19 13:06:21] [INFO ] [Real]Absence check using 202 positive place invariants in 1085 ms returned sat
[2021-05-19 13:06:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:23] [INFO ] [Real]Absence check using state equation in 2138 ms returned sat
[2021-05-19 13:06:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:06:23] [INFO ] [Nat]Absence check using 202 positive place invariants in 65 ms returned sat
[2021-05-19 13:06:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:25] [INFO ] [Nat]Absence check using state equation in 1983 ms returned sat
[2021-05-19 13:06:25] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 30 ms.
[2021-05-19 13:06:27] [INFO ] Added : 170 causal constraints over 34 iterations in 1389 ms. Result :sat
[2021-05-19 13:06:27] [INFO ] [Real]Absence check using 202 positive place invariants in 462 ms returned sat
[2021-05-19 13:06:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:28] [INFO ] [Real]Absence check using state equation in 493 ms returned sat
[2021-05-19 13:06:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:06:28] [INFO ] [Nat]Absence check using 202 positive place invariants in 91 ms returned sat
[2021-05-19 13:06:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:28] [INFO ] [Nat]Absence check using state equation in 618 ms returned sat
[2021-05-19 13:06:28] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 49 ms.
[2021-05-19 13:06:29] [INFO ] Added : 149 causal constraints over 30 iterations in 695 ms. Result :sat
[2021-05-19 13:06:29] [INFO ] [Real]Absence check using 202 positive place invariants in 67 ms returned sat
[2021-05-19 13:06:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:30] [INFO ] [Real]Absence check using state equation in 468 ms returned sat
[2021-05-19 13:06:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:06:30] [INFO ] [Nat]Absence check using 202 positive place invariants in 92 ms returned sat
[2021-05-19 13:06:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:31] [INFO ] [Nat]Absence check using state equation in 615 ms returned sat
[2021-05-19 13:06:31] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 31 ms.
[2021-05-19 13:06:31] [INFO ] Added : 169 causal constraints over 34 iterations in 797 ms. Result :sat
[2021-05-19 13:06:32] [INFO ] [Real]Absence check using 202 positive place invariants in 82 ms returned sat
[2021-05-19 13:06:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:32] [INFO ] [Real]Absence check using state equation in 567 ms returned sat
[2021-05-19 13:06:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:06:32] [INFO ] [Nat]Absence check using 202 positive place invariants in 96 ms returned sat
[2021-05-19 13:06:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:33] [INFO ] [Nat]Absence check using state equation in 660 ms returned sat
[2021-05-19 13:06:33] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 32 ms.
[2021-05-19 13:06:34] [INFO ] Added : 199 causal constraints over 40 iterations in 900 ms. Result :sat
[2021-05-19 13:06:34] [INFO ] [Real]Absence check using 202 positive place invariants in 7 ms returned unsat
[2021-05-19 13:06:34] [INFO ] [Real]Absence check using 202 positive place invariants in 7 ms returned unsat
[2021-05-19 13:06:34] [INFO ] [Real]Absence check using 202 positive place invariants in 6 ms returned unsat
[2021-05-19 13:06:34] [INFO ] [Real]Absence check using 202 positive place invariants in 92 ms returned sat
[2021-05-19 13:06:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:35] [INFO ] [Real]Absence check using state equation in 580 ms returned sat
[2021-05-19 13:06:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:06:35] [INFO ] [Nat]Absence check using 202 positive place invariants in 95 ms returned sat
[2021-05-19 13:06:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:36] [INFO ] [Nat]Absence check using state equation in 587 ms returned sat
[2021-05-19 13:06:36] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 21 ms.
[2021-05-19 13:06:36] [INFO ] Added : 199 causal constraints over 40 iterations in 810 ms. Result :sat
[2021-05-19 13:06:37] [INFO ] [Real]Absence check using 202 positive place invariants in 60 ms returned sat
[2021-05-19 13:06:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:37] [INFO ] [Real]Absence check using state equation in 421 ms returned sat
[2021-05-19 13:06:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:06:37] [INFO ] [Nat]Absence check using 202 positive place invariants in 93 ms returned sat
[2021-05-19 13:06:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:38] [INFO ] [Nat]Absence check using state equation in 608 ms returned sat
[2021-05-19 13:06:38] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 27 ms.
[2021-05-19 13:06:38] [INFO ] Added : 199 causal constraints over 40 iterations in 690 ms. Result :sat
[2021-05-19 13:06:39] [INFO ] [Real]Absence check using 202 positive place invariants in 98 ms returned sat
[2021-05-19 13:06:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:39] [INFO ] [Real]Absence check using state equation in 598 ms returned sat
[2021-05-19 13:06:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:06:39] [INFO ] [Nat]Absence check using 202 positive place invariants in 99 ms returned sat
[2021-05-19 13:06:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:40] [INFO ] [Nat]Absence check using state equation in 576 ms returned sat
[2021-05-19 13:06:40] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 31 ms.
[2021-05-19 13:06:41] [INFO ] Added : 160 causal constraints over 32 iterations in 616 ms. Result :sat
[2021-05-19 13:06:41] [INFO ] [Real]Absence check using 202 positive place invariants in 125 ms returned sat
[2021-05-19 13:06:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:41] [INFO ] [Real]Absence check using state equation in 461 ms returned sat
[2021-05-19 13:06:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:06:41] [INFO ] [Nat]Absence check using 202 positive place invariants in 93 ms returned sat
[2021-05-19 13:06:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:42] [INFO ] [Nat]Absence check using state equation in 555 ms returned sat
[2021-05-19 13:06:42] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 24 ms.
[2021-05-19 13:06:42] [INFO ] Added : 62 causal constraints over 13 iterations in 278 ms. Result :sat
[2021-05-19 13:06:42] [INFO ] [Real]Absence check using 202 positive place invariants in 64 ms returned sat
[2021-05-19 13:06:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:43] [INFO ] [Real]Absence check using state equation in 400 ms returned sat
[2021-05-19 13:06:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:06:43] [INFO ] [Nat]Absence check using 202 positive place invariants in 59 ms returned sat
[2021-05-19 13:06:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:43] [INFO ] [Nat]Absence check using state equation in 401 ms returned sat
[2021-05-19 13:06:43] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 14 ms.
[2021-05-19 13:06:44] [INFO ] Added : 75 causal constraints over 15 iterations in 275 ms. Result :sat
[2021-05-19 13:06:44] [INFO ] [Real]Absence check using 202 positive place invariants in 59 ms returned sat
[2021-05-19 13:06:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:44] [INFO ] [Real]Absence check using state equation in 448 ms returned sat
[2021-05-19 13:06:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:06:44] [INFO ] [Nat]Absence check using 202 positive place invariants in 59 ms returned sat
[2021-05-19 13:06:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:45] [INFO ] [Nat]Absence check using state equation in 431 ms returned sat
[2021-05-19 13:06:45] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 16 ms.
[2021-05-19 13:06:45] [INFO ] Added : 205 causal constraints over 41 iterations in 758 ms. Result :sat
[2021-05-19 13:06:46] [INFO ] [Real]Absence check using 202 positive place invariants in 56 ms returned sat
[2021-05-19 13:06:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:46] [INFO ] [Real]Absence check using state equation in 559 ms returned sat
[2021-05-19 13:06:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:06:46] [INFO ] [Nat]Absence check using 202 positive place invariants in 94 ms returned sat
[2021-05-19 13:06:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:47] [INFO ] [Nat]Absence check using state equation in 663 ms returned sat
[2021-05-19 13:06:47] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 25 ms.
[2021-05-19 13:06:48] [INFO ] Added : 199 causal constraints over 40 iterations in 1044 ms. Result :sat
[2021-05-19 13:06:48] [INFO ] [Real]Absence check using 202 positive place invariants in 101 ms returned sat
[2021-05-19 13:06:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:49] [INFO ] [Real]Absence check using state equation in 596 ms returned sat
[2021-05-19 13:06:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:06:49] [INFO ] [Nat]Absence check using 202 positive place invariants in 86 ms returned sat
[2021-05-19 13:06:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:50] [INFO ] [Nat]Absence check using state equation in 582 ms returned sat
[2021-05-19 13:06:50] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 18 ms.
[2021-05-19 13:06:50] [INFO ] Added : 36 causal constraints over 8 iterations in 164 ms. Result :sat
[2021-05-19 13:06:50] [INFO ] [Real]Absence check using 202 positive place invariants in 4 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 5 simplifications.
[2021-05-19 13:06:50] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2021-05-19 13:06:50] [INFO ] Flatten gal took : 70 ms
FORMULA RefineWMG-PT-100101-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100101-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100101-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100101-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 13:06:50] [INFO ] Flatten gal took : 32 ms
[2021-05-19 13:06:50] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 7 ms.
[2021-05-19 13:06:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ RefineWMG-PT-100101 @ 3570 seconds

FORMULA RefineWMG-PT-100101-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100101-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA RefineWMG-PT-100101-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100101-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100101-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100101-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100101-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100101-01 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100101-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100101-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100101-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2223
rslt: Output for LTLCardinality @ RefineWMG-PT-100101

{
"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 13:06:51 2021
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((p202 <= p440))",
"processed_size": 18,
"rewrites": 68
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 307
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F ((G ((1 <= p145)) OR (F ((2 <= p79)) OR X ((1 <= p253))))))",
"processed_size": 64,
"rewrites": 68
},
"result":
{
"edges": 102,
"markings": 102,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 338
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 338
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G ((2 <= p76))",
"processed_size": 14,
"rewrites": 68
},
"result":
{
"edges": 1182922,
"markings": 824082,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 375
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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 ((p238 <= p480))))",
"processed_size": 26,
"rewrites": 68
},
"result":
{
"edges": 157,
"markings": 157,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 459
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (X (F (((p157 <= p367) OR (1 <= p468)))))",
"processed_size": 44,
"rewrites": 68
},
"result":
{
"edges": 131,
"markings": 131,
"produced_by": "LTL model checker",
"value": false
},
"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": 609
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 3,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((X (G ((3 <= p8))) OR (G (F ((p447 + 1 <= p419))) AND F (G ((3 <= p8))))))",
"processed_size": 77,
"rewrites": 68
},
"result":
{
"edges": 102,
"markings": 102,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 12
},
"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": 959
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((p142 <= p367)))",
"processed_size": 22,
"rewrites": 68
},
"result":
{
"edges": 873,
"markings": 684,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"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": 1439
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G (((p126 <= p406) AND (p306 <= p172))))",
"processed_size": 43,
"rewrites": 68
},
"result":
{
"edges": 621,
"markings": 486,
"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": "stabilization",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2878
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G ((1 <= p267))",
"processed_size": 15,
"rewrites": 68
},
"result":
{
"edges": 11114,
"markings": 6085,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

{
"child":
[

{
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((p202 <= p440))",
"processed_size": 18,
"rewrites": 68
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3552,
"runtime": 1347.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X(G((X(F(*)) AND **))) OR (G(**) AND F(G((X(F(*)) AND **))))) : (F(*) AND G(**)) : G(F((G(**) OR (F(**) OR X(**))))) : (((X(X(G(**))) OR **) U **) OR G(**)) : X(X(F(**))) : G(F(**)) : F(G((** AND **))) : X(G(*)) : X(X(F(**))) : X(G(*)) : F((X(G(**)) OR (G(F(*)) AND F(G(**))))) : X(G((X(*) OR *)))"
},
"net":
{
"arcs": 1208,
"conflict_clusters": 303,
"places": 504,
"places_significant": 302,
"singleton_clusters": 0,
"transitions": 403
},
"result":
{
"preliminary_value": "unknown no no no no no no unknown no unknown no unknown ",
"value": "unknown no no no no no no unknown no unknown no unknown "
},
"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: 907/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 16128
lola: finding significant places
lola: 504 places, 403 transitions, 302 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: (G ((p202 <= p440)) U G (X ((NOT(X (G ((3 <= p314)))) AND ((p253 + 1 <= p323) OR (p385 <= 1)))))) : (F (NOT(G ((p230 + 1 <= p487)))) AND G ((1 <= p267))) : G ((X ((p213 <= 1)) U F (X (((G ((1 <= p145)) OR F ((2 <= p79))) OR X ((1 <= p253))))))) : (((G (X (G (X (G ((1 <= p129)))))) OR (1 <= p129)) U (1 <= p95)) OR G ((2 <= p76))) : X (F (X (F ((p238 <= p480))))) : X (G (F ((p142 <= p367)))) : G (NOT(G (F ((X (NOT(X ((p126 <= p406)))) OR NOT(X (X ((p306 <= p172))))))))) : NOT(F (((1 <= p420) U X ((p491 + 1 <= p230))))) : F (X ((F ((2 <= p321)) U X (((p157 <= p367) OR (1 <= p468)))))) : NOT(F (X (F ((1 <= p338))))) : F ((G (NOT(G ((p419 <= p447)))) U G (X ((3 <= p8))))) : G (NOT(X ((X ((p412 <= p33)) AND (p412 <= p33)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:335
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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 (G ((X (F ((p314 <= 2))) AND ((p253 + 1 <= p323) OR (p385 <= 1))))) OR (G ((p202 <= p440)) AND F (G ((X (F ((p314 <= 2))) AND ((p253 + 1 <= p323) OR (p385 <= 1)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p202 <= p440))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p202 <= p440))
lola: processed formula length: 18
lola: 68 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: 7 markings, 7 edges
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X (F ((p314 <= 2))) AND ((p253 + 1 <= p323) OR (p385 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X (F ((p314 <= 2))) AND ((p253 + 1 <= p323) OR (p385 <= 1)))))
lola: processed formula length: 70
lola: 68 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: 1173110 markings, 1765322 edges, 234622 markings/sec, 0 secs
lola: 2405731 markings, 3620293 edges, 246524 markings/sec, 5 secs
lola: 3543424 markings, 5332585 edges, 227539 markings/sec, 10 secs
lola: 4665223 markings, 7020811 edges, 224360 markings/sec, 15 secs
lola: 5779778 markings, 8698154 edges, 222911 markings/sec, 20 secs
lola: 6948961 markings, 10457711 edges, 233837 markings/sec, 25 secs
lola: 8063526 markings, 12135041 edges, 222913 markings/sec, 30 secs
lola: 9178173 markings, 13812469 edges, 222929 markings/sec, 35 secs
lola: 10239485 markings, 15409782 edges, 212262 markings/sec, 40 secs
lola: 11403801 markings, 17161981 edges, 232863 markings/sec, 45 secs
lola: 12432028 markings, 18709442 edges, 205645 markings/sec, 50 secs
lola: 13547424 markings, 20387964 edges, 223079 markings/sec, 55 secs
lola: 14675743 markings, 22086085 edges, 225664 markings/sec, 60 secs
lola: 15824130 markings, 23814345 edges, 229677 markings/sec, 65 secs
lola: 16926168 markings, 25472917 edges, 220408 markings/sec, 70 secs
lola: 18047600 markings, 27160552 edges, 224286 markings/sec, 75 secs
lola: 19201725 markings, 28897444 edges, 230825 markings/sec, 80 secs
lola: 20343296 markings, 30615562 edges, 228314 markings/sec, 85 secs
lola: 21493410 markings, 32346384 edges, 230023 markings/sec, 90 secs
lola: 22663163 markings, 34106764 edges, 233951 markings/sec, 95 secs
lola: 23863052 markings, 35912514 edges, 239978 markings/sec, 100 secs
lola: 25035557 markings, 37677087 edges, 234501 markings/sec, 105 secs
lola: 26209490 markings, 39443886 edges, 234787 markings/sec, 110 secs
lola: 27281460 markings, 41056988 edges, 214394 markings/sec, 115 secs
lola: 28073918 markings, 42249734 edges, 158492 markings/sec, 120 secs
lola: 28852169 markings, 43421052 edges, 155650 markings/sec, 125 secs
lola: 29311520 markings, 44112278 edges, 91870 markings/sec, 130 secs
lola: 30091476 markings, 45286058 edges, 155991 markings/sec, 135 secs
lola: 30674998 markings, 46164238 edges, 116704 markings/sec, 140 secs
lola: 31310509 markings, 47120508 edges, 127102 markings/sec, 145 secs
lola: 31628450 markings, 47599086 edges, 63588 markings/sec, 150 secs
lola: 32413149 markings, 48780063 edges, 156940 markings/sec, 155 secs
lola: 32552558 markings, 48989796 edges, 27882 markings/sec, 160 secs
lola: 33311616 markings, 50132168 edges, 151812 markings/sec, 165 secs
lola: 33924503 markings, 51054582 edges, 122577 markings/sec, 170 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 1 will run for 307 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((1 <= p145)) OR (F ((2 <= p79)) OR X ((1 <= p253))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((1 <= p145)) OR (F ((2 <= p79)) OR X ((1 <= p253))))))
lola: processed formula length: 64
lola: 68 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: 102 markings, 102 edges
lola: ========================================
lola: subprocess 2 will run for 338 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((X (X (G ((1 <= p129)))) OR (1 <= p129)) U (1 <= p95)) OR G ((2 <= p76)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 338 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((2 <= p76))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((2 <= p76))
lola: processed formula length: 14
lola: 68 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: 751911 markings, 1079404 edges, 150382 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 824082 markings, 1182922 edges
lola: ========================================
lola: subprocess 3 will run for 375 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X (X (G ((1 <= p129)))) OR (1 <= p129)) U (1 <= p95))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((X (X (G ((1 <= p129)))) OR (1 <= p129)) U (1 <= p95))
lola: processed formula length: 55
lola: 68 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: 102 markings, 102 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 375 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((p238 <= p480))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((p238 <= p480))))
lola: processed formula length: 26
lola: 68 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: 157 markings, 157 edges
lola: ========================================
lola: subprocess 4 will run for 422 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p230 <= p491)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p230 <= p491)))
lola: processed formula length: 22
lola: 68 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: 1171529 markings, 1762994 edges, 234306 markings/sec, 0 secs
lola: 2376597 markings, 3576623 edges, 241014 markings/sec, 5 secs
lola: 3582331 markings, 5391135 edges, 241147 markings/sec, 10 secs
lola: 4678164 markings, 7040346 edges, 219167 markings/sec, 15 secs
lola: 5799842 markings, 8728378 edges, 224336 markings/sec, 20 secs
lola: 6958990 markings, 10472828 edges, 231830 markings/sec, 25 secs
lola: 8143231 markings, 12255082 edges, 236848 markings/sec, 30 secs
lola: 9328671 markings, 14039086 edges, 237088 markings/sec, 35 secs
lola: 10532160 markings, 15850329 edges, 240698 markings/sec, 40 secs
lola: 11717493 markings, 17634148 edges, 237067 markings/sec, 45 secs
lola: 12894735 markings, 19405842 edges, 235448 markings/sec, 50 secs
lola: 14094121 markings, 21210858 edges, 239877 markings/sec, 55 secs
lola: 15260646 markings, 22966440 edges, 233305 markings/sec, 60 secs
lola: 16315490 markings, 24553944 edges, 210969 markings/sec, 65 secs
lola: 17435877 markings, 26240092 edges, 224077 markings/sec, 70 secs
lola: 18615446 markings, 28015234 edges, 235914 markings/sec, 75 secs
lola: 19778941 markings, 29766195 edges, 232699 markings/sec, 80 secs
lola: 20958934 markings, 31542096 edges, 235999 markings/sec, 85 secs
lola: 22133608 markings, 33309892 edges, 234935 markings/sec, 90 secs
lola: 23316057 markings, 35089415 edges, 236490 markings/sec, 95 secs
lola: 24464615 markings, 36817904 edges, 229712 markings/sec, 100 secs
lola: 25170442 markings, 37880437 edges, 141165 markings/sec, 105 secs
lola: 25462901 markings, 38320348 edges, 58492 markings/sec, 110 secs
lola: 26179447 markings, 39400883 edges, 143309 markings/sec, 115 secs
lola: 26701001 markings, 40183581 edges, 104311 markings/sec, 120 secs
lola: 27273400 markings, 41045048 edges, 114480 markings/sec, 125 secs
lola: 28012429 markings, 42157242 edges, 147806 markings/sec, 130 secs
lola: 28688866 markings, 43175202 edges, 135287 markings/sec, 135 secs
lola: 29437598 markings, 44302064 edges, 149746 markings/sec, 140 secs
lola: 29987352 markings, 45129418 edges, 109951 markings/sec, 145 secs
lola: 30628749 markings, 46094679 edges, 128279 markings/sec, 150 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 459 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F (((p157 <= p367) OR (1 <= p468)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F (((p157 <= p367) OR (1 <= p468)))))
lola: processed formula length: 44
lola: 68 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: 131 markings, 131 edges
lola: ========================================
lola: subprocess 6 will run for 536 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p338 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p338 <= 0)))
lola: processed formula length: 19
lola: 68 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: 1027716 markings, 1546554 edges, 205543 markings/sec, 0 secs
lola: 2106707 markings, 3170462 edges, 215798 markings/sec, 5 secs
lola: 3125136 markings, 4703075 edges, 203686 markings/sec, 10 secs
lola: 4142072 markings, 6233572 edges, 203387 markings/sec, 15 secs
lola: 5202114 markings, 7828829 edges, 212008 markings/sec, 20 secs
lola: 6249701 markings, 9405424 edges, 209517 markings/sec, 25 secs
lola: 7297655 markings, 10982511 edges, 209591 markings/sec, 30 secs
lola: 8405301 markings, 12649499 edges, 221529 markings/sec, 35 secs
lola: 9488442 markings, 14279578 edges, 216628 markings/sec, 40 secs
lola: 10555883 markings, 15885992 edges, 213488 markings/sec, 45 secs
lola: 11619492 markings, 17486634 edges, 212722 markings/sec, 50 secs
lola: 12741194 markings, 19174810 edges, 224340 markings/sec, 55 secs
lola: 13894032 markings, 20909748 edges, 230568 markings/sec, 60 secs
lola: 14935016 markings, 22476409 edges, 208197 markings/sec, 65 secs
lola: 15982084 markings, 24052136 edges, 209414 markings/sec, 70 secs
lola: 17050876 markings, 25660639 edges, 213758 markings/sec, 75 secs
lola: 18166362 markings, 27339396 edges, 223097 markings/sec, 80 secs
lola: 19318482 markings, 29073252 edges, 230424 markings/sec, 85 secs
lola: 20312320 markings, 30568943 edges, 198768 markings/sec, 90 secs
lola: 21355459 markings, 32138821 edges, 208628 markings/sec, 95 secs
lola: 22387074 markings, 33691323 edges, 206323 markings/sec, 100 secs
lola: 23438977 markings, 35274434 edges, 210381 markings/sec, 105 secs
lola: 24514203 markings, 36892557 edges, 215045 markings/sec, 110 secs
lola: 25221471 markings, 37957068 edges, 141454 markings/sec, 115 secs
lola: 25540687 markings, 38437834 edges, 63843 markings/sec, 120 secs
lola: 26266743 markings, 39530036 edges, 145211 markings/sec, 125 secs
lola: 26845998 markings, 40401828 edges, 115851 markings/sec, 130 secs
lola: 27776807 markings, 41802671 edges, 186162 markings/sec, 135 secs
lola: 28390446 markings, 42726112 edges, 122728 markings/sec, 140 secs
lola: 29029963 markings, 43688569 edges, 127903 markings/sec, 145 secs
lola: 29827073 markings, 44888188 edges, 159422 markings/sec, 150 secs
lola: 30454179 markings, 45831918 edges, 125421 markings/sec, 155 secs
lola: 30578946 markings, 46019679 edges, 24953 markings/sec, 160 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 609 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (G ((3 <= p8))) OR (G (F ((p447 + 1 <= p419))) AND F (G ((3 <= p8))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (G ((3 <= p8))) OR (G (F ((p447 + 1 <= p419))) AND F (G ((3 <= p8))))))
lola: processed formula length: 77
lola: 68 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 12 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: 102 markings, 102 edges
lola: ========================================
lola: subprocess 8 will run for 762 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X ((p33 + 1 <= p412)) OR (p33 + 1 <= p412))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X ((p33 + 1 <= p412)) OR (p33 + 1 <= p412))))
lola: processed formula length: 52
lola: 68 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: 985959 markings, 1483719 edges, 197192 markings/sec, 0 secs
lola: 2186380 markings, 3290336 edges, 240084 markings/sec, 5 secs
lola: 3398907 markings, 5115077 edges, 242505 markings/sec, 10 secs
lola: 4500846 markings, 6773501 edges, 220388 markings/sec, 15 secs
lola: 5569066 markings, 8381055 edges, 213644 markings/sec, 20 secs
lola: 6766257 markings, 10182834 edges, 239438 markings/sec, 25 secs
lola: 7970055 markings, 11994495 edges, 240760 markings/sec, 30 secs
lola: 8995566 markings, 13537811 edges, 205102 markings/sec, 35 secs
lola: 10128306 markings, 15242499 edges, 226548 markings/sec, 40 secs
lola: 11216485 markings, 16880192 edges, 217636 markings/sec, 45 secs
lola: 12332188 markings, 18559262 edges, 223141 markings/sec, 50 secs
lola: 13424002 markings, 20202399 edges, 218363 markings/sec, 55 secs
lola: 14619966 markings, 22002216 edges, 239193 markings/sec, 60 secs
lola: 15810564 markings, 23794021 edges, 238120 markings/sec, 65 secs
lola: 16990303 markings, 25569485 edges, 235948 markings/sec, 70 secs
lola: 18123300 markings, 27274580 edges, 226599 markings/sec, 75 secs
lola: 19310339 markings, 29061032 edges, 237408 markings/sec, 80 secs
lola: 20498640 markings, 30849331 edges, 237660 markings/sec, 85 secs
lola: 21667217 markings, 32608012 edges, 233715 markings/sec, 90 secs
lola: 22852118 markings, 34391228 edges, 236980 markings/sec, 95 secs
lola: 24005207 markings, 36126526 edges, 230618 markings/sec, 100 secs
lola: 24845232 markings, 37391085 edges, 168005 markings/sec, 105 secs
lola: 25137170 markings, 37830237 edges, 58388 markings/sec, 110 secs
lola: 25505793 markings, 38384913 edges, 73725 markings/sec, 115 secs
lola: 26185966 markings, 39408453 edges, 136035 markings/sec, 120 secs
lola: 26767100 markings, 40283039 edges, 116227 markings/sec, 125 secs
lola: 27421773 markings, 41268325 edges, 130935 markings/sec, 130 secs
lola: 28041217 markings, 42200561 edges, 123889 markings/sec, 135 secs
lola: 28740627 markings, 43253093 edges, 139882 markings/sec, 140 secs
lola: 29578190 markings, 44513627 edges, 167513 markings/sec, 145 secs
lola: 30075803 markings, 45262480 edges, 99523 markings/sec, 150 secs
lola: 30624056 markings, 46087594 edges, 109651 markings/sec, 155 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 959 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p142 <= p367)))
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 ((p142 <= p367)))
lola: processed formula length: 22
lola: 68 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: 684 markings, 873 edges
lola: ========================================
lola: subprocess 10 will run for 1439 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p126 <= p406) AND (p306 <= p172))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((p126 <= p406) AND (p306 <= p172))))
lola: processed formula length: 43
lola: 68 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: add low 321
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: 486 markings, 621 edges
lola: ========================================
lola: subprocess 11 will run for 2878 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((p487 <= p230)) AND G ((1 <= p267)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 2878 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((1 <= p267))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((1 <= p267))
lola: processed formula length: 15
lola: 68 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: 6085 markings, 11114 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (X (G ((X (F ((p314 <= 2))) AND ((p253 + 1 <= p323) OR (p385 <= 1))))) OR (G ((p202 <= p440)) AND F (G ((X (F ((p314 <= 2))) AND ((p253 + 1 <= p323) OR (p385 <= 1)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: G ((p202 <= p440))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p202 <= p440))
lola: processed formula length: 18
lola: 68 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: 7 markings, 7 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (G ((X (F ((p314 <= 2))) AND ((p253 + 1 <= p323) OR (p385 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X (F ((p314 <= 2))) AND ((p253 + 1 <= p323) OR (p385 <= 1)))))
lola: processed formula length: 70
lola: 68 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: 1065282 markings, 1603058 edges, 213056 markings/sec, 0 secs
lola: 2081836 markings, 3132860 edges, 203311 markings/sec, 5 secs
lola: 3198483 markings, 4813392 edges, 223329 markings/sec, 10 secs
lola: 4223054 markings, 6355310 edges, 204914 markings/sec, 15 secs
lola: 5260012 markings, 7915888 edges, 207392 markings/sec, 20 secs
lola: 6288846 markings, 9464246 edges, 205767 markings/sec, 25 secs
lola: 7330103 markings, 11031343 edges, 208251 markings/sec, 30 secs
lola: 8451785 markings, 12719461 edges, 224336 markings/sec, 35 secs
lola: 9529643 markings, 14341577 edges, 215572 markings/sec, 40 secs
lola: 10585788 markings, 15930817 edges, 211229 markings/sec, 45 secs
lola: 11683473 markings, 17582931 edges, 219537 markings/sec, 50 secs
lola: 12698900 markings, 19111128 edges, 203085 markings/sec, 55 secs
lola: 13764326 markings, 20714502 edges, 213085 markings/sec, 60 secs
lola: 14788296 markings, 22255440 edges, 204794 markings/sec, 65 secs
lola: 15877250 markings, 23894279 edges, 217791 markings/sec, 70 secs
lola: 17026996 markings, 25624712 edges, 229949 markings/sec, 75 secs
lola: 18207302 markings, 27400866 edges, 236061 markings/sec, 80 secs
lola: 19405756 markings, 29204516 edges, 239691 markings/sec, 85 secs
lola: 20583540 markings, 30977057 edges, 235557 markings/sec, 90 secs
lola: 21751642 markings, 32735011 edges, 233620 markings/sec, 95 secs
lola: 22922222 markings, 34496660 edges, 234116 markings/sec, 100 secs
lola: 24020524 markings, 36149546 edges, 219660 markings/sec, 105 secs
lola: 25134120 markings, 37825518 edges, 222719 markings/sec, 110 secs
lola: 26044070 markings, 39194857 edges, 181990 markings/sec, 115 secs
lola: 27065396 markings, 40731867 edges, 204265 markings/sec, 120 secs
lola: 27954171 markings, 42070021 edges, 177755 markings/sec, 125 secs
lola: 28715038 markings, 43214721 edges, 152173 markings/sec, 130 secs
lola: 29216464 markings, 43969282 edges, 100285 markings/sec, 135 secs
lola: 29650510 markings, 44622398 edges, 86809 markings/sec, 140 secs
lola: 30137001 markings, 45354585 edges, 97298 markings/sec, 145 secs
lola: 30935212 markings, 46555739 edges, 159642 markings/sec, 150 secs
lola: 31628158 markings, 47598706 edges, 138589 markings/sec, 155 secs
lola: 32367878 markings, 48711907 edges, 147944 markings/sec, 160 secs
lola: 33082316 markings, 49787154 edges, 142888 markings/sec, 165 secs
lola: 33885106 markings, 50995285 edges, 160558 markings/sec, 170 secs
lola: 34191434 markings, 51456211 edges, 61266 markings/sec, 175 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (G ((p230 <= p491)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p230 <= p491)))
lola: processed formula length: 22
lola: 68 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: 1168576 markings, 1758554 edges, 233715 markings/sec, 0 secs
lola: 2263957 markings, 3407096 edges, 219076 markings/sec, 5 secs
lola: 3353223 markings, 5046336 edges, 217853 markings/sec, 10 secs
lola: 4461334 markings, 6714003 edges, 221622 markings/sec, 15 secs
lola: 5590524 markings, 8413339 edges, 225838 markings/sec, 20 secs
lola: 6691281 markings, 10069943 edges, 220151 markings/sec, 25 secs
lola: 7807639 markings, 11750024 edges, 223272 markings/sec, 30 secs
lola: 8906417 markings, 13403686 edges, 219756 markings/sec, 35 secs
lola: 10036885 markings, 15104903 edges, 226094 markings/sec, 40 secs
lola: 11143431 markings, 16770197 edges, 221309 markings/sec, 45 secs
lola: 12272157 markings, 18468898 edges, 225745 markings/sec, 50 secs
lola: 13379306 markings, 20135144 edges, 221430 markings/sec, 55 secs
lola: 14509323 markings, 21835745 edges, 226003 markings/sec, 60 secs
lola: 15602134 markings, 23480371 edges, 218562 markings/sec, 65 secs
lola: 16708136 markings, 25144854 edges, 221200 markings/sec, 70 secs
lola: 17795488 markings, 26781236 edges, 217470 markings/sec, 75 secs
lola: 18907055 markings, 28454089 edges, 222313 markings/sec, 80 secs
lola: 20008377 markings, 30111491 edges, 220264 markings/sec, 85 secs
lola: 21105965 markings, 31763344 edges, 219518 markings/sec, 90 secs
lola: 22273374 markings, 33520200 edges, 233482 markings/sec, 95 secs
lola: 23442017 markings, 35279001 edges, 233729 markings/sec, 100 secs
lola: 24591760 markings, 37009359 edges, 229949 markings/sec, 105 secs
lola: 25042044 markings, 37687253 edges, 90057 markings/sec, 110 secs
lola: 25349812 markings, 38150223 edges, 61554 markings/sec, 115 secs
lola: 26100014 markings, 39279128 edges, 150040 markings/sec, 120 secs
lola: 26761995 markings, 40275384 edges, 132396 markings/sec, 125 secs
lola: 27502592 markings, 41389955 edges, 148119 markings/sec, 130 secs
lola: 28164160 markings, 42385537 edges, 132314 markings/sec, 135 secs
lola: 29032344 markings, 43692126 edges, 173637 markings/sec, 140 secs
lola: 29721879 markings, 44729854 edges, 137907 markings/sec, 145 secs
lola: 30552598 markings, 45980023 edges, 166144 markings/sec, 150 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: X (G ((p338 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p338 <= 0)))
lola: processed formula length: 19
lola: 68 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: 1195322 markings, 1798765 edges, 239064 markings/sec, 0 secs
lola: 2365456 markings, 3559810 edges, 234027 markings/sec, 5 secs
lola: 3563271 markings, 5362485 edges, 239563 markings/sec, 10 secs
lola: 4668790 markings, 7026214 edges, 221104 markings/sec, 15 secs
lola: 5867184 markings, 8829759 edges, 239679 markings/sec, 20 secs
lola: 7040904 markings, 10596113 edges, 234744 markings/sec, 25 secs
lola: 8232084 markings, 12388787 edges, 238236 markings/sec, 30 secs
lola: 9418901 markings, 14174887 edges, 237363 markings/sec, 35 secs
lola: 10614157 markings, 15973747 edges, 239051 markings/sec, 40 secs
lola: 11792385 markings, 17746854 edges, 235646 markings/sec, 45 secs
lola: 12958244 markings, 19501453 edges, 233172 markings/sec, 50 secs
lola: 14143715 markings, 21285514 edges, 237094 markings/sec, 55 secs
lola: 15308301 markings, 23038142 edges, 232917 markings/sec, 60 secs
lola: 16481929 markings, 24804428 edges, 234726 markings/sec, 65 secs
lola: 17640730 markings, 26548352 edges, 231760 markings/sec, 70 secs
lola: 18815707 markings, 28316644 edges, 234995 markings/sec, 75 secs
lola: 19899640 markings, 29947864 edges, 216787 markings/sec, 80 secs
lola: 21062409 markings, 31697831 edges, 232554 markings/sec, 85 secs
lola: 22226772 markings, 33450090 edges, 232873 markings/sec, 90 secs
lola: 23383622 markings, 35191117 edges, 231370 markings/sec, 95 secs
lola: 24545271 markings, 36939314 edges, 232330 markings/sec, 100 secs
lola: 25184356 markings, 37901410 edges, 127817 markings/sec, 105 secs
lola: 25836718 markings, 38888965 edges, 130472 markings/sec, 110 secs
lola: 26471885 markings, 39838781 edges, 127033 markings/sec, 115 secs
lola: 27153034 markings, 40863920 edges, 136230 markings/sec, 120 secs
lola: 27928210 markings, 42030522 edges, 155035 markings/sec, 125 secs
lola: 28633631 markings, 43092116 edges, 141084 markings/sec, 130 secs
lola: 29350819 markings, 44171406 edges, 143438 markings/sec, 135 secs
lola: 30245981 markings, 45518581 edges, 179032 markings/sec, 140 secs
lola: 30625848 markings, 46090279 edges, 75973 markings/sec, 145 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: X (G ((X ((p33 + 1 <= p412)) OR (p33 + 1 <= p412))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X ((p33 + 1 <= p412)) OR (p33 + 1 <= p412))))
lola: processed formula length: 52
lola: 68 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: 1191238 markings, 1792641 edges, 238248 markings/sec, 0 secs
lola: 2325166 markings, 3499207 edges, 226786 markings/sec, 5 secs
lola: 3483561 markings, 5242476 edges, 231679 markings/sec, 10 secs
lola: 4615606 markings, 6946171 edges, 226409 markings/sec, 15 secs
lola: 5775958 markings, 8692407 edges, 232070 markings/sec, 20 secs
lola: 6910828 markings, 10400372 edges, 226974 markings/sec, 25 secs
lola: 8056019 markings, 12123839 edges, 229038 markings/sec, 30 secs
lola: 9180466 markings, 13816060 edges, 224889 markings/sec, 35 secs
lola: 10325785 markings, 15539710 edges, 229064 markings/sec, 40 secs
lola: 11452788 markings, 17235780 edges, 225401 markings/sec, 45 secs
lola: 12587685 markings, 18943787 edges, 226979 markings/sec, 50 secs
lola: 13707090 markings, 20628372 edges, 223881 markings/sec, 55 secs
lola: 14827767 markings, 22314991 edges, 224135 markings/sec, 60 secs
lola: 15938505 markings, 23986591 edges, 222148 markings/sec, 65 secs
lola: 17037639 markings, 25640754 edges, 219827 markings/sec, 70 secs
lola: 18163161 markings, 27334581 edges, 225104 markings/sec, 75 secs
lola: 19276955 markings, 29010788 edges, 222759 markings/sec, 80 secs
lola: 20389322 markings, 30684822 edges, 222473 markings/sec, 85 secs
lola: 21477435 markings, 32322388 edges, 217623 markings/sec, 90 secs
lola: 22596718 markings, 34006866 edges, 223857 markings/sec, 95 secs
lola: 23687522 markings, 35648450 edges, 218161 markings/sec, 100 secs
lola: 24736422 markings, 37227564 edges, 209780 markings/sec, 105 secs
lola: 25264721 markings, 38022224 edges, 105660 markings/sec, 110 secs
lola: 25873039 markings, 38937529 edges, 121664 markings/sec, 115 secs
lola: 26596781 markings, 40026718 edges, 144748 markings/sec, 120 secs
lola: 27349700 markings, 41159864 edges, 150584 markings/sec, 125 secs
lola: 28116456 markings, 42313787 edges, 153351 markings/sec, 130 secs
lola: 28888787 markings, 43476073 edges, 154466 markings/sec, 135 secs
lola: 29642788 markings, 44610846 edges, 150800 markings/sec, 140 secs
lola: 30379733 markings, 45719922 edges, 147389 markings/sec, 145 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: unknown no no no no no no unknown no unknown no unknown
lola:
preliminary result: unknown no no no no no no unknown no unknown no unknown
lola: memory consumption: 3552 KB
lola: time consumption: 1347 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="RefineWMG-PT-100101"
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 RefineWMG-PT-100101, 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-162089432900349"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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