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-162089287000025.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-PT-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-oct2-162089287000025
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 13M
-rw-r--r-- 1 mcc users 150K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 653K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.3M May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 6.4M 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 11K Mar 28 16:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 45K Mar 28 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 125K Mar 28 16:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 468K Mar 28 16:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 27 09:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 39K Mar 27 09:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 215K Mar 25 11:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 832K Mar 25 11:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.6K Mar 22 09:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.8K Mar 22 09:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 2.5M 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-PT-10-00
FORMULA_NAME PhilosophersDyn-PT-10-01
FORMULA_NAME PhilosophersDyn-PT-10-02
FORMULA_NAME PhilosophersDyn-PT-10-03
FORMULA_NAME PhilosophersDyn-PT-10-04
FORMULA_NAME PhilosophersDyn-PT-10-05
FORMULA_NAME PhilosophersDyn-PT-10-06
FORMULA_NAME PhilosophersDyn-PT-10-07
FORMULA_NAME PhilosophersDyn-PT-10-08
FORMULA_NAME PhilosophersDyn-PT-10-09
FORMULA_NAME PhilosophersDyn-PT-10-10
FORMULA_NAME PhilosophersDyn-PT-10-11
FORMULA_NAME PhilosophersDyn-PT-10-12
FORMULA_NAME PhilosophersDyn-PT-10-13
FORMULA_NAME PhilosophersDyn-PT-10-14
FORMULA_NAME PhilosophersDyn-PT-10-15

=== Now, execution of the tool begins

BK_START 1621372057819

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-18 21:07:40] [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:07:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 21:07:40] [INFO ] Load time of PNML (sax parser for PT used): 202 ms
[2021-05-18 21:07:40] [INFO ] Transformed 170 places.
[2021-05-18 21:07:40] [INFO ] Transformed 2310 transitions.
[2021-05-18 21:07:40] [INFO ] Parsed PT model containing 170 places and 2310 transitions in 271 ms.
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 64 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 11918 resets, run finished after 1865 ms. (steps per millisecond=53 ) 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1]
[2021-05-18 21:07:42] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
// Phase 1: matrix 1905 rows 170 cols
[2021-05-18 21:07:42] [INFO ] Computed 39 place invariants in 52 ms
[2021-05-18 21:07:42] [INFO ] [Real]Absence check using 27 positive place invariants in 38 ms returned sat
[2021-05-18 21:07:42] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 11 ms returned sat
[2021-05-18 21:07:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 21:07:43] [INFO ] [Real]Absence check using state equation in 835 ms returned sat
[2021-05-18 21:07:44] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2021-05-18 21:07:44] [INFO ] [Real]Added 1030 Read/Feed constraints in 375 ms returned sat
[2021-05-18 21:07:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 21:07:44] [INFO ] [Nat]Absence check using 27 positive place invariants in 12 ms returned sat
[2021-05-18 21:07:44] [INFO ] [Nat]Absence check using 27 positive and 12 generalized place invariants in 7 ms returned sat
[2021-05-18 21:07:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 21:07:45] [INFO ] [Nat]Absence check using state equation in 1407 ms returned sat
[2021-05-18 21:07:46] [INFO ] [Nat]Added 1030 Read/Feed constraints in 720 ms returned sat
[2021-05-18 21:07:47] [INFO ] Computed and/alt/rep : 2220/268350/1860 causal constraints in 579 ms.
[2021-05-18 21:08:04] [INFO ] Added : 145 causal constraints over 29 iterations in 17714 ms. Result :unknown
[2021-05-18 21:08:04] [INFO ] [Real]Absence check using 27 positive place invariants in 8 ms returned sat
[2021-05-18 21:08:04] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 4 ms returned sat
[2021-05-18 21:08:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 21:08:05] [INFO ] [Real]Absence check using state equation in 622 ms returned sat
[2021-05-18 21:08:05] [INFO ] [Real]Added 1030 Read/Feed constraints in 209 ms returned sat
[2021-05-18 21:08:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 21:08:05] [INFO ] [Nat]Absence check using 27 positive place invariants in 14 ms returned sat
[2021-05-18 21:08:05] [INFO ] [Nat]Absence check using 27 positive and 12 generalized place invariants in 4 ms returned sat
[2021-05-18 21:08:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 21:08:06] [INFO ] [Nat]Absence check using state equation in 582 ms returned sat
[2021-05-18 21:08:06] [INFO ] [Nat]Added 1030 Read/Feed constraints in 683 ms returned sat
[2021-05-18 21:08:07] [INFO ] Computed and/alt/rep : 2220/268350/1860 causal constraints in 422 ms.
[2021-05-18 21:08:25] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t264 0) (and (or (and (> t22 0) (< o22 o264)) (and (> t28 0) (< o28 o264)) (and (> t149 0) (< o149 o264)) (and (> t258 0) (< o258 o264)) (and (> t260 0) (< o260 o264)) (and (> t303 0) (< o303 o264)) (and (> t345 0) (< o345 o264)) (and (> t585 0) (< o585 o264)) (and (> t660 0) (< o660 o264)) (and (> t919 0) (< o919 o264)) (and (> t991 0) (< o991 o264)) (and (> t1046 0) (< o1046 o264)) (and (> t1083 0) (< o1083 o264)) (and (> t1155 0) (< o1155 o264)) (and (> t1236 0) (< o1236 o264)) (and (> t1359 0) (< o1359 o264)) (and (> t1364 0) (< o1364 o264)) (and (> t1415 0) (< o1415 o264)) (and (> t1482 0) (< o1482 o264)) (and (> t1553 0) (< o1553 o264)) (and (> t1604 0) (< o1604 o264)) (and (> t1684 0) (< o1684 o264)) (and (> t1706 0) (< o1706 o264)) (and (> t1753 0) (< o1753 o264)) (and (> t1793 0) (< o1793 o264)) (and (> t1811 0) (< o1811 o264)) (and (> t1814 0) (< o1814 o264)) (and (> t1832 0) (< o1832 o264))) (and (> t1531 0) (< o1531 o264)) (or (and (> t135 0) (< o135 o264)) (and (> t254 0) (< o254 o264)) (and (> t456 0) (< o456 o264)) (and (> t501 0) (< o501 o264)) (and (> t525 0) (< o525 o264)) (and (> t552 0) (< o552 o264)) (and (> t675 0) (< o675 o264)) (and (> t683 0) (< o683 o264)) (and (> t799 0) (< o799 o264)) (and (> t816 0) (< o816 o264)) (and (> t879 0) (< o879 o264)) (and (> t933 0) (< o933 o264)) (and (> t956 0) (< o956 o264)) (and (> t997 0) (< o997 o264)) (and (> t1112 0) (< o1112 o264)) (and (> t1122 0) (< o1122 o264)) (and (> t1136 0) (< o1136 o264)) (and (> t1163 0) (< o1163 o264)) (and (> t1170 0) (< o1170 o264)) (and (> t1221 0) (< o1221 o264)) (and (> t1336 0) (< o1336 o264)) (and (> t1398 0) (< o1398 o264)) (and (> t1598 0) (< o1598 o264)) (and (> t1661 0) (< o1661 o264)) (and (> t1699 0) (< o1699 o264)) (and (> t1753 0) (< o1753 o264)) (and (> t1771 0) (< o1771 o264)))))") while checking expression at index 1
[2021-05-18 21:08:25] [INFO ] [Real]Absence check using 27 positive place invariants in 9 ms returned sat
[2021-05-18 21:08:25] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 4 ms returned sat
[2021-05-18 21:08:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 21:08:26] [INFO ] [Real]Absence check using state equation in 616 ms returned sat
[2021-05-18 21:08:26] [INFO ] [Real]Added 1030 Read/Feed constraints in 217 ms returned sat
[2021-05-18 21:08:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 21:08:26] [INFO ] [Nat]Absence check using 27 positive place invariants in 9 ms returned sat
[2021-05-18 21:08:26] [INFO ] [Nat]Absence check using 27 positive and 12 generalized place invariants in 4 ms returned sat
[2021-05-18 21:08:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 21:08:27] [INFO ] [Nat]Absence check using state equation in 670 ms returned sat
[2021-05-18 21:08:27] [INFO ] [Nat]Added 1030 Read/Feed constraints in 701 ms returned sat
[2021-05-18 21:08:28] [INFO ] Deduced a trap composed of 48 places in 297 ms
[2021-05-18 21:08:28] [INFO ] Deduced a trap composed of 70 places in 281 ms
[2021-05-18 21:08:28] [INFO ] Deduced a trap composed of 57 places in 279 ms
[2021-05-18 21:08:29] [INFO ] Deduced a trap composed of 48 places in 265 ms
[2021-05-18 21:08:29] [INFO ] Deduced a trap composed of 48 places in 274 ms
[2021-05-18 21:08:29] [INFO ] Deduced a trap composed of 48 places in 262 ms
[2021-05-18 21:08:30] [INFO ] Deduced a trap composed of 48 places in 266 ms
[2021-05-18 21:08:30] [INFO ] Deduced a trap composed of 64 places in 253 ms
[2021-05-18 21:08:30] [INFO ] Deduced a trap composed of 48 places in 276 ms
[2021-05-18 21:08:30] [INFO ] Deduced a trap composed of 56 places in 286 ms
[2021-05-18 21:08:31] [INFO ] Deduced a trap composed of 48 places in 272 ms
[2021-05-18 21:08:31] [INFO ] Deduced a trap composed of 48 places in 273 ms
[2021-05-18 21:08:31] [INFO ] Deduced a trap composed of 57 places in 243 ms
[2021-05-18 21:08:32] [INFO ] Deduced a trap composed of 63 places in 270 ms
[2021-05-18 21:08:32] [INFO ] Deduced a trap composed of 57 places in 274 ms
[2021-05-18 21:08:32] [INFO ] Deduced a trap composed of 48 places in 272 ms
[2021-05-18 21:08:33] [INFO ] Deduced a trap composed of 57 places in 284 ms
[2021-05-18 21:08:33] [INFO ] Deduced a trap composed of 57 places in 274 ms
[2021-05-18 21:08:33] [INFO ] Deduced a trap composed of 48 places in 274 ms
[2021-05-18 21:08:34] [INFO ] Deduced a trap composed of 69 places in 276 ms
[2021-05-18 21:08:34] [INFO ] Deduced a trap composed of 83 places in 260 ms
[2021-05-18 21:08:34] [INFO ] Deduced a trap composed of 74 places in 257 ms
[2021-05-18 21:08:35] [INFO ] Deduced a trap composed of 56 places in 266 ms
[2021-05-18 21:08:35] [INFO ] Deduced a trap composed of 68 places in 262 ms
[2021-05-18 21:08:35] [INFO ] Deduced a trap composed of 48 places in 279 ms
[2021-05-18 21:08:36] [INFO ] Deduced a trap composed of 48 places in 281 ms
[2021-05-18 21:08:36] [INFO ] Deduced a trap composed of 40 places in 271 ms
[2021-05-18 21:08:36] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 9083 ms
[2021-05-18 21:08:37] [INFO ] Computed and/alt/rep : 2220/268350/1860 causal constraints in 251 ms.
[2021-05-18 21:08:46] [INFO ] Added : 110 causal constraints over 22 iterations in 9519 ms. Result :unknown
[2021-05-18 21:08:46] [INFO ] [Real]Absence check using 27 positive place invariants in 5 ms returned unsat
[2021-05-18 21:08:46] [INFO ] [Real]Absence check using 27 positive place invariants in 9 ms returned sat
[2021-05-18 21:08:46] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 4 ms returned unsat
[2021-05-18 21:08:46] [INFO ] [Real]Absence check using 27 positive place invariants in 8 ms returned sat
[2021-05-18 21:08:46] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 4 ms returned sat
[2021-05-18 21:08:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 21:08:47] [INFO ] [Real]Absence check using state equation in 714 ms returned sat
[2021-05-18 21:08:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 21:08:47] [INFO ] [Nat]Absence check using 27 positive place invariants in 9 ms returned sat
[2021-05-18 21:08:47] [INFO ] [Nat]Absence check using 27 positive and 12 generalized place invariants in 4 ms returned sat
[2021-05-18 21:08:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 21:08:47] [INFO ] [Nat]Absence check using state equation in 585 ms returned sat
[2021-05-18 21:08:48] [INFO ] [Nat]Added 1030 Read/Feed constraints in 702 ms returned sat
[2021-05-18 21:08:48] [INFO ] Deduced a trap composed of 57 places in 284 ms
[2021-05-18 21:08:49] [INFO ] Deduced a trap composed of 48 places in 499 ms
[2021-05-18 21:08:49] [INFO ] Deduced a trap composed of 48 places in 283 ms
[2021-05-18 21:08:50] [INFO ] Deduced a trap composed of 63 places in 315 ms
[2021-05-18 21:08:50] [INFO ] Deduced a trap composed of 48 places in 278 ms
[2021-05-18 21:08:50] [INFO ] Deduced a trap composed of 48 places in 276 ms
[2021-05-18 21:08:51] [INFO ] Deduced a trap composed of 66 places in 294 ms
[2021-05-18 21:08:51] [INFO ] Deduced a trap composed of 48 places in 281 ms
[2021-05-18 21:08:51] [INFO ] Deduced a trap composed of 56 places in 318 ms
[2021-05-18 21:08:52] [INFO ] Deduced a trap composed of 48 places in 333 ms
[2021-05-18 21:08:53] [INFO ] Deduced a trap composed of 56 places in 837 ms
[2021-05-18 21:08:54] [INFO ] Deduced a trap composed of 48 places in 1444 ms
[2021-05-18 21:08:56] [INFO ] Deduced a trap composed of 48 places in 1928 ms
[2021-05-18 21:08:57] [INFO ] Deduced a trap composed of 48 places in 317 ms
[2021-05-18 21:08:57] [INFO ] Deduced a trap composed of 40 places in 303 ms
[2021-05-18 21:08:59] [INFO ] Deduced a trap composed of 48 places in 1818 ms
[2021-05-18 21:08:59] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 11121 ms
[2021-05-18 21:09:00] [INFO ] Computed and/alt/rep : 2220/268350/1860 causal constraints in 401 ms.
[2021-05-18 21:09:07] [INFO ] Added : 95 causal constraints over 19 iterations in 7561 ms. Result :unknown
[2021-05-18 21:09:07] [INFO ] [Real]Absence check using 27 positive place invariants in 5 ms returned unsat
[2021-05-18 21:09:07] [INFO ] [Real]Absence check using 27 positive place invariants in 85 ms returned sat
[2021-05-18 21:09:07] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 84 ms returned sat
[2021-05-18 21:09:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 21:09:08] [INFO ] [Real]Absence check using state equation in 657 ms returned sat
[2021-05-18 21:09:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 21:09:08] [INFO ] [Nat]Absence check using 27 positive place invariants in 122 ms returned sat
[2021-05-18 21:09:08] [INFO ] [Nat]Absence check using 27 positive and 12 generalized place invariants in 12 ms returned sat
[2021-05-18 21:09:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 21:09:09] [INFO ] [Nat]Absence check using state equation in 887 ms returned sat
[2021-05-18 21:09:09] [INFO ] [Nat]Added 1030 Read/Feed constraints in 733 ms returned sat
[2021-05-18 21:09:10] [INFO ] Computed and/alt/rep : 2220/268350/1860 causal constraints in 408 ms.
[2021-05-18 21:09:28] [INFO ] Added : 160 causal constraints over 32 iterations in 18210 ms. Result :unknown
[2021-05-18 21:09:28] [INFO ] [Real]Absence check using 27 positive place invariants in 5 ms returned unsat
[2021-05-18 21:09:28] [INFO ] [Real]Absence check using 27 positive place invariants in 53 ms returned unsat
[2021-05-18 21:09:28] [INFO ] [Real]Absence check using 27 positive place invariants in 5 ms returned unsat
Successfully simplified 6 atomic propositions for a total of 6 simplifications.
[2021-05-18 21:09:28] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2021-05-18 21:09:29] [INFO ] Flatten gal took : 449 ms
FORMULA PhilosophersDyn-PT-10-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-10-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-10-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-10-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-10-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 21:09:29] [INFO ] Flatten gal took : 211 ms
[2021-05-18 21:09:29] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 8 ms.
[2021-05-18 21:09:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 27 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ PhilosophersDyn-PT-10 @ 3570 seconds

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

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

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

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

FORMULA PhilosophersDyn-PT-10-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-10-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-10-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-10-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA PhilosophersDyn-PT-10-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-10-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3494
rslt: Output for LTLCardinality @ PhilosophersDyn-PT-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:09:29 2021
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 320
},
"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": "(p4 + p136 + p11 + p21 + p22 + p41 + p58 + p46 + p72 + p86 + 1 <= p0 + p107 + p115 + p152 + p153 + p155 + p19 + p63 + p43 + p83)",
"processed_size": 128,
"rewrites": 74
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 352
},
"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 ((p120 + p157 + p26 + p42 + p68 + p39 + p75 + p96 + p165 + p98 <= 2))",
"processed_size": 71,
"rewrites": 74
},
"result":
{
"edges": 624377,
"markings": 191995,
"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": 349
},
"exit":
{
"localtimelimitreached": false
},
"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 ((p4 + p136 + p11 + p21 + p22 + p41 + p58 + p46 + p72 + p86 <= 0)) AND (p3 + p108 + p127 + p140 + p146 + p97 + p13 + p31 + p35 + p47 <= 1))))",
"processed_size": 150,
"rewrites": 74
},
"result":
{
"edges": 1269,
"markings": 341,
"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": 388
},
"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 (((p2 + p102 + p112 + p116 + p145 + p166 + p94 + p59 + p38 + p77 <= p0 + p107 + p115 + p152 + p153 + p155 + p19 + p63 + p43 + p83) OR (p3 + p108 + p127 + p140 + p146 + p97 + p13 + p31 + p35 + p47 <= p4 + p136 + p11 + p21 + p22 + p41 + p58 + p46 + p72 + p86))) OR G ((2 <= p120 + p157 + p26 + p42 + p68 + p39 + p75 + p96 + p165 + p98))) U X ((3 <= p4 + p136 + p11 + p21 + p22 + p41 + p58 + p46 + p72 + p86))) AND (3 <= p4 + p136 + p11 + p21 + p22 + p41 + p58 + p46 + p72 + p86))))",
"processed_size": 491,
"rewrites": 74
},
"result":
{
"edges": 10,
"markings": 10,
"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": 436
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 1,
"X": 4,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (F ((X (((p106 <= p0) U X (X (G ((1 <= p86)))))) OR (G ((p127 <= p63)) AND F (G ((1 <= p86)))))))",
"processed_size": 99,
"rewrites": 74
},
"result":
{
"edges": 7639,
"markings": 1796,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 20
},
"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": 499
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 499
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((p16 <= p30))",
"processed_size": 16,
"rewrites": 74
},
"result":
{
"edges": 40,
"markings": 30,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"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": 582
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (F ((X (X ((p30 + 1 <= p16))) AND (p112 <= p65))))",
"processed_size": 52,
"rewrites": 74
},
"result":
{
"edges": 9,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 699
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((1 <= p99)))",
"processed_size": 18,
"rewrites": 74
},
"result":
{
"edges": 11,
"markings": 10,
"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": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 873
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "F (G (((p75 + 1 <= p108))))",
"processed_size": 27,
"rewrites": 74
},
"result":
{
"edges": 11,
"markings": 10,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"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": 1165
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G (F (((p99 <= p31) AND (p71 <= p155) AND (1 <= p75))))",
"processed_size": 55,
"rewrites": 74
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1747
},
"exit":
{
"localtimelimitreached": false
},
"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 ((p1 + p5 + p6 + p7 + p8 + p9 + p100 + p101 + p103 + p104 + p105 + p110 + p111 + p113 + p114 + p117 + p118 + p119 + p121 + p122 + p123 + p126 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p137 + p139 + p142 + p143 + p147 + p148 + p149 + p150 + p151 + p154 + p156 + p158 + p162 + p163 + p164 + p167 + p168 + p169 + p10 + p14 + p15 + p17 + p18 + p20 + p23 + p74 + p25 + p27 + p28 + p29 + p32 + p33 + p34 + p36 + p37 + p69 + p40 + p64 + p44 + p45 + p62 + p48 + p49 + p50 + p51 + p52 + p53 + p61 + p55 + p56 + p57 + p60 + p54 + p67 + p70 + p73 + p76 + p78 + p79 + p80 + p82 + p84 + p85 + p88 + p89 + p90 + p91 + p92 + p93 + p95 <= 1))",
"processed_size": 644,
"rewrites": 74
},
"result":
{
"edges": 8,
"markings": 8,
"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"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3495
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": 4,
"visible_transitions": 0
},
"processed": "((p116 <= p85) OR (p39 <= p45))",
"processed_size": 32,
"rewrites": 74
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": 4,
"visible_transitions": 0
},
"processed": "((p116 <= p85) OR (p39 <= p45))",
"processed_size": 32,
"rewrites": 74
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((F ((p16 + 1 <= p24)) AND G ((p45 + 1 <= p39))))",
"processed_size": 51,
"rewrites": 74
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 92628,
"runtime": 76.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 **))) : F(G(**)) : X(F((X((** U X(X(G(**))))) OR (G(**) AND F(G(**)))))) : F(G(*)) : (F((F(*) AND G(*))) AND **) : (X(F((X(X(*)) AND **))) OR G(**)) : G((X(X(F(**))) AND F(G(*)))) : G(F(**))"
},
"net":
{
"arcs": 17110,
"conflict_clusters": 1,
"places": 170,
"places_significant": 131,
"singleton_clusters": 0,
"transitions": 2265
},
"result":
{
"preliminary_value": "no yes no no no no no no no no no ",
"value": "no yes no no no no no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 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: LP says that atomic proposition is always false: (3 <= p87)
lola: NOT(F ((2 <= p1 + p5 + p6 + p7 + p8 + p9 + p100 + p101 + p103 + p104 + p105 + p110 + p111 + p113 + p114 + p117 + p118 + p119 + p121 + p122 + p123 + p126 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p137 + p139 + p142 + p143 + p147 + p148 + p149 + p150 + p151 + p154 + p156 + p158 + p162 + p163 + p164 + p167 + p168 + p169 + p10 + p14 + p15 + p17 + p18 + p20 + p23 + p74 + p25 + p27 + p28 + p29 + p32 + p33 + p34 + p36 + p37 + p69 + p40 + p64 + p44 + p45 + p62 + p48 + p49 + p50 + p51 + p52 + p53 + p61 + p55 + p56 + p57 + p60 + p54 + p67 + p70 + p73 + p76 + p78 + p79 + p80 + p82 + p84 + p85 + p88 + p89 + p90 + p91 + p92 + p93 + p95))) : (G ((p120 + p157 + p26 + p42 + p68 + p39 + p75 + p96 + p165 + p98 <= 2)) OR ((X (F ((3 <= p120 + p157 + p26 + p42 + p68 + p39 + p75 + p96 + p165 + p98))) U NOT(X (G ((1 <= p3 + p108 + p127 + p140 + p146 + p97 + p13 + p31 + p35 + p47))))) AND (p4 + p136 + p11 + p21 + p22 + p41 + p58 + p46 + p72 + p86 + 1 <= p0 + p107 + p115 + p152 + p153 + p155 + p19 + p63 + p43 + p83))) : X (F ((NOT(X ((1 <= p4 + p136 + p11 + p21 + p22 + p41 + p58 + p46 + p72 + p86))) AND (p3 + p108 + p127 + p140 + p146 + p97 + p13 + p31 + p35 + p47 <= 1)))) : X (X ((((((0 <= 0) U ((p2 + p102 + p112 + p116 + p145 + p166 + p94 + p59 + p38 + p77 <= p0 + p107 + p115 + p152 + p153 + p155 + p19 + p63 + p43 + p83) OR (p3 + p108 + p127 + p140 + p146 + p97 + p13 + p31 + p35 + p47 <= p4 + p136 + p11 + p21 + p22 + p41 + p58 + p46 + p72 + p86))) OR G ((2 <= p120 + p157 + p26 + p42 + p68 + p39 + p75 + p96 + p165 + p98))) U X ((3 <= p4 + p136 + p11 + p21 + p22 + p41 + p58 + p46 + p72 + p86))) AND (3 <= p4 + p136 + p11 + p21 + p22 + p41 + p58 + p46 + p72 + p86)))) : F (G (X (G (X ((1 <= p99)))))) : X (F ((G ((p127 <= p63)) U X (((p106 <= p0) U X (X (G ((1 <= p86))))))))) : F (G (F (G (NOT(G (F (X (((p108 <= p75)))))))))) : (NOT(G ((G ((p24 <= p16)) OR F ((p39 <= p45))))) AND ((p116 <= p85) OR (p39 <= p45))) : (X (F ((X (NOT(X ((p16 <= p30)))) AND (p112 <= p65)))) OR G ((p16 <= p30))) : NOT(F ((NOT(F (X (X (((p107 <= p140)))))) OR G (F ((p43 <= p114)))))) : NOT(F (NOT(G (F ((F ((p99 <= p31)) U X (X (((p99 <= p31) AND (p71 <= p155) AND (1 <= p75))))))))))
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: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:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:332
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 320 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((p120 + p157 + p26 + p42 + p68 + p39 + p75 + p96 + p165 + p98 <= 2)) OR (X (F ((p3 + p108 + p127 + p140 + p146 + p97 + p13 + p31 + p35 + p47 <= 0))) AND (p4 + p136 + p11 + p21 + p22 + p41 + p58 + p46 + p72 + p86 + 1 <= p0 + p107 + p115 + p152 + p153 + p155 + p19 + p63 + p43 + p83)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 320 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p4 + p136 + p11 + p21 + p22 + p41 + p58 + p46 + p72 + p86 + 1 <= p0 + p107 + p115 + p152 + p153 + p155 + p19 + p63 + p43 + p83)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p4 + p136 + p11 + p21 + p22 + p41 + p58 + p46 + p72 + p86 + 1 <= p0 + p107 + p115 + p152 + p153 + p155 + p19 + p63 + p43 + p83)
lola: processed formula length: 128
lola: 74 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 352 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p120 + p157 + p26 + p42 + p68 + p39 + p75 + p96 + p165 + p98 <= 2))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p120 + p157 + p26 + p42 + p68 + p39 + p75 + p96 + p165 + p98 <= 2))
lola: processed formula length: 71
lola: 74 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: 30908 markings, 92393 edges, 6182 markings/sec, 0 secs
lola: 62327 markings, 192207 edges, 6284 markings/sec, 5 secs
lola: 94461 markings, 298041 edges, 6427 markings/sec, 10 secs
lola: 127582 markings, 408468 edges, 6624 markings/sec, 15 secs
lola: 159682 markings, 516706 edges, 6420 markings/sec, 20 secs
lola: 191909 markings, 623897 edges, 6445 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: 191995 markings, 624377 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 349 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((X ((p4 + p136 + p11 + p21 + p22 + p41 + p58 + p46 + p72 + p86 <= 0)) AND (p3 + p108 + p127 + p140 + p146 + p97 + p13 + p31 + p35 + p47 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((X ((p4 + p136 + p11 + p21 + p22 + p41 + p58 + p46 + p72 + p86 <= 0)) AND (p3 + p108 + p127 + p140 + p146 + p97 + p13 + p31 + p35 + p47 <= 1))))
lola: processed formula length: 150
lola: 74 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: 341 markings, 1269 edges
lola: ========================================
lola: subprocess 2 will run for 388 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((((F (((p2 + p102 + p112 + p116 + p145 + p166 + p94 + p59 + p38 + p77 <= p0 + p107 + p115 + p152 + p153 + p155 + p19 + p63 + p43 + p83) OR (p3 + p108 + p127 + p140 + p146 + p97 + p13 + p31 + p35 + p47 <= p4 + p136 + p11 + p21 + p22 + p41 + p58 + p46 + p72 + p86))) OR G ((2 <= p120 + p157 + p26 + p42 + p68 + p39 + p75 + p96 + p165 + p98))) U X ((3 <= p4 + p136 + p11 + p21 + p22 + p41 + p58 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((((F (((p2 + p102 + p112 + p116 + p145 + p166 + p94 + p59 + p38 + p77 <= p0 + p107 + p115 + p152 + p153 + p155 + p19 + p63 + p43 + p83) OR (p3 + p108 + p127 + p140 + p146 + p97 + p13 + p31 + p35 + p47 <= p4 + p136 + p11 + p21 + p22 + p41 + p58 + p46 + p72 + p86))) OR G ((2 <= p120 + p157 + p26 + p42 + p68 + p39 + p75 + p96 + p165 + p98))) U X ((3 <= p4 + p136 + p11 + p21 + p22 + p41 + p58 +... (shortened)
lola: processed formula length: 491
lola: 74 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: 10 markings, 10 edges
lola: ========================================
lola: subprocess 3 will run for 436 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((X (((p106 <= p0) U X (X (G ((1 <= p86)))))) OR (G ((p127 <= p63)) AND F (G ((1 <= p86)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((X (((p106 <= p0) U X (X (G ((1 <= p86)))))) OR (G ((p127 <= p63)) AND F (G ((1 <= p86)))))))
lola: processed formula length: 99
lola: 74 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 20 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: 1796 markings, 7639 edges
lola: ========================================
lola: subprocess 4 will run for 499 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((X (X ((p30 + 1 <= p16))) AND (p112 <= p65)))) OR G ((p16 <= p30)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 499 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p16 <= p30))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p16 <= p30))
lola: processed formula length: 16
lola: 74 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: 30 markings, 40 edges
lola: ========================================
lola: subprocess 5 will run for 582 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((X (X ((p30 + 1 <= p16))) AND (p112 <= p65))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((X (X ((p30 + 1 <= p16))) AND (p112 <= p65))))
lola: processed formula length: 52
lola: 74 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: 9 markings, 9 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 582 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (X (F (((p107 <= p140))))) AND F (G ((p114 + 1 <= p43)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (X (F (((p107 <= p140))))) AND F (G ((p114 + 1 <= p43)))))
lola: processed formula length: 64
lola: 74 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 19 markings, 19 edges
lola: ========================================
lola: subprocess 6 will run for 699 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((1 <= p99)))
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 ((1 <= p99)))
lola: processed formula length: 18
lola: 74 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: 10 markings, 11 edges
lola: ========================================
lola: subprocess 7 will run for 873 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p75 + 1 <= p108))))
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 (((p75 + 1 <= p108))))
lola: processed formula length: 27
lola: 74 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: 10 markings, 11 edges
lola: ========================================
lola: subprocess 8 will run for 1165 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((p99 <= p31) AND (p71 <= p155) AND (1 <= p75))))
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 (((p99 <= p31) AND (p71 <= p155) AND (1 <= p75))))
lola: processed formula length: 55
lola: 74 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: 8 markings, 8 edges
lola: ========================================
lola: subprocess 9 will run for 1747 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p1 + p5 + p6 + p7 + p8 + p9 + p100 + p101 + p103 + p104 + p105 + p110 + p111 + p113 + p114 + p117 + p118 + p119 + p121 + p122 + p123 + p126 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p137 + p139 + p142 + p143 + p147 + p148 + p149 + p150 + p151 + p154 + p156 + p158 + p162 + p163 + p164 + p167 + p168 + p169 + p10 + p14 + p15 + p17 + p18 + p20 + p23 + p74 + p25 + p27 + p28 + p29 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p1 + p5 + p6 + p7 + p8 + p9 + p100 + p101 + p103 + p104 + p105 + p110 + p111 + p113 + p114 + p117 + p118 + p119 + p121 + p122 + p123 + p126 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p137 + p139 + p142 + p143 + p147 + p148 + p149 + p150 + p151 + p154 + p156 + p158 + p162 + p163 + p164 + p167 + p168 + p169 + p10 + p14 + p15 + p17 + p18 + p20 + p23 + p74 + p25 + p27 + p28 + p29 + ... (shortened)
lola: processed formula length: 644
lola: 74 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: 8 markings, 8 edges
lola: ========================================
lola: subprocess 10 will run for 3495 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((F ((p16 + 1 <= p24)) AND G ((p45 + 1 <= p39)))) AND ((p116 <= p85) OR (p39 <= p45)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 3495 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p116 <= p85) OR (p39 <= p45))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p116 <= p85) OR (p39 <= p45))
lola: processed formula length: 32
lola: 74 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 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: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (F ((F ((p16 + 1 <= p24)) AND G ((p45 + 1 <= p39)))) AND ((p116 <= p85) OR (p39 <= p45)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((p116 <= p85) OR (p39 <= p45))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p116 <= p85) OR (p39 <= p45))
lola: processed formula length: 32
lola: 74 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 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: ========================================
lola: ...considering subproblem: F ((F ((p16 + 1 <= p24)) AND G ((p45 + 1 <= p39))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F ((p16 + 1 <= p24)) AND G ((p45 + 1 <= p39))))
lola: processed formula length: 51
lola: 74 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no no no no no no no no no
lola:
preliminary result: no yes no no no no no no no no no
lola: memory consumption: 92628 KB
lola: time consumption: 76 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-PT-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-PT-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-162089287000025"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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