fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r186-oct2-158987938500121
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for RefineWMG-PT-100101

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15744.020 3600000.00 87979.00 2503.10 TFFFTFTFFFTTFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r186-oct2-158987938500121.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
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 r186-oct2-158987938500121
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 392K
-rw-r--r-- 1 mcc users 3.0K Apr 12 10:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 12 10:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 11 12:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 11 12:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 14 12:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 14 12:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 10 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 10 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 9 22:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 9 22:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 218K Mar 24 05:38 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 1591228131184

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 23:48:54] [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]
[2020-06-03 23:48:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 23:48:55] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2020-06-03 23:48:55] [INFO ] Transformed 504 places.
[2020-06-03 23:48:55] [INFO ] Transformed 403 transitions.
[2020-06-03 23:48:55] [INFO ] Parsed PT model containing 504 places and 403 transitions in 106 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100008 steps, including 0 resets, run finished after 346 ms. (steps per millisecond=289 ) properties seen :[0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0]
// Phase 1: matrix 403 rows 504 cols
[2020-06-03 23:48:55] [INFO ] Computed 202 place invariants in 14 ms
[2020-06-03 23:48:55] [INFO ] [Real]Absence check using 202 positive place invariants in 12 ms returned unsat
[2020-06-03 23:48:55] [INFO ] [Real]Absence check using 202 positive place invariants in 105 ms returned sat
[2020-06-03 23:48:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:48:56] [INFO ] [Real]Absence check using state equation in 504 ms returned sat
[2020-06-03 23:48:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:48:56] [INFO ] [Nat]Absence check using 202 positive place invariants in 118 ms returned sat
[2020-06-03 23:48:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:48:57] [INFO ] [Nat]Absence check using state equation in 748 ms returned sat
[2020-06-03 23:48:57] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 51 ms.
[2020-06-03 23:48:58] [INFO ] Added : 136 causal constraints over 28 iterations in 759 ms. Result :sat
[2020-06-03 23:48:58] [INFO ] [Real]Absence check using 202 positive place invariants in 76 ms returned sat
[2020-06-03 23:48:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:48:58] [INFO ] [Real]Absence check using state equation in 498 ms returned sat
[2020-06-03 23:48:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:48:59] [INFO ] [Nat]Absence check using 202 positive place invariants in 121 ms returned sat
[2020-06-03 23:48:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:48:59] [INFO ] [Nat]Absence check using state equation in 509 ms returned sat
[2020-06-03 23:48:59] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 31 ms.
[2020-06-03 23:49:00] [INFO ] Added : 199 causal constraints over 40 iterations in 1084 ms. Result :sat
[2020-06-03 23:49:01] [INFO ] [Real]Absence check using 202 positive place invariants in 347 ms returned sat
[2020-06-03 23:49:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:03] [INFO ] [Real]Absence check using state equation in 1959 ms returned sat
[2020-06-03 23:49:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:49:03] [INFO ] [Nat]Absence check using 202 positive place invariants in 62 ms returned sat
[2020-06-03 23:49:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:03] [INFO ] [Nat]Absence check using state equation in 444 ms returned sat
[2020-06-03 23:49:03] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 18 ms.
[2020-06-03 23:49:04] [INFO ] Added : 101 causal constraints over 21 iterations in 665 ms. Result :sat
[2020-06-03 23:49:04] [INFO ] [Real]Absence check using 202 positive place invariants in 62 ms returned sat
[2020-06-03 23:49:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:05] [INFO ] [Real]Absence check using state equation in 446 ms returned sat
[2020-06-03 23:49:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:49:05] [INFO ] [Nat]Absence check using 202 positive place invariants in 66 ms returned sat
[2020-06-03 23:49:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:06] [INFO ] [Nat]Absence check using state equation in 1214 ms returned sat
[2020-06-03 23:49:06] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 14 ms.
[2020-06-03 23:49:06] [INFO ] Added : 101 causal constraints over 21 iterations in 509 ms. Result :sat
[2020-06-03 23:49:07] [INFO ] [Real]Absence check using 202 positive place invariants in 106 ms returned sat
[2020-06-03 23:49:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:07] [INFO ] [Real]Absence check using state equation in 569 ms returned sat
[2020-06-03 23:49:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:49:07] [INFO ] [Nat]Absence check using 202 positive place invariants in 61 ms returned sat
[2020-06-03 23:49:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:08] [INFO ] [Nat]Absence check using state equation in 456 ms returned sat
[2020-06-03 23:49:08] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 21 ms.
[2020-06-03 23:49:08] [INFO ] Added : 76 causal constraints over 16 iterations in 708 ms. Result :sat
[2020-06-03 23:49:09] [INFO ] [Real]Absence check using 202 positive place invariants in 61 ms returned sat
[2020-06-03 23:49:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:09] [INFO ] [Real]Absence check using state equation in 438 ms returned sat
[2020-06-03 23:49:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:49:09] [INFO ] [Nat]Absence check using 202 positive place invariants in 60 ms returned sat
[2020-06-03 23:49:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:10] [INFO ] [Nat]Absence check using state equation in 450 ms returned sat
[2020-06-03 23:49:10] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 16 ms.
[2020-06-03 23:49:10] [INFO ] Added : 43 causal constraints over 9 iterations in 241 ms. Result :sat
[2020-06-03 23:49:10] [INFO ] [Real]Absence check using 202 positive place invariants in 57 ms returned sat
[2020-06-03 23:49:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:10] [INFO ] [Real]Absence check using state equation in 462 ms returned sat
[2020-06-03 23:49:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:49:11] [INFO ] [Nat]Absence check using 202 positive place invariants in 169 ms returned sat
[2020-06-03 23:49:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:11] [INFO ] [Nat]Absence check using state equation in 471 ms returned sat
[2020-06-03 23:49:11] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 37 ms.
[2020-06-03 23:49:12] [INFO ] Added : 198 causal constraints over 40 iterations in 1177 ms. Result :sat
[2020-06-03 23:49:13] [INFO ] [Real]Absence check using 202 positive place invariants in 185 ms returned sat
[2020-06-03 23:49:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:13] [INFO ] [Real]Absence check using state equation in 506 ms returned sat
[2020-06-03 23:49:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:49:13] [INFO ] [Nat]Absence check using 202 positive place invariants in 70 ms returned sat
[2020-06-03 23:49:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:14] [INFO ] [Nat]Absence check using state equation in 1004 ms returned sat
[2020-06-03 23:49:14] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 37 ms.
[2020-06-03 23:49:15] [INFO ] Added : 112 causal constraints over 23 iterations in 755 ms. Result :sat
[2020-06-03 23:49:15] [INFO ] [Real]Absence check using 202 positive place invariants in 162 ms returned sat
[2020-06-03 23:49:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:16] [INFO ] [Real]Absence check using state equation in 791 ms returned sat
[2020-06-03 23:49:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:49:16] [INFO ] [Nat]Absence check using 202 positive place invariants in 237 ms returned sat
[2020-06-03 23:49:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:17] [INFO ] [Nat]Absence check using state equation in 563 ms returned sat
[2020-06-03 23:49:17] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 18 ms.
[2020-06-03 23:49:18] [INFO ] Added : 198 causal constraints over 40 iterations in 1260 ms. Result :sat
[2020-06-03 23:49:18] [INFO ] [Real]Absence check using 202 positive place invariants in 14 ms returned unsat
[2020-06-03 23:49:18] [INFO ] [Real]Absence check using 202 positive place invariants in 57 ms returned sat
[2020-06-03 23:49:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:19] [INFO ] [Real]Absence check using state equation in 431 ms returned sat
[2020-06-03 23:49:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:49:19] [INFO ] [Nat]Absence check using 202 positive place invariants in 105 ms returned sat
[2020-06-03 23:49:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:20] [INFO ] [Nat]Absence check using state equation in 1136 ms returned sat
[2020-06-03 23:49:20] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 15 ms.
[2020-06-03 23:49:21] [INFO ] Added : 76 causal constraints over 16 iterations in 467 ms. Result :sat
[2020-06-03 23:49:21] [INFO ] [Real]Absence check using 202 positive place invariants in 186 ms returned sat
[2020-06-03 23:49:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:22] [INFO ] [Real]Absence check using state equation in 1357 ms returned sat
[2020-06-03 23:49:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:49:22] [INFO ] [Nat]Absence check using 202 positive place invariants in 96 ms returned sat
[2020-06-03 23:49:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:24] [INFO ] [Nat]Absence check using state equation in 1149 ms returned sat
[2020-06-03 23:49:24] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 30 ms.
[2020-06-03 23:49:25] [INFO ] Added : 203 causal constraints over 41 iterations in 1022 ms. Result :sat
[2020-06-03 23:49:25] [INFO ] [Real]Absence check using 202 positive place invariants in 161 ms returned sat
[2020-06-03 23:49:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:25] [INFO ] [Real]Absence check using state equation in 519 ms returned sat
[2020-06-03 23:49:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:49:26] [INFO ] [Nat]Absence check using 202 positive place invariants in 96 ms returned sat
[2020-06-03 23:49:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:26] [INFO ] [Nat]Absence check using state equation in 445 ms returned sat
[2020-06-03 23:49:26] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 15 ms.
[2020-06-03 23:49:27] [INFO ] Added : 115 causal constraints over 23 iterations in 739 ms. Result :sat
[2020-06-03 23:49:27] [INFO ] [Real]Absence check using 202 positive place invariants in 138 ms returned sat
[2020-06-03 23:49:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:28] [INFO ] [Real]Absence check using state equation in 693 ms returned sat
[2020-06-03 23:49:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:49:28] [INFO ] [Nat]Absence check using 202 positive place invariants in 60 ms returned sat
[2020-06-03 23:49:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:28] [INFO ] [Nat]Absence check using state equation in 434 ms returned sat
[2020-06-03 23:49:28] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 13 ms.
[2020-06-03 23:49:29] [INFO ] Added : 79 causal constraints over 16 iterations in 435 ms. Result :sat
[2020-06-03 23:49:29] [INFO ] [Real]Absence check using 202 positive place invariants in 77 ms returned sat
[2020-06-03 23:49:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:29] [INFO ] [Real]Absence check using state equation in 474 ms returned sat
[2020-06-03 23:49:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:49:30] [INFO ] [Nat]Absence check using 202 positive place invariants in 143 ms returned sat
[2020-06-03 23:49:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:30] [INFO ] [Nat]Absence check using state equation in 490 ms returned sat
[2020-06-03 23:49:30] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 23 ms.
[2020-06-03 23:49:31] [INFO ] Added : 184 causal constraints over 37 iterations in 1285 ms. Result :sat
[2020-06-03 23:49:32] [INFO ] [Real]Absence check using 202 positive place invariants in 20 ms returned unsat
[2020-06-03 23:49:32] [INFO ] [Real]Absence check using 202 positive place invariants in 56 ms returned sat
[2020-06-03 23:49:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:32] [INFO ] [Real]Absence check using state equation in 448 ms returned sat
[2020-06-03 23:49:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:49:32] [INFO ] [Nat]Absence check using 202 positive place invariants in 78 ms returned sat
[2020-06-03 23:49:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:33] [INFO ] [Nat]Absence check using state equation in 449 ms returned sat
[2020-06-03 23:49:33] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 37 ms.
[2020-06-03 23:49:34] [INFO ] Added : 136 causal constraints over 28 iterations in 872 ms. Result :sat
[2020-06-03 23:49:34] [INFO ] [Real]Absence check using 202 positive place invariants in 108 ms returned sat
[2020-06-03 23:49:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:35] [INFO ] [Real]Absence check using state equation in 831 ms returned sat
[2020-06-03 23:49:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:49:35] [INFO ] [Nat]Absence check using 202 positive place invariants in 61 ms returned sat
[2020-06-03 23:49:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:35] [INFO ] [Nat]Absence check using state equation in 475 ms returned sat
[2020-06-03 23:49:35] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 14 ms.
[2020-06-03 23:49:36] [INFO ] Added : 198 causal constraints over 40 iterations in 1086 ms. Result :sat
[2020-06-03 23:49:36] [INFO ] [Real]Absence check using 202 positive place invariants in 84 ms returned sat
[2020-06-03 23:49:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:37] [INFO ] [Real]Absence check using state equation in 463 ms returned sat
[2020-06-03 23:49:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:49:37] [INFO ] [Nat]Absence check using 202 positive place invariants in 63 ms returned sat
[2020-06-03 23:49:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:38] [INFO ] [Nat]Absence check using state equation in 759 ms returned sat
[2020-06-03 23:49:38] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 26 ms.
[2020-06-03 23:49:39] [INFO ] Added : 155 causal constraints over 31 iterations in 945 ms. Result :sat
[2020-06-03 23:49:39] [INFO ] [Real]Absence check using 202 positive place invariants in 141 ms returned sat
[2020-06-03 23:49:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:39] [INFO ] [Real]Absence check using state equation in 453 ms returned sat
[2020-06-03 23:49:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:49:40] [INFO ] [Nat]Absence check using 202 positive place invariants in 111 ms returned sat
[2020-06-03 23:49:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:40] [INFO ] [Nat]Absence check using state equation in 649 ms returned sat
[2020-06-03 23:49:40] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 36 ms.
[2020-06-03 23:49:42] [INFO ] Added : 216 causal constraints over 44 iterations in 1464 ms. Result :sat
[2020-06-03 23:49:42] [INFO ] [Real]Absence check using 202 positive place invariants in 111 ms returned sat
[2020-06-03 23:49:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:43] [INFO ] [Real]Absence check using state equation in 837 ms returned sat
[2020-06-03 23:49:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:49:43] [INFO ] [Nat]Absence check using 202 positive place invariants in 71 ms returned sat
[2020-06-03 23:49:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:44] [INFO ] [Nat]Absence check using state equation in 560 ms returned sat
[2020-06-03 23:49:44] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 17 ms.
[2020-06-03 23:49:45] [INFO ] Added : 194 causal constraints over 39 iterations in 1394 ms. Result :sat
[2020-06-03 23:49:45] [INFO ] [Real]Absence check using 202 positive place invariants in 4 ms returned unsat
[2020-06-03 23:49:45] [INFO ] [Real]Absence check using 202 positive place invariants in 61 ms returned sat
[2020-06-03 23:49:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:46] [INFO ] [Real]Absence check using state equation in 484 ms returned sat
[2020-06-03 23:49:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:49:46] [INFO ] [Nat]Absence check using 202 positive place invariants in 73 ms returned sat
[2020-06-03 23:49:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:46] [INFO ] [Nat]Absence check using state equation in 557 ms returned sat
[2020-06-03 23:49:46] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 21 ms.
[2020-06-03 23:49:48] [INFO ] Added : 191 causal constraints over 39 iterations in 1402 ms. Result :sat
[2020-06-03 23:49:48] [INFO ] [Real]Absence check using 202 positive place invariants in 59 ms returned sat
[2020-06-03 23:49:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:48] [INFO ] [Real]Absence check using state equation in 429 ms returned sat
[2020-06-03 23:49:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:49:49] [INFO ] [Nat]Absence check using 202 positive place invariants in 265 ms returned sat
[2020-06-03 23:49:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:49] [INFO ] [Nat]Absence check using state equation in 474 ms returned sat
[2020-06-03 23:49:49] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 14 ms.
[2020-06-03 23:49:50] [INFO ] Added : 179 causal constraints over 36 iterations in 926 ms. Result :sat
Successfully simplified 4 atomic propositions for a total of 4 simplifications.
[2020-06-03 23:49:50] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2020-06-03 23:49:50] [INFO ] Flatten gal took : 123 ms
FORMULA RefineWMG-PT-100101-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100101-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100101-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100101-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100101-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100101-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100101-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100101-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100101-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 23:49:51] [INFO ] Flatten gal took : 40 ms
[2020-06-03 23:49:51] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2020-06-03 23:49:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 20 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ RefineWMG-PT-100101 @ 3569 seconds

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

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

FORMULA RefineWMG-PT-100101-05 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-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100101-13 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
vrfy: finished
info: timeLeft: 3565
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=3569",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 23:49:52 2020
",
"timelimit": 3569
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F (G ((X (X (X (F (((p276 <= p162) OR (p113 <= p367)))))) AND (2 <= p325))))",
"processed_size": 77,
"rewrites": 28
},
"result":
{
"edges": 104,
"markings": 103,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 1,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "(X ((X (X (F (((p0 + 1 <= p404) R F ((p127 + 1 <= p386)))))) AND (3 <= p480))) U (3 <= p480))",
"processed_size": 93,
"rewrites": 28
},
"result":
{
"edges": 105,
"markings": 104,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 713
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((F ((3 <= p8)) AND F (G ((p232 + 1 <= p11)))))",
"processed_size": 49,
"rewrites": 28
},
"result":
{
"edges": 102,
"markings": 102,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 2,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 5,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "X (((((p326 <= p290) U (3 <= p219)) AND (F (((2 <= p324) AND (p369 <= p442))) AND (3 <= p292))) OR (G ((2 <= p324)) AND F ((((p326 <= p290) U (3 <= p219)) AND (F (((2 <= p324) AND (p369 <= p442))) AND (3 <= p292)))))))",
"processed_size": 218,
"rewrites": 28
},
"result":
{
"edges": 102,
"markings": 102,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 18
},
"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": 1188
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"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": 2,
"visible_transitions": 0
},
"processed": "(X (X ((p482 <= p212))) U G ((p482 <= p212)))",
"processed_size": 45,
"rewrites": 28
},
"result":
{
"edges": 162,
"markings": 162,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"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 ((p213 <= p252)))",
"processed_size": 22,
"rewrites": 28
},
"result":
{
"edges": 11825,
"markings": 6417,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"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": 3566
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F ((G ((p2 + 1 <= p125)) AND ((p58 + 1 <= p88) OR (3 <= p244))))",
"processed_size": 65,
"rewrites": 28
},
"result":
{
"edges": 2,
"markings": 2,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"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": 22072,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(G((X(X(X(F(**)))) AND **))) : (X((X(X(F((* R F(*))))) AND **)) U **) : X((F(**) AND F(G(*)))) : X((((** U **) AND (F(**) AND **)) OR (G(**) AND F(((** U **) AND (F(**) AND **)))))) : (X(X(**)) U G(**)) : F((G(*) AND *)) : G(F(*))"
},
"net":
{
"arcs": 1208,
"conflict_clusters": 303,
"places": 504,
"places_significant": 302,
"singleton_clusters": 0,
"transitions": 403
},
"result":
{
"preliminary_value": "no no no no no no no ",
"value": "no no no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3569 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: F (G ((F (X (X (X (((p276 <= p162) OR (p113 <= p367)))))) AND (2 <= p325)))) : (X ((F (NOT(X (X (((p404 <= p0) U G ((p386 <= p127))))))) AND (3 <= p480))) U (3 <= p480)) : X ((F ((3 <= p8)) AND NOT(F (G (F ((p11 <= p232))))))) : (X (G ((2 <= p324))) U X (((((p326 <= p290) U (3 <= p219)) AND F (((2 <= p324) AND (p369 <= p442)))) AND (3 <= p292)))) : (X (X ((p482 <= p212))) U G ((p482 <= p212))) : NOT(G ((F ((p125 <= p2)) OR ((p88 <= p58) AND (p244 <= 2))))) : ((0 <= 0) U G (NOT(G ((p252 + 1 <= p213)))))
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:371
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X (X (X (F (((p276 <= p162) OR (p113 <= p367)))))) AND (2 <= p325))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X (X (X (F (((p276 <= p162) OR (p113 <= p367)))))) AND (2 <= p325))))
lola: processed formula length: 77
lola: 28 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: add low 401
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: 103 markings, 104 edges
lola: ========================================
lola: subprocess 1 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((X (X (F (((p0 + 1 <= p404) R F ((p127 + 1 <= p386)))))) AND (3 <= p480))) U (3 <= p480))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X ((X (X (F (((p0 + 1 <= p404) R F ((p127 + 1 <= p386)))))) AND (3 <= p480))) U (3 <= p480))
lola: processed formula length: 93
lola: 28 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 104 markings, 105 edges
lola: ========================================
lola: subprocess 2 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((3 <= p8)) AND F (G ((p232 + 1 <= p11)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((3 <= p8)) AND F (G ((p232 + 1 <= p11)))))
lola: processed formula length: 49
lola: 28 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 3 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((((p326 <= p290) U (3 <= p219)) AND (F (((2 <= p324) AND (p369 <= p442))) AND (3 <= p292))) OR (G ((2 <= p324)) AND F ((((p326 <= p290) U (3 <= p219)) AND (F (((2 <= p324) AND (p369 <= p442))) AND (3 <= p292)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((((p326 <= p290) U (3 <= p219)) AND (F (((2 <= p324) AND (p369 <= p442))) AND (3 <= p292))) OR (G ((2 <= p324)) AND F ((((p326 <= p290) U (3 <= p219)) AND (F (((2 <= p324) AND (p369 <= p442))) AND (3 <= p292)))))))
lola: processed formula length: 218
lola: 28 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 18 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 4 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X ((p482 <= p212))) U G ((p482 <= p212)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (X ((p482 <= p212))) U G ((p482 <= p212)))
lola: processed formula length: 45
lola: 28 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 162 markings, 162 edges
lola: ========================================
lola: subprocess 5 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p213 <= p252)))
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 ((p213 <= p252)))
lola: processed formula length: 22
lola: 28 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: 6417 markings, 11825 edges
lola: ========================================
lola: subprocess 6 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((p2 + 1 <= p125)) AND ((p58 + 1 <= p88) OR (3 <= p244))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((p2 + 1 <= p125)) AND ((p58 + 1 <= p88) OR (3 <= p244))))
lola: processed formula length: 65
lola: 28 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: 2 markings, 2 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no
lola:
preliminary result: no no no no no no no
lola: memory consumption: 22072 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="RefineWMG-PT-100101"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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 itslola"
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 r186-oct2-158987938500121"
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 ;