Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2021-input.r170-oct2-162089286900005.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-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 gold2020
Input is PhilosophersDyn-COL-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-oct2-162089286900005
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 404K
-rw-r--r-- 1 mcc users 17K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 134K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 16:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 09:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 09:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 25 11:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 11:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 32K 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 PhilosophersDyn-COL-10-00
FORMULA_NAME PhilosophersDyn-COL-10-01
FORMULA_NAME PhilosophersDyn-COL-10-02
FORMULA_NAME PhilosophersDyn-COL-10-03
FORMULA_NAME PhilosophersDyn-COL-10-04
FORMULA_NAME PhilosophersDyn-COL-10-05
FORMULA_NAME PhilosophersDyn-COL-10-06
FORMULA_NAME PhilosophersDyn-COL-10-07
FORMULA_NAME PhilosophersDyn-COL-10-08
FORMULA_NAME PhilosophersDyn-COL-10-09
FORMULA_NAME PhilosophersDyn-COL-10-10
FORMULA_NAME PhilosophersDyn-COL-10-11
FORMULA_NAME PhilosophersDyn-COL-10-12
FORMULA_NAME PhilosophersDyn-COL-10-13
FORMULA_NAME PhilosophersDyn-COL-10-14
FORMULA_NAME PhilosophersDyn-COL-10-15

=== Now, execution of the tool begins

BK_START 1621372014448

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-18 21:06:56] [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-18 21:06:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 21:06:56] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2021-05-18 21:06:57] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 775 ms
[2021-05-18 21:06:57] [INFO ] sort/places :
Neighbourhood->Neighbourhood,
Philosopher->Outside,Think,Forks,WaitLeft,WaitRight,HasLeft,HasRight,

[2021-05-18 21:06:57] [INFO ] Imported 8 HL places and 7 HL transitions for a total of 170 PT places and 2320.0 transition bindings in 14 ms.
[2021-05-18 21:06:57] [INFO ] Computed order based on color domains.
[2021-05-18 21:06:57] [INFO ] Unfolded HLPN to a Petri net with 170 places and 2310 transitions in 119 ms.
[2021-05-18 21:06:57] [INFO ] Unfolded HLPN properties in 0 ms.
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 158 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 11918 resets, run finished after 1438 ms. (steps per millisecond=69 ) properties seen :[0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1]
[2021-05-18 21:06:58] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
// Phase 1: matrix 1905 rows 170 cols
[2021-05-18 21:06:59] [INFO ] Computed 39 place invariants in 56 ms
[2021-05-18 21:06:59] [INFO ] [Real]Absence check using 30 positive place invariants in 62 ms returned sat
[2021-05-18 21:06:59] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 13 ms returned sat
[2021-05-18 21:06:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 21:07:00] [INFO ] [Real]Absence check using state equation in 1090 ms returned sat
[2021-05-18 21:07:00] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2021-05-18 21:07:00] [INFO ] [Real]Added 1030 Read/Feed constraints in 251 ms returned sat
[2021-05-18 21:07:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 21:07:00] [INFO ] [Nat]Absence check using 30 positive place invariants in 13 ms returned sat
[2021-05-18 21:07:00] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 5 ms returned sat
[2021-05-18 21:07:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 21:07:01] [INFO ] [Nat]Absence check using state equation in 753 ms returned sat
[2021-05-18 21:07:02] [INFO ] [Nat]Added 1030 Read/Feed constraints in 694 ms returned sat
[2021-05-18 21:07:02] [INFO ] Computed and/alt/rep : 2220/268350/1860 causal constraints in 500 ms.
[2021-05-18 21:07:20] [INFO ] Added : 150 causal constraints over 30 iterations in 18481 ms. Result :(error "Solver has unexpectedly terminated")
[2021-05-18 21:07:20] [INFO ] [Real]Absence check using 30 positive place invariants in 8 ms returned sat
[2021-05-18 21:07:20] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 3 ms returned sat
[2021-05-18 21:07:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 21:07:21] [INFO ] [Real]Absence check using state equation in 690 ms returned sat
[2021-05-18 21:07:21] [INFO ] [Real]Added 1030 Read/Feed constraints in 211 ms returned sat
[2021-05-18 21:07:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 21:07:21] [INFO ] [Nat]Absence check using 30 positive place invariants in 10 ms returned sat
[2021-05-18 21:07:21] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 4 ms returned sat
[2021-05-18 21:07:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 21:07:22] [INFO ] [Nat]Absence check using state equation in 686 ms returned sat
[2021-05-18 21:07:23] [INFO ] [Nat]Added 1030 Read/Feed constraints in 659 ms returned sat
[2021-05-18 21:07:23] [INFO ] Computed and/alt/rep : 2220/268350/1860 causal constraints in 284 ms.
[2021-05-18 21:07:41] [INFO ] Added : 145 causal constraints over 29 iterations in 18604 ms. Result :unknown
[2021-05-18 21:07:41] [INFO ] [Real]Absence check using 30 positive place invariants in 12 ms returned sat
[2021-05-18 21:07:41] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 3 ms returned sat
[2021-05-18 21:07:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 21:07:42] [INFO ] [Real]Absence check using state equation in 634 ms returned sat
[2021-05-18 21:07:42] [INFO ] [Real]Added 1030 Read/Feed constraints in 224 ms returned sat
[2021-05-18 21:07:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 21:07:42] [INFO ] [Nat]Absence check using 30 positive place invariants in 20 ms returned sat
[2021-05-18 21:07:42] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 3 ms returned sat
[2021-05-18 21:07:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 21:07:43] [INFO ] [Nat]Absence check using state equation in 581 ms returned sat
[2021-05-18 21:07:44] [INFO ] [Nat]Added 1030 Read/Feed constraints in 669 ms returned sat
[2021-05-18 21:07:44] [INFO ] Deduced a trap composed of 62 places in 287 ms
[2021-05-18 21:07:44] [INFO ] Deduced a trap composed of 54 places in 269 ms
[2021-05-18 21:07:45] [INFO ] Deduced a trap composed of 48 places in 287 ms
[2021-05-18 21:07:45] [INFO ] Deduced a trap composed of 60 places in 265 ms
[2021-05-18 21:07:45] [INFO ] Deduced a trap composed of 48 places in 375 ms
[2021-05-18 21:07:46] [INFO ] Deduced a trap composed of 55 places in 314 ms
[2021-05-18 21:07:46] [INFO ] Deduced a trap composed of 57 places in 245 ms
[2021-05-18 21:07:46] [INFO ] Deduced a trap composed of 69 places in 259 ms
[2021-05-18 21:07:47] [INFO ] Deduced a trap composed of 58 places in 237 ms
[2021-05-18 21:07:47] [INFO ] Deduced a trap composed of 56 places in 265 ms
[2021-05-18 21:07:47] [INFO ] Deduced a trap composed of 40 places in 294 ms
[2021-05-18 21:07:48] [INFO ] Deduced a trap composed of 62 places in 296 ms
[2021-05-18 21:07:48] [INFO ] Deduced a trap composed of 76 places in 360 ms
[2021-05-18 21:07:49] [INFO ] Deduced a trap composed of 79 places in 1005 ms
[2021-05-18 21:07:50] [INFO ] Deduced a trap composed of 84 places in 387 ms
[2021-05-18 21:07:50] [INFO ] Deduced a trap composed of 60 places in 223 ms
[2021-05-18 21:07:50] [INFO ] Deduced a trap composed of 68 places in 226 ms
[2021-05-18 21:07:51] [INFO ] Deduced a trap composed of 78 places in 252 ms
[2021-05-18 21:07:51] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 7004 ms
[2021-05-18 21:07:51] [INFO ] Computed and/alt/rep : 2220/268350/1860 causal constraints in 227 ms.
[2021-05-18 21:08:02] [INFO ] Added : 110 causal constraints over 22 iterations in 11736 ms. Result :unknown
[2021-05-18 21:08:02] [INFO ] [Real]Absence check using 30 positive place invariants in 4 ms returned unsat
[2021-05-18 21:08:02] [INFO ] [Real]Absence check using 30 positive place invariants in 8 ms returned sat
[2021-05-18 21:08:02] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 3 ms returned unsat
[2021-05-18 21:08:02] [INFO ] [Real]Absence check using 30 positive place invariants in 8 ms returned sat
[2021-05-18 21:08:02] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 3 ms returned sat
[2021-05-18 21:08:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 21:08:03] [INFO ] [Real]Absence check using state equation in 567 ms returned sat
[2021-05-18 21:08:03] [INFO ] [Real]Added 1030 Read/Feed constraints in 180 ms returned sat
[2021-05-18 21:08:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 21:08:03] [INFO ] [Nat]Absence check using 30 positive place invariants in 9 ms returned sat
[2021-05-18 21:08:03] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 13 ms returned sat
[2021-05-18 21:08:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 21:08:04] [INFO ] [Nat]Absence check using state equation in 600 ms returned sat
[2021-05-18 21:08:05] [INFO ] [Nat]Added 1030 Read/Feed constraints in 675 ms returned sat
[2021-05-18 21:08:05] [INFO ] Deduced a trap composed of 48 places in 222 ms
[2021-05-18 21:08:05] [INFO ] Deduced a trap composed of 48 places in 301 ms
[2021-05-18 21:08:06] [INFO ] Deduced a trap composed of 84 places in 240 ms
[2021-05-18 21:08:06] [INFO ] Deduced a trap composed of 67 places in 235 ms
[2021-05-18 21:08:06] [INFO ] Deduced a trap composed of 75 places in 317 ms
[2021-05-18 21:08:06] [INFO ] Deduced a trap composed of 70 places in 283 ms
[2021-05-18 21:08:07] [INFO ] Deduced a trap composed of 64 places in 240 ms
[2021-05-18 21:08:07] [INFO ] Deduced a trap composed of 71 places in 235 ms
[2021-05-18 21:08:07] [INFO ] Deduced a trap composed of 60 places in 209 ms
[2021-05-18 21:08:08] [INFO ] Deduced a trap composed of 73 places in 228 ms
[2021-05-18 21:08:08] [INFO ] Deduced a trap composed of 78 places in 229 ms
[2021-05-18 21:08:08] [INFO ] Deduced a trap composed of 67 places in 249 ms
[2021-05-18 21:08:09] [INFO ] Deduced a trap composed of 48 places in 230 ms
[2021-05-18 21:08:09] [INFO ] Deduced a trap composed of 68 places in 246 ms
[2021-05-18 21:08:09] [INFO ] Deduced a trap composed of 70 places in 268 ms
[2021-05-18 21:08:09] [INFO ] Deduced a trap composed of 73 places in 249 ms
[2021-05-18 21:08:10] [INFO ] Deduced a trap composed of 60 places in 231 ms
[2021-05-18 21:08:10] [INFO ] Deduced a trap composed of 48 places in 237 ms
[2021-05-18 21:08:10] [INFO ] Deduced a trap composed of 40 places in 223 ms
[2021-05-18 21:08:11] [INFO ] Deduced a trap composed of 63 places in 230 ms
[2021-05-18 21:08:11] [INFO ] Deduced a trap composed of 64 places in 213 ms
[2021-05-18 21:08:11] [INFO ] Deduced a trap composed of 67 places in 214 ms
[2021-05-18 21:08:12] [INFO ] Deduced a trap composed of 73 places in 230 ms
[2021-05-18 21:08:12] [INFO ] Deduced a trap composed of 69 places in 210 ms
[2021-05-18 21:08:12] [INFO ] Deduced a trap composed of 63 places in 240 ms
[2021-05-18 21:08:13] [INFO ] Deduced a trap composed of 69 places in 223 ms
[2021-05-18 21:08:13] [INFO ] Deduced a trap composed of 67 places in 255 ms
[2021-05-18 21:08:13] [INFO ] Deduced a trap composed of 68 places in 224 ms
[2021-05-18 21:08:13] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 8659 ms
[2021-05-18 21:08:13] [INFO ] Computed and/alt/rep : 2220/268350/1860 causal constraints in 202 ms.
[2021-05-18 21:08:23] [INFO ] Added : 115 causal constraints over 23 iterations in 10025 ms. Result :(error "Solver has unexpectedly terminated")
[2021-05-18 21:08:23] [INFO ] [Real]Absence check using 30 positive place invariants in 4 ms returned unsat
[2021-05-18 21:08:23] [INFO ] [Real]Absence check using 30 positive place invariants in 8 ms returned sat
[2021-05-18 21:08:23] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 5 ms returned sat
[2021-05-18 21:08:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 21:08:24] [INFO ] [Real]Absence check using state equation in 537 ms returned sat
[2021-05-18 21:08:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 21:08:24] [INFO ] [Nat]Absence check using 30 positive place invariants in 10 ms returned sat
[2021-05-18 21:08:24] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 5 ms returned sat
[2021-05-18 21:08:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 21:08:25] [INFO ] [Nat]Absence check using state equation in 547 ms returned sat
[2021-05-18 21:08:25] [INFO ] [Nat]Added 1030 Read/Feed constraints in 608 ms returned sat
[2021-05-18 21:08:25] [INFO ] Deduced a trap composed of 52 places in 202 ms
[2021-05-18 21:08:26] [INFO ] Deduced a trap composed of 57 places in 202 ms
[2021-05-18 21:08:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 517 ms
[2021-05-18 21:08:26] [INFO ] Computed and/alt/rep : 2220/268350/1860 causal constraints in 239 ms.
[2021-05-18 21:08:44] [INFO ] Added : 155 causal constraints over 31 iterations in 18307 ms. Result :unknown
[2021-05-18 21:08:44] [INFO ] [Real]Absence check using 30 positive place invariants in 8 ms returned sat
[2021-05-18 21:08:44] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 3 ms returned sat
[2021-05-18 21:08:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 21:08:44] [INFO ] [Real]Absence check using state equation in 495 ms returned sat
[2021-05-18 21:08:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 21:08:45] [INFO ] [Nat]Absence check using 30 positive place invariants in 8 ms returned sat
[2021-05-18 21:08:45] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 3 ms returned sat
[2021-05-18 21:08:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 21:08:45] [INFO ] [Nat]Absence check using state equation in 508 ms returned sat
[2021-05-18 21:08:46] [INFO ] [Nat]Added 1030 Read/Feed constraints in 589 ms returned sat
[2021-05-18 21:08:46] [INFO ] Deduced a trap composed of 68 places in 205 ms
[2021-05-18 21:08:46] [INFO ] Deduced a trap composed of 68 places in 211 ms
[2021-05-18 21:08:46] [INFO ] Deduced a trap composed of 66 places in 272 ms
[2021-05-18 21:08:47] [INFO ] Deduced a trap composed of 65 places in 204 ms
[2021-05-18 21:08:47] [INFO ] Deduced a trap composed of 61 places in 349 ms
[2021-05-18 21:08:47] [INFO ] Deduced a trap composed of 70 places in 236 ms
[2021-05-18 21:08:48] [INFO ] Deduced a trap composed of 61 places in 218 ms
[2021-05-18 21:08:48] [INFO ] Deduced a trap composed of 77 places in 254 ms
[2021-05-18 21:08:48] [INFO ] Deduced a trap composed of 76 places in 211 ms
[2021-05-18 21:08:48] [INFO ] Deduced a trap composed of 76 places in 207 ms
[2021-05-18 21:08:49] [INFO ] Deduced a trap composed of 71 places in 282 ms
[2021-05-18 21:08:49] [INFO ] Deduced a trap composed of 75 places in 333 ms
[2021-05-18 21:08:50] [INFO ] Deduced a trap composed of 78 places in 414 ms
[2021-05-18 21:08:50] [INFO ] Deduced a trap composed of 70 places in 424 ms
[2021-05-18 21:08:50] [INFO ] Deduced a trap composed of 74 places in 236 ms
[2021-05-18 21:08:51] [INFO ] Deduced a trap composed of 75 places in 328 ms
[2021-05-18 21:08:51] [INFO ] Deduced a trap composed of 73 places in 264 ms
[2021-05-18 21:08:51] [INFO ] Deduced a trap composed of 65 places in 307 ms
[2021-05-18 21:08:52] [INFO ] Deduced a trap composed of 65 places in 244 ms
[2021-05-18 21:08:52] [INFO ] Deduced a trap composed of 78 places in 311 ms
[2021-05-18 21:08:52] [INFO ] Deduced a trap composed of 64 places in 268 ms
[2021-05-18 21:08:53] [INFO ] Deduced a trap composed of 71 places in 286 ms
[2021-05-18 21:08:53] [INFO ] Deduced a trap composed of 78 places in 240 ms
[2021-05-18 21:08:53] [INFO ] Deduced a trap composed of 67 places in 373 ms
[2021-05-18 21:08:54] [INFO ] Deduced a trap composed of 74 places in 210 ms
[2021-05-18 21:08:54] [INFO ] Deduced a trap composed of 87 places in 211 ms
[2021-05-18 21:08:54] [INFO ] Deduced a trap composed of 67 places in 324 ms
[2021-05-18 21:08:55] [INFO ] Deduced a trap composed of 80 places in 300 ms
[2021-05-18 21:08:55] [INFO ] Deduced a trap composed of 73 places in 282 ms
[2021-05-18 21:08:55] [INFO ] Deduced a trap composed of 76 places in 237 ms
[2021-05-18 21:08:56] [INFO ] Deduced a trap composed of 67 places in 227 ms
[2021-05-18 21:08:56] [INFO ] Deduced a trap composed of 67 places in 280 ms
[2021-05-18 21:08:56] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 10380 ms
[2021-05-18 21:08:56] [INFO ] Computed and/alt/rep : 2220/268350/1860 causal constraints in 177 ms.
[2021-05-18 21:09:05] [INFO ] Added : 90 causal constraints over 18 iterations in 8502 ms. Result :unknown
[2021-05-18 21:09:05] [INFO ] [Real]Absence check using 30 positive place invariants in 42 ms returned sat
[2021-05-18 21:09:05] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 35 ms returned sat
[2021-05-18 21:09:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 21:09:05] [INFO ] [Real]Absence check using state equation in 515 ms returned sat
[2021-05-18 21:09:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 21:09:05] [INFO ] [Nat]Absence check using 30 positive place invariants in 12 ms returned sat
[2021-05-18 21:09:05] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 3 ms returned sat
[2021-05-18 21:09:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 21:09:06] [INFO ] [Nat]Absence check using state equation in 509 ms returned sat
[2021-05-18 21:09:06] [INFO ] [Nat]Added 1030 Read/Feed constraints in 671 ms returned sat
[2021-05-18 21:09:07] [INFO ] Deduced a trap composed of 49 places in 218 ms
[2021-05-18 21:09:07] [INFO ] Deduced a trap composed of 70 places in 234 ms
[2021-05-18 21:09:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 568 ms
[2021-05-18 21:09:07] [INFO ] Computed and/alt/rep : 2220/268350/1860 causal constraints in 180 ms.
[2021-05-18 21:09:25] [INFO ] Added : 160 causal constraints over 32 iterations in 18226 ms. Result :unknown
[2021-05-18 21:09:25] [INFO ] [Real]Absence check using 30 positive place invariants in 11 ms returned sat
[2021-05-18 21:09:25] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 6 ms returned sat
[2021-05-18 21:09:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 21:09:26] [INFO ] [Real]Absence check using state equation in 553 ms returned sat
[2021-05-18 21:09:26] [INFO ] [Real]Added 1030 Read/Feed constraints in 175 ms returned sat
[2021-05-18 21:09:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 21:09:26] [INFO ] [Nat]Absence check using 30 positive place invariants in 9 ms returned sat
[2021-05-18 21:09:26] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 3 ms returned sat
[2021-05-18 21:09:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 21:09:27] [INFO ] [Nat]Absence check using state equation in 503 ms returned sat
[2021-05-18 21:09:27] [INFO ] [Nat]Added 1030 Read/Feed constraints in 704 ms returned sat
[2021-05-18 21:09:28] [INFO ] Deduced a trap composed of 48 places in 229 ms
[2021-05-18 21:09:28] [INFO ] Deduced a trap composed of 48 places in 227 ms
[2021-05-18 21:09:28] [INFO ] Deduced a trap composed of 48 places in 269 ms
[2021-05-18 21:09:28] [INFO ] Deduced a trap composed of 48 places in 246 ms
[2021-05-18 21:09:29] [INFO ] Deduced a trap composed of 48 places in 273 ms
[2021-05-18 21:09:29] [INFO ] Deduced a trap composed of 61 places in 309 ms
[2021-05-18 21:09:29] [INFO ] Deduced a trap composed of 63 places in 248 ms
[2021-05-18 21:09:30] [INFO ] Deduced a trap composed of 70 places in 230 ms
[2021-05-18 21:09:30] [INFO ] Deduced a trap composed of 48 places in 238 ms
[2021-05-18 21:09:30] [INFO ] Deduced a trap composed of 54 places in 262 ms
[2021-05-18 21:09:31] [INFO ] Deduced a trap composed of 48 places in 271 ms
[2021-05-18 21:09:31] [INFO ] Deduced a trap composed of 48 places in 245 ms
[2021-05-18 21:09:31] [INFO ] Deduced a trap composed of 40 places in 263 ms
[2021-05-18 21:09:32] [INFO ] Deduced a trap composed of 74 places in 292 ms
[2021-05-18 21:09:32] [INFO ] Deduced a trap composed of 69 places in 288 ms
[2021-05-18 21:09:32] [INFO ] Deduced a trap composed of 83 places in 273 ms
[2021-05-18 21:09:33] [INFO ] Deduced a trap composed of 84 places in 253 ms
[2021-05-18 21:09:33] [INFO ] Deduced a trap composed of 89 places in 243 ms
[2021-05-18 21:09:33] [INFO ] Deduced a trap composed of 71 places in 270 ms
[2021-05-18 21:09:34] [INFO ] Deduced a trap composed of 70 places in 244 ms
[2021-05-18 21:09:34] [INFO ] Deduced a trap composed of 91 places in 280 ms
[2021-05-18 21:09:34] [INFO ] Deduced a trap composed of 55 places in 329 ms
[2021-05-18 21:09:35] [INFO ] Deduced a trap composed of 71 places in 288 ms
[2021-05-18 21:09:35] [INFO ] Deduced a trap composed of 64 places in 247 ms
[2021-05-18 21:09:35] [INFO ] Deduced a trap composed of 62 places in 301 ms
[2021-05-18 21:09:35] [INFO ] Deduced a trap composed of 67 places in 231 ms
[2021-05-18 21:09:36] [INFO ] Deduced a trap composed of 68 places in 250 ms
[2021-05-18 21:09:36] [INFO ] Deduced a trap composed of 81 places in 317 ms
[2021-05-18 21:09:36] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 8884 ms
[2021-05-18 21:09:36] [INFO ] Computed and/alt/rep : 2220/268350/1860 causal constraints in 189 ms.
[2021-05-18 21:09:46] [INFO ] Added : 115 causal constraints over 23 iterations in 9890 ms. Result :(error "Solver has unexpectedly terminated")
[2021-05-18 21:09:46] [INFO ] [Real]Absence check using 30 positive place invariants in 22 ms returned sat
[2021-05-18 21:09:46] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 4 ms returned sat
[2021-05-18 21:09:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 21:09:47] [INFO ] [Real]Absence check using state equation in 454 ms returned sat
[2021-05-18 21:09:47] [INFO ] [Real]Added 1030 Read/Feed constraints in 229 ms returned sat
[2021-05-18 21:09:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 21:09:47] [INFO ] [Nat]Absence check using 30 positive place invariants in 21 ms returned sat
[2021-05-18 21:09:47] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 4 ms returned sat
[2021-05-18 21:09:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 21:09:47] [INFO ] [Nat]Absence check using state equation in 454 ms returned sat
[2021-05-18 21:09:48] [INFO ] [Nat]Added 1030 Read/Feed constraints in 704 ms returned sat
[2021-05-18 21:09:48] [INFO ] Deduced a trap composed of 69 places in 223 ms
[2021-05-18 21:09:49] [INFO ] Deduced a trap composed of 40 places in 221 ms
[2021-05-18 21:09:49] [INFO ] Deduced a trap composed of 75 places in 228 ms
[2021-05-18 21:09:49] [INFO ] Deduced a trap composed of 53 places in 215 ms
[2021-05-18 21:09:50] [INFO ] Deduced a trap composed of 64 places in 236 ms
[2021-05-18 21:09:50] [INFO ] Deduced a trap composed of 79 places in 242 ms
[2021-05-18 21:09:50] [INFO ] Deduced a trap composed of 86 places in 283 ms
[2021-05-18 21:09:51] [INFO ] Deduced a trap composed of 65 places in 283 ms
[2021-05-18 21:09:51] [INFO ] Deduced a trap composed of 70 places in 300 ms
[2021-05-18 21:09:51] [INFO ] Deduced a trap composed of 68 places in 357 ms
[2021-05-18 21:09:51] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3275 ms
[2021-05-18 21:09:51] [INFO ] Computed and/alt/rep : 2220/268350/1860 causal constraints in 153 ms.
[2021-05-18 21:10:07] [INFO ] Added : 135 causal constraints over 27 iterations in 15533 ms. Result :(error "Failed to check-sat")
[2021-05-18 21:10:07] [INFO ] [Real]Absence check using 30 positive place invariants in 9 ms returned sat
[2021-05-18 21:10:07] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 4 ms returned unsat
[2021-05-18 21:10:07] [INFO ] [Real]Absence check using 30 positive place invariants in 11 ms returned sat
[2021-05-18 21:10:07] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 7 ms returned sat
[2021-05-18 21:10:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 21:10:08] [INFO ] [Real]Absence check using state equation in 762 ms returned sat
[2021-05-18 21:10:08] [INFO ] [Real]Added 1030 Read/Feed constraints in 199 ms returned sat
[2021-05-18 21:10:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 21:10:08] [INFO ] [Nat]Absence check using 30 positive place invariants in 10 ms returned sat
[2021-05-18 21:10:08] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 3 ms returned sat
[2021-05-18 21:10:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 21:10:09] [INFO ] [Nat]Absence check using state equation in 534 ms returned sat
[2021-05-18 21:10:09] [INFO ] [Nat]Added 1030 Read/Feed constraints in 610 ms returned sat
[2021-05-18 21:10:10] [INFO ] Deduced a trap composed of 48 places in 445 ms
[2021-05-18 21:10:10] [INFO ] Deduced a trap composed of 69 places in 281 ms
[2021-05-18 21:10:10] [INFO ] Deduced a trap composed of 66 places in 321 ms
[2021-05-18 21:10:11] [INFO ] Deduced a trap composed of 78 places in 274 ms
[2021-05-18 21:10:11] [INFO ] Deduced a trap composed of 78 places in 284 ms
[2021-05-18 21:10:11] [INFO ] Deduced a trap composed of 51 places in 285 ms
[2021-05-18 21:10:12] [INFO ] Deduced a trap composed of 40 places in 255 ms
[2021-05-18 21:10:12] [INFO ] Deduced a trap composed of 58 places in 256 ms
[2021-05-18 21:10:13] [INFO ] Deduced a trap composed of 63 places in 247 ms
[2021-05-18 21:10:13] [INFO ] Deduced a trap composed of 58 places in 260 ms
[2021-05-18 21:10:13] [INFO ] Deduced a trap composed of 73 places in 256 ms
[2021-05-18 21:10:13] [INFO ] Deduced a trap composed of 84 places in 252 ms
[2021-05-18 21:10:14] [INFO ] Deduced a trap composed of 67 places in 262 ms
[2021-05-18 21:10:14] [INFO ] Deduced a trap composed of 65 places in 261 ms
[2021-05-18 21:10:14] [INFO ] Deduced a trap composed of 56 places in 268 ms
[2021-05-18 21:10:15] [INFO ] Deduced a trap composed of 64 places in 249 ms
[2021-05-18 21:10:15] [INFO ] Deduced a trap composed of 74 places in 255 ms
[2021-05-18 21:10:15] [INFO ] Deduced a trap composed of 75 places in 253 ms
[2021-05-18 21:10:16] [INFO ] Deduced a trap composed of 67 places in 299 ms
[2021-05-18 21:10:16] [INFO ] Deduced a trap composed of 67 places in 265 ms
[2021-05-18 21:10:16] [INFO ] Deduced a trap composed of 79 places in 249 ms
[2021-05-18 21:10:17] [INFO ] Deduced a trap composed of 77 places in 267 ms
[2021-05-18 21:10:17] [INFO ] Deduced a trap composed of 80 places in 256 ms
[2021-05-18 21:10:17] [INFO ] Deduced a trap composed of 66 places in 274 ms
[2021-05-18 21:10:18] [INFO ] Deduced a trap composed of 64 places in 272 ms
[2021-05-18 21:10:18] [INFO ] Deduced a trap composed of 54 places in 287 ms
[2021-05-18 21:10:18] [INFO ] Deduced a trap composed of 57 places in 271 ms
[2021-05-18 21:10:19] [INFO ] Deduced a trap composed of 61 places in 259 ms
[2021-05-18 21:10:19] [INFO ] Deduced a trap composed of 57 places in 260 ms
[2021-05-18 21:10:19] [INFO ] Deduced a trap composed of 82 places in 215 ms
[2021-05-18 21:10:19] [INFO ] Deduced a trap composed of 65 places in 246 ms
[2021-05-18 21:10:20] [INFO ] Deduced a trap composed of 65 places in 219 ms
[2021-05-18 21:10:20] [INFO ] Deduced a trap composed of 64 places in 237 ms
[2021-05-18 21:10:20] [INFO ] Deduced a trap composed of 62 places in 233 ms
[2021-05-18 21:10:20] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 11183 ms
[2021-05-18 21:10:21] [INFO ] Computed and/alt/rep : 2220/268350/1860 causal constraints in 263 ms.
[2021-05-18 21:10:28] [INFO ] Added : 85 causal constraints over 17 iterations in 7652 ms. Result :(error "Failed to check-sat")
[2021-05-18 21:10:28] [INFO ] [Real]Absence check using 30 positive place invariants in 4 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 7 simplifications.
[2021-05-18 21:10:28] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2021-05-18 21:10:29] [INFO ] Flatten gal took : 441 ms
FORMULA PhilosophersDyn-COL-10-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-10-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-10-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-10-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-10-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-10-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 21:10:29] [INFO ] Applying decomposition
[2021-05-18 21:10:29] [INFO ] Flatten gal took : 381 ms
[2021-05-18 21:10:29] [INFO ] Decomposing Gal with order
[2021-05-18 21:10:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 21:10:30] [INFO ] Removed a total of 9970 redundant transitions.
[2021-05-18 21:10:31] [INFO ] Flatten gal took : 1088 ms
[2021-05-18 21:10:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 65 ms.
[2021-05-18 21:10:31] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2021-05-18 21:10:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 17 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ PhilosophersDyn-COL-10 @ 3570 seconds

FORMULA PhilosophersDyn-COL-10-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3458
rslt: Output for LTLCardinality @ PhilosophersDyn-COL-10

{
"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": "Tue May 18 21:10:31 2021
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 354
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "(p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + 1 <= p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p100)",
"processed_size": 144,
"rewrites": 85
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 394
},
"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": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "G ((p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 <= 2))",
"processed_size": 78,
"rewrites": 85
},
"result":
{
"edges": 626468,
"markings": 187102,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 389
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "X (F ((X ((p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 <= 0)) AND (p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 <= 1))))",
"processed_size": 167,
"rewrites": 85
},
"result":
{
"edges": 416,
"markings": 213,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 438
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 3,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 70,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 50,
"visible_transitions": 0
},
"processed": "X (X ((((F (((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p100) OR (p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119))) OR G ((2 <= p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150))) U X ((3 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119))) AND (3 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119))))",
"processed_size": 547,
"rewrites": 85
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"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": 501
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 4,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 360,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 130,
"visible_transitions": 0
},
"processed": "((1 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129) U G (((F ((p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p29 + p19 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)) AND (p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160 <= p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p100)) OR (X ((p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p29 + p19 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)) AND F ((p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p29 + p19 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99))))))",
"processed_size": 2247,
"rewrites": 85
},
"result":
{
"edges": 1378725,
"markings": 418771,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 16
},
"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": 584
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 130,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 130,
"visible_transitions": 0
},
"processed": "X (X (G (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p29 + p19 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160) AND F ((p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p100 + 1 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129))))))",
"processed_size": 827,
"rewrites": 85
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 700
},
"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": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "F (G ((p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + 1 <= p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150)))",
"processed_size": 152,
"rewrites": 85
},
"result":
{
"edges": 7,
"markings": 6,
"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": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 876
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 100,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 100,
"visible_transitions": 0
},
"processed": "X (X (X (G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p29 + p19 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= 0)))))",
"processed_size": 610,
"rewrites": 85
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 876
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 130,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 130,
"visible_transitions": 0
},
"processed": "X (X (G ((F ((p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + 1 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119)) AND (p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p29 + p19 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)))))",
"processed_size": 831,
"rewrites": 85
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1168
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "F (G ((G ((2 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160)) OR (p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160 <= 1))))",
"processed_size": 166,
"rewrites": 85
},
"result":
{
"edges": 650751,
"markings": 198919,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 7,
"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": 1735
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 30,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "G ((F (G ((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + 1 <= p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p100))) OR (1 <= p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p100)))",
"processed_size": 236,
"rewrites": 85
},
"result":
{
"edges": 628790,
"markings": 199051,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3458
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 100,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 100,
"visible_transitions": 0
},
"processed": "G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p29 + p19 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= 1))",
"processed_size": 598,
"rewrites": 85
},
"result":
{
"edges": 5,
"markings": 5,
"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": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 101304,
"runtime": 112.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(*) : (G(**) OR (X(F(*)) AND **)) : X(F((X(*) AND **))) : X(X((((F(**) OR G(**)) U X(**)) AND **))) : (** U G(((F(*) AND *) OR (X(*) AND F(*))))) : X(X(G((** AND F(*))))) : G((F(G(**)) OR **)) : F(G((G(**) OR **))) : (X(X(X(G(*)))) OR (F(G(*)) AND F(G(**)))) : X(X(G((F(*) AND *))))"
},
"net":
{
"arcs": 17110,
"conflict_clusters": 1,
"places": 170,
"places_significant": 131,
"singleton_clusters": 0,
"transitions": 2265
},
"result":
{
"preliminary_value": "no yes no no yes no yes yes no no ",
"value": "no yes no no yes no yes yes no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 2435/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 5440
lola: finding significant places
lola: 170 places, 2265 transitions, 131 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: NOT(F ((2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p29 + p19 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99))) : (G ((p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 <= 2)) OR ((X (F ((3 <= p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150))) U NOT(X (G ((1 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129))))) AND (p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + 1 <= p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p100))) : X (F ((NOT(X ((1 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119))) AND (p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 <= 1)))) : X (X ((((((0 <= 0) U ((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p100) OR (p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119))) OR G ((2 <= p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150))) U X ((3 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119))) AND (3 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119)))) : ((1 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129) U NOT(F (((G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p29 + p19 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129)) OR (p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p100 + 1 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160)) AND (X ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p29 + p19 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129)) OR G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p29 + p19 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129))))))) : NOT(F ((NOT(X (X ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p29 + p19 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160)))) OR NOT(F (X (NOT(X ((p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 <= p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p100))))))))) : G ((F (G (X (G (X ((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + 1 <= p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p100)))))) OR (1 <= p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p100))) : G (X (F (G ((G ((2 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160)) OR (p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160 <= 1)))))) : (F (G ((p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + 1 <= p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150))) U X (NOT(F (NOT(G (X (NOT(X ((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p29 + p19 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)))))))))) : X (G (NOT(X (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p29 + p19 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160) U F ((G ((p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129)) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p29 + p19 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:335
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:297
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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: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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k: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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 <= 2)) OR (X (F ((p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 <= 0))) AND (p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + 1 <= p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p100)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + 1 <= p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p100)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + 1 <= p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p100)
lola: processed formula length: 144
lola: 85 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 394 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 <= 2))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 <= 2))
lola: processed formula length: 78
lola: 85 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: 23487 markings, 74108 edges, 4697 markings/sec, 0 secs
lola: 46686 markings, 151539 edges, 4640 markings/sec, 5 secs
lola: 69732 markings, 229632 edges, 4609 markings/sec, 10 secs
lola: 92705 markings, 308419 edges, 4595 markings/sec, 15 secs
lola: 115809 markings, 386583 edges, 4621 markings/sec, 20 secs
lola: 139325 markings, 464626 edges, 4703 markings/sec, 25 secs
lola: 162860 markings, 544187 edges, 4707 markings/sec, 30 secs
lola: 185964 markings, 622279 edges, 4621 markings/sec, 35 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 187102 markings, 626468 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 389 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((X ((p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 <= 0)) AND (p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((X ((p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 <= 0)) AND (p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 <= 1))))
lola: processed formula length: 167
lola: 85 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: 213 markings, 416 edges
lola: ========================================
lola: subprocess 2 will run for 438 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((((F (((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p100) OR (p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119))) OR G ((2 <= p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150))) U X ((3 <= p110 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((((F (((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p100) OR (p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119))) OR G ((2 <= p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150))) U X ((3 <= p110 ... (shortened)
lola: processed formula length: 547
lola: 85 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 10 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 3 will run for 501 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129) U G (((F ((p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((1 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129) U G (((F ((p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p2... (shortened)
lola: processed formula length: 2247
lola: 85 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 16 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 418771 markings, 1378725 edges
lola: subprocess 4 will run for 584 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45... (shortened)
lola: processed formula length: 827
lola: 85 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================
lola: ========================================
lola: subprocess 5 will run for 700 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (X (G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 700 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + 1 <= p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150)))
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 ((p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + 1 <= p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150)))
lola: processed formula length: 152
lola: 85 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: 6 markings, 7 edges
lola: ========================================
lola: subprocess 6 will run for 876 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p... (shortened)
lola: processed formula length: 610
lola: 85 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 876 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((F ((p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + 1 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119)) AND (p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((F ((p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + 1 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119)) AND (p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68... (shortened)
lola: processed formula length: 831
lola: 85 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================
lola: subprocess 7 will run for 1168 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((G ((2 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160)) OR (p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((G ((2 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160)) OR (p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160 <= 1))))
lola: processed formula length: 166
lola: 85 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 23810 markings, 73691 edges, 4762 markings/sec, 0 secs
lola: 49424 markings, 156726 edges, 5123 markings/sec, 5 secs
lola: 78595 markings, 252789 edges, 5834 markings/sec, 10 secs
lola: 111283 markings, 362257 edges, 6538 markings/sec, 15 secs
lola: 143341 markings, 466480 edges, 6412 markings/sec, 20 secs
lola: 176384 markings, 575712 edges, 6609 markings/sec, 25 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 198919 markings, 650751 edges
lola: ========================================
lola: subprocess 8 will run for 1735 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F (G ((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + 1 <= p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p100))) OR (1 <= p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p100)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (G ((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + 1 <= p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p100))) OR (1 <= p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p100)))
lola: processed formula length: 236
lola: 85 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 91170 markings, 280404 edges, 18234 markings/sec, 0 secs
lola: 173528 markings, 546045 edges, 16472 markings/sec, 5 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 199051 markings, 628790 edges
lola: ========================================
lola: subprocess 9 will run for 3458 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 ... (shortened)
lola: processed formula length: 598
lola: 85 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: 5 markings, 5 edges
lola: RESULT
lola:
SUMMARY: no yes no no yes no yes yes no no
lola:
preliminary result: no yes no no yes no yes yes no no
lola: ========================================
lola: memory consumption: 101304 KB
lola: time consumption: 112 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="PhilosophersDyn-COL-10"
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 PhilosophersDyn-COL-10, 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 r170-oct2-162089286900005"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-COL-10.tgz
mv PhilosophersDyn-COL-10 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 ;