Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r151-tall-162089151400312.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is Peterson-PT-4, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r151-tall-162089151400312
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.0M
-rw-r--r-- 1 mcc users 697K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.7M May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 286K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.3M 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.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 27K Mar 28 16:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Mar 28 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 23K Mar 28 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 83K Mar 28 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Mar 27 07:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 49K Mar 27 07:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 23K Mar 25 08:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Mar 25 08:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 21K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 520K 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 Peterson-PT-4-ReachabilityFireability-00
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-01
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-02
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-03
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-04
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-05
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-06
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-07
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-08
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-09
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-10
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-11
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-12
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-13
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-14
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1621026028019

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-14 21:00:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-14 21:00:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 21:00:29] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2021-05-14 21:00:29] [INFO ] Transformed 480 places.
[2021-05-14 21:00:29] [INFO ] Transformed 690 transitions.
[2021-05-14 21:00:29] [INFO ] Found NUPN structural information;
[2021-05-14 21:00:29] [INFO ] Parsed PT model containing 480 places and 690 transitions in 133 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 46 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 99 ms. (steps per millisecond=101 ) properties seen :[1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0]
FORMULA Peterson-PT-4-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 184 ms. (steps per millisecond=54 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 53 ms. (steps per millisecond=188 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 1, 0, 0]
FORMULA Peterson-PT-4-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 1, 0, 0, 0]
FORMULA Peterson-PT-4-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0]
[2021-05-14 21:00:30] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2021-05-14 21:00:30] [INFO ] Computed 19 place invariants in 17 ms
[2021-05-14 21:00:30] [INFO ] [Real]Absence check using 14 positive place invariants in 43 ms returned sat
[2021-05-14 21:00:30] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 7 ms returned sat
[2021-05-14 21:00:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:00:31] [INFO ] [Real]Absence check using state equation in 819 ms returned sat
[2021-05-14 21:00:31] [INFO ] State equation strengthened by 132 read => feed constraints.
[2021-05-14 21:00:31] [INFO ] [Real]Added 132 Read/Feed constraints in 44 ms returned sat
[2021-05-14 21:00:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:00:31] [INFO ] [Nat]Absence check using 14 positive place invariants in 123 ms returned sat
[2021-05-14 21:00:31] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 7 ms returned sat
[2021-05-14 21:00:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:00:32] [INFO ] [Nat]Absence check using state equation in 867 ms returned sat
[2021-05-14 21:00:32] [INFO ] [Nat]Added 132 Read/Feed constraints in 28 ms returned sat
[2021-05-14 21:00:33] [INFO ] Deduced a trap composed of 32 places in 242 ms
[2021-05-14 21:00:33] [INFO ] Deduced a trap composed of 32 places in 189 ms
[2021-05-14 21:00:33] [INFO ] Deduced a trap composed of 10 places in 196 ms
[2021-05-14 21:00:33] [INFO ] Deduced a trap composed of 10 places in 193 ms
[2021-05-14 21:00:33] [INFO ] Deduced a trap composed of 10 places in 187 ms
[2021-05-14 21:00:34] [INFO ] Deduced a trap composed of 13 places in 214 ms
[2021-05-14 21:00:34] [INFO ] Deduced a trap composed of 12 places in 178 ms
[2021-05-14 21:00:34] [INFO ] Deduced a trap composed of 19 places in 177 ms
[2021-05-14 21:00:34] [INFO ] Deduced a trap composed of 32 places in 162 ms
[2021-05-14 21:00:34] [INFO ] Deduced a trap composed of 39 places in 158 ms
[2021-05-14 21:00:35] [INFO ] Deduced a trap composed of 76 places in 163 ms
[2021-05-14 21:00:35] [INFO ] Deduced a trap composed of 76 places in 206 ms
[2021-05-14 21:00:35] [INFO ] Deduced a trap composed of 54 places in 152 ms
[2021-05-14 21:00:35] [INFO ] Deduced a trap composed of 54 places in 156 ms
[2021-05-14 21:00:35] [INFO ] Deduced a trap composed of 54 places in 160 ms
[2021-05-14 21:00:36] [INFO ] Deduced a trap composed of 57 places in 194 ms
[2021-05-14 21:00:36] [INFO ] Deduced a trap composed of 54 places in 175 ms
[2021-05-14 21:00:36] [INFO ] Deduced a trap composed of 10 places in 164 ms
[2021-05-14 21:00:36] [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 (> (+ s120 s227 s232 s296 s341 s414 s418 s422 s466 s475) 0)") while checking expression at index 0
[2021-05-14 21:00:36] [INFO ] [Real]Absence check using 14 positive place invariants in 21 ms returned sat
[2021-05-14 21:00:36] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2021-05-14 21:00:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:00:37] [INFO ] [Real]Absence check using state equation in 543 ms returned sat
[2021-05-14 21:00:37] [INFO ] [Real]Added 132 Read/Feed constraints in 17 ms returned sat
[2021-05-14 21:00:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:00:37] [INFO ] [Nat]Absence check using 14 positive place invariants in 41 ms returned sat
[2021-05-14 21:00:37] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2021-05-14 21:00:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:00:37] [INFO ] [Nat]Absence check using state equation in 549 ms returned sat
[2021-05-14 21:00:37] [INFO ] [Nat]Added 132 Read/Feed constraints in 29 ms returned sat
[2021-05-14 21:00:38] [INFO ] Deduced a trap composed of 27 places in 209 ms
[2021-05-14 21:00:38] [INFO ] Deduced a trap composed of 14 places in 203 ms
[2021-05-14 21:00:38] [INFO ] Deduced a trap composed of 10 places in 203 ms
[2021-05-14 21:00:38] [INFO ] Deduced a trap composed of 14 places in 194 ms
[2021-05-14 21:00:39] [INFO ] Deduced a trap composed of 14 places in 203 ms
[2021-05-14 21:00:39] [INFO ] Deduced a trap composed of 47 places in 179 ms
[2021-05-14 21:00:39] [INFO ] Deduced a trap composed of 27 places in 170 ms
[2021-05-14 21:00:39] [INFO ] Deduced a trap composed of 84 places in 178 ms
[2021-05-14 21:00:39] [INFO ] Deduced a trap composed of 42 places in 183 ms
[2021-05-14 21:00:40] [INFO ] Deduced a trap composed of 42 places in 190 ms
[2021-05-14 21:00:40] [INFO ] Deduced a trap composed of 17 places in 223 ms
[2021-05-14 21:00:40] [INFO ] Deduced a trap composed of 15 places in 231 ms
[2021-05-14 21:00:40] [INFO ] Deduced a trap composed of 62 places in 192 ms
[2021-05-14 21:00:41] [INFO ] Deduced a trap composed of 96 places in 172 ms
[2021-05-14 21:00:41] [INFO ] Deduced a trap composed of 25 places in 184 ms
[2021-05-14 21:00:41] [INFO ] Deduced a trap composed of 30 places in 194 ms
[2021-05-14 21:00:41] [INFO ] Deduced a trap composed of 10 places in 181 ms
[2021-05-14 21:00:41] [INFO ] Deduced a trap composed of 32 places in 166 ms
[2021-05-14 21:00:42] [INFO ] Deduced a trap composed of 25 places in 179 ms
[2021-05-14 21:00:42] [INFO ] Deduced a trap composed of 25 places in 180 ms
[2021-05-14 21:00:42] [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 (> (+ s105 s108 s118 s119 s133 s223 s225 s226 s232 s295 s298 s299 s321 s324 s342 s415 s419 s422 s423 s426 s457 s460 s466 s474 s475) 0)") while checking expression at index 1
[2021-05-14 21:00:42] [INFO ] [Real]Absence check using 14 positive place invariants in 19 ms returned sat
[2021-05-14 21:00:42] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2021-05-14 21:00:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:00:42] [INFO ] [Real]Absence check using state equation in 487 ms returned sat
[2021-05-14 21:00:42] [INFO ] [Real]Added 132 Read/Feed constraints in 14 ms returned sat
[2021-05-14 21:00:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:00:43] [INFO ] [Nat]Absence check using 14 positive place invariants in 24 ms returned sat
[2021-05-14 21:00:43] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2021-05-14 21:00:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:00:43] [INFO ] [Nat]Absence check using state equation in 496 ms returned sat
[2021-05-14 21:00:43] [INFO ] [Nat]Added 132 Read/Feed constraints in 31 ms returned sat
[2021-05-14 21:00:43] [INFO ] Deduced a trap composed of 42 places in 192 ms
[2021-05-14 21:00:44] [INFO ] Deduced a trap composed of 16 places in 303 ms
[2021-05-14 21:00:44] [INFO ] Deduced a trap composed of 10 places in 302 ms
[2021-05-14 21:00:44] [INFO ] Deduced a trap composed of 10 places in 194 ms
[2021-05-14 21:00:44] [INFO ] Deduced a trap composed of 32 places in 297 ms
[2021-05-14 21:00:45] [INFO ] Deduced a trap composed of 27 places in 194 ms
[2021-05-14 21:00:45] [INFO ] Deduced a trap composed of 54 places in 193 ms
[2021-05-14 21:00:45] [INFO ] Deduced a trap composed of 14 places in 186 ms
[2021-05-14 21:00:45] [INFO ] Deduced a trap composed of 54 places in 164 ms
[2021-05-14 21:00:45] [INFO ] Deduced a trap composed of 54 places in 176 ms
[2021-05-14 21:00:46] [INFO ] Deduced a trap composed of 53 places in 155 ms
[2021-05-14 21:00:46] [INFO ] Deduced a trap composed of 36 places in 154 ms
[2021-05-14 21:00:46] [INFO ] Deduced a trap composed of 63 places in 178 ms
[2021-05-14 21:00:46] [INFO ] Deduced a trap composed of 59 places in 165 ms
[2021-05-14 21:00:46] [INFO ] Deduced a trap composed of 57 places in 162 ms
[2021-05-14 21:00:47] [INFO ] Deduced a trap composed of 96 places in 176 ms
[2021-05-14 21:00:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 16 trap constraints in 3521 ms
[2021-05-14 21:00:47] [INFO ] [Real]Absence check using 14 positive place invariants in 20 ms returned sat
[2021-05-14 21:00:47] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2021-05-14 21:00:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:00:47] [INFO ] [Real]Absence check using state equation in 646 ms returned sat
[2021-05-14 21:00:47] [INFO ] [Real]Added 132 Read/Feed constraints in 45 ms returned sat
[2021-05-14 21:00:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:00:48] [INFO ] [Nat]Absence check using 14 positive place invariants in 74 ms returned sat
[2021-05-14 21:00:48] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2021-05-14 21:00:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:00:48] [INFO ] [Nat]Absence check using state equation in 730 ms returned sat
[2021-05-14 21:00:48] [INFO ] [Nat]Added 132 Read/Feed constraints in 29 ms returned sat
[2021-05-14 21:00:49] [INFO ] Deduced a trap composed of 10 places in 209 ms
[2021-05-14 21:00:49] [INFO ] Deduced a trap composed of 40 places in 414 ms
[2021-05-14 21:00:49] [INFO ] Deduced a trap composed of 43 places in 198 ms
[2021-05-14 21:00:49] [INFO ] Deduced a trap composed of 19 places in 199 ms
[2021-05-14 21:00:50] [INFO ] Deduced a trap composed of 10 places in 195 ms
[2021-05-14 21:00:50] [INFO ] Deduced a trap composed of 10 places in 188 ms
[2021-05-14 21:00:50] [INFO ] Deduced a trap composed of 10 places in 190 ms
[2021-05-14 21:00:50] [INFO ] Deduced a trap composed of 36 places in 172 ms
[2021-05-14 21:00:50] [INFO ] Deduced a trap composed of 58 places in 178 ms
[2021-05-14 21:00:51] [INFO ] Deduced a trap composed of 39 places in 196 ms
[2021-05-14 21:00:51] [INFO ] Deduced a trap composed of 96 places in 184 ms
[2021-05-14 21:00:51] [INFO ] Deduced a trap composed of 36 places in 155 ms
[2021-05-14 21:00:51] [INFO ] Deduced a trap composed of 43 places in 159 ms
[2021-05-14 21:00:51] [INFO ] Deduced a trap composed of 36 places in 150 ms
[2021-05-14 21:00:52] [INFO ] Deduced a trap composed of 32 places in 158 ms
[2021-05-14 21:00:52] [INFO ] Deduced a trap composed of 80 places in 119 ms
[2021-05-14 21:00:52] [INFO ] Deduced a trap composed of 54 places in 135 ms
[2021-05-14 21:00:52] [INFO ] Deduced a trap composed of 54 places in 121 ms
[2021-05-14 21:00:52] [INFO ] Deduced a trap composed of 64 places in 144 ms
[2021-05-14 21:00:52] [INFO ] Deduced a trap composed of 54 places in 128 ms
[2021-05-14 21:00:53] [INFO ] Deduced a trap composed of 2 places in 231 ms
[2021-05-14 21:00:53] [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 (> (+ s231 s236) 0)") while checking expression at index 3
FORMULA Peterson-PT-4-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 275 out of 480 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 480/480 places, 690/690 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 480 transition count 669
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 459 transition count 669
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 50 place count 455 transition count 665
Applied a total of 50 rules in 101 ms. Remains 455 /480 variables (removed 25) and now considering 665/690 (removed 25) transitions.
Finished structural reductions, in 1 iterations. Remains : 455/480 places, 665/690 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 3369 ms. (steps per millisecond=296 ) properties seen :[0, 0, 0]
Interrupted Best-First random walk after 357858 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=71 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1140 ms. (steps per millisecond=877 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 975 ms. (steps per millisecond=1025 ) properties seen :[0, 0, 0]
Interrupted probabilistic random walk after 9949794 steps, run timeout after 30001 ms. (steps per millisecond=331 ) properties seen :[0, 0, 0]
Probabilistic random walk after 9949794 steps, saw 1658300 distinct states, run finished after 30001 ms. (steps per millisecond=331 ) properties seen :[0, 0, 0]
[2021-05-14 21:01:33] [INFO ] Flow matrix only has 605 transitions (discarded 60 similar events)
// Phase 1: matrix 605 rows 455 cols
[2021-05-14 21:01:33] [INFO ] Computed 19 place invariants in 10 ms
[2021-05-14 21:01:33] [INFO ] [Real]Absence check using 14 positive place invariants in 30 ms returned sat
[2021-05-14 21:01:33] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 6 ms returned sat
[2021-05-14 21:01:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:01:34] [INFO ] [Real]Absence check using state equation in 735 ms returned sat
[2021-05-14 21:01:34] [INFO ] State equation strengthened by 132 read => feed constraints.
[2021-05-14 21:01:34] [INFO ] [Real]Added 132 Read/Feed constraints in 34 ms returned sat
[2021-05-14 21:01:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:01:34] [INFO ] [Nat]Absence check using 14 positive place invariants in 52 ms returned sat
[2021-05-14 21:01:34] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 7 ms returned sat
[2021-05-14 21:01:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:01:35] [INFO ] [Nat]Absence check using state equation in 705 ms returned sat
[2021-05-14 21:01:35] [INFO ] [Nat]Added 132 Read/Feed constraints in 24 ms returned sat
[2021-05-14 21:01:35] [INFO ] Deduced a trap composed of 47 places in 153 ms
[2021-05-14 21:01:35] [INFO ] Deduced a trap composed of 16 places in 171 ms
[2021-05-14 21:01:36] [INFO ] Deduced a trap composed of 10 places in 152 ms
[2021-05-14 21:01:36] [INFO ] Deduced a trap composed of 10 places in 146 ms
[2021-05-14 21:01:36] [INFO ] Deduced a trap composed of 40 places in 164 ms
[2021-05-14 21:01:36] [INFO ] Deduced a trap composed of 40 places in 179 ms
[2021-05-14 21:01:36] [INFO ] Deduced a trap composed of 16 places in 161 ms
[2021-05-14 21:01:37] [INFO ] Deduced a trap composed of 42 places in 304 ms
[2021-05-14 21:01:37] [INFO ] Deduced a trap composed of 10 places in 299 ms
[2021-05-14 21:01:37] [INFO ] Deduced a trap composed of 35 places in 263 ms
[2021-05-14 21:01:38] [INFO ] Deduced a trap composed of 38 places in 218 ms
[2021-05-14 21:01:38] [INFO ] Deduced a trap composed of 47 places in 261 ms
[2021-05-14 21:01:38] [INFO ] Deduced a trap composed of 35 places in 198 ms
[2021-05-14 21:01:38] [INFO ] Deduced a trap composed of 40 places in 266 ms
[2021-05-14 21:01:39] [INFO ] Deduced a trap composed of 62 places in 251 ms
[2021-05-14 21:01:39] [INFO ] Deduced a trap composed of 60 places in 164 ms
[2021-05-14 21:01:39] [INFO ] Deduced a trap composed of 51 places in 156 ms
[2021-05-14 21:01:39] [INFO ] Deduced a trap composed of 53 places in 151 ms
[2021-05-14 21:01:39] [INFO ] Deduced a trap composed of 78 places in 154 ms
[2021-05-14 21:01:40] [INFO ] Deduced a trap composed of 52 places in 154 ms
[2021-05-14 21:01:40] [INFO ] Deduced a trap composed of 52 places in 159 ms
[2021-05-14 21:01:40] [INFO ] Deduced a trap composed of 52 places in 153 ms
[2021-05-14 21:01:40] [INFO ] Deduced a trap composed of 60 places in 166 ms
[2021-05-14 21:01:40] [INFO ] Deduced a trap composed of 30 places in 162 ms
[2021-05-14 21:01:41] [INFO ] Deduced a trap composed of 54 places in 162 ms
[2021-05-14 21:01:41] [INFO ] Deduced a trap composed of 36 places in 170 ms
[2021-05-14 21:01:41] [INFO ] Deduced a trap composed of 31 places in 145 ms
[2021-05-14 21:01:41] [INFO ] Deduced a trap composed of 31 places in 161 ms
[2021-05-14 21:01:41] [INFO ] Deduced a trap composed of 31 places in 151 ms
[2021-05-14 21:01:41] [INFO ] Deduced a trap composed of 33 places in 135 ms
[2021-05-14 21:01:42] [INFO ] Deduced a trap composed of 40 places in 119 ms
[2021-05-14 21:01:42] [INFO ] Deduced a trap composed of 52 places in 118 ms
[2021-05-14 21:01:42] [INFO ] Deduced a trap composed of 28 places in 132 ms
[2021-05-14 21:01:42] [INFO ] Deduced a trap composed of 31 places in 141 ms
[2021-05-14 21:01:42] [INFO ] Deduced a trap composed of 73 places in 143 ms
[2021-05-14 21:01:43] [INFO ] Deduced a trap composed of 44 places in 141 ms
[2021-05-14 21:01:43] [INFO ] Deduced a trap composed of 73 places in 127 ms
[2021-05-14 21:01:43] [INFO ] Deduced a trap composed of 73 places in 135 ms
[2021-05-14 21:01:43] [INFO ] Deduced a trap composed of 66 places in 132 ms
[2021-05-14 21:01:43] [INFO ] Deduced a trap composed of 12 places in 156 ms
[2021-05-14 21:01:44] [INFO ] Deduced a trap composed of 88 places in 148 ms
[2021-05-14 21:01:44] [INFO ] Deduced a trap composed of 84 places in 206 ms
[2021-05-14 21:01:44] [INFO ] Deduced a trap composed of 10 places in 114 ms
[2021-05-14 21:01:44] [INFO ] Deduced a trap composed of 87 places in 173 ms
[2021-05-14 21:01:45] [INFO ] Deduced a trap composed of 38 places in 156 ms
[2021-05-14 21:01:45] [INFO ] Deduced a trap composed of 60 places in 157 ms
[2021-05-14 21:01:45] [INFO ] Deduced a trap composed of 58 places in 165 ms
[2021-05-14 21:01:45] [INFO ] Deduced a trap composed of 37 places in 175 ms
[2021-05-14 21:01:45] [INFO ] Deduced a trap composed of 45 places in 153 ms
[2021-05-14 21:01:46] [INFO ] Deduced a trap composed of 58 places in 146 ms
[2021-05-14 21:01:46] [INFO ] Deduced a trap composed of 41 places in 164 ms
[2021-05-14 21:01:46] [INFO ] Deduced a trap composed of 37 places in 165 ms
[2021-05-14 21:01:46] [INFO ] Trap strengthening (SAT) tested/added 53/52 trap constraints in 11084 ms
[2021-05-14 21:01:46] [INFO ] Computed and/alt/rep : 660/2205/600 causal constraints in 36 ms.
[2021-05-14 21:01:52] [INFO ] Added : 590 causal constraints over 118 iterations in 6167 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 46 ms.
[2021-05-14 21:01:53] [INFO ] [Real]Absence check using 14 positive place invariants in 18 ms returned sat
[2021-05-14 21:01:53] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2021-05-14 21:01:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:01:53] [INFO ] [Real]Absence check using state equation in 507 ms returned sat
[2021-05-14 21:01:53] [INFO ] [Real]Added 132 Read/Feed constraints in 18 ms returned sat
[2021-05-14 21:01:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:01:53] [INFO ] [Nat]Absence check using 14 positive place invariants in 19 ms returned sat
[2021-05-14 21:01:53] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2021-05-14 21:01:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:01:54] [INFO ] [Nat]Absence check using state equation in 503 ms returned sat
[2021-05-14 21:01:54] [INFO ] [Nat]Added 132 Read/Feed constraints in 28 ms returned sat
[2021-05-14 21:01:54] [INFO ] Deduced a trap composed of 38 places in 180 ms
[2021-05-14 21:01:54] [INFO ] Deduced a trap composed of 22 places in 183 ms
[2021-05-14 21:01:54] [INFO ] Deduced a trap composed of 16 places in 184 ms
[2021-05-14 21:01:55] [INFO ] Deduced a trap composed of 40 places in 190 ms
[2021-05-14 21:01:55] [INFO ] Deduced a trap composed of 20 places in 158 ms
[2021-05-14 21:01:55] [INFO ] Deduced a trap composed of 10 places in 197 ms
[2021-05-14 21:01:55] [INFO ] Deduced a trap composed of 14 places in 167 ms
[2021-05-14 21:01:55] [INFO ] Deduced a trap composed of 33 places in 182 ms
[2021-05-14 21:01:55] [INFO ] Deduced a trap composed of 39 places in 167 ms
[2021-05-14 21:01:56] [INFO ] Deduced a trap composed of 37 places in 175 ms
[2021-05-14 21:01:56] [INFO ] Deduced a trap composed of 38 places in 170 ms
[2021-05-14 21:01:56] [INFO ] Deduced a trap composed of 20 places in 190 ms
[2021-05-14 21:01:56] [INFO ] Deduced a trap composed of 60 places in 150 ms
[2021-05-14 21:01:56] [INFO ] Deduced a trap composed of 37 places in 146 ms
[2021-05-14 21:01:57] [INFO ] Deduced a trap composed of 60 places in 148 ms
[2021-05-14 21:01:57] [INFO ] Deduced a trap composed of 60 places in 146 ms
[2021-05-14 21:01:57] [INFO ] Deduced a trap composed of 58 places in 146 ms
[2021-05-14 21:01:57] [INFO ] Deduced a trap composed of 12 places in 148 ms
[2021-05-14 21:01:57] [INFO ] Deduced a trap composed of 58 places in 145 ms
[2021-05-14 21:01:58] [INFO ] Deduced a trap composed of 10 places in 171 ms
[2021-05-14 21:01:58] [INFO ] Deduced a trap composed of 31 places in 135 ms
[2021-05-14 21:01:58] [INFO ] Deduced a trap composed of 31 places in 174 ms
[2021-05-14 21:01:58] [INFO ] Deduced a trap composed of 31 places in 156 ms
[2021-05-14 21:01:58] [INFO ] Deduced a trap composed of 77 places in 170 ms
[2021-05-14 21:01:58] [INFO ] Deduced a trap composed of 34 places in 148 ms
[2021-05-14 21:01:59] [INFO ] Deduced a trap composed of 28 places in 181 ms
[2021-05-14 21:01:59] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 4937 ms
[2021-05-14 21:01:59] [INFO ] Computed and/alt/rep : 660/2205/600 causal constraints in 42 ms.
[2021-05-14 21:02:03] [INFO ] Added : 554 causal constraints over 111 iterations in 4574 ms. Result :sat
[2021-05-14 21:02:03] [INFO ] Deduced a trap composed of 66 places in 129 ms
[2021-05-14 21:02:04] [INFO ] Deduced a trap composed of 124 places in 100 ms
[2021-05-14 21:02:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 514 ms
Attempting to minimize the solution found.
Minimization took 44 ms.
[2021-05-14 21:02:04] [INFO ] [Real]Absence check using 14 positive place invariants in 18 ms returned sat
[2021-05-14 21:02:04] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2021-05-14 21:02:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:02:04] [INFO ] [Real]Absence check using state equation in 467 ms returned sat
[2021-05-14 21:02:04] [INFO ] [Real]Added 132 Read/Feed constraints in 15 ms returned sat
[2021-05-14 21:02:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:02:04] [INFO ] [Nat]Absence check using 14 positive place invariants in 18 ms returned sat
[2021-05-14 21:02:05] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 11 ms returned sat
[2021-05-14 21:02:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:02:05] [INFO ] [Nat]Absence check using state equation in 463 ms returned sat
[2021-05-14 21:02:05] [INFO ] [Nat]Added 132 Read/Feed constraints in 26 ms returned sat
[2021-05-14 21:02:05] [INFO ] Deduced a trap composed of 10 places in 165 ms
[2021-05-14 21:02:05] [INFO ] Deduced a trap composed of 16 places in 173 ms
[2021-05-14 21:02:06] [INFO ] Deduced a trap composed of 10 places in 177 ms
[2021-05-14 21:02:06] [INFO ] Deduced a trap composed of 10 places in 184 ms
[2021-05-14 21:02:06] [INFO ] Deduced a trap composed of 35 places in 157 ms
[2021-05-14 21:02:06] [INFO ] Deduced a trap composed of 35 places in 169 ms
[2021-05-14 21:02:06] [INFO ] Deduced a trap composed of 35 places in 158 ms
[2021-05-14 21:02:07] [INFO ] Deduced a trap composed of 56 places in 158 ms
[2021-05-14 21:02:07] [INFO ] Deduced a trap composed of 56 places in 157 ms
[2021-05-14 21:02:07] [INFO ] Deduced a trap composed of 37 places in 157 ms
[2021-05-14 21:02:07] [INFO ] Deduced a trap composed of 58 places in 179 ms
[2021-05-14 21:02:07] [INFO ] Deduced a trap composed of 62 places in 175 ms
[2021-05-14 21:02:07] [INFO ] Deduced a trap composed of 60 places in 177 ms
[2021-05-14 21:02:08] [INFO ] Deduced a trap composed of 12 places in 168 ms
[2021-05-14 21:02:08] [INFO ] Deduced a trap composed of 33 places in 163 ms
[2021-05-14 21:02:08] [INFO ] Deduced a trap composed of 14 places in 137 ms
[2021-05-14 21:02:08] [INFO ] Deduced a trap composed of 14 places in 154 ms
[2021-05-14 21:02:08] [INFO ] Deduced a trap composed of 14 places in 142 ms
[2021-05-14 21:02:09] [INFO ] Deduced a trap composed of 58 places in 124 ms
[2021-05-14 21:02:09] [INFO ] Deduced a trap composed of 56 places in 139 ms
[2021-05-14 21:02:09] [INFO ] Deduced a trap composed of 20 places in 155 ms
[2021-05-14 21:02:09] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 3907 ms
[2021-05-14 21:02:09] [INFO ] Computed and/alt/rep : 660/2205/600 causal constraints in 32 ms.
[2021-05-14 21:02:13] [INFO ] Added : 533 causal constraints over 107 iterations in 3700 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 21 ms.
Incomplete Parikh walk after 91600 steps, including 1000 resets, run finished after 356 ms. (steps per millisecond=257 ) properties seen :[0, 0, 1] could not realise parikh vector
FORMULA Peterson-PT-4-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 82700 steps, including 1000 resets, run finished after 264 ms. (steps per millisecond=313 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 200000 steps, including 1000 resets, run finished after 575 ms. (steps per millisecond=347 ) properties seen :[0, 0] could not realise parikh vector
Support contains 274 out of 455 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 455/455 places, 665/665 transitions.
Applied a total of 0 rules in 19 ms. Remains 455 /455 variables (removed 0) and now considering 665/665 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 455/455 places, 665/665 transitions.
Starting structural reductions, iteration 0 : 455/455 places, 665/665 transitions.
Applied a total of 0 rules in 15 ms. Remains 455 /455 variables (removed 0) and now considering 665/665 (removed 0) transitions.
[2021-05-14 21:02:14] [INFO ] Flow matrix only has 605 transitions (discarded 60 similar events)
// Phase 1: matrix 605 rows 455 cols
[2021-05-14 21:02:14] [INFO ] Computed 19 place invariants in 32 ms
[2021-05-14 21:02:14] [INFO ] Implicit Places using invariants in 130 ms returned [442, 443, 444, 445, 446]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 131 ms to find 5 implicit places.
[2021-05-14 21:02:14] [INFO ] Redundant transitions in 36 ms returned []
[2021-05-14 21:02:14] [INFO ] Flow matrix only has 605 transitions (discarded 60 similar events)
// Phase 1: matrix 605 rows 450 cols
[2021-05-14 21:02:14] [INFO ] Computed 14 place invariants in 12 ms
[2021-05-14 21:02:15] [INFO ] Dead Transitions using invariants and state equation in 775 ms returned []
Starting structural reductions, iteration 1 : 450/455 places, 665/665 transitions.
Applied a total of 0 rules in 17 ms. Remains 450 /450 variables (removed 0) and now considering 665/665 (removed 0) transitions.
[2021-05-14 21:02:15] [INFO ] Redundant transitions in 6 ms returned []
[2021-05-14 21:02:15] [INFO ] Flow matrix only has 605 transitions (discarded 60 similar events)
// Phase 1: matrix 605 rows 450 cols
[2021-05-14 21:02:15] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-14 21:02:16] [INFO ] Dead Transitions using invariants and state equation in 713 ms returned []
Finished structural reductions, in 2 iterations. Remains : 450/455 places, 665/665 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2852 ms. (steps per millisecond=350 ) properties seen :[0, 0]
Interrupted Best-First random walk after 324510 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=64 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1225 ms. (steps per millisecond=816 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 9006258 steps, run timeout after 30001 ms. (steps per millisecond=300 ) properties seen :[0, 0]
Probabilistic random walk after 9006258 steps, saw 1501044 distinct states, run finished after 30001 ms. (steps per millisecond=300 ) properties seen :[0, 0]
[2021-05-14 21:02:55] [INFO ] Flow matrix only has 605 transitions (discarded 60 similar events)
// Phase 1: matrix 605 rows 450 cols
[2021-05-14 21:02:55] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-14 21:02:55] [INFO ] [Real]Absence check using 14 positive place invariants in 36 ms returned sat
[2021-05-14 21:02:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:02:56] [INFO ] [Real]Absence check using state equation in 708 ms returned sat
[2021-05-14 21:02:56] [INFO ] State equation strengthened by 132 read => feed constraints.
[2021-05-14 21:02:56] [INFO ] [Real]Added 132 Read/Feed constraints in 25 ms returned sat
[2021-05-14 21:02:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:02:56] [INFO ] [Nat]Absence check using 14 positive place invariants in 71 ms returned sat
[2021-05-14 21:02:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:02:56] [INFO ] [Nat]Absence check using state equation in 705 ms returned sat
[2021-05-14 21:02:56] [INFO ] [Nat]Added 132 Read/Feed constraints in 26 ms returned sat
[2021-05-14 21:02:57] [INFO ] Deduced a trap composed of 24 places in 149 ms
[2021-05-14 21:02:57] [INFO ] Deduced a trap composed of 45 places in 162 ms
[2021-05-14 21:02:57] [INFO ] Deduced a trap composed of 45 places in 153 ms
[2021-05-14 21:02:57] [INFO ] Deduced a trap composed of 22 places in 142 ms
[2021-05-14 21:02:57] [INFO ] Deduced a trap composed of 14 places in 159 ms
[2021-05-14 21:02:57] [INFO ] Deduced a trap composed of 12 places in 142 ms
[2021-05-14 21:02:58] [INFO ] Deduced a trap composed of 66 places in 103 ms
[2021-05-14 21:02:58] [INFO ] Deduced a trap composed of 91 places in 111 ms
[2021-05-14 21:02:58] [INFO ] Deduced a trap composed of 66 places in 114 ms
[2021-05-14 21:02:58] [INFO ] Deduced a trap composed of 66 places in 113 ms
[2021-05-14 21:02:58] [INFO ] Deduced a trap composed of 66 places in 113 ms
[2021-05-14 21:02:58] [INFO ] Deduced a trap composed of 18 places in 148 ms
[2021-05-14 21:02:59] [INFO ] Deduced a trap composed of 30 places in 138 ms
[2021-05-14 21:02:59] [INFO ] Deduced a trap composed of 87 places in 85 ms
[2021-05-14 21:02:59] [INFO ] Deduced a trap composed of 87 places in 108 ms
[2021-05-14 21:02:59] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2369 ms
[2021-05-14 21:02:59] [INFO ] Computed and/alt/rep : 660/2205/600 causal constraints in 29 ms.
[2021-05-14 21:03:03] [INFO ] Added : 592 causal constraints over 119 iterations in 4702 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 40 ms.
[2021-05-14 21:03:04] [INFO ] [Real]Absence check using 14 positive place invariants in 19 ms returned sat
[2021-05-14 21:03:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:03:04] [INFO ] [Real]Absence check using state equation in 478 ms returned sat
[2021-05-14 21:03:04] [INFO ] [Real]Added 132 Read/Feed constraints in 15 ms returned sat
[2021-05-14 21:03:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:03:04] [INFO ] [Nat]Absence check using 14 positive place invariants in 37 ms returned sat
[2021-05-14 21:03:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:03:05] [INFO ] [Nat]Absence check using state equation in 481 ms returned sat
[2021-05-14 21:03:05] [INFO ] [Nat]Added 132 Read/Feed constraints in 24 ms returned sat
[2021-05-14 21:03:05] [INFO ] Deduced a trap composed of 10 places in 179 ms
[2021-05-14 21:03:05] [INFO ] Deduced a trap composed of 10 places in 180 ms
[2021-05-14 21:03:05] [INFO ] Deduced a trap composed of 10 places in 189 ms
[2021-05-14 21:03:06] [INFO ] Deduced a trap composed of 12 places in 198 ms
[2021-05-14 21:03:06] [INFO ] Deduced a trap composed of 10 places in 189 ms
[2021-05-14 21:03:06] [INFO ] Deduced a trap composed of 31 places in 173 ms
[2021-05-14 21:03:06] [INFO ] Deduced a trap composed of 38 places in 167 ms
[2021-05-14 21:03:06] [INFO ] Deduced a trap composed of 36 places in 166 ms
[2021-05-14 21:03:07] [INFO ] Deduced a trap composed of 60 places in 170 ms
[2021-05-14 21:03:07] [INFO ] Deduced a trap composed of 76 places in 168 ms
[2021-05-14 21:03:07] [INFO ] Deduced a trap composed of 30 places in 185 ms
[2021-05-14 21:03:07] [INFO ] Deduced a trap composed of 30 places in 164 ms
[2021-05-14 21:03:07] [INFO ] Deduced a trap composed of 56 places in 150 ms
[2021-05-14 21:03:08] [INFO ] Deduced a trap composed of 60 places in 154 ms
[2021-05-14 21:03:08] [INFO ] Deduced a trap composed of 22 places in 152 ms
[2021-05-14 21:03:08] [INFO ] Deduced a trap composed of 87 places in 150 ms
[2021-05-14 21:03:08] [INFO ] Deduced a trap composed of 31 places in 166 ms
[2021-05-14 21:03:08] [INFO ] Deduced a trap composed of 91 places in 119 ms
[2021-05-14 21:03:08] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 3467 ms
[2021-05-14 21:03:08] [INFO ] Computed and/alt/rep : 660/2205/600 causal constraints in 29 ms.
[2021-05-14 21:03:12] [INFO ] Added : 592 causal constraints over 119 iterations in 3997 ms. Result :sat
[2021-05-14 21:03:12] [INFO ] Deduced a trap composed of 16 places in 179 ms
[2021-05-14 21:03:13] [INFO ] Deduced a trap composed of 20 places in 171 ms
[2021-05-14 21:03:13] [INFO ] Deduced a trap composed of 56 places in 177 ms
[2021-05-14 21:03:13] [INFO ] Deduced a trap composed of 82 places in 180 ms
[2021-05-14 21:03:13] [INFO ] Deduced a trap composed of 14 places in 179 ms
[2021-05-14 21:03:14] [INFO ] Deduced a trap composed of 54 places in 161 ms
[2021-05-14 21:03:14] [INFO ] Deduced a trap composed of 35 places in 165 ms
[2021-05-14 21:03:14] [INFO ] Deduced a trap composed of 50 places in 165 ms
[2021-05-14 21:03:14] [INFO ] Deduced a trap composed of 37 places in 166 ms
[2021-05-14 21:03:14] [INFO ] Deduced a trap composed of 77 places in 136 ms
[2021-05-14 21:03:15] [INFO ] Deduced a trap composed of 60 places in 140 ms
[2021-05-14 21:03:15] [INFO ] Deduced a trap composed of 77 places in 155 ms
[2021-05-14 21:03:15] [INFO ] Deduced a trap composed of 79 places in 155 ms
[2021-05-14 21:03:15] [INFO ] Deduced a trap composed of 58 places in 144 ms
[2021-05-14 21:03:16] [INFO ] Deduced a trap composed of 48 places in 126 ms
[2021-05-14 21:03:16] [INFO ] Deduced a trap composed of 75 places in 150 ms
[2021-05-14 21:03:16] [INFO ] Deduced a trap composed of 56 places in 128 ms
[2021-05-14 21:03:16] [INFO ] Deduced a trap composed of 33 places in 143 ms
[2021-05-14 21:03:16] [INFO ] Deduced a trap composed of 56 places in 139 ms
[2021-05-14 21:03:16] [INFO ] Deduced a trap composed of 77 places in 96 ms
[2021-05-14 21:03:17] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 4260 ms
Attempting to minimize the solution found.
Minimization took 27 ms.
Incomplete Parikh walk after 150500 steps, including 1000 resets, run finished after 439 ms. (steps per millisecond=342 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 156100 steps, including 1000 resets, run finished after 451 ms. (steps per millisecond=346 ) properties seen :[0, 0] could not realise parikh vector
Support contains 274 out of 450 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 450/450 places, 665/665 transitions.
Applied a total of 0 rules in 12 ms. Remains 450 /450 variables (removed 0) and now considering 665/665 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 450/450 places, 665/665 transitions.
Starting structural reductions, iteration 0 : 450/450 places, 665/665 transitions.
Applied a total of 0 rules in 12 ms. Remains 450 /450 variables (removed 0) and now considering 665/665 (removed 0) transitions.
[2021-05-14 21:03:17] [INFO ] Flow matrix only has 605 transitions (discarded 60 similar events)
// Phase 1: matrix 605 rows 450 cols
[2021-05-14 21:03:18] [INFO ] Computed 14 place invariants in 3 ms
[2021-05-14 21:03:18] [INFO ] Implicit Places using invariants in 77 ms returned []
[2021-05-14 21:03:18] [INFO ] Flow matrix only has 605 transitions (discarded 60 similar events)
// Phase 1: matrix 605 rows 450 cols
[2021-05-14 21:03:18] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-14 21:03:18] [INFO ] State equation strengthened by 132 read => feed constraints.
[2021-05-14 21:03:18] [INFO ] Implicit Places using invariants and state equation in 543 ms returned []
Implicit Place search using SMT with State Equation took 621 ms to find 0 implicit places.
[2021-05-14 21:03:18] [INFO ] Redundant transitions in 3 ms returned []
[2021-05-14 21:03:18] [INFO ] Flow matrix only has 605 transitions (discarded 60 similar events)
// Phase 1: matrix 605 rows 450 cols
[2021-05-14 21:03:18] [INFO ] Computed 14 place invariants in 3 ms
[2021-05-14 21:03:19] [INFO ] Dead Transitions using invariants and state equation in 678 ms returned []
Finished structural reductions, in 1 iterations. Remains : 450/450 places, 665/665 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 288 ms. (steps per millisecond=347 ) properties seen :[0, 0]
[2021-05-14 21:03:19] [INFO ] Flow matrix only has 605 transitions (discarded 60 similar events)
// Phase 1: matrix 605 rows 450 cols
[2021-05-14 21:03:19] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-14 21:03:19] [INFO ] [Real]Absence check using 14 positive place invariants in 31 ms returned sat
[2021-05-14 21:03:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:03:20] [INFO ] [Real]Absence check using state equation in 698 ms returned sat
[2021-05-14 21:03:20] [INFO ] State equation strengthened by 132 read => feed constraints.
[2021-05-14 21:03:20] [INFO ] [Real]Added 132 Read/Feed constraints in 24 ms returned sat
[2021-05-14 21:03:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:03:20] [INFO ] [Nat]Absence check using 14 positive place invariants in 72 ms returned sat
[2021-05-14 21:03:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:03:21] [INFO ] [Nat]Absence check using state equation in 715 ms returned sat
[2021-05-14 21:03:21] [INFO ] [Nat]Added 132 Read/Feed constraints in 25 ms returned sat
[2021-05-14 21:03:21] [INFO ] Deduced a trap composed of 24 places in 159 ms
[2021-05-14 21:03:21] [INFO ] Deduced a trap composed of 45 places in 159 ms
[2021-05-14 21:03:21] [INFO ] Deduced a trap composed of 45 places in 155 ms
[2021-05-14 21:03:22] [INFO ] Deduced a trap composed of 22 places in 144 ms
[2021-05-14 21:03:22] [INFO ] Deduced a trap composed of 14 places in 147 ms
[2021-05-14 21:03:22] [INFO ] Deduced a trap composed of 12 places in 148 ms
[2021-05-14 21:03:22] [INFO ] Deduced a trap composed of 66 places in 115 ms
[2021-05-14 21:03:22] [INFO ] Deduced a trap composed of 91 places in 114 ms
[2021-05-14 21:03:22] [INFO ] Deduced a trap composed of 66 places in 115 ms
[2021-05-14 21:03:22] [INFO ] Deduced a trap composed of 66 places in 115 ms
[2021-05-14 21:03:23] [INFO ] Deduced a trap composed of 66 places in 126 ms
[2021-05-14 21:03:23] [INFO ] Deduced a trap composed of 18 places in 156 ms
[2021-05-14 21:03:23] [INFO ] Deduced a trap composed of 30 places in 142 ms
[2021-05-14 21:03:23] [INFO ] Deduced a trap composed of 87 places in 88 ms
[2021-05-14 21:03:23] [INFO ] Deduced a trap composed of 87 places in 95 ms
[2021-05-14 21:03:23] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2353 ms
[2021-05-14 21:03:23] [INFO ] Computed and/alt/rep : 660/2205/600 causal constraints in 33 ms.
[2021-05-14 21:03:28] [INFO ] Added : 592 causal constraints over 119 iterations in 4744 ms. Result :sat
[2021-05-14 21:03:28] [INFO ] [Real]Absence check using 14 positive place invariants in 19 ms returned sat
[2021-05-14 21:03:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:03:28] [INFO ] [Real]Absence check using state equation in 478 ms returned sat
[2021-05-14 21:03:29] [INFO ] [Real]Added 132 Read/Feed constraints in 14 ms returned sat
[2021-05-14 21:03:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:03:29] [INFO ] [Nat]Absence check using 14 positive place invariants in 37 ms returned sat
[2021-05-14 21:03:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:03:29] [INFO ] [Nat]Absence check using state equation in 499 ms returned sat
[2021-05-14 21:03:29] [INFO ] [Nat]Added 132 Read/Feed constraints in 25 ms returned sat
[2021-05-14 21:03:29] [INFO ] Deduced a trap composed of 10 places in 189 ms
[2021-05-14 21:03:30] [INFO ] Deduced a trap composed of 10 places in 192 ms
[2021-05-14 21:03:30] [INFO ] Deduced a trap composed of 10 places in 197 ms
[2021-05-14 21:03:30] [INFO ] Deduced a trap composed of 12 places in 197 ms
[2021-05-14 21:03:30] [INFO ] Deduced a trap composed of 10 places in 202 ms
[2021-05-14 21:03:30] [INFO ] Deduced a trap composed of 31 places in 180 ms
[2021-05-14 21:03:31] [INFO ] Deduced a trap composed of 38 places in 166 ms
[2021-05-14 21:03:31] [INFO ] Deduced a trap composed of 36 places in 167 ms
[2021-05-14 21:03:31] [INFO ] Deduced a trap composed of 60 places in 168 ms
[2021-05-14 21:03:31] [INFO ] Deduced a trap composed of 76 places in 168 ms
[2021-05-14 21:03:31] [INFO ] Deduced a trap composed of 30 places in 158 ms
[2021-05-14 21:03:32] [INFO ] Deduced a trap composed of 30 places in 158 ms
[2021-05-14 21:03:32] [INFO ] Deduced a trap composed of 56 places in 140 ms
[2021-05-14 21:03:32] [INFO ] Deduced a trap composed of 60 places in 148 ms
[2021-05-14 21:03:32] [INFO ] Deduced a trap composed of 22 places in 159 ms
[2021-05-14 21:03:32] [INFO ] Deduced a trap composed of 87 places in 184 ms
[2021-05-14 21:03:32] [INFO ] Deduced a trap composed of 31 places in 142 ms
[2021-05-14 21:03:33] [INFO ] Deduced a trap composed of 91 places in 112 ms
[2021-05-14 21:03:33] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 3477 ms
[2021-05-14 21:03:33] [INFO ] Computed and/alt/rep : 660/2205/600 causal constraints in 28 ms.
[2021-05-14 21:03:37] [INFO ] Added : 592 causal constraints over 119 iterations in 3959 ms. Result :sat
[2021-05-14 21:03:37] [INFO ] Deduced a trap composed of 16 places in 174 ms
[2021-05-14 21:03:37] [INFO ] Deduced a trap composed of 20 places in 189 ms
[2021-05-14 21:03:37] [INFO ] Deduced a trap composed of 56 places in 190 ms
[2021-05-14 21:03:38] [INFO ] Deduced a trap composed of 82 places in 192 ms
[2021-05-14 21:03:38] [INFO ] Deduced a trap composed of 14 places in 188 ms
[2021-05-14 21:03:38] [INFO ] Deduced a trap composed of 54 places in 177 ms
[2021-05-14 21:03:38] [INFO ] Deduced a trap composed of 35 places in 160 ms
[2021-05-14 21:03:38] [INFO ] Deduced a trap composed of 50 places in 168 ms
[2021-05-14 21:03:39] [INFO ] Deduced a trap composed of 37 places in 170 ms
[2021-05-14 21:03:39] [INFO ] Deduced a trap composed of 77 places in 145 ms
[2021-05-14 21:03:39] [INFO ] Deduced a trap composed of 60 places in 152 ms
[2021-05-14 21:03:39] [INFO ] Deduced a trap composed of 77 places in 142 ms
[2021-05-14 21:03:39] [INFO ] Deduced a trap composed of 79 places in 136 ms
[2021-05-14 21:03:40] [INFO ] Deduced a trap composed of 58 places in 128 ms
[2021-05-14 21:03:40] [INFO ] Deduced a trap composed of 48 places in 138 ms
[2021-05-14 21:03:40] [INFO ] Deduced a trap composed of 75 places in 134 ms
[2021-05-14 21:03:40] [INFO ] Deduced a trap composed of 56 places in 128 ms
[2021-05-14 21:03:40] [INFO ] Deduced a trap composed of 33 places in 139 ms
[2021-05-14 21:03:41] [INFO ] Deduced a trap composed of 56 places in 140 ms
[2021-05-14 21:03:41] [INFO ] Deduced a trap composed of 77 places in 86 ms
[2021-05-14 21:03:41] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 4287 ms
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 450 transition count 605
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 64 place count 450 transition count 601
Applied a total of 64 rules in 19 ms. Remains 450 /450 variables (removed 0) and now considering 601/665 (removed 64) transitions.
// Phase 1: matrix 601 rows 450 cols
[2021-05-14 21:03:41] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-14 21:03:41] [INFO ] [Real]Absence check using 14 positive place invariants in 31 ms returned sat
[2021-05-14 21:03:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:03:42] [INFO ] [Real]Absence check using state equation in 716 ms returned sat
[2021-05-14 21:03:42] [INFO ] Computed and/alt/rep : 596/1193/596 causal constraints in 33 ms.
[2021-05-14 21:03:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:03:42] [INFO ] [Nat]Absence check using 14 positive place invariants in 72 ms returned sat
[2021-05-14 21:03:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:03:43] [INFO ] [Nat]Absence check using state equation in 705 ms returned sat
[2021-05-14 21:03:43] [INFO ] Computed and/alt/rep : 596/1193/596 causal constraints in 31 ms.
[2021-05-14 21:03:47] [INFO ] Added : 594 causal constraints over 119 iterations in 4094 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 24 ms.
[2021-05-14 21:03:47] [INFO ] [Real]Absence check using 14 positive place invariants in 19 ms returned sat
[2021-05-14 21:03:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:03:47] [INFO ] [Real]Absence check using state equation in 489 ms returned sat
[2021-05-14 21:03:47] [INFO ] Computed and/alt/rep : 596/1193/596 causal constraints in 29 ms.
[2021-05-14 21:03:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:03:48] [INFO ] [Nat]Absence check using 14 positive place invariants in 38 ms returned sat
[2021-05-14 21:03:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:03:48] [INFO ] [Nat]Absence check using state equation in 503 ms returned sat
[2021-05-14 21:03:48] [INFO ] Computed and/alt/rep : 596/1193/596 causal constraints in 35 ms.
[2021-05-14 21:03:52] [INFO ] Added : 593 causal constraints over 119 iterations in 3669 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 20 ms.
[2021-05-14 21:03:52] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 12 ms.
[2021-05-14 21:03:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 6 ms.
[2021-05-14 21:03:52] [INFO ] Flatten gal took : 75 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ Peterson-PT-4 @ 3570 seconds

FORMULA Peterson-PT-4-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-4-ReachabilityFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2041
rslt: Output for ReachabilityFireability @ Peterson-PT-4

{
"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=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri May 14 21:03:53 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1771
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 8,
"adisj": 2,
"aneg": 0,
"comp": 17,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 17,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "E (F (((((1 <= p41)) OR ((1 <= p214)) OR ((1 <= p224) AND (1 <= p261) AND (1 <= p406) AND (1 <= p431) AND (1 <= p90)) OR ((1 <= p174) AND (1 <= p4))) AND ((p96 <= 0) OR (p191 <= 0) OR ((1 <= p189)) OR ((1 <= p229) AND (1 <= p257)) OR ((1 <= p229) AND (1 <= p301) AND (1 <= p71))))))",
"processed_size": 289,
"rewrites": 1
},
"result":
{
"edges": 39152851,
"markings": 10675113,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 77,
"problems": 20
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3289
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 243,
"adisj": 90,
"aneg": 0,
"comp": 535,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 535,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 270,
"visible_transitions": 0
},
"processed": "A (G (((((p230 <= 0) OR (p448 <= 0)) AND ((p203 <= 0) OR (p420 <= 0)) AND ((p231 <= 0) OR (p421 <= 0)) AND ((p228 <= 0) OR (p449 <= 0)) AND ((p229 <= 0) OR (p447 <= 0))) OR (((p225 <= 0) OR (p279 <= 0)) AND ((p227 <= 0) OR (p242 <= 0)) AND ((p225 <= 0) OR (p277 <= 0)) AND ((p221 <= 0) OR (p227 <= 0)) AND ((p227 <= 0) OR (p240 <= 0)) AND ((p224 <= 0) OR (p263 <= 0)) AND ((p227 <= 0) OR (p238 <= 0)) AND ((p226 <= 0) OR (p234 <= 0)) AND ((p226 <= 0) OR (p236 <= 0)) AND ((p226 <= 0) OR (p232 <= 0)) AND ((p224 <= 0) OR (p261 <= 0)) AND ((p222 <= 0) OR (p227 <= 0)) AND ((p224 <= 0) OR (p257 <= 0)) AND ((p223 <= 0) OR (p285 <= 0)) AND ((p224 <= 0) OR (p299 <= 0)) AND ((p223 <= 0) OR (p283 <= 0)) AND ((p224 <= 0) OR (p301 <= 0)) AND ((p225 <= 0) OR (p251 <= 0)) AND ((p223 <= 0) OR (p281 <= 0)) AND ((p226 <= 0) OR (p265 <= 0)) AND ((p219 <= 0) OR (p227 <= 0)) AND ((p225 <= 0) OR (p249 <= 0)) AND ((p226 <= 0) OR (p267 <= 0)) AND ((p224 <= 0) OR (p297 <= 0)) AND ((p225 <= 0) OR (p255 <= 0)) AND ((p226 <= 0) OR (p269 <= 0)) AND ((p225 <= 0) OR (p253 <= 0)) AND ((p226 <= 0) OR (p271 <= 0)) AND ((p225 <= 0) OR (p259 <= 0)) AND ((p223 <= 0) OR (p289 <= 0)) AND ((p224 <= 0) OR (p303 <= 0)) AND ((p223 <= 0) OR (p287 <= 0)) AND ((p220 <= 0) OR (p227 <= 0)) AND ((p223 <= 0) OR (p309 <= 0)) AND ((p227 <= 0) OR (p247 <= 0)) AND ((p223 <= 0) OR (p307 <= 0)) AND ((p227 <= 0) OR (p245 <= 0)) AND ((p225 <= 0) OR (p275 <= 0)) AND ((p223 <= 0) OR (p305 <= 0)) AND ((p225 <= 0) OR (p273 <= 0)) AND ((p227 <= 0) OR (p243 <= 0)) AND ((p227 <= 0) OR (p241 <= 0)) AND ((p225 <= 0) OR (p278 <= 0)) AND ((p224 <= 0) OR (p262 <= 0)) AND ((p226 <= 0) OR (p233 <= 0)) AND ((p223 <= 0) OR (p311 <= 0)) AND ((p216 <= 0) OR (p227 <= 0)) AND ((p226 <= 0) OR (p235 <= 0)) AND ((p226 <= 0) OR (p237 <= 0)) AND ((p226 <= 0) OR (p239 <= 0)) AND ((p217 <= 0) OR (p227 <= 0)) AND ((p224 <= 0) OR (p258 <= 0)) AND ((p218 <= 0) OR (p227 <= 0)) AND ((p224 <= 0) OR (p260 <= 0)) AND ((p224 <= 0) OR (p256 <= 0)) AND ((p224 <= 0) OR (p298 <= 0)) AND ((p225 <= 0) OR (p248 <= 0)) AND ((p223 <= 0) OR (p286 <= 0)) AND ((p224 <= 0) OR (p300 <= 0)) AND ((p223 <= 0) OR (p284 <= 0)) AND ((p226 <= 0) OR (p264 <= 0)) AND ((p225 <= 0) OR (p252 <= 0)) AND ((p223 <= 0) OR (p282 <= 0)) AND ((p226 <= 0) OR (p266 <= 0)) AND ((p224 <= 0) OR (p296 <= 0)) AND ((p225 <= 0) OR (p250 <= 0)) AND ((p223 <= 0) OR (p280 <= 0)) AND ((p226 <= 0) OR (p268 <= 0)) AND ((p226 <= 0) OR (p270 <= 0)) AND ((p225 <= 0) OR (p254 <= 0)) AND ((p224 <= 0) OR (p302 <= 0)) AND ((p226 <= 0) OR (p274 <= 0)) AND ((p224 <= 0) OR (p304 <= 0)) AND ((p223 <= 0) OR (p310 <= 0)) AND ((p225 <= 0) OR (p272 <= 0)) AND ((p223 <= 0) OR (p308 <= 0)) AND ((p225 <= 0) OR (p276 <= 0)) AND ((p223 <= 0) OR (p306 <= 0)) AND ((p227 <= 0) OR (p246 <= 0)) AND ((p227 <= 0) OR (p244 <= 0))) OR ((((1 <= p126)) OR ((1 <= p187)) OR ((1 <= p130)) OR ((1 <= p191)) OR ((1 <= p134)) OR ((1 <= p195)) OR ((1 <= p138)) OR ((1 <= p199)) OR ((1 <= p142)) OR ((1 <= p146)) OR ((1 <= p207)) OR ((1 <= p150)) OR ((1 <= p211)) OR ((1 <= p154)) OR ((1 <= p215)) OR ((1 <= p158)) OR ((1 <= p162)) OR ((1 <= p166)) OR ((1 <= p170)) OR ((1 <= p174)) OR ((1 <= p113)) OR ((1 <= p178)) OR ((1 <= p182)) OR ((1 <= p186)) OR ((1 <= p121)) OR ((1 <= p190)) OR ((1 <= p125)) OR ((1 <= p129)) OR ((1 <= p194)) OR ((1 <= p198)) OR ((1 <= p133)) OR ((1 <= p137)) OR ((1 <= p202)) OR ((1 <= p141)) OR ((1 <= p206)) OR ((1 <= p145)) OR ((1 <= p210)) OR ((1 <= p214)) OR ((1 <= p149)) OR ((1 <= p153)) OR ((1 <= p157)) OR ((1 <= p161)) OR ((1 <= p165)) OR ((1 <= p169)) OR ((1 <= p173)) OR ((1 <= p177)) OR ((1 <= p112)) OR ((1 <= p181)) OR ((1 <= p116)) OR ((1 <= p185)) OR ((1 <= p120)) OR ((1 <= p189)) OR ((1 <= p124)) OR ((1 <= p193)) OR ((1 <= p128)) OR ((1 <= p197)) OR ((1 <= p132)) OR ((1 <= p201)) OR ((1 <= p136)) OR ((1 <= p205)) OR ((1 <= p140)) OR ((1 <= p209)) OR ((1 <= p144)) OR ((1 <= p213)) OR ((1 <= p148)) OR ((1 <= p152)) OR ((1 <= p156)) OR ((1 <= p160)) OR ((1 <= p164)) OR ((1 <= p168)) OR ((1 <= p172)) OR ((1 <= p176)) OR ((1 <= p115)) OR ((1 <= p180)) OR ((1 <= p184)) OR ((1 <= p123)) OR ((1 <= p188)) OR ((1 <= p127)) OR ((1 <= p192)) OR ((1 <= p196)) OR ((1 <= p131)) OR ((1 <= p135)) OR ((1 <= p200)) OR ((1 <= p204)) OR ((1 <= p139)) OR ((1 <= p143)) OR ((1 <= p208)) OR ((1 <= p147)) OR ((1 <= p212)) OR ((1 <= p151)) OR ((1 <= p155)) OR ((1 <= p159)) OR ((1 <= p163)) OR ((1 <= p167)) OR ((1 <= p171)) OR ((1 <= p114)) OR ((1 <= p175)) OR ((1 <= p179)) OR ((1 <= p122)) OR ((1 <= p183))) AND (((1 <= p96)) OR ((1 <= p98)) OR ((1 <= p97)) OR ((1 <= p101)) OR ((1 <= p102)) OR ((1 <= p99)) OR ((1 <= p100)) OR ((1 <= p106)) OR ((1 <= p103)) OR ((1 <= p109)) OR ((1 <= p110)) OR ((1 <= p107)) OR ((1 <= p108)) OR ((1 <= p111)) OR ((1 <= p93))) AND (((1 <= p325) AND (1 <= p399)) OR ((1 <= p329) AND (1 <= p444)) OR ((1 <= p336) AND (1 <= p396)) OR ((1 <= p332) AND (1 <= p398)) OR ((1 <= p294) AND (1 <= p405)) OR ((1 <= p328) AND (1 <= p395)) OR ((1 <= p330) AND (1 <= p402)) OR ((1 <= p295) AND (1 <= p401)) OR ((1 <= p293) AND (1 <= p397)) OR ((1 <= p338) AND (1 <= p403)) OR ((1 <= p292) AND (1 <= p445)) OR ((1 <= p335) AND (1 <= p442)) OR ((1 <= p291) AND (1 <= p404)) OR ((1 <= p331) AND (1 <= p394)) OR ((1 <= p327) AND (1 <= p406)) OR ((1 <= p288) AND (1 <= p400)) OR ((1 <= p326) AND (1 <= p443)) OR ((1 <= p339) AND (1 <= p392)) OR ((1 <= p290) AND (1 <= p393)) OR ((1 <= p337) AND (1 <= p446))) AND (((1 <= p398) AND (1 <= p435)) OR ((1 <= p430) AND (1 <= p443)) OR ((1 <= p435) AND (1 <= p444)) OR ((1 <= p392) AND (1 <= p424)) OR ((1 <= p393) AND (1 <= p438)) OR ((1 <= p399) AND (1 <= p429)) OR ((1 <= p428) AND (1 <= p443)) OR ((1 <= p401) AND (1 <= p434)) OR ((1 <= p394) AND (1 <= p436)) OR ((1 <= p440) AND (1 <= p445)) OR ((1 <= p423) AND (1 <= p446)) OR ((1 <= p394) AND (1 <= p432)) OR ((1 <= p427) AND (1 <= p446)) OR ((1 <= p423) AND (1 <= p442)) OR ((1 <= p402) AND (1 <= p428)) OR ((1 <= p406) AND (1 <= p431)) OR ((1 <= p395) AND (1 <= p426)) OR ((1 <= p400) AND (1 <= p437)) OR ((1 <= p395) AND (1 <= p430)) OR ((1 <= p403) AND (1 <= p422)) OR ((1 <= p405) AND (1 <= p434)) OR ((1 <= p400) AND (1 <= p441)) OR ((1 <= p397) AND (1 <= p438)) OR ((1 <= p396) AND (1 <= p424)) OR ((1 <= p426) AND (1 <= p443)) OR ((1 <= p404) AND (1 <= p440)) OR ((1 <= p398) AND (1 <= p432)) OR ((1 <= p402) AND (1 <= p431)) OR ((1 <= p392) AND (1 <= p425)) OR ((1 <= p393) AND (1 <= p437)) OR ((1 <= p399) AND (1 <= p430)) OR ((1 <= p401) AND (1 <= p433)) OR ((1 <= p393) AND (1 <= p441)) OR ((1 <= p406) AND (1 <= p428)) OR ((1 <= p398) AND (1 <= p436)) OR ((1 <= p399) AND (1 <= p426)) OR ((1 <= p394) AND (1 <= p435)) OR ((1 <= p400) AND (1 <= p438)) OR ((1 <= p395) AND (1 <= p429)) OR ((1 <= p432) AND (1 <= p444)) OR ((1 <= p405) AND (1 <= p433)) OR ((1 <= p397) AND (1 <= p441)) OR ((1 <= p403) AND (1 <= p425)) OR ((1 <= p397) AND (1 <= p437)) OR ((1 <= p396) AND (1 <= p423)) OR ((1 <= p438) AND (1 <= p445)) OR ((1 <= p396) AND (1 <= p427)) OR ((1 <= p404) AND (1 <= p439)) OR ((1 <= p398) AND (1 <= p433)) OR ((1 <= p434) AND (1 <= p444)) OR ((1 <= p429) AND (1 <= p443)) OR ((1 <= p393) AND (1 <= p440)) OR ((1 <= p424) AND (1 <= p442)) OR ((1 <= p392) AND (1 <= p422)) OR ((1 <= p439) AND (1 <= p445)) OR ((1 <= p424) AND (1 <= p446)) OR ((1 <= p401) AND (1 <= p436)) OR ((1 <= p401) AND (1 <= p432)) OR ((1 <= p399) AND (1 <= p431)) OR ((1 <= p431) AND (1 <= p443)) OR ((1 <= p402) AND (1 <= p426)) OR ((1 <= p406) AND (1 <= p429)) OR ((1 <= p436) AND (1 <= p444)) OR ((1 <= p402) AND (1 <= p430)) OR ((1 <= p394) AND (1 <= p434)) OR ((1 <= p422) AND (1 <= p442)) OR ((1 <= p400) AND (1 <= p439)) OR ((1 <= p405) AND (1 <= p436)) OR ((1 <= p395) AND (1 <= p428)) OR ((1 <= p405) AND (1 <= p432)) OR ((1 <= p403) AND (1 <= p424)) OR ((1 <= p422) AND (1 <= p446)) OR ((1 <= p397) AND (1 <= p440)) OR ((1 <= p441) AND (1 <= p445)) OR ((1 <= p396) AND (1 <= p422)) OR ((1 <= p392) AND (1 <= p427)) OR ((1 <= p404) AND (1 <= p438)) OR ((1 <= p398) AND (1 <= p434)) OR ((1 <= p406) AND (1 <= p426)) OR ((1 <= p393) AND (1 <= p439)) OR ((1 <= p392) AND (1 <= p423)) OR ((1 <= p399) AND (1 <= p428)) OR ((1 <= p401) AND (1 <= p435)) OR ((1 <= p406) AND (1 <= p430)) OR ((1 <= p402) AND (1 <= p429)) OR ((1 <= p394) AND (1 <= p433)) OR ((1 <= p427) AND (1 <= p442)) OR ((1 <= p400) AND (1 <= p440)) OR ((1 <= p437) AND (1 <= p445)) OR ((1 <= p403) AND (1 <= p423)) OR ((1 <= p395) AND (1 <= p431)) OR ((1 <= p405) AND (1 <= p435)) OR ((1 <= p397) AND (1 <= p439)) OR ((1 <= p403) AND (1 <= p427)) OR ((1 <= p396) AND (1 <= p425)) OR ((1 <= p404) AND (1 <= p441)) OR ((1 <= p433) AND (1 <= p444)) OR ((1 <= p404) AND (1 <= p437)) OR ((1 <= p425) AND (1 <= p442)) OR ((1 <= p425) AND (1 <= p446)) OR ((1 <= p230) AND (1 <= p448)) OR ((1 <= p203) AND (1 <= p420)) OR ((1 <= p231) AND (1 <= p421)) OR ((1 <= p228) AND (1 <= p449)) OR ((1 <= p229) AND (1 <= p447)))))))",
"processed_size": 9224,
"rewrites": 2
},
"result":
{
"edges": 180215018,
"markings": 42855502,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": null,
"problems": null
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 206864,
"runtime": 1529.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : E(F(**))"
},
"net":
{
"arcs": 2060,
"conflict_clusters": 304,
"places": 450,
"places_significant": 436,
"singleton_clusters": 0,
"transitions": 665
},
"result":
{
"preliminary_value": "no yes ",
"value": "no yes "
},
"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: 1115/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 450
lola: finding significant places
lola: 450 places, 665 transitions, 436 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 ReachabilityFireability.xml
lola: LP says that atomic proposition is always true: (p230 <= 1)
lola: LP says that atomic proposition is always true: (p448 <= 1)
lola: LP says that atomic proposition is always true: (p203 <= 1)
lola: LP says that atomic proposition is always true: (p420 <= 1)
lola: LP says that atomic proposition is always true: (p231 <= 1)
lola: LP says that atomic proposition is always true: (p421 <= 1)
lola: LP says that atomic proposition is always true: (p228 <= 1)
lola: LP says that atomic proposition is always true: (p449 <= 1)
lola: LP says that atomic proposition is always true: (p229 <= 1)
lola: LP says that atomic proposition is always true: (p447 <= 1)
lola: LP says that atomic proposition is always true: (p225 <= 1)
lola: LP says that atomic proposition is always true: (p279 <= 1)
lola: LP says that atomic proposition is always true: (p227 <= 1)
lola: LP says that atomic proposition is always true: (p242 <= 1)
lola: LP says that atomic proposition is always true: (p225 <= 1)
lola: LP says that atomic proposition is always true: (p277 <= 1)
lola: LP says that atomic proposition is always true: (p221 <= 1)
lola: LP says that atomic proposition is always true: (p227 <= 1)
lola: LP says that atomic proposition is always true: (p227 <= 1)
lola: LP says that atomic proposition is always true: (p240 <= 1)
lola: LP says that atomic proposition is always true: (p224 <= 1)
lola: LP says that atomic proposition is always true: (p263 <= 1)
lola: LP says that atomic proposition is always true: (p227 <= 1)
lola: LP says that atomic proposition is always true: (p238 <= 1)
lola: LP says that atomic proposition is always true: (p226 <= 1)
lola: LP says that atomic proposition is always true: (p234 <= 1)
lola: LP says that atomic proposition is always true: (p226 <= 1)
lola: LP says that atomic proposition is always true: (p236 <= 1)
lola: LP says that atomic proposition is always true: (p226 <= 1)
lola: LP says that atomic proposition is always true: (p232 <= 1)
lola: LP says that atomic proposition is always true: (p224 <= 1)
lola: LP says that atomic proposition is always true: (p261 <= 1)
lola: LP says that atomic proposition is always true: (p222 <= 1)
lola: LP says that atomic proposition is always true: (p227 <= 1)
lola: LP says that atomic proposition is always true: (p224 <= 1)
lola: LP says that atomic proposition is always true: (p257 <= 1)
lola: LP says that atomic proposition is always true: (p223 <= 1)
lola: LP says that atomic proposition is always true: (p285 <= 1)
lola: LP says that atomic proposition is always true: (p224 <= 1)
lola: LP says that atomic proposition is always true: (p299 <= 1)
lola: LP says that atomic proposition is always true: (p223 <= 1)
lola: LP says that atomic proposition is always true: (p283 <= 1)
lola: LP says that atomic proposition is always true: (p224 <= 1)
lola: LP says that atomic proposition is always true: (p301 <= 1)
lola: LP says that atomic proposition is always true: (p225 <= 1)
lola: LP says that atomic proposition is always true: (p251 <= 1)
lola: LP says that atomic proposition is always true: (p223 <= 1)
lola: LP says that atomic proposition is always true: (p281 <= 1)
lola: LP says that atomic proposition is always true: (p226 <= 1)
lola: LP says that atomic proposition is always true: (p265 <= 1)
lola: LP says that atomic proposition is always true: (p219 <= 1)
lola: LP says that atomic proposition is always true: (p227 <= 1)
lola: LP says that atomic proposition is always true: (p225 <= 1)
lola: LP says that atomic proposition is always true: (p249 <= 1)
lola: LP says that atomic proposition is always true: (p226 <= 1)
lola: LP says that atomic proposition is always true: (p267 <= 1)
lola: LP says that atomic proposition is always true: (p224 <= 1)
lola: LP says that atomic proposition is always true: (p297 <= 1)
lola: LP says that atomic proposition is always true: (p225 <= 1)
lola: LP says that atomic proposition is always true: (p255 <= 1)
lola: LP says that atomic proposition is always true: (p226 <= 1)
lola: LP says that atomic proposition is always true: (p269 <= 1)
lola: LP says that atomic proposition is always true: (p225 <= 1)
lola: LP says that atomic proposition is always true: (p253 <= 1)
lola: LP says that atomic proposition is always true: (p226 <= 1)
lola: LP says that atomic proposition is always true: (p271 <= 1)
lola: LP says that atomic proposition is always true: (p225 <= 1)
lola: LP says that atomic proposition is always true: (p259 <= 1)
lola: LP says that atomic proposition is always true: (p223 <= 1)
lola: LP says that atomic proposition is always true: (p289 <= 1)
lola: LP says that atomic proposition is always true: (p224 <= 1)
lola: LP says that atomic proposition is always true: (p303 <= 1)
lola: LP says that atomic proposition is always true: (p223 <= 1)
lola: LP says that atomic proposition is always true: (p287 <= 1)
lola: LP says that atomic proposition is always true: (p220 <= 1)
lola: LP says that atomic proposition is always true: (p227 <= 1)
lola: LP says that atomic proposition is always true: (p223 <= 1)
lola: LP says that atomic proposition is always true: (p309 <= 1)
lola: LP says that atomic proposition is always true: (p227 <= 1)
lola: LP says that atomic proposition is always true: (p247 <= 1)
lola: LP says that atomic proposition is always true: (p223 <= 1)
lola: LP says that atomic proposition is always true: (p307 <= 1)
lola: LP says that atomic proposition is always true: (p227 <= 1)
lola: LP says that atomic proposition is always true: (p245 <= 1)
lola: LP says that atomic proposition is always true: (p225 <= 1)
lola: LP says that atomic proposition is always true: (p275 <= 1)
lola: LP says that atomic proposition is always true: (p223 <= 1)
lola: LP says that atomic proposition is always true: (p305 <= 1)
lola: LP says that atomic proposition is always true: (p225 <= 1)
lola: LP says that atomic proposition is always true: (p273 <= 1)
lola: LP says that atomic proposition is always true: (p227 <= 1)
lola: LP says that atomic proposition is always true: (p243 <= 1)
lola: LP says that atomic proposition is always true: (p227 <= 1)
lola: LP says that atomic proposition is always true: (p241 <= 1)
lola: LP says that atomic proposition is always true: (p225 <= 1)
lola: LP says that atomic proposition is always true: (p278 <= 1)
lola: LP says that atomic proposition is always true: (p224 <= 1)
lola: LP says that atomic proposition is always true: (p262 <= 1)
lola: LP says that atomic proposition is always true: (p226 <= 1)
lola: LP says that atomic proposition is always true: (p233 <= 1)
lola: LP says that atomic proposition is always true: (p223 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p216 <= 1)
lola: LP says that atomic proposition is always true: (p227 <= 1)
lola: LP says that atomic proposition is always true: (p226 <= 1)
lola: LP says that atomic proposition is always true: (p235 <= 1)
lola: LP says that atomic proposition is always true: (p226 <= 1)
lola: LP says that atomic proposition is always true: (p237 <= 1)
lola: LP says that atomic proposition is always true: (p226 <= 1)
lola: LP says that atomic proposition is always true: (p239 <= 1)
lola: LP says that atomic proposition is always true: (p217 <= 1)
lola: LP says that atomic proposition is always true: (p227 <= 1)
lola: LP says that atomic proposition is always true: (p224 <= 1)
lola: LP says that atomic proposition is always true: (p258 <= 1)
lola: LP says that atomic proposition is always true: (p218 <= 1)
lola: LP says that atomic proposition is always true: (p227 <= 1)
lola: LP says that atomic proposition is always true: (p224 <= 1)
lola: LP says that atomic proposition is always true: (p260 <= 1)
lola: LP says that atomic proposition is always true: (p224 <= 1)
lola: LP says that atomic proposition is always true: (p256 <= 1)
lola: LP says that atomic proposition is always true: (p224 <= 1)
lola: LP says that atomic proposition is always true: (p298 <= 1)
lola: LP says that atomic proposition is always true: (p225 <= 1)
lola: LP says that atomic proposition is always true: (p248 <= 1)
lola: LP says that atomic proposition is always true: (p223 <= 1)
lola: LP says that atomic proposition is always true: (p286 <= 1)
lola: LP says that atomic proposition is always true: (p224 <= 1)
lola: LP says that atomic proposition is always true: (p300 <= 1)
lola: LP says that atomic proposition is always true: (p223 <= 1)
lola: LP says that atomic proposition is always true: (p284 <= 1)
lola: LP says that atomic proposition is always true: (p226 <= 1)
lola: LP says that atomic proposition is always true: (p264 <= 1)
lola: LP says that atomic proposition is always true: (p225 <= 1)
lola: LP says that atomic proposition is always true: (p252 <= 1)
lola: LP says that atomic proposition is always true: (p223 <= 1)
lola: LP says that atomic proposition is always true: (p282 <= 1)
lola: LP says that atomic proposition is always true: (p226 <= 1)
lola: LP says that atomic proposition is always true: (p266 <= 1)
lola: LP says that atomic proposition is always true: (p224 <= 1)
lola: LP says that atomic proposition is always true: (p296 <= 1)
lola: LP says that atomic proposition is always true: (p225 <= 1)
lola: LP says that atomic proposition is always true: (p250 <= 1)
lola: LP says that atomic proposition is always true: (p223 <= 1)
lola: LP says that atomic proposition is always true: (p280 <= 1)
lola: LP says that atomic proposition is always true: (p226 <= 1)
lola: LP says that atomic proposition is always true: (p268 <= 1)
lola: LP says that atomic proposition is always true: (p226 <= 1)
lola: LP says that atomic proposition is always true: (p270 <= 1)
lola: LP says that atomic proposition is always true: (p225 <= 1)
lola: LP says that atomic proposition is always true: (p254 <= 1)
lola: LP says that atomic proposition is always true: (p224 <= 1)
lola: LP says that atomic proposition is always true: (p302 <= 1)
lola: LP says that atomic proposition is always true: (p226 <= 1)
lola: LP says that atomic proposition is always true: (p274 <= 1)
lola: LP says that atomic proposition is always true: (p224 <= 1)
lola: LP says that atomic proposition is always true: (p304 <= 1)
lola: LP says that atomic proposition is always true: (p223 <= 1)
lola: LP says that atomic proposition is always true: (p310 <= 1)
lola: LP says that atomic proposition is always true: (p225 <= 1)
lola: LP says that atomic proposition is always true: (p272 <= 1)
lola: LP says that atomic proposition is always true: (p223 <= 1)
lola: LP says that atomic proposition is always true: (p308 <= 1)
lola: LP says that atomic proposition is always true: (p225 <= 1)
lola: LP says that atomic proposition is always true: (p276 <= 1)
lola: LP says that atomic proposition is always true: (p223 <= 1)
lola: LP says that atomic proposition is always true: (p306 <= 1)
lola: LP says that atomic proposition is always true: (p227 <= 1)
lola: LP says that atomic proposition is always true: (p246 <= 1)
lola: LP says that atomic proposition is always true: (p227 <= 1)
lola: LP says that atomic proposition is always true: (p244 <= 1)
lola: LP says that atomic proposition is always true: (p126 <= 1)
lola: LP says that atomic proposition is always true: (p187 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p191 <= 1)
lola: LP says that atomic proposition is always true: (p134 <= 1)
lola: LP says that atomic proposition is always true: (p195 <= 1)
lola: LP says that atomic proposition is always true: (p138 <= 1)
lola: LP says that atomic proposition is always true: (p199 <= 1)
lola: LP says that atomic proposition is always true: (p142 <= 1)
lola: LP says that atomic proposition is always true: (p146 <= 1)
lola: LP says that atomic proposition is always true: (p207 <= 1)
lola: LP says that atomic proposition is always true: (p150 <= 1)
lola: LP says that atomic proposition is always true: (p211 <= 1)
lola: LP says that atomic proposition is always true: (p154 <= 1)
lola: LP says that atomic proposition is always true: (p215 <= 1)
lola: LP says that atomic proposition is always true: (p158 <= 1)
lola: LP says that atomic proposition is always true: (p162 <= 1)
lola: LP says that atomic proposition is always true: (p166 <= 1)
lola: LP says that atomic proposition is always true: (p170 <= 1)
lola: LP says that atomic proposition is always true: (p174 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p178 <= 1)
lola: LP says that atomic proposition is always true: (p182 <= 1)
lola: LP says that atomic proposition is always true: (p186 <= 1)
lola: LP says that atomic proposition is always true: (p121 <= 1)
lola: LP says that atomic proposition is always true: (p190 <= 1)
lola: LP says that atomic proposition is always true: (p125 <= 1)
lola: LP says that atomic proposition is always true: (p129 <= 1)
lola: LP says that atomic proposition is always true: (p194 <= 1)
lola: LP says that atomic proposition is always true: (p198 <= 1)
lola: LP says that atomic proposition is always true: (p133 <= 1)
lola: LP says that atomic proposition is always true: (p137 <= 1)
lola: LP says that atomic proposition is always true: (p202 <= 1)
lola: LP says that atomic proposition is always true: (p141 <= 1)
lola: LP says that atomic proposition is always true: (p206 <= 1)
lola: LP says that atomic proposition is always true: (p145 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p149 <= 1)
lola: LP says that atomic proposition is always true: (p153 <= 1)
lola: LP says that atomic proposition is always true: (p157 <= 1)
lola: LP says that atomic proposition is always true: (p161 <= 1)
lola: LP says that atomic proposition is always true: (p165 <= 1)
lola: LP says that atomic proposition is always true: (p169 <= 1)
lola: LP says that atomic proposition is always true: (p173 <= 1)
lola: LP says that atomic proposition is always true: (p177 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p181 <= 1)
lola: LP says that atomic proposition is always true: (p116 <= 1)
lola: LP says that atomic proposition is always true: (p185 <= 1)
lola: LP says that atomic proposition is always true: (p120 <= 1)
lola: LP says that atomic proposition is always true: (p189 <= 1)
lola: LP says that atomic proposition is always true: (p124 <= 1)
lola: LP says that atomic proposition is always true: (p193 <= 1)
lola: LP says that atomic proposition is always true: (p128 <= 1)
lola: LP says that atomic proposition is always true: (p197 <= 1)
lola: LP says that atomic proposition is always true: (p132 <= 1)
lola: LP says that atomic proposition is always true: (p201 <= 1)
lola: LP says that atomic proposition is always true: (p136 <= 1)
lola: LP says that atomic proposition is always true: (p205 <= 1)
lola: LP says that atomic proposition is always true: (p140 <= 1)
lola: LP says that atomic proposition is always true: (p209 <= 1)
lola: LP says that atomic proposition is always true: (p144 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p148 <= 1)
lola: LP says that atomic proposition is always true: (p152 <= 1)
lola: LP says that atomic proposition is always true: (p156 <= 1)
lola: LP says that atomic proposition is always true: (p160 <= 1)
lola: LP says that atomic proposition is always true: (p164 <= 1)
lola: LP says that atomic proposition is always true: (p168 <= 1)
lola: LP says that atomic proposition is always true: (p172 <= 1)
lola: LP says that atomic proposition is always true: (p176 <= 1)
lola: LP says that atomic proposition is always true: (p115 <= 1)
lola: LP says that atomic proposition is always true: (p180 <= 1)
lola: LP says that atomic proposition is always true: (p184 <= 1)
lola: LP says that atomic proposition is always true: (p123 <= 1)
lola: LP says that atomic proposition is always true: (p188 <= 1)
lola: LP says that atomic proposition is always true: (p127 <= 1)
lola: LP says that atomic proposition is always true: (p192 <= 1)
lola: LP says that atomic proposition is always true: (p196 <= 1)
lola: LP says that atomic proposition is always true: (p131 <= 1)
lola: LP says that atomic proposition is always true: (p135 <= 1)
lola: LP says that atomic proposition is always true: (p200 <= 1)
lola: LP says that atomic proposition is always true: (p204 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p143 <= 1)
lola: LP says that atomic proposition is always true: (p208 <= 1)
lola: LP says that atomic proposition is always true: (p147 <= 1)
lola: LP says that atomic proposition is always true: (p212 <= 1)
lola: LP says that atomic proposition is always true: (p151 <= 1)
lola: LP says that atomic proposition is always true: (p155 <= 1)
lola: LP says that atomic proposition is always true: (p159 <= 1)
lola: LP says that atomic proposition is always true: (p163 <= 1)
lola: LP says that atomic proposition is always true: (p167 <= 1)
lola: LP says that atomic proposition is always true: (p171 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p175 <= 1)
lola: LP says that atomic proposition is always true: (p179 <= 1)
lola: LP says that atomic proposition is always true: (p122 <= 1)
lola: LP says that atomic proposition is always true: (p183 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p101 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p106 <= 1)
lola: LP says that atomic proposition is always true: (p103 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p108 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p325 <= 1)
lola: LP says that atomic proposition is always true: (p399 <= 1)
lola: LP says that atomic proposition is always true: (p329 <= 1)
lola: LP says that atomic proposition is always true: (p444 <= 1)
lola: LP says that atomic proposition is always true: (p336 <= 1)
lola: LP says that atomic proposition is always true: (p396 <= 1)
lola: LP says that atomic proposition is always true: (p332 <= 1)
lola: LP says that atomic proposition is always true: (p398 <= 1)
lola: LP says that atomic proposition is always true: (p294 <= 1)
lola: LP says that atomic proposition is always true: (p405 <= 1)
lola: LP says that atomic proposition is always true: (p328 <= 1)
lola: LP says that atomic proposition is always true: (p395 <= 1)
lola: LP says that atomic proposition is always true: (p330 <= 1)
lola: LP says that atomic proposition is always true: (p402 <= 1)
lola: LP says that atomic proposition is always true: (p295 <= 1)
lola: LP says that atomic proposition is always true: (p401 <= 1)
lola: LP says that atomic proposition is always true: (p293 <= 1)
lola: LP says that atomic proposition is always true: (p397 <= 1)
lola: LP says that atomic proposition is always true: (p338 <= 1)
lola: LP says that atomic proposition is always true: (p403 <= 1)
lola: LP says that atomic proposition is always true: (p292 <= 1)
lola: LP says that atomic proposition is always true: (p445 <= 1)
lola: LP says that atomic proposition is always true: (p335 <= 1)
lola: LP says that atomic proposition is always true: (p442 <= 1)
lola: LP says that atomic proposition is always true: (p291 <= 1)
lola: LP says that atomic proposition is always true: (p404 <= 1)
lola: LP says that atomic proposition is always true: (p331 <= 1)
lola: LP says that atomic proposition is always true: (p394 <= 1)
lola: LP says that atomic proposition is always true: (p327 <= 1)
lola: LP says that atomic proposition is always true: (p406 <= 1)
lola: LP says that atomic proposition is always true: (p288 <= 1)
lola: LP says that atomic proposition is always true: (p400 <= 1)
lola: LP says that atomic proposition is always true: (p326 <= 1)
lola: LP says that atomic proposition is always true: (p443 <= 1)
lola: LP says that atomic proposition is always true: (p339 <= 1)
lola: LP says that atomic proposition is always true: (p392 <= 1)
lola: LP says that atomic proposition is always true: (p290 <= 1)
lola: LP says that atomic proposition is always true: (p393 <= 1)
lola: LP says that atomic proposition is always true: (p337 <= 1)
lola: LP says that atomic proposition is always true: (p446 <= 1)
lola: LP says that atomic proposition is always true: (p398 <= 1)
lola: LP says that atomic proposition is always true: (p435 <= 1)
lola: LP says that atomic proposition is always true: (p430 <= 1)
lola: LP says that atomic proposition is always true: (p443 <= 1)
lola: LP says that atomic proposition is always true: (p435 <= 1)
lola: LP says that atomic proposition is always true: (p444 <= 1)
lola: LP says that atomic proposition is always true: (p392 <= 1)
lola: LP says that atomic proposition is always true: (p424 <= 1)
lola: LP says that atomic proposition is always true: (p393 <= 1)
lola: LP says that atomic proposition is always true: (p438 <= 1)
lola: LP says that atomic proposition is always true: (p399 <= 1)
lola: LP says that atomic proposition is always true: (p429 <= 1)
lola: LP says that atomic proposition is always true: (p428 <= 1)
lola: LP says that atomic proposition is always true: (p443 <= 1)
lola: LP says that atomic proposition is always true: (p401 <= 1)
lola: LP says that atomic proposition is always true: (p434 <= 1)
lola: LP says that atomic proposition is always true: (p394 <= 1)
lola: LP says that atomic proposition is always true: (p436 <= 1)
lola: LP says that atomic proposition is always true: (p440 <= 1)
lola: LP says that atomic proposition is always true: (p445 <= 1)
lola: LP says that atomic proposition is always true: (p423 <= 1)
lola: LP says that atomic proposition is always true: (p446 <= 1)
lola: LP says that atomic proposition is always true: (p394 <= 1)
lola: LP says that atomic proposition is always true: (p432 <= 1)
lola: LP says that atomic proposition is always true: (p427 <= 1)
lola: LP says that atomic proposition is always true: (p446 <= 1)
lola: LP says that atomic proposition is always true: (p423 <= 1)
lola: LP says that atomic proposition is always true: (p442 <= 1)
lola: LP says that atomic proposition is always true: (p402 <= 1)
lola: LP says that atomic proposition is always true: (p428 <= 1)
lola: LP says that atomic proposition is always true: (p406 <= 1)
lola: LP says that atomic proposition is always true: (p431 <= 1)
lola: LP says that atomic proposition is always true: (p395 <= 1)
lola: LP says that atomic proposition is always true: (p426 <= 1)
lola: LP says that atomic proposition is always true: (p400 <= 1)
lola: LP says that atomic proposition is always true: (p437 <= 1)
lola: LP says that atomic proposition is always true: (p395 <= 1)
lola: LP says that atomic proposition is always true: (p430 <= 1)
lola: LP says that atomic proposition is always true: (p403 <= 1)
lola: LP says that atomic proposition is always true: (p422 <= 1)
lola: LP says that atomic proposition is always true: (p405 <= 1)
lola: LP says that atomic proposition is always true: (p434 <= 1)
lola: LP says that atomic proposition is always true: (p400 <= 1)
lola: LP says that atomic proposition is always true: (p441 <= 1)
lola: LP says that atomic proposition is always true: (p397 <= 1)
lola: LP says that atomic proposition is always true: (p438 <= 1)
lola: LP says that atomic proposition is always true: (p396 <= 1)
lola: LP says that atomic proposition is always true: (p424 <= 1)
lola: LP says that atomic proposition is always true: (p426 <= 1)
lola: LP says that atomic proposition is always true: (p443 <= 1)
lola: LP says that atomic proposition is always true: (p404 <= 1)
lola: LP says that atomic proposition is always true: (p440 <= 1)
lola: LP says that atomic proposition is always true: (p398 <= 1)
lola: LP says that atomic proposition is always true: (p432 <= 1)
lola: LP says that atomic proposition is always true: (p402 <= 1)
lola: LP says that atomic proposition is always true: (p431 <= 1)
lola: LP says that atomic proposition is always true: (p392 <= 1)
lola: LP says that atomic proposition is always true: (p425 <= 1)
lola: LP says that atomic proposition is always true: (p393 <= 1)
lola: LP says that atomic proposition is always true: (p437 <= 1)
lola: LP says that atomic proposition is always true: (p399 <= 1)
lola: LP says that atomic proposition is always true: (p430 <= 1)
lola: LP says that atomic proposition is always true: (p401 <= 1)
lola: LP says that atomic proposition is always true: (p433 <= 1)
lola: LP says that atomic proposition is always true: (p393 <= 1)
lola: LP says that atomic proposition is always true: (p441 <= 1)
lola: LP says that atomic proposition is always true: (p406 <= 1)
lola: LP says that atomic proposition is always true: (p428 <= 1)
lola: LP says that atomic proposition is always true: (p398 <= 1)
lola: LP says that atomic proposition is always true: (p436 <= 1)
lola: LP says that atomic proposition is always true: (p399 <= 1)
lola: LP says that atomic proposition is always true: (p426 <= 1)
lola: LP says that atomic proposition is always true: (p394 <= 1)
lola: LP says that atomic proposition is always true: (p435 <= 1)
lola: LP says that atomic proposition is always true: (p400 <= 1)
lola: LP says that atomic proposition is always true: (p438 <= 1)
lola: LP says that atomic proposition is always true: (p395 <= 1)
lola: LP says that atomic proposition is always true: (p429 <= 1)
lola: LP says that atomic proposition is always true: (p432 <= 1)
lola: LP says that atomic proposition is always true: (p444 <= 1)
lola: LP says that atomic proposition is always true: (p405 <= 1)
lola: LP says that atomic proposition is always true: (p433 <= 1)
lola: LP says that atomic proposition is always true: (p397 <= 1)
lola: LP says that atomic proposition is always true: (p441 <= 1)
lola: LP says that atomic proposition is always true: (p403 <= 1)
lola: LP says that atomic proposition is always true: (p425 <= 1)
lola: LP says that atomic proposition is always true: (p397 <= 1)
lola: LP says that atomic proposition is always true: (p437 <= 1)
lola: LP says that atomic proposition is always true: (p396 <= 1)
lola: LP says that atomic proposition is always true: (p423 <= 1)
lola: LP says that atomic proposition is always true: (p438 <= 1)
lola: LP says that atomic proposition is always true: (p445 <= 1)
lola: LP says that atomic proposition is always true: (p396 <= 1)
lola: LP says that atomic proposition is always true: (p427 <= 1)
lola: LP says that atomic proposition is always true: (p404 <= 1)
lola: LP says that atomic proposition is always true: (p439 <= 1)
lola: LP says that atomic proposition is always true: (p398 <= 1)
lola: LP says that atomic proposition is always true: (p433 <= 1)
lola: LP says that atomic proposition is always true: (p434 <= 1)
lola: LP says that atomic proposition is always true: (p444 <= 1)
lola: LP says that atomic proposition is always true: (p429 <= 1)
lola: LP says that atomic proposition is always true: (p443 <= 1)
lola: LP says that atomic proposition is always true: (p393 <= 1)
lola: LP says that atomic proposition is always true: (p440 <= 1)
lola: LP says that atomic proposition is always true: (p424 <= 1)
lola: LP says that atomic proposition is always true: (p442 <= 1)
lola: LP says that atomic proposition is always true: (p392 <= 1)
lola: LP says that atomic proposition is always true: (p422 <= 1)
lola: LP says that atomic proposition is always true: (p439 <= 1)
lola: LP says that atomic proposition is always true: (p445 <= 1)
lola: LP says that atomic proposition is always true: (p424 <= 1)
lola: LP says that atomic proposition is always true: (p446 <= 1)
lola: LP says that atomic proposition is always true: (p401 <= 1)
lola: LP says that atomic proposition is always true: (p436 <= 1)
lola: LP says that atomic proposition is always true: (p401 <= 1)
lola: LP says that atomic proposition is always true: (p432 <= 1)
lola: LP says that atomic proposition is always true: (p399 <= 1)
lola: LP says that atomic proposition is always true: (p431 <= 1)
lola: LP says that atomic proposition is always true: (p431 <= 1)
lola: LP says that atomic proposition is always true: (p443 <= 1)
lola: LP says that atomic proposition is always true: (p402 <= 1)
lola: LP says that atomic proposition is always true: (p426 <= 1)
lola: LP says that atomic proposition is always true: (p406 <= 1)
lola: LP says that atomic proposition is always true: (p429 <= 1)
lola: LP says that atomic proposition is always true: (p436 <= 1)
lola: LP says that atomic proposition is always true: (p444 <= 1)
lola: LP says that atomic proposition is always true: (p402 <= 1)
lola: LP says that atomic proposition is always true: (p430 <= 1)
lola: LP says that atomic proposition is always true: (p394 <= 1)
lola: LP says that atomic proposition is always true: (p434 <= 1)
lola: LP says that atomic proposition is always true: (p422 <= 1)
lola: LP says that atomic proposition is always true: (p442 <= 1)
lola: LP says that atomic proposition is always true: (p400 <= 1)
lola: LP says that atomic proposition is always true: (p439 <= 1)
lola: LP says that atomic proposition is always true: (p405 <= 1)
lola: LP says that atomic proposition is always true: (p436 <= 1)
lola: LP says that atomic proposition is always true: (p395 <= 1)
lola: LP says that atomic proposition is always true: (p428 <= 1)
lola: LP says that atomic proposition is always true: (p405 <= 1)
lola: LP says that atomic proposition is always true: (p432 <= 1)
lola: LP says that atomic proposition is always true: (p403 <= 1)
lola: LP says that atomic proposition is always true: (p424 <= 1)
lola: LP says that atomic proposition is always true: (p422 <= 1)
lola: LP says that atomic proposition is always true: (p446 <= 1)
lola: LP says that atomic proposition is always true: (p397 <= 1)
lola: LP says that atomic proposition is always true: (p440 <= 1)
lola: LP says that atomic proposition is always true: (p441 <= 1)
lola: LP says that atomic proposition is always true: (p445 <= 1)
lola: LP says that atomic proposition is always true: (p396 <= 1)
lola: LP says that atomic proposition is always true: (p422 <= 1)
lola: LP says that atomic proposition is always true: (p392 <= 1)
lola: LP says that atomic proposition is always true: (p427 <= 1)
lola: LP says that atomic proposition is always true: (p404 <= 1)
lola: LP says that atomic proposition is always true: (p438 <= 1)
lola: LP says that atomic proposition is always true: (p398 <= 1)
lola: LP says that atomic proposition is always true: (p434 <= 1)
lola: LP says that atomic proposition is always true: (p406 <= 1)
lola: LP says that atomic proposition is always true: (p426 <= 1)
lola: LP says that atomic proposition is always true: (p393 <= 1)
lola: LP says that atomic proposition is always true: (p439 <= 1)
lola: LP says that atomic proposition is always true: (p392 <= 1)
lola: LP says that atomic proposition is always true: (p423 <= 1)
lola: LP says that atomic proposition is always true: (p399 <= 1)
lola: LP says that atomic proposition is always true: (p428 <= 1)
lola: LP says that atomic proposition is always true: (p401 <= 1)
lola: LP says that atomic proposition is always true: (p435 <= 1)
lola: LP says that atomic proposition is always true: (p406 <= 1)
lola: LP says that atomic proposition is always true: (p430 <= 1)
lola: LP says that atomic proposition is always true: (p402 <= 1)
lola: LP says that atomic proposition is always true: (p429 <= 1)
lola: LP says that atomic proposition is always true: (p394 <= 1)
lola: LP says that atomic proposition is always true: (p433 <= 1)
lola: LP says that atomic proposition is always true: (p427 <= 1)
lola: LP says that atomic proposition is always true: (p442 <= 1)
lola: LP says that atomic proposition is always true: (p400 <= 1)
lola: LP says that atomic proposition is always true: (p440 <= 1)
lola: LP says that atomic proposition is always true: (p437 <= 1)
lola: LP says that atomic proposition is always true: (p445 <= 1)
lola: LP says that atomic proposition is always true: (p403 <= 1)
lola: LP says that atomic proposition is always true: (p423 <= 1)
lola: LP says that atomic proposition is always true: (p395 <= 1)
lola: LP says that atomic proposition is always true: (p431 <= 1)
lola: LP says that atomic proposition is always true: (p405 <= 1)
lola: LP says that atomic proposition is always true: (p435 <= 1)
lola: LP says that atomic proposition is always true: (p397 <= 1)
lola: LP says that atomic proposition is always true: (p439 <= 1)
lola: LP says that atomic proposition is always true: (p403 <= 1)
lola: LP says that atomic proposition is always true: (p427 <= 1)
lola: LP says that atomic proposition is always true: (p396 <= 1)
lola: LP says that atomic proposition is always true: (p425 <= 1)
lola: LP says that atomic proposition is always true: (p404 <= 1)
lola: LP says that atomic proposition is always true: (p441 <= 1)
lola: LP says that atomic proposition is always true: (p433 <= 1)
lola: LP says that atomic proposition is always true: (p444 <= 1)
lola: LP says that atomic proposition is always true: (p404 <= 1)
lola: LP says that atomic proposition is always true: (p437 <= 1)
lola: LP says that atomic proposition is always true: (p425 <= 1)
lola: LP says that atomic proposition is always true: (p442 <= 1)
lola: LP says that atomic proposition is always true: (p425 <= 1)
lola: LP says that atomic proposition is always true: (p446 <= 1)
lola: LP says that atomic proposition is always true: (p230 <= 1)
lola: LP says that atomic proposition is always true: (p448 <= 1)
lola: LP says that atomic proposition is always true: (p203 <= 1)
lola: LP says that atomic proposition is always true: (p420 <= 1)
lola: LP says that atomic proposition is always true: (p231 <= 1)
lola: LP says that atomic proposition is always true: (p421 <= 1)
lola: LP says that atomic proposition is always true: (p228 <= 1)
lola: LP says that atomic proposition is always true: (p449 <= 1)
lola: LP says that atomic proposition is always true: (p229 <= 1)
lola: LP says that atomic proposition is always true: (p447 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p224 <= 1)
lola: LP says that atomic proposition is always true: (p261 <= 1)
lola: LP says that atomic proposition is always true: (p406 <= 1)
lola: LP says that atomic proposition is always true: (p431 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p174 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p191 <= 1)
lola: LP says that atomic proposition is always true: (p189 <= 1)
lola: LP says that atomic proposition is always true: (p229 <= 1)
lola: LP says that atomic proposition is always true: (p257 <= 1)
lola: LP says that atomic proposition is always true: (p229 <= 1)
lola: LP says that atomic proposition is always true: (p301 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: A (G (((((p230 <= 0) OR (p448 <= 0)) AND ((p203 <= 0) OR (p420 <= 0)) AND ((p231 <= 0) OR (p421 <= 0)) AND ((p228 <= 0) OR (p449 <= 0)) AND ((p229 <= 0) OR (p447 <= 0))) OR (((p225 <= 0) OR (p279 <= 0)) AND ((p227 <= 0) OR (p242 <= 0)) AND ((p225 <= 0) OR (p277 <= 0)) AND ((p221 <= 0) OR (p227 <= 0)) AND ((p227 <= 0) OR (p240 <= 0)) AND ((p224 <= 0) OR (p263 <= 0)) AND ((p227 <= 0) OR (p238 <= 0)) AND ((p226 <= 0) OR (p234 <= 0)) AND ((p226 <= 0) OR (p236 <= 0)) AND ((p226 <= 0) OR (p232 <= 0)) AND ((p224 <= 0) OR (p261 <= 0)) AND ((p222 <= 0) OR (p227 <= 0)) AND ((p224 <= 0) OR (p257 <= 0)) AND ((p223 <= 0) OR (p285 <= 0)) AND ((p224 <= 0) OR (p299 <= 0)) AND ((p223 <= 0) OR (p283 <= 0)) AND ((p224 <= 0) OR (p301 <= 0)) AND ((p225 <= 0) OR (p251 <= 0)) AND ((p223 <= 0) OR (p281 <= 0)) AND ((p226 <= 0) OR (p265 <= 0)) AND ((p219 <= 0) OR (p227 <= 0)) AND ((p225 <= 0) OR (p249 <= 0)) AND ((p226 <= 0) OR (p267 <= 0)) AND ((p224 <= 0) OR (p297 <= 0)) AND ((p225 <= 0) OR (p255 <= 0)) AND ((p226 <= 0) OR (p269 <= 0)) AND ((p225 <= 0) OR (p253 <= 0)) AND ((p226 <= 0) OR (p271 <= 0)) AND ((p225 <= 0) OR (p259 <= 0)) AND ((p223 <= 0) OR (p289 <= 0)) AND ((p224 <= 0) OR (p303 <= 0)) AND ((p223 <= 0) OR (p287 <= 0)) AND ((p220 <= 0) OR (p227 <= 0)) AND ((p223 <= 0) OR (p309 <= 0)) AND ((p227 <= 0) OR (p247 <= 0)) AND ((p223 <= 0) OR (p307 <= 0)) AND ((p227 <= 0) OR (p245 <= 0)) AND ((p225 <= 0) OR (p275 <= 0)) AND ((p223 <= 0) OR (p305 <= 0)) AND ((p225 <= 0) OR (p273 <= 0)) AND ((p227 <= 0) OR (p243 <= 0)) AND ((p227 <= 0) OR (p241 <= 0)) AND ((p225 <= 0) OR (p278 <= 0)) AND ((p224 <= 0) OR (p262 <= 0)) AND ((p226 <= 0) OR (p233 <= 0)) AND ((p223 <= 0) OR (p311 <= 0)) AND ((p216 <= 0) OR (p227 <= 0)) AND ((p226 <= 0) OR (p235 <= 0)) AND ((p226 <= 0) OR (p237 <= 0)) AND ((p226 <= 0) OR (p239 <= 0)) AND ((p217 <= 0) OR (p227 <= 0)) AND ((p224 <= 0) OR (p258 <= 0)) AND ((p218 <= 0) OR (p227 <= 0)) AND ((p224 <= 0) OR (p260 <= 0)) AND ((p224 <= 0) OR (p256 <= 0)) AND ((p224 <= 0) OR (p298 <= 0)) AND ((p225 <= 0) OR (p248 <= 0)) AND ((p223 <= 0) OR (p286 <= 0)) AND ((p224 <= 0) OR (p300 <= 0)) AND ((p223 <= 0) OR (p284 <= 0)) AND ((p226 <= 0) OR (p264 <= 0)) AND ((p225 <= 0) OR (p252 <= 0)) AND ((p223 <= 0) OR (p282 <= 0)) AND ((p226 <= 0) OR (p266 <= 0)) AND ((p224 <= 0) OR (p296 <= 0)) AND ((p225 <= 0) OR (p250 <= 0)) AND ((p223 <= 0) OR (p280 <= 0)) AND ((p226 <= 0) OR (p268 <= 0)) AND ((p226 <= 0) OR (p270 <= 0)) AND ((p225 <= 0) OR (p254 <= 0)) AND ((p224 <= 0) OR (p302 <= 0)) AND ((p226 <= 0) OR (p274 <= 0)) AND ((p224 <= 0) OR (p304 <= 0)) AND ((p223 <= 0) OR (p310 <= 0)) AND ((p225 <= 0) OR (p272 <= 0)) AND ((p223 <= 0) OR (p308 <= 0)) AND ((p225 <= 0) OR (p276 <= 0)) AND ((p223 <= 0) OR (p306 <= 0)) AND ((p227 <= 0) OR (p246 <= 0)) AND ((p227 <= 0) OR (p244 <= 0))) OR ((((1 <= p126)) OR ((1 <= p187)) OR ((1 <= p130)) OR ((1 <= p191)) OR ((1 <= p134)) OR ((1 <= p195)) OR ((1 <= p138)) OR ((1 <= p199)) OR ((1 <= p142)) OR ((1 <= p146)) OR ((1 <= p207)) OR ((1 <= p150)) OR ((1 <= p211)) OR ((1 <= p154)) OR ((1 <= p215)) OR ((1 <= p158)) OR ((1 <= p162)) OR ((1 <= p166)) OR ((1 <= p170)) OR ((1 <= p174)) OR ((1 <= p113)) OR ((1 <= p178)) OR ((1 <= p182)) OR ((1 <= p186)) OR ((1 <= p121)) OR ((1 <= p190)) OR ((1 <= p125)) OR ((1 <= p129)) OR ((1 <= p194)) OR ((1 <= p198)) OR ((1 <= p133)) OR ((1 <= p137)) OR ((1 <= p202)) OR ((1 <= p141)) OR ((1 <= p206)) OR ((1 <= p145)) OR ((1 <= p210)) OR ((1 <= p214)) OR ((1 <= p149)) OR ((1 <= p153)) OR ((1 <= p157)) OR ((1 <= p161)) OR ((1 <= p165)) OR ((1 <= p169)) OR ((1 <= p173)) OR ((1 <= p177)) OR ((1 <= p112)) OR ((1 <= p181)) OR ((1 <= p116)) OR ((1 <= p185)) OR ((1 <= p120)) OR ((1 <= p189)) OR ((1 <= p124)) OR ((1 <= p193)) OR ((1 <= p128)) OR ((1 <= p197)) OR ((1 <= p132)) OR ((1 <= p201)) OR ((1 <= p136)) OR ((1 <= p205)) OR ((1 <= p140)) OR ((1 <= p209)) OR ((1 <= p144)) OR ((1 <= p213)) OR ((1 <= p148)) OR ((1 <= p152)) OR ((1 <= p156)) OR ((1 <= p160)) OR ((1 <= p164)) OR ((1 <= p168)) OR ((1 <= p172)) OR ((1 <= p176)) OR ((1 <= p115)) OR ((1 <= p180)) OR ((1 <= p184)) OR ((1 <= p123)) OR ((1 <= p188)) OR ((1 <= p127)) OR ((1 <= p192)) OR ((1 <= p196)) OR ((1 <= p131)) OR ((1 <= p135)) OR ((1 <= p200)) OR ((1 <= p204)) OR ((1 <= p139)) OR ((1 <= p143)) OR ((1 <= p208)) OR ((1 <= p147)) OR ((1 <= p212)) OR ((1 <= p151)) OR ((1 <= p155)) OR ((1 <= p159)) OR ((1 <= p163)) OR ((1 <= p167)) OR ((1 <= p171)) OR ((1 <= p114)) OR ((1 <= p175)) OR ((1 <= p179)) OR ((1 <= p122)) OR ((1 <= p183))) AND (((1 <= p96)) OR ((1 <= p98)) OR ((1 <= p97)) OR ((1 <= p101)) OR ((1 <= p102)) OR ((1 <= p99)) OR ((1 <= p100)) OR ((1 <= p106)) OR ((1 <= p103)) OR ((1 <= p109)) OR ((1 <= p110)) OR ((1 <= p107)) OR ((1 <= p108)) OR ((1 <= p111)) OR ((1 <= p93))) AND (((1 <= p325) AND (1 <= p399)) OR ((1 <= p329) AND (1 <= p444)) OR ((1 <= p336) AND (1 <= p396)) OR ((1 <= p332) AND (1 <= p398)) OR ((1 <= p294) AND (1 <= p405)) OR ((1 <= p328) AND (1 <= p395)) OR ((1 <= p330) AND (1 <= p402)) OR ((1 <= p295) AND (1 <= p401)) OR ((1 <= p293) AND (1 <= p397)) OR ((1 <= p338) AND (1 <= p403)) OR ((1 <= p292) AND (1 <= p445)) OR ((1 <= p335) AND (1 <= p442)) OR ((1 <= p291) AND (1 <= p404)) OR ((1 <= p331) AND (1 <= p394)) OR ((1 <= p327) AND (1 <= p406)) OR ((1 <= p288) AND (1 <= p400)) OR ((1 <= p326) AND (1 <= p443)) OR ((1 <= p339) AND (1 <= p392)) OR ((1 <= p290) AND (1 <= p393)) OR ((1 <= p337) AND (1 <= p446))) AND (((1 <= p398) AND (1 <= p435)) OR ((1 <= p430) AND (1 <= p443)) OR ((1 <= p435) AND (1 <= p444)) OR ((1 <= p392) AND (1 <= p424)) OR ((1 <= p393) AND (1 <= p438)) OR ((1 <= p399) AND (1 <= p429)) OR ((1 <= p428) AND (1 <= p443)) OR ((1 <= p401) AND (1 <= p434)) OR ((1 <= p394) AND (1 <= p436)) OR ((1 <= p440) AND (1 <= p445)) OR ((1 <= p423) AND (1 <= p446)) OR ((1 <= p394) AND (1 <= p432)) OR ((1 <= p427) AND (1 <= p446)) OR ((1 <= p423) AND (1 <= p442)) OR ((1 <= p402) AND (1 <= p428)) OR ((1 <= p406) AND (1 <= p431)) OR ((1 <= p395) AND (1 <= p426)) OR ((1 <= p400) AND (1 <= p437)) OR ((1 <= p395) AND (1 <= p430)) OR ((1 <= p403) AND (1 <= p422)) OR ((1 <= p405) AND (1 <= p434)) OR ((1 <= p400) AND (1 <= p441)) OR ((1 <= p397) AND (1 <= p438)) OR ((1 <= p396) AND (1 <= p424)) OR ((1 <= p426) AND (1 <= p443)) OR ((1 <= p404) AND (1 <= p440)) OR ((1 <= p398) AND (1 <= p432)) OR ((1 <= p402) AND (1 <= p431)) OR ((1 <= p392) AND (1 <= p425)) OR ((1 <= p393) AND (1 <= p437)) OR ((1 <= p399) AND (1 <= p430)) OR ((1 <= p401) AND (1 <= p433)) OR ((1 <= p393) AND (1 <= p441)) OR ((1 <= p406) AND (1 <= p428)) OR ((1 <= p398) AND (1 <= p436)) OR ((1 <= p399) AND (1 <= p426)) OR ((1 <= p394) AND (1 <= p435)) OR ((1 <= p400) AND (1 <= p438)) OR ((1 <= p395) AND (1 <= p429)) OR ((1 <= p432) AND (1 <= p444)) OR ((1 <= p405) AND (1 <= p433)) OR ((1 <= p397) AND (1 <= p441)) OR ((1 <= p403) AND (1 <= p425)) OR ((1 <= p397) AND (1 <= p437)) OR ((1 <= p396) AND (1 <= p423)) OR ((1 <= p438) AND (1 <= p445)) OR ((1 <= p396) AND (1 <= p427)) OR ((1 <= p404) AND (1 <= p439)) OR ((1 <= p398) AND (1 <= p433)) OR ((1 <= p434) AND (1 <= p444)) OR ((1 <= p429) AND (1 <= p443)) OR ((1 <= p393) AND (1 <= p440)) OR ((1 <= p424) AND (1 <= p442)) OR ((1 <= p392) AND (1 <= p422)) OR ((1 <= p439) AND (1 <= p445)) OR ((1 <= p424) AND (1 <= p446)) OR ((1 <= p401) AND (1 <= p436)) OR ((1 <= p401) AND (1 <= p432)) OR ((1 <= p399) AND (1 <= p431)) OR ((1 <= p431) AND (1 <= p443)) OR ((1 <= p402) AND (1 <= p426)) OR ((1 <= p406) AND (1 <= p429)) OR ((1 <= p436) AND (1 <= p444)) OR ((1 <= p402) AND (1 <= p430)) OR ((1 <= p394) AND (1 <= p434)) OR ((1 <= p422) AND (1 <= p442)) OR ((1 <= p400) AND (1 <= p439)) OR ((1 <= p405) AND (1 <= p436)) OR ((1 <= p395) AND (1 <= p428)) OR ((1 <= p405) AND (1 <= p432)) OR ((1 <= p403) AND (1 <= p424)) OR ((1 <= p422) AND (1 <= p446)) OR ((1 <= p397) AND (1 <= p440)) OR ((1 <= p441) AND (1 <= p445)) OR ((1 <= p396) AND (1 <= p422)) OR ((1 <= p392) AND (1 <= p427)) OR ((1 <= p404) AND (1 <= p438)) OR ((1 <= p398) AND (1 <= p434)) OR ((1 <= p406) AND (1 <= p426)) OR ((1 <= p393) AND (1 <= p439)) OR ((1 <= p392) AND (1 <= p423)) OR ((1 <= p399) AND (1 <= p428)) OR ((1 <= p401) AND (1 <= p435)) OR ((1 <= p406) AND (1 <= p430)) OR ((1 <= p402) AND (1 <= p429)) OR ((1 <= p394) AND (1 <= p433)) OR ((1 <= p427) AND (1 <= p442)) OR ((1 <= p400) AND (1 <= p440)) OR ((1 <= p437) AND (1 <= p445)) OR ((1 <= p403) AND (1 <= p423)) OR ((1 <= p395) AND (1 <= p431)) OR ((1 <= p405) AND (1 <= p435)) OR ((1 <= p397) AND (1 <= p439)) OR ((1 <= p403) AND (1 <= p427)) OR ((1 <= p396) AND (1 <= p425)) OR ((1 <= p404) AND (1 <= p441)) OR ((1 <= p433) AND (1 <= p444)) OR ((1 <= p404) AND (1 <= p437)) OR ((1 <= p425) AND (1 <= p442)) OR ((1 <= p425) AND (1 <= p446)) OR ((1 <= p230) AND (1 <= p448)) OR ((1 <= p203) AND (1 <= p420)) OR ((1 <= p231) AND (1 <= p421)) OR ((1 <= p228) AND (1 <= p449)) OR ((1 <= p229) AND (1 <= p447))))))) : E (F (((((1 <= p41)) OR ((1 <= p214)) OR ((1 <= p224) AND (1 <= p261) AND (1 <= p406) AND (1 <= p431) AND (1 <= p90)) OR ((1 <= p174) AND (1 <= p4))) AND ((p96 <= 0) OR (p191 <= 0) OR ((1 <= p189)) OR ((1 <= p229) AND (1 <= p257)) OR ((1 <= p229) AND (1 <= p301) AND (1 <= p71))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 1771 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((((1 <= p41)) OR ((1 <= p214)) OR ((1 <= p224) AND (1 <= p261) AND (1 <= p406) AND (1 <= p431) AND (1 <= p90)) OR ((1 <= p174) AND (1 <= p4))) AND ((p96 <= 0) OR (p191 <= 0) OR ((1 <= p189)) OR ((1 <= p229) AND (1 <= p257)) OR ((1 <= p229) AND (1 <= p301) AND (1 <= p71))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((((1 <= p41)) OR ((1 <= p214)) OR ((1 <= p224) AND (1 <= p261) AND (1 <= p406) AND (1 <= p431) AND (1 <= p90)) OR ((1 <= p174) AND (1 <= p4))) AND ((p96 <= 0) OR (p191 <= 0) OR ((1 <= p189)) OR ((1 <= p229) AND (1 <= p257)) OR ((1 <= p229) AND (1 <= p301) AND (1 <= p71))))))
lola: processed formula length: 289
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((((1 <= p41)) OR ((1 <= p214)) OR ((1 <= p224) AND (1 <= p261) AND (1 <= p406) AND (1 <= p431) AND (1 <= p90)) OR ((1 <= p174) AND (1 <= p4))) AND ((p96 <= 0) OR (p191 <= 0) OR ((1 <= p189)) OR ((1 <= p229) AND (1 <= p257)) OR ((1 <= p229) AND (1 <= p301) AND (1 <= p71))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 77 literals and 20 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 285828 markings, 714213 edges, 57166 markings/sec, 0 secs
lola: sara is running 5 secs || 538679 markings, 1465526 edges, 50570 markings/sec, 5 secs
lola: sara is running 10 secs || 758043 markings, 2269577 edges, 43873 markings/sec, 10 secs
lola: sara is running 15 secs || 982861 markings, 3073811 edges, 44964 markings/sec, 15 secs
lola: sara is running 20 secs || 1212636 markings, 3857956 edges, 45955 markings/sec, 20 secs
sara: warning, failure of lp_solve (at job 5739)
lola: sara is running 25 secs || 1431603 markings, 4663194 edges, 43793 markings/sec, 25 secs
lola: sara is running 30 secs || 1655797 markings, 5452892 edges, 44839 markings/sec, 30 secs
lola: sara is running 35 secs || 1875672 markings, 6244332 edges, 43975 markings/sec, 35 secs
lola: sara is running 40 secs || 2100401 markings, 7029906 edges, 44946 markings/sec, 40 secs
lola: sara is running 45 secs || 2314684 markings, 7819687 edges, 42857 markings/sec, 45 secs
lola: sara is running 50 secs || 2533742 markings, 8605120 edges, 43812 markings/sec, 50 secs
lola: sara is running 55 secs || 2750465 markings, 9388715 edges, 43345 markings/sec, 55 secs
lola: sara is running 60 secs || 2968658 markings, 10200687 edges, 43639 markings/sec, 60 secs
lola: sara is running 65 secs || 3177637 markings, 11017502 edges, 41796 markings/sec, 65 secs
lola: sara is running 70 secs || 3391607 markings, 11818278 edges, 42794 markings/sec, 70 secs
lola: sara is running 75 secs || 3603884 markings, 12618639 edges, 42455 markings/sec, 75 secs
lola: sara is running 80 secs || 3819864 markings, 13401437 edges, 43196 markings/sec, 80 secs
lola: sara is running 85 secs || 4038172 markings, 14181985 edges, 43662 markings/sec, 85 secs
lola: sara is running 90 secs || 4242762 markings, 14979253 edges, 40918 markings/sec, 90 secs
lola: sara is running 95 secs || 4451095 markings, 15749982 edges, 41667 markings/sec, 95 secs
lola: sara is running 100 secs || 4652804 markings, 16524403 edges, 40342 markings/sec, 100 secs
lola: sara is running 105 secs || 4853638 markings, 17308996 edges, 40167 markings/sec, 105 secs
lola: sara is running 110 secs || 5056784 markings, 18090728 edges, 40629 markings/sec, 110 secs
lola: sara is running 115 secs || 5271214 markings, 18856492 edges, 42886 markings/sec, 115 secs
lola: sara is running 120 secs || 5480802 markings, 19650036 edges, 41918 markings/sec, 120 secs
lola: sara is running 125 secs || 5695451 markings, 20436530 edges, 42930 markings/sec, 125 secs
lola: sara is running 130 secs || 5912907 markings, 21194603 edges, 43491 markings/sec, 130 secs
lola: sara is running 135 secs || 6126657 markings, 21956407 edges, 42750 markings/sec, 135 secs
lola: sara is running 140 secs || 6333496 markings, 22729649 edges, 41368 markings/sec, 140 secs
lola: sara is running 145 secs || 6533062 markings, 23530496 edges, 39913 markings/sec, 145 secs
lola: sara is running 150 secs || 6732219 markings, 24313873 edges, 39831 markings/sec, 150 secs
lola: sara is running 155 secs || 6931814 markings, 25083256 edges, 39919 markings/sec, 155 secs
lola: sara is running 160 secs || 7131852 markings, 25854355 edges, 40008 markings/sec, 160 secs
lola: sara is running 165 secs || 7348205 markings, 26607104 edges, 43271 markings/sec, 165 secs
lola: sara is running 170 secs || 7557096 markings, 27365000 edges, 41778 markings/sec, 170 secs
lola: sara is running 175 secs || 7763832 markings, 28112325 edges, 41347 markings/sec, 175 secs
lola: sara is running 180 secs || 7960889 markings, 28878257 edges, 39411 markings/sec, 180 secs
lola: sara is running 185 secs || 8152865 markings, 29657208 edges, 38395 markings/sec, 185 secs
lola: sara is running 190 secs || 8353091 markings, 30419021 edges, 40045 markings/sec, 190 secs
lola: sara is running 195 secs || 8571993 markings, 31159625 edges, 43780 markings/sec, 195 secs
lola: sara is running 200 secs || 8771351 markings, 31907656 edges, 39872 markings/sec, 200 secs
lola: sara is running 205 secs || 8982300 markings, 32652943 edges, 42190 markings/sec, 205 secs
lola: sara is running 210 secs || 9179235 markings, 33401882 edges, 39387 markings/sec, 210 secs
lola: sara is running 215 secs || 9369781 markings, 34167041 edges, 38109 markings/sec, 215 secs
lola: sara is running 220 secs || 9566868 markings, 34915471 edges, 39417 markings/sec, 220 secs
lola: sara is running 225 secs || 9762555 markings, 35659200 edges, 39137 markings/sec, 225 secs
lola: sara is running 230 secs || 9964027 markings, 36401004 edges, 40294 markings/sec, 230 secs
lola: sara is running 235 secs || 10165619 markings, 37154108 edges, 40318 markings/sec, 235 secs
lola: sara is running 240 secs || 10359369 markings, 37923266 edges, 38750 markings/sec, 240 secs
lola: sara is running 245 secs || 10551973 markings, 38669747 edges, 38521 markings/sec, 245 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 10675113 markings, 39152851 edges
lola: ========================================
lola: subprocess 1 will run for 3289 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((((p230 <= 0) OR (p448 <= 0)) AND ((p203 <= 0) OR (p420 <= 0)) AND ((p231 <= 0) OR (p421 <= 0)) AND ((p228 <= 0) OR (p449 <= 0)) AND ((p229 <= 0) OR (p447 <= 0))) OR (((p225 <= 0) OR (p279 <= 0)) AND ((p227 <= 0) OR (p242 <= 0)) AND ((p225 <= 0) OR (p277 <= 0)) AND ((p221 <= 0) OR (p227 <= 0)) AND ((p227 <= 0) OR (p240 <= 0)) AND ((p224 <= 0) OR (p263 <= 0)) AND ((p227 <= 0) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((((p230 <= 0) OR (p448 <= 0)) AND ((p203 <= 0) OR (p420 <= 0)) AND ((p231 <= 0) OR (p421 <= 0)) AND ((p228 <= 0) OR (p449 <= 0)) AND ((p229 <= 0) OR (p447 <= 0))) OR (((p225 <= 0) OR (p279 <= 0)) AND ((p227 <= 0) OR (p242 <= 0)) AND ((p225 <= 0) OR (p277 <= 0)) AND ((p221 <= 0) OR (p227 <= 0)) AND ((p227 <= 0) OR (p240 <= 0)) AND ((p224 <= 0) OR (p263 <= 0)) AND ((p227 <= 0) OR ... (shortened)
lola: processed formula length: 9224
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((((1 <= p230) AND (1 <= p448)) OR ((1 <= p203) AND (1 <= p420)) OR ((1 <= p231) AND (1 <= p421)) OR ((1 <= p228) AND (1 <= p449)) OR ((1 <= p229) AND (1 <= p447))) AND (((1 <= p225) AND (1 <= p279)) OR ((1 <= p227) AND (1 <= p242)) OR ((1 <= p225) AND (1 <= p277)) OR ((1 <= p221) AND (1 <= p227)) OR ((1 <= p227) AND (1 <= p240)) OR ((1 <= p224) AND (1 <= p263)) OR ((1 <= p227) AND (1 <= p238)) OR ((1 <= p226) AND (1 <= p234)) OR ((1 <= p226) AND (1 <= p236)) OR ((1 <= p226) AND (1 <= p232)) OR ((1 <= p224) AND (1 <= p261)) OR ((1 <= p222) AND (1 <= p227)) OR ((1 <= p224) AND (1 <= p257)) OR ((1 <= p223) AND (1 <= p285)) OR ((1 <= p224) AND (1 <= p299)) OR ((1 <= p223) AND (1 <= p283)) OR ((1 <= p224) AND (1 <= p301)) OR ((1 <= p225) AND (1 <= p251)) OR ((1 <= p223) AND (1 <= p281)) OR ((1 <= p226) AND (1 <= p265)) OR ((1 <= p219) AND (1 <= p227)) OR ((1 <= p225) AND (1 <= p249)) OR ((1 <= p226) AND (1 <= p267)) OR ((1 <= p224) AND (1 <= p297)) OR ((1 <= p225) AND (1 <= p255)) OR ((1 <= p226) AND (1 <= p269)) OR ((1 <= p225) AND (1 <= p253)) OR ((1 <= p226) AND (1 <= p271)) OR ((1 <= p225) AND (1 <= p259)) OR ((1 <= p223) AND (1 <= p289)) OR ((1 <= p224) AND (1 <= p303)) OR ((1 <= p223) AND (1 <= p287)) OR ((1 <= p220) AND (1 <= p227)) OR ((1 <= p223) AND (1 <= p309)) OR ((1 <= p227) AND (1 <= p247)) OR ((1 <= p223) AND (1 <= p307)) OR ((1 <= p227) AND (1 <= p245)) OR ((1 <= p225) AND (1 <= p275)) OR ((1 <= p223) AND (1 <= p305)) OR ((1 <= p225) AND (1 <= p273)) OR ((1 <= p227) AND (1 <= p243)) OR ((1 <= p227) AND (1 <= p241)) OR ((1 <= p225) AND (1 <= p278)) OR ((1 <= p224) AND (1 <= p262)) OR ((1 <= p226) AND (1 <= p233)) OR ((1 <= p223) AND (1 <= p311)) OR ((1 <= p216) AND (1 <= p227)) OR ((1 <= p226) AND (1 <= p235)) OR ((1 <= p226) AND (1 <= p237)) OR ((1 <= p226) AND (1 <= p239)) OR ((1 <= p217) AND (1 <= p227)) OR ((1 <= p224) AND (1 <= p258)) OR ((1 <= p218) AND (1 <= p227)) OR ((1 <= p224) AND (1 <= p260)) OR ((1 <= p224) AND (1 <= p256)) OR ((1 <= p224) AND (1 <= p298)) OR ((1 <= p225) AND (1 <= p248)) OR ((1 <= p223) AND (1 <= p286)) OR ((1 <= p224) AND (1 <= p300)) OR ((1 <= p223) AND (1 <= p284)) OR ((1 <= p226) AND (1 <= p264)) OR ((1 <= p225) AND (1 <= p252)) OR ((1 <= p223) AND (1 <= p282)) OR ((1 <= p226) AND (1 <= p266)) OR ((1 <= p224) AND (1 <= p296)) OR ((1 <= p225) AND (1 <= p250)) OR ((1 <= p223) AND (1 <= p280)) OR ((1 <= p226) AND (1 <= p268)) OR ((1 <= p226) AND (1 <= p270)) OR ((1 <= p225) AND (1 <= p254)) OR ((1 <= p224) AND (1 <= p302)) OR ((1 <= p226) AND (1 <= p274)) OR ((1 <= p224) AND (1 <= p304)) OR ((1 <= p223) AND (1 <= p310)) OR ((1 <= p225) AND (1 <= p272)) OR ((1 <= p223) AND (1 <= p308)) OR ((1 <= p225) AND (1 <= p276)) OR ((1 <= p223) AND (1 <= p306)) OR ((1 <= p227) AND (1 <= p246)) OR ((1 <= p227) AND (1 <= p244))) AND ((((p126 <= 0)) AND ((p187 <= 0)) AND ((p130 <= 0)) AND ((p191 <= 0)) AND ((p134 <= 0)) AND ((p195 <= 0)) AND ((p138 <= 0)) AND ((p199 <= 0)) AND ((p142 <= 0)) AND ((p146 <= 0)) AND ((p207 <= 0)) AND ((p150 <= 0)) AND ((p211 <= 0)) AND ((p154 <= 0)) AND ((p215 <= 0)) AND ((p158 <= 0)) AND ((p162 <= 0)) AND ((p166 <= 0)) AND ((p170 <= 0)) AND ((p174 <= 0)) AND ((p113 <= 0)) AND ((p178 <= 0)) AND ((p182 <= 0)) AND ((p186 <= 0)) AND ((p121 <= 0)) AND ((p190 <= 0)) AND ((p125 <= 0)) AND ((p129 <= 0)) AND ((p194 <= 0)) AND ((p198 <= 0)) AND ((p133 <= 0)) AND ((p137 <= 0)) AND ((p202 <= 0)) AND ((p141 <= 0)) AND ((p206 <= 0)) AND ((p145 <= 0)) AND ((p210 <= 0)) AND ((p214 <= 0)) AND ((p149 <= 0)) AND ((p153 <= 0)) AND ((p157 <= 0)) AND ((p161 <= 0)) AND ((p165 <= 0)) AND ((p169 <= 0)) AND ((p173 <= 0)) AND ((p177 <= 0)) AND ((p112 <= 0)) AND ((p181 <= 0)) AND ((p116 <= 0)) AND ((p185 <= 0)) AND ((p120 <= 0)) AND ((p189 <= 0)) AND ((p124 <= 0)) AND ((p193 <= 0)) AND ((p128 <= 0)) AND ((p197 <= 0)) AND ((p132 <= 0)) AND ((p201 <= 0)) AND ((p136 <= 0)) AND ((p205 <= 0)) AND ((p140 <= 0)) AND ((p209 <= 0)) AND ((p144 <= 0)) AND ((p213 <= 0)) AND ((p148 <= 0)) AND ((p152 <= 0)) AND ((p156 <= 0)) AND ((p160 <= 0)) AND ((p164 <= 0)) AND ((p168 <= 0)) AND ((p172 <= 0)) AND ((p176 <= 0)) AND ((p115 <= 0)) AND ((p180 <= 0)) AND ((p184 <= 0)) AND ((p123 <= 0)) AND ((p188 <= 0)) AND ((p127 <= 0)) AND ((p192 <= 0)) AND ((p196 <= 0)) AND ((p131 <= 0)) AND ((p135 <= 0)) AND ((p200 <= 0)) AND ((p204 <= 0)) AND ((p139 <= 0)) AND ((p143 <= 0)) AND ((p208 <= 0)) AND ((p147 <= 0)) AND ((p212 <= 0)) AND ((p151 <= 0)) AND ((p155 <= 0)) AND ((p159 <= 0)) AND ((p163 <= 0)) AND ((p167 <= 0)) AND ((p171 <= 0)) AND ((p114 <= 0)) AND ((p175 <= 0)) AND ((p179 <= 0)) AND ((p122 <= 0)) AND ((p183 <= 0))) OR (((p96 <= 0)) AND ((p98 <= 0)) AND ((p97 <= 0)) AND ((p101 <= 0)) AND ((p102 <= 0)) AND ((p99 <= 0)) AND ((p100 <= 0)) AND ((p106 <= 0)) AND ((p103 <= 0)) AND ((p109 <= 0)) AND ((p110 <= 0)) AND ((p107 <= 0)) AND ((p108 <= 0)) AND ((p111 <= 0)) AND ((p93 <= 0))) OR (((p325 <= 0) OR (p399 <= 0)) AND ((p329 <= 0) OR (p444 <= 0)) AND ((p336 <= 0) OR (p396 <= 0)) AND ((p332 <= 0) OR (p398 <= 0)) AND ((p294 <= 0) OR (p405 <= 0)) AND ((p328 <= 0) OR (p395 <= 0)) AND ((p330 <= 0) OR (p402 <= 0)) AND ((p295 <= 0) OR (p401 <= 0)) AND ((p293 <= 0) OR (p397 <= 0)) AND ((p338 <= 0) OR (p403 <= 0)) AND ((p292 <= 0) OR (p445 <= 0)) AND ((p335 <= 0) OR (p442 <= 0)) AND ((p291 <= 0) OR (p404 <= 0)) AND ((p331 <= 0) OR (p394 <= 0)) AND ((p327 <= 0) OR (p406 <= 0)) AND ((p288 <= 0) OR (p400 <= 0)) AND ((p326 <= 0) OR (p443 <= 0)) AND ((p339 <= 0) OR (p392 <= 0)) AND ((p290 <= 0) OR (p393 <= 0)) AND ((p337 <= 0) OR (p446 <= 0))) OR (((p398 <= 0) OR (p435 <= 0)) AND ((p430 <= 0) OR (p443 <= 0)) AND ((p435 <= 0) OR (p444 <= 0)) AND ((p392 <= 0) OR (p424 <= 0)) AND ((p393 <= 0) OR (p438 <= 0)) AND ((p399 <= 0) OR (p429 <= 0)) AND ((p428 <= 0) OR (p443 <= 0)) AND ((p401 <= 0) OR (p434 <= 0)) AND ((p394 <= 0) OR (p436 <= 0)) AND ((p440 <= 0) OR (p445 <= 0)) AND ((p423 <= 0) OR (p446 <= 0)) AND ((p394 <= 0) OR (p432 <= 0)) AND ((p427 <= 0) OR (p446 <= 0)) AND ((p423 <= 0) OR (p442 <= 0)) AND ((p402 <= 0) OR (p428 <= 0)) AND ((p406 <= 0) OR (p431 <= 0)) AND ((p395 <= 0) OR (p426 <= 0)) AND ((p400 <= 0) OR (p437 <= 0)) AND ((p395 <= 0) OR (p430 <= 0)) AND ((p403 <= 0) OR (p422 <= 0)) AND ((p405 <= 0) OR (p434 <= 0)) AND ((p400 <= 0) OR (p441 <= 0)) AND ((p397 <= 0) OR (p438 <= 0)) AND ((p396 <= 0) OR (p424 <= 0)) AND ((p426 <= 0) OR (p443 <= 0)) AND ((p404 <= 0) OR (p440 <= 0)) AND ((p398 <= 0) OR (p432 <= 0)) AND ((p402 <= 0) OR (p431 <= 0)) AND ((p392 <= 0) OR (p425 <= 0)) AND ((p393 <= 0) OR (p437 <= 0)) AND ((p399 <= 0) OR (p430 <= 0)) AND ((p401 <= 0) OR (p433 <= 0)) AND ((p393 <= 0) OR (p441 <= 0)) AND ((p406 <= 0) OR (p428 <= 0)) AND ((p398 <= 0) OR (p436 <= 0)) AND ((p399 <= 0) OR (p426 <= 0)) AND ((p394 <= 0) OR (p435 <= 0)) AND ((p400 <= 0) OR (p438 <= 0)) AND ((p395 <= 0) OR (p429 <= 0)) AND ((p432 <= 0) OR (p444 <= 0)) AND ((p405 <= 0) OR (p433 <= 0)) AND ((p397 <= 0) OR (p441 <= 0)) AND ((p403 <= 0) OR (p425 <= 0)) AND ((p397 <= 0) OR (p437 <= 0)) AND ((p396 <= 0) OR (p423 <= 0)) AND ((p438 <= 0) OR (p445 <= 0)) AND ((p396 <= 0) OR (p427 <= 0)) AND ((p404 <= 0) OR (p439 <= 0)) AND ((p398 <= 0) OR (p433 <= 0)) AND ((p434 <= 0) OR (p444 <= 0)) AND ((p429 <= 0) OR (p443 <= 0)) AND ((p393 <= 0) OR (p440 <= 0)) AND ((p424 <= 0) OR (p442 <= 0)) AND ((p392 <= 0) OR (p422 <= 0)) AND ((p439 <= 0) OR (p445 <= 0)) AND ((p424 <= 0) OR (p446 <= 0)) AND ((p401 <= 0) OR (p436 <= 0)) AND ((p401 <= 0) OR (p432 <= 0)) AND ((p399 <= 0) OR (p431 <= 0)) AND ((p431 <= 0) OR (p443 <= 0)) AND ((p402 <= 0) OR (p426 <= 0)) AND ((p406 <= 0) OR (p429 <= 0)) AND ((p436 <= 0) OR (p444 <= 0)) AND ((p402 <= 0) OR (p430 <= 0)) AND ((p394 <= 0) OR (p434 <= 0)) AND ((p422 <= 0) OR (p442 <= 0)) AND ((p400 <= 0) OR (p439 <= 0)) AND ((p405 <= 0) OR (p436 <= 0)) AND ((p395 <= 0) OR (p428 <= 0)) AND ((p405 <= 0) OR (p432 <= 0)) AND ((p403 <= 0) OR (p424 <= 0)) AND ((p422 <= 0) OR (p446 <= 0)) AND ((p397 <= 0) OR (p440 <= 0)) AND ((p441 <= 0) OR (p445 <= 0)) AND ((p396 <= 0) OR (p422 <= 0)) AND ((p392 <= 0) OR (p427 <= 0)) AND ((p404 <= 0) OR (p438 <= 0)) AND ((p398 <= 0) OR (p434 <= 0)) AND ((p406 <= 0) OR (p426 <= 0)) AND ((p393 <= 0) OR (p439 <= 0)) AND ((p392 <= 0) OR (p423 <= 0)) AND ((p399 <= 0) OR (p428 <= 0)) AND ((p401 <= 0) OR (p435 <= 0)) AND ((p406 <= 0) OR (p430 <= 0)) AND ((p402 <= 0) OR (p429 <= 0)) AND ((p394 <= 0) OR (p433 <= 0)) AND ((p427 <= 0) OR (p442 <= 0)) AND ((p400 <= 0) OR (p440 <= 0)) AND ((p437 <= 0) OR (p445 <= 0)) AND ((p403 <= 0) OR (p423 <= 0)) AND ((p395 <= 0) OR (p431 <= 0)) AND ((p405 <= 0) OR (p435 <= 0)) AND ((p397 <= 0) OR (p439 <= 0)) AND ((p403 <= 0) OR (p427 <= 0)) AND ((p396 <= 0) OR (p425 <= 0)) AND ((p404 <= 0) OR (p441 <= 0)) AND ((p433 <= 0) OR (p444 <= 0)) AND ((p404 <= 0) OR (p437 <= 0)) AND ((p425 <= 0) OR (p442 <= 0)) AND ((p425 <= 0) OR (p446 <= 0)) AND ((p230 <= 0) OR (p448 <= 0)) AND ((p203 <= 0) OR (p420 <= 0)) AND ((p231 <= 0) OR (p421 <= 0)) AND ((p228 <= 0) OR (p449 <= 0)) AND ((p229 <= 0) OR (p447 <= 0)))))
lola: sara not yet started (preprocessing) || 234990 markings, 808629 edges, 46998 markings/sec, 0 secs
lola: state equation task get result unparse finished id 0
lola: state equation: Could not create input for sara: DNF too long or DEADLOCK predicate contained
lola: sara not yet started (preprocessing) || 468334 markings, 1610423 edges, 46669 markings/sec, 5 secs
lola: sara not yet started (preprocessing) || 701160 markings, 2393162 edges, 46565 markings/sec, 10 secs
lola: sara not yet started (preprocessing) || 931392 markings, 3174418 edges, 46046 markings/sec, 15 secs
lola: sara not yet started (preprocessing) || 1160606 markings, 3958418 edges, 45843 markings/sec, 20 secs
lola: sara not yet started (preprocessing) || 1395326 markings, 4714974 edges, 46944 markings/sec, 25 secs
lola: sara not yet started (preprocessing) || 1647399 markings, 5447872 edges, 50415 markings/sec, 30 secs
lola: sara not yet started (preprocessing) || 1889439 markings, 6202290 edges, 48408 markings/sec, 35 secs
lola: sara not yet started (preprocessing) || 2106292 markings, 6991717 edges, 43371 markings/sec, 40 secs
lola: sara not yet started (preprocessing) || 2294496 markings, 7803878 edges, 37641 markings/sec, 45 secs
lola: sara not yet started (preprocessing) || 2486775 markings, 8596280 edges, 38456 markings/sec, 50 secs
lola: sara not yet started (preprocessing) || 2688593 markings, 9390743 edges, 40364 markings/sec, 55 secs
lola: sara not yet started (preprocessing) || 2874726 markings, 10180530 edges, 37227 markings/sec, 60 secs
lola: sara not yet started (preprocessing) || 3057009 markings, 10969104 edges, 36457 markings/sec, 65 secs
lola: sara not yet started (preprocessing) || 3260020 markings, 11750326 edges, 40602 markings/sec, 70 secs
lola: sara not yet started (preprocessing) || 3451665 markings, 12550668 edges, 38329 markings/sec, 75 secs
lola: sara not yet started (preprocessing) || 3638222 markings, 13339805 edges, 37311 markings/sec, 80 secs
lola: sara not yet started (preprocessing) || 3824028 markings, 14128820 edges, 37161 markings/sec, 85 secs
lola: sara not yet started (preprocessing) || 4013042 markings, 14920223 edges, 37803 markings/sec, 90 secs
lola: sara not yet started (preprocessing) || 4203887 markings, 15718934 edges, 38169 markings/sec, 95 secs
lola: sara not yet started (preprocessing) || 4392951 markings, 16508149 edges, 37813 markings/sec, 100 secs
lola: sara not yet started (preprocessing) || 4575671 markings, 17303391 edges, 36544 markings/sec, 105 secs
lola: sara not yet started (preprocessing) || 4772374 markings, 18078862 edges, 39341 markings/sec, 110 secs
lola: sara not yet started (preprocessing) || 4955976 markings, 18890171 edges, 36720 markings/sec, 115 secs
lola: sara not yet started (preprocessing) || 5144177 markings, 19695818 edges, 37640 markings/sec, 120 secs
lola: sara not yet started (preprocessing) || 5328469 markings, 20507596 edges, 36858 markings/sec, 125 secs
lola: sara not yet started (preprocessing) || 5506219 markings, 21302738 edges, 35550 markings/sec, 130 secs
lola: sara not yet started (preprocessing) || 5689724 markings, 22114629 edges, 36701 markings/sec, 135 secs
lola: sara not yet started (preprocessing) || 5880992 markings, 22909143 edges, 38254 markings/sec, 140 secs
lola: sara not yet started (preprocessing) || 6067971 markings, 23714150 edges, 37396 markings/sec, 145 secs
lola: sara not yet started (preprocessing) || 6255713 markings, 24508446 edges, 37548 markings/sec, 150 secs
lola: sara not yet started (preprocessing) || 6438757 markings, 25304573 edges, 36609 markings/sec, 155 secs
lola: sara not yet started (preprocessing) || 6624019 markings, 26083739 edges, 37052 markings/sec, 160 secs
lola: sara not yet started (preprocessing) || 6804571 markings, 26865790 edges, 36110 markings/sec, 165 secs
lola: sara not yet started (preprocessing) || 6991311 markings, 27660990 edges, 37348 markings/sec, 170 secs
lola: sara not yet started (preprocessing) || 7176837 markings, 28449975 edges, 37105 markings/sec, 175 secs
lola: sara not yet started (preprocessing) || 7371285 markings, 29214902 edges, 38890 markings/sec, 180 secs
lola: sara not yet started (preprocessing) || 7554828 markings, 30001809 edges, 36709 markings/sec, 185 secs
lola: sara not yet started (preprocessing) || 7736231 markings, 30793550 edges, 36281 markings/sec, 190 secs
lola: sara not yet started (preprocessing) || 7921860 markings, 31563344 edges, 37126 markings/sec, 195 secs
lola: sara not yet started (preprocessing) || 8106360 markings, 32348576 edges, 36900 markings/sec, 200 secs
lola: sara not yet started (preprocessing) || 8289567 markings, 33135323 edges, 36641 markings/sec, 205 secs
lola: sara not yet started (preprocessing) || 8468538 markings, 33916807 edges, 35794 markings/sec, 210 secs
lola: sara not yet started (preprocessing) || 8653101 markings, 34686676 edges, 36913 markings/sec, 215 secs
lola: sara not yet started (preprocessing) || 8829933 markings, 35464264 edges, 35366 markings/sec, 220 secs
lola: sara not yet started (preprocessing) || 9008828 markings, 36242426 edges, 35779 markings/sec, 225 secs
lola: sara not yet started (preprocessing) || 9195750 markings, 37013257 edges, 37384 markings/sec, 230 secs
lola: sara not yet started (preprocessing) || 9375970 markings, 37772522 edges, 36044 markings/sec, 235 secs
lola: sara not yet started (preprocessing) || 9553454 markings, 38556635 edges, 35497 markings/sec, 240 secs
lola: sara not yet started (preprocessing) || 9736688 markings, 39349602 edges, 36647 markings/sec, 245 secs
lola: sara not yet started (preprocessing) || 9912633 markings, 40124289 edges, 35189 markings/sec, 250 secs
lola: sara not yet started (preprocessing) || 10088808 markings, 40905060 edges, 35235 markings/sec, 255 secs
lola: sara not yet started (preprocessing) || 10266294 markings, 41688142 edges, 35497 markings/sec, 260 secs
lola: sara not yet started (preprocessing) || 10449877 markings, 42445298 edges, 36717 markings/sec, 265 secs
lola: sara not yet started (preprocessing) || 10630054 markings, 43213120 edges, 36035 markings/sec, 270 secs
lola: sara not yet started (preprocessing) || 10809107 markings, 43978173 edges, 35811 markings/sec, 275 secs
lola: sara not yet started (preprocessing) || 10985658 markings, 44728225 edges, 35310 markings/sec, 280 secs
lola: sara not yet started (preprocessing) || 11153012 markings, 45448127 edges, 33471 markings/sec, 285 secs
lola: sara not yet started (preprocessing) || 11325311 markings, 46208035 edges, 34460 markings/sec, 290 secs
lola: sara not yet started (preprocessing) || 11505732 markings, 46967813 edges, 36084 markings/sec, 295 secs
lola: sara not yet started (preprocessing) || 11688575 markings, 47717627 edges, 36569 markings/sec, 300 secs
lola: sara not yet started (preprocessing) || 11864354 markings, 48443957 edges, 35156 markings/sec, 305 secs
lola: sara not yet started (preprocessing) || 12050007 markings, 49163525 edges, 37131 markings/sec, 310 secs
lola: sara not yet started (preprocessing) || 12219569 markings, 49915939 edges, 33912 markings/sec, 315 secs
lola: sara not yet started (preprocessing) || 12406184 markings, 50631163 edges, 37323 markings/sec, 320 secs
lola: sara not yet started (preprocessing) || 12590920 markings, 51323522 edges, 36947 markings/sec, 325 secs
lola: sara not yet started (preprocessing) || 12762780 markings, 52032374 edges, 34372 markings/sec, 330 secs
lola: sara not yet started (preprocessing) || 12935394 markings, 52793490 edges, 34523 markings/sec, 335 secs
lola: sara not yet started (preprocessing) || 13103643 markings, 53536675 edges, 33650 markings/sec, 340 secs
lola: sara not yet started (preprocessing) || 13277383 markings, 54301345 edges, 34748 markings/sec, 345 secs
lola: sara not yet started (preprocessing) || 13447473 markings, 55046842 edges, 34018 markings/sec, 350 secs
lola: sara not yet started (preprocessing) || 13622139 markings, 55791992 edges, 34933 markings/sec, 355 secs
lola: sara not yet started (preprocessing) || 13796107 markings, 56565914 edges, 34794 markings/sec, 360 secs
lola: sara not yet started (preprocessing) || 13967835 markings, 57337067 edges, 34346 markings/sec, 365 secs
lola: sara not yet started (preprocessing) || 14136587 markings, 58095927 edges, 33750 markings/sec, 370 secs
lola: sara not yet started (preprocessing) || 14304833 markings, 58851368 edges, 33649 markings/sec, 375 secs
lola: sara not yet started (preprocessing) || 14471420 markings, 59609190 edges, 33317 markings/sec, 380 secs
lola: sara not yet started (preprocessing) || 14636871 markings, 60340359 edges, 33090 markings/sec, 385 secs
lola: sara not yet started (preprocessing) || 14807606 markings, 61095083 edges, 34147 markings/sec, 390 secs
lola: sara not yet started (preprocessing) || 14973732 markings, 61827712 edges, 33225 markings/sec, 395 secs
lola: sara not yet started (preprocessing) || 15148785 markings, 62574294 edges, 35011 markings/sec, 400 secs
lola: sara not yet started (preprocessing) || 15314483 markings, 63324201 edges, 33140 markings/sec, 405 secs
lola: sara not yet started (preprocessing) || 15490866 markings, 64077971 edges, 35277 markings/sec, 410 secs
lola: sara not yet started (preprocessing) || 15657104 markings, 64813392 edges, 33248 markings/sec, 415 secs
lola: sara not yet started (preprocessing) || 15835582 markings, 65541043 edges, 35696 markings/sec, 420 secs
lola: sara not yet started (preprocessing) || 16005717 markings, 66275189 edges, 34027 markings/sec, 425 secs
lola: sara not yet started (preprocessing) || 16170895 markings, 66998521 edges, 33036 markings/sec, 430 secs
lola: sara not yet started (preprocessing) || 16340014 markings, 67742652 edges, 33824 markings/sec, 435 secs
lola: sara not yet started (preprocessing) || 16521508 markings, 68474460 edges, 36299 markings/sec, 440 secs
lola: sara not yet started (preprocessing) || 16694863 markings, 69199941 edges, 34671 markings/sec, 445 secs
lola: sara not yet started (preprocessing) || 16868529 markings, 69940016 edges, 34733 markings/sec, 450 secs
lola: sara not yet started (preprocessing) || 17037148 markings, 70663963 edges, 33724 markings/sec, 455 secs
lola: sara not yet started (preprocessing) || 17202569 markings, 71401808 edges, 33084 markings/sec, 460 secs
lola: sara not yet started (preprocessing) || 17376212 markings, 72132186 edges, 34729 markings/sec, 465 secs
lola: sara not yet started (preprocessing) || 17555838 markings, 72854920 edges, 35925 markings/sec, 470 secs
lola: sara not yet started (preprocessing) || 17728590 markings, 73581623 edges, 34550 markings/sec, 475 secs
lola: sara not yet started (preprocessing) || 17893743 markings, 74306470 edges, 33031 markings/sec, 480 secs
lola: sara not yet started (preprocessing) || 18061183 markings, 75062680 edges, 33488 markings/sec, 485 secs
lola: sara not yet started (preprocessing) || 18226153 markings, 75790889 edges, 32994 markings/sec, 490 secs
lola: sara not yet started (preprocessing) || 18393408 markings, 76523589 edges, 33451 markings/sec, 495 secs
lola: sara not yet started (preprocessing) || 18557513 markings, 77261836 edges, 32821 markings/sec, 500 secs
lola: sara not yet started (preprocessing) || 18723945 markings, 78010574 edges, 33286 markings/sec, 505 secs
lola: sara not yet started (preprocessing) || 18890480 markings, 78743330 edges, 33307 markings/sec, 510 secs
lola: sara not yet started (preprocessing) || 19055143 markings, 79479155 edges, 32933 markings/sec, 515 secs
lola: sara not yet started (preprocessing) || 19221085 markings, 80214165 edges, 33188 markings/sec, 520 secs
lola: sara not yet started (preprocessing) || 19384831 markings, 80949533 edges, 32749 markings/sec, 525 secs
lola: sara not yet started (preprocessing) || 19547862 markings, 81659676 edges, 32606 markings/sec, 530 secs
lola: sara not yet started (preprocessing) || 19711082 markings, 82388857 edges, 32644 markings/sec, 535 secs
lola: sara not yet started (preprocessing) || 19870958 markings, 83083009 edges, 31975 markings/sec, 540 secs
lola: sara not yet started (preprocessing) || 20042517 markings, 83813412 edges, 34312 markings/sec, 545 secs
lola: sara not yet started (preprocessing) || 20202239 markings, 84498776 edges, 31944 markings/sec, 550 secs
lola: sara not yet started (preprocessing) || 20373452 markings, 85225027 edges, 34243 markings/sec, 555 secs
lola: sara not yet started (preprocessing) || 20543815 markings, 85949670 edges, 34073 markings/sec, 560 secs
lola: sara not yet started (preprocessing) || 20708321 markings, 86682763 edges, 32901 markings/sec, 565 secs
lola: sara not yet started (preprocessing) || 20876579 markings, 87398393 edges, 33652 markings/sec, 570 secs
lola: sara not yet started (preprocessing) || 21049341 markings, 88120520 edges, 34552 markings/sec, 575 secs
lola: sara not yet started (preprocessing) || 21219050 markings, 88830472 edges, 33942 markings/sec, 580 secs
lola: sara not yet started (preprocessing) || 21378780 markings, 89529480 edges, 31946 markings/sec, 585 secs
lola: sara not yet started (preprocessing) || 21540334 markings, 90258768 edges, 32311 markings/sec, 590 secs
lola: sara not yet started (preprocessing) || 21696536 markings, 90942493 edges, 31240 markings/sec, 595 secs
lola: sara not yet started (preprocessing) || 21854078 markings, 91648338 edges, 31508 markings/sec, 600 secs
lola: sara not yet started (preprocessing) || 22014254 markings, 92352592 edges, 32035 markings/sec, 605 secs
lola: sara not yet started (preprocessing) || 22170623 markings, 93051009 edges, 31274 markings/sec, 610 secs
lola: sara not yet started (preprocessing) || 22330632 markings, 93750606 edges, 32002 markings/sec, 615 secs
lola: sara not yet started (preprocessing) || 22493115 markings, 94486152 edges, 32497 markings/sec, 620 secs
lola: sara not yet started (preprocessing) || 22657167 markings, 95229660 edges, 32810 markings/sec, 625 secs
lola: sara not yet started (preprocessing) || 22817257 markings, 95949001 edges, 32018 markings/sec, 630 secs
lola: sara not yet started (preprocessing) || 22981242 markings, 96687264 edges, 32797 markings/sec, 635 secs
lola: sara not yet started (preprocessing) || 23147159 markings, 97406559 edges, 33183 markings/sec, 640 secs
lola: sara not yet started (preprocessing) || 23305610 markings, 98117805 edges, 31690 markings/sec, 645 secs
lola: sara not yet started (preprocessing) || 23460597 markings, 98816458 edges, 30997 markings/sec, 650 secs
lola: sara not yet started (preprocessing) || 23617003 markings, 99520823 edges, 31281 markings/sec, 655 secs
lola: sara not yet started (preprocessing) || 23777507 markings, 100236002 edges, 32101 markings/sec, 660 secs
lola: sara not yet started (preprocessing) || 23931585 markings, 100923985 edges, 30816 markings/sec, 665 secs
lola: sara not yet started (preprocessing) || 24082605 markings, 101599055 edges, 30204 markings/sec, 670 secs
lola: sara not yet started (preprocessing) || 24245584 markings, 102292346 edges, 32596 markings/sec, 675 secs
lola: sara not yet started (preprocessing) || 24399909 markings, 102970652 edges, 30865 markings/sec, 680 secs
lola: sara not yet started (preprocessing) || 24552676 markings, 103658791 edges, 30553 markings/sec, 685 secs
lola: sara not yet started (preprocessing) || 24708168 markings, 104348355 edges, 31098 markings/sec, 690 secs
lola: sara not yet started (preprocessing) || 24858218 markings, 105012832 edges, 30010 markings/sec, 695 secs
lola: sara not yet started (preprocessing) || 25004586 markings, 105664109 edges, 29274 markings/sec, 700 secs
lola: sara not yet started (preprocessing) || 25156665 markings, 106338798 edges, 30416 markings/sec, 705 secs
lola: sara not yet started (preprocessing) || 25305521 markings, 107006024 edges, 29771 markings/sec, 710 secs
lola: sara not yet started (preprocessing) || 25469331 markings, 107714270 edges, 32762 markings/sec, 715 secs
lola: sara not yet started (preprocessing) || 25618339 markings, 108374883 edges, 29802 markings/sec, 720 secs
lola: sara not yet started (preprocessing) || 25764593 markings, 109026781 edges, 29251 markings/sec, 725 secs
lola: sara not yet started (preprocessing) || 25901194 markings, 109640941 edges, 27320 markings/sec, 730 secs
lola: sara not yet started (preprocessing) || 26047209 markings, 110269010 edges, 29203 markings/sec, 735 secs
lola: sara not yet started (preprocessing) || 26182769 markings, 110877748 edges, 27112 markings/sec, 740 secs
lola: sara not yet started (preprocessing) || 26342206 markings, 111550199 edges, 31887 markings/sec, 745 secs
lola: sara not yet started (preprocessing) || 26490583 markings, 112215547 edges, 29675 markings/sec, 750 secs
lola: sara not yet started (preprocessing) || 26644347 markings, 112890429 edges, 30753 markings/sec, 755 secs
lola: sara not yet started (preprocessing) || 26793919 markings, 113550439 edges, 29914 markings/sec, 760 secs
lola: sara not yet started (preprocessing) || 26952923 markings, 114259929 edges, 31801 markings/sec, 765 secs
lola: sara not yet started (preprocessing) || 27116480 markings, 114978438 edges, 32711 markings/sec, 770 secs
lola: sara not yet started (preprocessing) || 27281284 markings, 115671568 edges, 32961 markings/sec, 775 secs
lola: sara not yet started (preprocessing) || 27442306 markings, 116364665 edges, 32204 markings/sec, 780 secs
lola: sara not yet started (preprocessing) || 27598459 markings, 117044136 edges, 31231 markings/sec, 785 secs
lola: sara not yet started (preprocessing) || 27760388 markings, 117745952 edges, 32386 markings/sec, 790 secs
lola: sara not yet started (preprocessing) || 27920487 markings, 118444288 edges, 32020 markings/sec, 795 secs
lola: sara not yet started (preprocessing) || 28086573 markings, 119167708 edges, 33217 markings/sec, 800 secs
lola: sara not yet started (preprocessing) || 28240896 markings, 119852696 edges, 30865 markings/sec, 805 secs
lola: sara not yet started (preprocessing) || 28402981 markings, 120544598 edges, 32417 markings/sec, 810 secs
lola: sara not yet started (preprocessing) || 28557767 markings, 121223696 edges, 30957 markings/sec, 815 secs
lola: sara not yet started (preprocessing) || 28717703 markings, 121900403 edges, 31987 markings/sec, 820 secs
lola: sara not yet started (preprocessing) || 28876514 markings, 122592497 edges, 31762 markings/sec, 825 secs
lola: sara not yet started (preprocessing) || 29035688 markings, 123277262 edges, 31835 markings/sec, 830 secs
lola: sara not yet started (preprocessing) || 29189870 markings, 123949797 edges, 30836 markings/sec, 835 secs
lola: sara not yet started (preprocessing) || 29348197 markings, 124630743 edges, 31665 markings/sec, 840 secs
lola: sara not yet started (preprocessing) || 29515639 markings, 125303363 edges, 33488 markings/sec, 845 secs
lola: sara not yet started (preprocessing) || 29671566 markings, 125975971 edges, 31185 markings/sec, 850 secs
lola: sara not yet started (preprocessing) || 29824829 markings, 126646617 edges, 30653 markings/sec, 855 secs
lola: sara not yet started (preprocessing) || 29986648 markings, 127336259 edges, 32364 markings/sec, 860 secs
lola: sara not yet started (preprocessing) || 30144966 markings, 128010752 edges, 31664 markings/sec, 865 secs
lola: sara not yet started (preprocessing) || 30292327 markings, 128659025 edges, 29472 markings/sec, 870 secs
lola: sara not yet started (preprocessing) || 30446995 markings, 129319496 edges, 30934 markings/sec, 875 secs
lola: sara not yet started (preprocessing) || 30599697 markings, 129981572 edges, 30540 markings/sec, 880 secs
lola: sara not yet started (preprocessing) || 30757388 markings, 130652915 edges, 31538 markings/sec, 885 secs
lola: sara not yet started (preprocessing) || 30911025 markings, 131302539 edges, 30727 markings/sec, 890 secs
lola: sara not yet started (preprocessing) || 31085082 markings, 131980763 edges, 34811 markings/sec, 895 secs
lola: sara not yet started (preprocessing) || 31245539 markings, 132676152 edges, 32091 markings/sec, 900 secs
lola: sara not yet started (preprocessing) || 31392865 markings, 133324916 edges, 29465 markings/sec, 905 secs
lola: sara not yet started (preprocessing) || 31557041 markings, 134006966 edges, 32835 markings/sec, 910 secs
lola: sara not yet started (preprocessing) || 31725048 markings, 134710824 edges, 33601 markings/sec, 915 secs
lola: sara not yet started (preprocessing) || 31897987 markings, 135418823 edges, 34588 markings/sec, 920 secs
lola: sara not yet started (preprocessing) || 32058925 markings, 136103506 edges, 32188 markings/sec, 925 secs
lola: sara not yet started (preprocessing) || 32242825 markings, 136796970 edges, 36780 markings/sec, 930 secs
lola: sara not yet started (preprocessing) || 32412173 markings, 137491652 edges, 33870 markings/sec, 935 secs
lola: sara not yet started (preprocessing) || 32579934 markings, 138162515 edges, 33552 markings/sec, 940 secs
lola: sara not yet started (preprocessing) || 32748693 markings, 138836729 edges, 33752 markings/sec, 945 secs
lola: sara not yet started (preprocessing) || 32912116 markings, 139523301 edges, 32685 markings/sec, 950 secs
lola: sara not yet started (preprocessing) || 33078535 markings, 140205642 edges, 33284 markings/sec, 955 secs
lola: sara not yet started (preprocessing) || 33253219 markings, 140867400 edges, 34937 markings/sec, 960 secs
lola: sara not yet started (preprocessing) || 33418408 markings, 141530290 edges, 33038 markings/sec, 965 secs
lola: sara not yet started (preprocessing) || 33580617 markings, 142205824 edges, 32442 markings/sec, 970 secs
lola: sara not yet started (preprocessing) || 33756743 markings, 142906201 edges, 35225 markings/sec, 975 secs
lola: sara not yet started (preprocessing) || 33918314 markings, 143583953 edges, 32314 markings/sec, 980 secs
lola: sara not yet started (preprocessing) || 34073522 markings, 144246798 edges, 31042 markings/sec, 985 secs
lola: sara not yet started (preprocessing) || 34243335 markings, 144930346 edges, 33963 markings/sec, 990 secs
lola: sara not yet started (preprocessing) || 34409471 markings, 145597380 edges, 33227 markings/sec, 995 secs
lola: sara not yet started (preprocessing) || 34561758 markings, 146250855 edges, 30457 markings/sec, 1000 secs
lola: sara not yet started (preprocessing) || 34720965 markings, 146932392 edges, 31841 markings/sec, 1005 secs
lola: sara not yet started (preprocessing) || 34885740 markings, 147623197 edges, 32955 markings/sec, 1010 secs
lola: sara not yet started (preprocessing) || 35039893 markings, 148305181 edges, 30831 markings/sec, 1015 secs
lola: sara not yet started (preprocessing) || 35205633 markings, 149000340 edges, 33148 markings/sec, 1020 secs
lola: sara not yet started (preprocessing) || 35363257 markings, 149686469 edges, 31525 markings/sec, 1025 secs
lola: sara not yet started (preprocessing) || 35528963 markings, 150368664 edges, 33141 markings/sec, 1030 secs
lola: sara not yet started (preprocessing) || 35700475 markings, 151069246 edges, 34302 markings/sec, 1035 secs
lola: sara not yet started (preprocessing) || 35869885 markings, 151765228 edges, 33882 markings/sec, 1040 secs
lola: sara not yet started (preprocessing) || 36036047 markings, 152469750 edges, 33232 markings/sec, 1045 secs
lola: sara not yet started (preprocessing) || 36201174 markings, 153165842 edges, 33025 markings/sec, 1050 secs
lola: sara not yet started (preprocessing) || 36359583 markings, 153855691 edges, 31682 markings/sec, 1055 secs
lola: sara not yet started (preprocessing) || 36526600 markings, 154551470 edges, 33403 markings/sec, 1060 secs
lola: sara not yet started (preprocessing) || 36700685 markings, 155229585 edges, 34817 markings/sec, 1065 secs
lola: sara not yet started (preprocessing) || 36867235 markings, 155932901 edges, 33310 markings/sec, 1070 secs
lola: sara not yet started (preprocessing) || 37027039 markings, 156622562 edges, 31961 markings/sec, 1075 secs
lola: sara not yet started (preprocessing) || 37192824 markings, 157318235 edges, 33157 markings/sec, 1080 secs
lola: sara not yet started (preprocessing) || 37356563 markings, 158004975 edges, 32748 markings/sec, 1085 secs
lola: sara not yet started (preprocessing) || 37511220 markings, 158684308 edges, 30931 markings/sec, 1090 secs
lola: sara not yet started (preprocessing) || 37669192 markings, 159358954 edges, 31594 markings/sec, 1095 secs
lola: sara not yet started (preprocessing) || 37828421 markings, 160031251 edges, 31846 markings/sec, 1100 secs
lola: sara not yet started (preprocessing) || 37991627 markings, 160704854 edges, 32641 markings/sec, 1105 secs
lola: sara not yet started (preprocessing) || 38144210 markings, 161359986 edges, 30517 markings/sec, 1110 secs
lola: sara not yet started (preprocessing) || 38352244 markings, 162012810 edges, 41607 markings/sec, 1115 secs
lola: sara not yet started (preprocessing) || 38570466 markings, 162683151 edges, 43644 markings/sec, 1120 secs
lola: sara not yet started (preprocessing) || 38776819 markings, 163358528 edges, 41271 markings/sec, 1125 secs
lola: sara not yet started (preprocessing) || 38971919 markings, 164028905 edges, 39020 markings/sec, 1130 secs
lola: sara not yet started (preprocessing) || 39164455 markings, 164670249 edges, 38507 markings/sec, 1135 secs
lola: sara not yet started (preprocessing) || 39352898 markings, 165322209 edges, 37689 markings/sec, 1140 secs
lola: sara not yet started (preprocessing) || 39536053 markings, 166040354 edges, 36631 markings/sec, 1145 secs
lola: sara not yet started (preprocessing) || 39706526 markings, 166777616 edges, 34095 markings/sec, 1150 secs
lola: sara not yet started (preprocessing) || 39885210 markings, 167515982 edges, 35737 markings/sec, 1155 secs
lola: sara not yet started (preprocessing) || 40075074 markings, 168274799 edges, 37973 markings/sec, 1160 secs
lola: sara not yet started (preprocessing) || 40247741 markings, 169010054 edges, 34533 markings/sec, 1165 secs
lola: sara not yet started (preprocessing) || 40421277 markings, 169746868 edges, 34707 markings/sec, 1170 secs
lola: sara not yet started (preprocessing) || 40604293 markings, 170475598 edges, 36603 markings/sec, 1175 secs
lola: sara not yet started (preprocessing) || 40773120 markings, 171207893 edges, 33765 markings/sec, 1180 secs
lola: sara not yet started (preprocessing) || 40938467 markings, 171931787 edges, 33069 markings/sec, 1185 secs
lola: sara not yet started (preprocessing) || 41116322 markings, 172654478 edges, 35571 markings/sec, 1190 secs
lola: sara not yet started (preprocessing) || 41289934 markings, 173383013 edges, 34722 markings/sec, 1195 secs
lola: sara not yet started (preprocessing) || 41455509 markings, 174108962 edges, 33115 markings/sec, 1200 secs
lola: sara not yet started (preprocessing) || 41618041 markings, 174815638 edges, 32506 markings/sec, 1205 secs
lola: sara not yet started (preprocessing) || 41787836 markings, 175536689 edges, 33959 markings/sec, 1210 secs
lola: sara not yet started (preprocessing) || 41957156 markings, 176246625 edges, 33864 markings/sec, 1215 secs
lola: sara not yet started (preprocessing) || 42129126 markings, 176994008 edges, 34394 markings/sec, 1220 secs
lola: sara not yet started (preprocessing) || 42294691 markings, 177725973 edges, 33113 markings/sec, 1225 secs
lola: sara not yet started (preprocessing) || 42461541 markings, 178460865 edges, 33370 markings/sec, 1230 secs
lola: sara not yet started (preprocessing) || 42625545 markings, 179187562 edges, 32801 markings/sec, 1235 secs
lola: sara not yet started (preprocessing) || 42787771 markings, 179912592 edges, 32445 markings/sec, 1240 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 42855502 markings, 180215018 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes
lola:
preliminary result: no yes
lola: memory consumption: 206864 KB
lola: time consumption: 1529 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.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="Peterson-PT-4"
export BK_EXAMINATION="ReachabilityFireability"
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 Peterson-PT-4, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r151-tall-162089151400312"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-4.tgz
mv Peterson-PT-4 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;