Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.0M
-rw-r--r-- 1 mcc users 57K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 285K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.2M May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 4.5M May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.2K Mar 28 15:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Mar 28 15:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 97K Mar 28 15:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 301K Mar 28 15:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.5K Mar 23 02:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 23 02:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 28K Mar 22 11:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Mar 22 11:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.7K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 10 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 2.5M May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-ReachabilityFireability-00
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-ReachabilityFireability-01
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-ReachabilityFireability-02
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-ReachabilityFireability-03
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-ReachabilityFireability-04
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-ReachabilityFireability-05
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-ReachabilityFireability-06
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-ReachabilityFireability-07
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-ReachabilityFireability-08
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-ReachabilityFireability-09
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-ReachabilityFireability-10
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-ReachabilityFireability-11
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-ReachabilityFireability-12
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-ReachabilityFireability-13
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-ReachabilityFireability-14
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620930966142

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 18:36:07] [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-13 18:36:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 18:36:07] [INFO ] Load time of PNML (sax parser for PT used): 161 ms
[2021-05-13 18:36:07] [INFO ] Transformed 108 places.
[2021-05-13 18:36:07] [INFO ] Transformed 2228 transitions.
[2021-05-13 18:36:07] [INFO ] Parsed PT model containing 108 places and 2228 transitions in 214 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 74 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 57 resets, run finished after 276 ms. (steps per millisecond=36 ) properties seen :[1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 88 ms. (steps per millisecond=113 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 986 ms. (steps per millisecond=10 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 93 ms. (steps per millisecond=107 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 93 ms. (steps per millisecond=107 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 92 ms. (steps per millisecond=108 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 96 ms. (steps per millisecond=104 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 90 ms. (steps per millisecond=111 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 91 ms. (steps per millisecond=109 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 93 ms. (steps per millisecond=107 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 93 ms. (steps per millisecond=107 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 88 ms. (steps per millisecond=113 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 78 ms. (steps per millisecond=128 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 92 ms. (steps per millisecond=108 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
[2021-05-13 18:36:10] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2021-05-13 18:36:10] [INFO ] Computed 7 place invariants in 14 ms
[2021-05-13 18:36:10] [INFO ] [Real]Absence check using 7 positive place invariants in 21 ms returned sat
[2021-05-13 18:36:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:36:10] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2021-05-13 18:36:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:36:10] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2021-05-13 18:36:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:36:10] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2021-05-13 18:36:10] [INFO ] State equation strengthened by 102 read => feed constraints.
[2021-05-13 18:36:10] [INFO ] [Nat]Added 102 Read/Feed constraints in 39 ms returned sat
[2021-05-13 18:36:11] [INFO ] Computed and/alt/rep : 2225/114389/287 causal constraints in 289 ms.
[2021-05-13 18:36:15] [INFO ] Added : 215 causal constraints over 43 iterations in 4685 ms. Result :unknown
[2021-05-13 18:36:15] [INFO ] [Real]Absence check using 7 positive place invariants in 24 ms returned unsat
[2021-05-13 18:36:15] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2021-05-13 18:36:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:36:15] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2021-05-13 18:36:16] [INFO ] [Real]Added 102 Read/Feed constraints in 26 ms returned sat
[2021-05-13 18:36:16] [INFO ] Computed and/alt/rep : 2225/114389/287 causal constraints in 155 ms.
[2021-05-13 18:36:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:36:16] [INFO ] [Nat]Absence check using 7 positive place invariants in 11 ms returned sat
[2021-05-13 18:36:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:36:16] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2021-05-13 18:36:16] [INFO ] [Nat]Added 102 Read/Feed constraints in 75 ms returned sat
[2021-05-13 18:36:16] [INFO ] Computed and/alt/rep : 2225/114389/287 causal constraints in 137 ms.
[2021-05-13 18:36:21] [INFO ] Added : 215 causal constraints over 43 iterations in 4732 ms. Result :(error "Solver has unexpectedly terminated")
[2021-05-13 18:36:21] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2021-05-13 18:36:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:36:21] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2021-05-13 18:36:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:36:21] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2021-05-13 18:36:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:36:21] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2021-05-13 18:36:21] [INFO ] [Nat]Added 102 Read/Feed constraints in 29 ms returned sat
[2021-05-13 18:36:21] [INFO ] Computed and/alt/rep : 2225/114389/287 causal constraints in 147 ms.
[2021-05-13 18:36:26] [INFO ] Added : 220 causal constraints over 44 iterations in 4800 ms. Result :(error "Solver has unexpectedly terminated")
[2021-05-13 18:36:26] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2021-05-13 18:36:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:36:26] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2021-05-13 18:36:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:36:26] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2021-05-13 18:36:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:36:26] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2021-05-13 18:36:26] [INFO ] [Nat]Added 102 Read/Feed constraints in 25 ms returned sat
[2021-05-13 18:36:27] [INFO ] Computed and/alt/rep : 2225/114389/287 causal constraints in 103 ms.
[2021-05-13 18:36:31] [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 (=> (> t222 0) (or (and (or (and (> t0 0) (< o0 o222)) (and (> t271 0) (< o271 o222))) (or (and (> t116 0) (< o116 o222)) (and (> t117 0) (< o117 o222)) (and (> t118 0) (< o118 o222)) (and (> t119 0) (< o119 o222)) (and (> t120 0) (< o120 o222)) (and (> t121 0) (< o121 o222)) (and (> t122 0) (< o122 o222)) (and (> t123 0) (< o123 o222)) (and (> t124 0) (< o124 o222)) (and (> t125 0) (< o125 o222)) (and (> t126 0) (< o126 o222)) (and (> t127 0) (< o127 o222)) (and (> t128 0) (< o128 o222)) (and (> t129 0) (< o129 o222)) (and (> t130 0) (< o130 o222)) (and (> t131 0) (< o131 o222)) (and (> t132 0) (< o132 o222)) (and (> t133 0) (< o133 o222)) (and (> t134 0) (< o134 o222)) (and (> t135 0) (< o135 o222)) (and (> t136 0) (< o136 o222)) (and (> t137 0) (< o137 o222)) (and (> t138 0) (< o138 o222)) (and (> t139 0) (< o139 o222)) (and (> t140 0) (< o140 o222)) (and (> t141 0) (< o141 o222)) (and (> t142 0) (< o142 o222)) (and (> t143 0) (< o143 o222)) (and (> t144 0) (< o144 o222)) (and (> t145 0) (< o145 o222)) (and (> t146 0) (< o146 o222)) (and (> t147 0) (< o147 o222)) (and (> t148 0) (< o148 o222)) (and (> t149 0) (< o149 o222)) (and (> t150 0) (< o150 o222)) (and (> t151 0) (< o151 o222)) (and (> t152 0) (< o152 o222)) (and (> t153 0) (< o153 o222)) (and (> t154 0) (< o154 o222)) (and (> t155 0) (< o155 o222)) (and (> t156 0) (< o156 o222)) (and (> t157 0) (< o157 o222)) (and (> t158 0) (< o158 o222)) (and (> t159 0) (< o159 o222)) (and (> t160 0) (< o160 o222)) (and (> t161 0) (< o161 o222)) (and (> t162 0) (< o162 o222)) (and (> t163 0) (< o163 o222)) (and (> t164 0) (< o164 o222)) (and (> t165 0) (< o165 o222))) (or (and (> t68 0) (< o68 o222)) (and (> t118 0) (< o118 o222)))) (and (or (and (> t1 0) (< o1 o222)) (and (> t272 0) (< o272 o222))) (or (and (> t116 0) (< o116 o222)) (and (> t117 0) (< o117 o222)) (and (> t118 0) (< o118 o222)) (and (> t119 0) (< o119 o222)) (and (> t120 0) (< o120 o222)) (and (> t121 0) (< o121 o222)) (and (> t122 0) (< o122 o222)) (and (> t123 0) (< o123 o222)) (and (> t124 0) (< o124 o222)) (and (> t125 0) (< o125 o222)) (and (> t126 0) (< o126 o222)) (and (> t127 0) (< o127 o222)) (and (> t128 0) (< o128 o222)) (and (> t129 0) (< o129 o222)) (and (> t130 0) (< o130 o222)) (and (> t131 0) (< o131 o222)) (and (> t132 0) (< o132 o222)) (and (> t133 0) (< o133 o222)) (and (> t134 0) (< o134 o222)) (and (> t135 0) (< o135 o222)) (and (> t136 0) (< o136 o222)) (and (> t137 0) (< o137 o222)) (and (> t138 0) (< o138 o222)) (and (> t139 0) (< o139 o222)) (and (> t140 0) (< o140 o222)) (and (> t141 0) (< o141 o222)) (and (> t142 0) (< o142 o222)) (and (> t143 0) (< o143 o222)) (and (> t144 0) (< o144 o222)) (and (> t145 0) (< o145 o222)) (and (> t146 0) (< o146 o222)) (and (> t147 0) (< o147 o222)) (and (> t148 0) (< o148 o222)) (and (> t149 0) (< o149 o222)) (and (> t150 0) (< o150 o222)) (and (> t151 0) (< o151 o222)) (and (> t152 0) (< o152 o222)) (and (> t153 0) (< o153 o222)) (and (> t154 0) (< o154 o222)) (and (> t155 0) (< o155 o222)) (and (> t156 0) (< o156 o222)) (and (> t157 0) (< o157 o222)) (and (> t158 0) (< o158 o222)) (and (> t159 0) (< o159 o222)) (and (> t160 0) (< o160 o222)) (and (> t161 0) (< o161 o222)) (and (> t162 0) (< o162 o222)) (and (> t163 0) (< o163 o222)) (and (> t164 0) (< o164 o222)) (and (> t165 0) (< o165 o222))) (or (and (> t68 0) (< o68 o222)) (and (> t118 0) (< o118 o222)))) (and (or (and (> t2 0) (< o2 o222)) (and (> t273 0) (< o273 o222))) (or (and (> t116 0) (< o116 o222)) (and (> t117 0) (< o117 o222)) (and (> t118 0) (< o118 o222)) (and (> t119 0) (< o119 o222)) (and (> t120 0) (< o120 o222)) (and (> t121 0) (< o121 o222)) (and (> t122 0) (< o122 o222)) (and (> t123 0) (< o123 o222)) (and (> t124 0) (< o124 o222)) (and (> t125 0) (< o125 o222)) (and (> t126 0) (< o126 o222)) (and (> t127 0) (< o127 o222)) (and (> t128 0) (< o128 o222)) (and (> t129 0) (< o129 o222)) (and (> t130 0) (< o130 o222)) (and (> t131 0) (< o131 o222)) (and (> t132 0) (< o132 o222)) (and (> t133 0) (< o133 o222)) (and (> t134 0) (< o134 o222)) (and (> t135 0) (< o135 o222)) (and (> t136 0) (< o136 o222)) (and (> t137 0) (< o137 o222)) (and (> t138 0) (< o138 o222)) (and (> t139 0) (< o139 o222)) (and (> t140 0) (< o140 o222)) (and (> t141 0) (< o141 o222)) (and (> t142 0) (< o142 o222)) (and (> t143 0) (< o143 o222)) (and (> t144 0) (< o144 o222)) (and (> t145 0) (< o145 o222)) (and (> t146 0) (< o146 o222)) (and (> t147 0) (< o147 o222)) (and (> t148 0) (< o148 o222)) (and (> t149 0) (< o149 o222)) (and (> t150 0) (< o150 o222)) (and (> t151 0) (< o151 o222)) (and (> t152 0) (< o152 o222)) (and (> t153 0) (< o153 o222)) (and (> t154 0) (< o154 o222)) (and (> t155 0) (< o155 o222)) (and (> t156 0) (< o156 o222)) (and (> t157 0) (< o157 o222)) (and (> t158 0) (< o158 o222)) (and (> t159 0) (< o159 o222)) (and (> t160 0) (< o160 o222)) (and (> t161 0) (< o161 o222)) (and (> t162 0) (< o162 o222)) (and (> t163 0) (< o163 o222)) (and (> t164 0) (< o164 o222)) (and (> t165 0) (< o165 o222))) (or (and (> t68 0) (< o68 o222)) (and (> t118 0) (< o118 o222)))) (and (or (and (> t3 0) (< o3 o222)) (and (> t274 0) (< o274 o222))) (or (and (> t116 0) (< o116 o222)) (and (> t117 0) (< o117 o222)) (and (> t118 0) (< o118 o222)) (and (> t119 0) (< o119 o222)) (and (> t120 0) (< o120 o222)) (and (> t121 0) (< o121 o222)) (and (> t122 0) (< o122 o222)) (and (> t123 0) (< o123 o222)) (and (> t124 0) (< o124 o222)) (and (> t125 0) (< o125 o222)) (and (> t126 0) (< o126 o222)) (and (> t127 0) (< o127 o222)) (and (> t128 0) (< o128 o222)) (and (> t129 0) (< o129 o222)) (and (> t130 0) (< o130 o222)) (and (> t131 0) (< o131 o222)) (and (> t132 0) (< o132 o222)) (and (> t133 0) (< o133 o222)) (and (> t134 0) (< o134 o222)) (and (> t135 0) (< o135 o222)) (and (> t136 0) (< o136 o222)) (and (> t137 0) (< o137 o222)) (and (> t138 0) (< o138 o222)) (and (> t139 0) (< o139 o222)) (and (> t140 0) (< o140 o222)) (and (> t141 0) (< o141 o222)) (and (> t142 0) (< o142 o222)) (and (> t143 0) (< o143 o222)) (and (> t144 0) (< o144 o222)) (and (> t145 0) (< o145 o222)) (and (> t146 0) (< o146 o222)) (and (> t147 0) (< o147 o222)) (and (> t148 0) (< o148 o222)) (and (> t149 0) (< o149 o222)) (and (> t150 0) (< o150 o222)) (and (> t151 0) (< o151 o222)) (and (> t152 0) (< o152 o222)) (and (> t153 0) (< o153 o222)) (and (> t154 0) (< o154 o222)) (and (> t155 0) (< o155 o222)) (and (> t156 0) (< o156 o222)) (and (> t157 0) (< o157 o222)) (and (> t158 0) (< o158 o222)) (and (> t159 0) (< o159 o222)) (and (> t160 0) (< o160 o222)) (and (> t161 0) (< o161 o222)) (and (> t162 0) (< o162 o222)) (and (> t163 0) (< o163 o222)) (and (> t164 0) (< o164 o222)) (and (> t165 0) (< o165 o222))) (or (and (> t68 0) (< o68 o222)) (and (> t118 0) (< o118 o222)))) (and (or (and (> t4 0) (< o4 o222)) (and (> t275 0) (< o275 o222))) (or (and (> t116 0) (< o116 o222)) (and (> t117 0) (< o117 o222)) (and (> t118 0) (< o118 o222)) (and (> t119 0) (< o119 o222)) (and (> t120 0) (< o120 o222)) (and (> t121 0) (< o121 o222)) (and (> t122 0) (< o122 o222)) (and (> t123 0) (< o123 o222)) (and (> t124 0) (< o124 o222)) (and (> t125 0) (< o125 o222)) (and (> t126 0) (< o126 o222)) (and (> t127 0) (< o127 o222)) (and (> t128 0) (< o128 o222)) (and (> t129 0) (< o129 o222)) (and (> t130 0) (< o130 o222)) (and (> t131 0) (< o131 o222)) (and (> t132 0) (< o132 o222)) (and (> t133 0) (< o133 o222)) (and (> t134 0) (< o134 o222)) (and (> t135 0) (< o135 o222)) (and (> t136 0) (< o136 o222)) (and (> t137 0) (< o137 o222)) (and (> t138 0) (< o138 o222)) (and (> t139 0) (< o139 o222)) (and (> t140 0) (< o140 o222)) (and (> t141 0) (< o141 o222)) (and (> t142 0) (< o142 o222)) (and (> t143 0) (< o143 o222)) (and (> t144 0) (< o144 o222)) (and (> t145 0) (< o145 o222)) (and (> t146 0) (< o146 o222)) (and (> t147 0) (< o147 o222)) (and (> t148 0) (< o148 o222)) (and (> t149 0) (< o149 o222)) (and (> t150 0) (< o150 o222)) (and (> t151 0) (< o151 o222)) (and (> t152 0) (< o152 o222)) (and (> t153 0) (< o153 o222)) (and (> t154 0) (< o154 o222)) (and (> t155 0) (< o155 o222)) (and (> t156 0) (< o156 o222)) (and (> t157 0) (< o157 o222)) (and (> t158 0) (< o158 o222)) (and (> t159 0) (< o159 o222)) (and (> t160 0) (< o160 o222)) (and (> t161 0) (< o161 o222)) (and (> t162 0) (< o162 o222)) (and (> t163 0) (< o163 o222)) (and (> t164 0) (< o164 o222)) (and (> t165 0) (< o165 o222))) (or (and (> t68 0) (< o68 o222)) (and (> t118 0) (< o118 o222)))) (and (or (and (> t5 0) (< o5 o222)) (and (> t276 0) (< o276 o222))) (or (and (> t116 0) (< o116 o222)) (and (> t117 0) (< o117 o222)) (and (> t118 0) (< o118 o222)) (and (> t119 0) (< o119 o222)) (and (> t120 0) (< o120 o222)) (and (> t121 0) (< o121 o222)) (and (> t122 0) (< o122 o222)) (and (> t123 0) (< o123 o222)) (and (> t124 0) (< o124 o222)) (and (> t125 0) (< o125 o222)) (and (> t126 0) (< o126 o222)) (and (> t127 0) (< o127 o222)) (and (> t128 0) (< o128 o222)) (and (> t129 0) (< o129 o222)) (and (> t130 0) (< o130 o222)) (and (> t131 0) (< o131 o222)) (and (> t132 0) (< o132 o222)) (and (> t133 0) (< o133 o222)) (and (> t134 0) (< o134 o222)) (and (> t135 0) (< o135 o222)) (and (> t136 0) (< o136 o222)) (and (> t137 0) (< o137 o222)) (and (> t138 0) (< o138 o222)) (and (> t139 0) (< o139 o222)) (and (> t140 0) (< o140 o222)) (and (> t141 0) (< o141 o222)) (and (> t142 0) (< o142 o222)) (and (> t143 0) (< o143 o222)) (and (> t144 0) (< o144 o222)) (and (> t145 0) (< o145 o222)) (and (> t146 0) (< o146 o222)) (and (> t147 0) (< o147 o222)) (and (> t148 0) (< o148 o222)) (and (> t149 0) (< o149 o222)) (and (> t150 0) (< o150 o222)) (and (> t151 0) (< o151 o222)) (and (> t152 0) (< o152 o222)) (and (> t153 0) (< o153 o222)) (and (> t154 0) (< o154 o222)) (and (> t155 0) (< o155 o222)) (and (> t156 0) (< o156 o222)) (and (> t157 0) (< o157 o222)) (and (> t158 0) (< o158 o222)) (and (> t159 0) (< o159 o222)) (and (> t160 0) (< o160 o222)) (and (> t161 0) (< o161 o222)) (and (> t162 0) (< o162 o222)) (and (> t163 0) (< o163 o222)) (and (> t164 0) (< o164 o222)) (and (> t165 0) (< o165 o222))) (or (and (> t68 0) (< o68 o222)) (and (> t118 0) (< o118 o222)))) (and (or (and (> t6 0) (< o6 o222)) (and (> t277 0) (< o277 o222))) (or (and (> t116 0) (< o116 o222)) (and (> t117 0) (< o117 o222)) (and (> t118 0) (< o118 o222)) (and (> t119 0) (< o119 o222)) (and (> t120 0) (< o120 o222)) (and (> t121 0) (< o121 o222)) (and (> t122 0) (< o122 o222)) (and (> t123 0) (< o123 o222)) (and (> t124 0) (< o124 o222)) (and (> t125 0) (< o125 o222)) (and (> t126 0) (< o126 o222)) (and (> t127 0) (< o127 o222)) (and (> t128 0) (< o128 o222)) (and (> t129 0) (< o129 o222)) (and (> t130 0) (< o130 o222)) (and (> t131 0) (< o131 o222)) (and (> t132 0) (< o132 o222)) (and (> t133 0) (< o133 o222)) (and (> t134 0) (< o134 o222)) (and (> t135 0) (< o135 o222)) (and (> t136 0) (< o136 o222)) (and (> t137 0) (< o137 o222)) (and (> t138 0) (< o138 o222)) (and (> t139 0) (< o139 o222)) (and (> t140 0) (< o140 o222)) (and (> t141 0) (< o141 o222)) (and (> t142 0) (< o142 o222)) (and (> t143 0) (< o143 o222)) (and (> t144 0) (< o144 o222)) (and (> t145 0) (< o145 o222)) (and (> t146 0) (< o146 o222)) (and (> t147 0) (< o147 o222)) (and (> t148 0) (< o148 o222)) (and (> t149 0) (< o149 o222)) (and (> t150 0) (< o150 o222)) (and (> t151 0) (< o151 o222)) (and (> t152 0) (< o152 o222)) (and (> t153 0) (< o153 o222)) (and (> t154 0) (< o154 o222)) (and (> t155 0) (< o155 o222)) (and (> t156 0) (< o156 o222)) (and (> t157 0) (< o157 o222)) (and (> t158 0) (< o158 o222)) (and (> t159 0) (< o159 o222)) (and (> t160 0) (< o160 o222)) (and (> t161 0) (< o161 o222)) (and (> t162 0) (< o162 o222)) (and (> t163 0) (< o163 o222)) (and (> t164 0) (< o164 o222)) (and (> t165 0) (< o165 o222))) (or (and (> t68 0) (< o68 o222)) (and (> t118 0) (< o118 o222)))) (and (or (and (> t7 0) (< o7 o222)) (and (> t278 0) (< o278 o222))) (or (and (> t116 0) (< o116 o222)) (and (> t117 0) (< o117 o222)) (and (> t118 0) (< o118 o222)) (and (> t119 0) (< o119 o222)) (and (> t120 0) (< o120 o222)) (and (> t121 0) (< o121 o222)) (and (> t122 0) (< o122 o222)) (and (> t123 0) (< o123 o222)) (and (> t124 0) (< o124 o222)) (and (> t125 0) (< o125 o222)) (and (> t126 0) (< o126 o222)) (and (> t127 0) (< o127 o222)) (and (> t128 0) (< o128 o222)) (and (> t129 0) (< o129 o222)) (and (> t130 0) (< o130 o222)) (and (> t131 0) (< o131 o222)) (and (> t132 0) (< o132 o222)) (and (> t133 0) (< o133 o222)) (and (> t134 0) (< o134 o222)) (and (> t135 0) (< o135 o222)) (and (> t136 0) (< o136 o222)) (and (> t137 0) (< o137 o222)) (and (> t138 0) (< o138 o222)) (and (> t139 0) (< o139 o222)) (and (> t140 0) (< o140 o222)) (and (> t141 0) (< o141 o222)) (and (> t142 0) (< o142 o222)) (and (> t143 0) (< o143 o222)) (and (> t144 0) (< o144 o222)) (and (> t145 0) (< o145 o222)) (and (> t146 0) (< o146 o222)) (and (> t147 0) (< o147 o222)) (and (> t148 0) (< o148 o222)) (and (> t149 0) (< o149 o222)) (and (> t150 0) (< o150 o222)) (and (> t151 0) (< o151 o222)) (and (> t152 0) (< o152 o222)) (and (> t153 0) (< o153 o222)) (and (> t154 0) (< o154 o222)) (and (> t155 0) (< o155 o222)) (and (> t156 0) (< o156 o222)) (and (> t157 0) (< o157 o222)) (and (> t158 0) (< o158 o222)) (and (> t159 0) (< o159 o222)) (and (> t160 0) (< o160 o222)) (and (> t161 0) (< o161 o222)) (and (> t162 0) (< o162 o222)) (and (> t163 0) (< o163 o222)) (and (> t164 0) (< o164 o222)) (and (> t165 0) (< o165 o222))) (or (and (> t68 0) (< o68 o222)) (and (> t118 0) (< o118 o222)))) (and (or (and (> t8 0) (< o8 o222)) (and (> t279 0) (< o279 o222))) (or (and (> t116 0) (< o116 o222)) (and (> t117 0) (< o117 o222)) (and (> t118 0) (< o118 o222)) (and (> t119 0) (< o119 o222)) (and (> t120 0) (< o120 o222)) (and (> t121 0) (< o121 o222)) (and (> t122 0) (< o122 o222)) (and (> t123 0) (< o123 o222)) (and (> t124 0) (< o124 o222)) (and (> t125 0) (< o125 o222)) (and (> t126 0) (< o126 o222)) (and (> t127 0) (< o127 o222)) (and (> t128 0) (< o128 o222)) (and (> t129 0) (< o129 o222)) (and (> t130 0) (< o130 o222)) (and (> t131 0) (< o131 o222)) (and (> t132 0) (< o132 o222)) (and (> t133 0) (< o133 o222)) (and (> t134 0) (< o134 o222)) (and (> t135 0) (< o135 o222)) (and (> t136 0) (< o136 o222)) (and (> t137 0) (< o137 o222)) (and (> t138 0) (< o138 o222)) (and (> t139 0) (< o139 o222)) (and (> t140 0) (< o140 o222)) (and (> t141 0) (< o141 o222)) (and (> t142 0) (< o142 o222)) (and (> t143 0) (< o143 o222)) (and (> t144 0) (< o144 o222)) (and (> t145 0) (< o145 o222)) (and (> t146 0) (< o146 o222)) (and (> t147 0) (< o147 o222)) (and (> t148 0) (< o148 o222)) (and (> t149 0) (< o149 o222)) (and (> t150 0) (< o150 o222)) (and (> t151 0) (< o151 o222)) (and (> t152 0) (< o152 o222)) (and (> t153 0) (< o153 o222)) (and (> t154 0) (< o154 o222)) (and (> t155 0) (< o155 o222)) (and (> t156 0) (< o156 o222)) (and (> t157 0) (< o157 o222)) (and (> t158 0) (< o158 o222)) (and (> t159 0) (< o159 o222)) (and (> t160 0) (< o160 o222)) (and (> t161 0) (< o161 o222)) (and (> t162 0) (< o162 o222)) (and (> t163 0) (< o163 o222)) (and (> t164 0) (< o164 o222)) (and (> t165 0) (< o165 o222))) (or (and (> t68 0) (< o68 o222)) (and (> t118 0) (< o118 o222)))) (and (or (and (> t9 0) (< o9 o222)) (and (> t280 0) (< o280 o222))) (or (and (> t116 0) (< o116 o222)) (and (> t117 0) (< o117 o222)) (and (> t118 0) (< o118 o222)) (and (> t119 0) (< o119 o222)) (and (> t120 0) (< o120 o222)) (and (> t121 0) (< o121 o222)) (and (> t122 0) (< o122 o222)) (and (> t123 0) (< o123 o222)) (and (> t124 0) (< o124 o222)) (and (> t125 0) (< o125 o222)) (and (> t126 0) (< o126 o222)) (and (> t127 0) (< o127 o222)) (and (> t128 0) (< o128 o222)) (and (> t129 0) (< o129 o222)) (and (> t130 0) (< o130 o222)) (and (> t131 0) (< o131 o222)) (and (> t132 0) (< o132 o222)) (and (> t133 0) (< o133 o222)) (and (> t134 0) (< o134 o222)) (and (> t135 0) (< o135 o222)) (and (> t136 0) (< o136 o222)) (and (> t137 0) (< o137 o222)) (and (> t138 0) (< o138 o222)) (and (> t139 0) (< o139 o222)) (and (> t140 0) (< o140 o222)) (and (> t141 0) (< o141 o222)) (and (> t142 0) (< o142 o222)) (and (> t143 0) (< o143 o222)) (and (> t144 0) (< o144 o222)) (and (> t145 0) (< o145 o222)) (and (> t146 0) (< o146 o222)) (and (> t147 0) (< o147 o222)) (and (> t148 0) (< o148 o222)) (and (> t149 0) (< o149 o222)) (and (> t150 0) (< o150 o222)) (and (> t151 0) (< o151 o222)) (and (> t152 0) (< o152 o222)) (and (> t153 0) (< o153 o222)) (and (> t154 0) (< o154 o222)) (and (> t155 0) (< o155 o222)) (and (> t156 0) (< o156 o222)) (and (> t157 0) (< o157 o222)) (and (> t158 0) (< o158 o222)) (and (> t159 0) (< o159 o222)) (and (> t160 0) (< o160 o222)) (and (> t161 0) (< o161 o222)) (and (> t162 0) (< o162 o222)) (and (> t163 0) (< o163 o222)) (and (> t164 0) (< o164 o222)) (and (> t165 0) (< o165 o222))) (or (and (> t68 0) (< o68 o222)) (and (> t118 0) (< o118 o222)))) (and (or (and (> t10 0) (< o10 o222)) (and (> t281 0) (< o281 o222))) (or (and (> t116 0) (< o116 o222)) (and (> t117 0) (< o117 o222)) (and (> t118 0) (< o118 o222)) (and (> t119 0) (< o119 o222)) (and (> t120 0) (< o120 o222)) (and (> t121 0) (< o121 o222)) (and (> t122 0) (< o122 o222)) (and (> t123 0) (< o123 o222)) (and (> t124 0) (< o124 o222)) (and (> t125 0) (< o125 o222)) (and (> t126 0) (< o126 o222)) (and (> t127 0) (< o127 o222)) (and (> t128 0) (< o128 o222)) (and (> t129 0) (< o129 o222)) (and (> t130 0) (< o130 o222)) (and (> t131 0) (< o131 o222)) (and (> t132 0) (< o132 o222)) (and (> t133 0) (< o133 o222)) (and (> t134 0) (< o134 o222)) (and (> t135 0) (< o135 o222)) (and (> t136 0) (< o136 o222)) (and (> t137 0) (< o137 o222)) (and (> t138 0) (< o138 o222)) (and (> t139 0) (< o139 o222)) (and (> t140 0) (< o140 o222)) (and (> t141 0) (< o141 o222)) (and (> t142 0) (< o142 o222)) (and (> t143 0) (< o143 o222)) (and (> t144 0) (< o144 o222)) (and (> t145 0) (< o145 o222)) (and (> t146 0) (< o146 o222)) (and (> t147 0) (< o147 o222)) (and (> t148 0) (< o148 o222)) (and (> t149 0) (< o149 o222)) (and (> t150 0) (< o150 o222)) (and (> t151 0) (< o151 o222)) (and (> t152 0) (< o152 o222)) (and (> t153 0) (< o153 o222)) (and (> t154 0) (< o154 o222)) (and (> t155 0) (< o155 o222)) (and (> t156 0) (< o156 o222)) (and (> t157 0) (< o157 o222)) (and (> t158 0) (< o158 o222)) (and (> t159 0) (< o159 o222)) (and (> t160 0) (< o160 o222)) (and (> t161 0) (< o161 o222)) (and (> t162 0) (< o162 o222)) (and (> t163 0) (< o163 o222)) (and (> t164 0) (< o164 o222)) (and (> t165 0) (< o165 o222))) (or (and (> t68 0) (< o68 o222)) (and (> t118 0) (< o118 o222)))) (and (or (and (> t11 0) (< o11 o222)) (and (> t282 0) (< o282 o222))) (or (and (> t116 0) (< o116 o222)) (and (> t117 0) (< o117 o222)) (and (> t118 0) (< o118 o222)) (and (> t119 0) (< o119 o222)) (and (> t120 0) (< o120 o222)) (and (> t121 0) (< o121 o222)) (and (> t122 0) (< o122 o222)) (and (> t123 0) (< o123 o222)) (and (> t124 0) (< o124 o222)) (and (> t125 0) (< o125 o222)) (and (> t126 0) (< o126 o222)) (and (> t127 0) (< o127 o222)) (and (> t128 0) (< o128 o222)) (and (> t129 0) (< o129 o222)) (and (> t130 0) (< o130 o222)) (and (> t131 0) (< o131 o222)) (and (> t132 0) (< o132 o222)) (and (> t133 0) (< o133 o222)) (and (> t134 0) (< o134 o222)) (and (> t135 0) (< o135 o222)) (and (> t136 0) (< o136 o222)) (and (> t137 0) (< o137 o222)) (and (> t138 0) (< o138 o222)) (and (> t139 0) (< o139 o222)) (and (> t140 0) (< o140 o222)) (and (> t141 0) (< o141 o222)) (and (> t142 0) (< o142 o222)) (and (> t143 0) (< o143 o222)) (and (> t144 0) (< o144 o222)) (and (> t145 0) (< o145 o222)) (and (> t146 0) (< o146 o222)) (and (> t147 0) (< o147 o222)) (and (> t148 0) (< o148 o222)) (and (> t149 0) (< o149 o222)) (and (> t150 0) (< o150 o222)) (and (> t151 0) (< o151 o222)) (and (> t152 0) (< o152 o222)) (and (> t153 0) (< o153 o222)) (and (> t154 0) (< o154 o222)) (and (> t155 0) (< o155 o222)) (and (> t156 0) (< o156 o222)) (and (> t157 0) (< o157 o222)) (and (> t158 0) (< o158 o222)) (and (> t159 0) (< o159 o222)) (and (> t160 0) (< o160 o222)) (and (> t161 0) (< o161 o222)) (and (> t162 0) (< o162 o222)) (and (> t163 0) (< o163 o222)) (and (> t164 0) (< o164 o222)) (and (> t165 0) (< o165 o222))) (or (and (> t68 0) (< o68 o222)) (and (> t118 0) (< o118 o222)))) (and (or (and (> t12 0) (< o12 o222)) (and (> t283 0) (< o283 o222))) (or (and (> t116 0) (< o116 o222)) (and (> t117 0) (< o117 o222)) (and (> t118 0) (< o118 o222)) (and (> t119 0) (< o119 o222)) (and (> t120 0) (< o120 o222)) (and (> t121 0) (< o121 o222)) (and (> t122 0) (< o122 o222)) (and (> t123 0) (< o123 o222)) (and (> t124 0) (< o124 o222)) (and (> t125 0) (< o125 o222)) (and (> t126 0) (< o126 o222)) (and (> t127 0) (< o127 o222)) (and (> t128 0) (< o128 o222)) (and (> t129 0) (< o129 o222)) (and (> t130 0) (< o130 o222)) (and (> t131 0) (< o131 o222)) (and (> t132 0) (< o132 o222)) (and (> t133 0) (< o133 o222)) (and (> t134 0) (< o134 o222)) (and (> t135 0) (< o135 o222)) (and (> t136 0) (< o136 o222)) (and (> t137 0) (< o137 o222)) (and (> t138 0) (< o138 o222)) (and (> t139 0) (< o139 o222)) (and (> t140 0) (< o140 o222)) (and (> t141 0) (< o141 o222)) (and (> t142 0) (< o142 o222)) (and (> t143 0) (< o143 o222)) (and (> t144 0) (< o144 o222)) (and (> t145 0) (< o145 o222)) (and (> t146 0) (< o146 o222)) (and (> t147 0) (< o147 o222)) (and (> t148 0) (< o148 o222)) (and (> t149 0) (< o149 o222)) (and (> t150 0) (< o150 o222)) (and (> t151 0) (< o151 o222)) (and (> t152 0) (< o152 o222)) (and (> t153 0) (< o153 o222)) (and (> t154 0) (< o154 o222)) (and (> t155 0) (< o155 o222)) (and (> t156 0) (< o156 o222)) (and (> t157 0) (< o157 o222)) (and (> t158 0) (< o158 o222)) (and (> t159 0) (< o159 o222)) (and (> t160 0) (< o160 o222)) (and (> t161 0) (< o161 o222)) (and (> t162 0) (< o162 o222)) (and (> t163 0) (< o163 o222)) (and (> t164 0) (< o164 o222)) (and (> t165 0) (< o165 o222))) (or (and (> t68 0) (< o68 o222)) (and (> t118 0) (< o118 o222)))) (and (or (and (> t13 0) (< o13 o222)) (and (> t284 0) (< o284 o222))) (or (and (> t116 0) (< o116 o222)) (and (> t117 0) (< o117 o222)) (and (> t118 0) (< o118 o222)) (and (> t119 0) (< o119 o222)) (and (> t120 0) (< o120 o222)) (and (> t121 0) (< o121 o222)) (and (> t122 0) (< o122 o222)) (and (> t123 0) (< o123 o222)) (and (> t124 0) (< o124 o222)) (and (> t125 0) (< o125 o222)) (and (> t126 0) (< o126 o222)) (and (> t127 0) (< o127 o222)) (and (> t128 0) (< o128 o222)) (and (> t129 0) (< o129 o222)) (and (> t130 0) (< o130 o222)) (and (> t131 0) (< o131 o222)) (and (> t132 0) (< o132 o222)) (and (> t133 0) (< o133 o222)) (and (> t134 0) (< o134 o222)) (and (> t135 0) (< o135 o222)) (and (> t136 0) (< o136 o222)) (and (> t137 0) (< o137 o222)) (and (> t138 0) (< o138 o222)) (and (> t139 0) (< o139 o222)) (and (> t140 0) (< o140 o222)) (and (> t141 0) (< o141 o222)) (and (> t142 0) (< o142 o222)) (and (> t143 0) (< o143 o222)) (and (> t144 0) (< o144 o222)) (and (> t145 0) (< o145 o222)) (and (> t146 0) (< o146 o222)) (and (> t147 0) (< o147 o222)) (and (> t148 0) (< o148 o222)) (and (> t149 0) (< o149 o222)) (and (> t150 0) (< o150 o222)) (and (> t151 0) (< o151 o222)) (and (> t152 0) (< o152 o222)) (and (> t153 0) (< o153 o222)) (and (> t154 0) (< o154 o222)) (and (> t155 0) (< o155 o222)) (and (> t156 0) (< o156 o222)) (and (> t157 0) (< o157 o222)) (and (> t158 0) (< o158 o222)) (and (> t159 0) (< o159 o222)) (and (> t160 0) (< o160 o222)) (and (> t161 0) (< o161 o222)) (and (> t162 0) (< o162 o222)) (and (> t163 0) (< o163 o222)) (and (> t164 0) (< o164 o222)) (and (> t165 0) (< o165 o222))) (or (and (> t68 0) (< o68 o222)) (and (> t118 0) (< o118 o222)))) (and (or (and (> t14 0) (< o14 o222)) (and (> t285 0) (< o285 o222))) (or (and (> t116 0) (< o116 o222)) (and (> t117 0) (< o117 o222)) (and (> t118 0) (< o118 o222)) (and (> t119 0) (< o119 o222)) (and (> t120 0) (< o120 o222)) (and (> t121 0) (< o121 o222)) (and (> t122 0) (< o122 o222)) (and (> t123 0) (< o123 o222)) (and (> t124 0) (< o124 o222)) (and (> t125 0) (< o125 o222)) (and (> t126 0) (< o126 o222)) (and (> t127 0) (< o127 o222)) (and (> t128 0) (< o128 o222)) (and (> t129 0) (< o129 o222)) (and (> t130 0) (< o130 o222)) (and (> t131 0) (< o131 o222)) (and (> t132 0) (< o132 o222)) (and (> t133 0) (< o133 o222)) (and (> t134 0) (< o134 o222)) (and (> t135 0) (< o135 o222)) (and (> t136 0) (< o136 o222)) (and (> t137 0) (< o137 o222)) (and (> t138 0) (< o138 o222)) (and (> t139 0) (< o139 o222)) (and (> t140 0) (< o140 o222)) (and (> t141 0) (< o141 o222)) (and (> t142 0) (< o142 o222)) (and (> t143 0) (< o143 o222)) (and (> t144 0) (< o144 o222)) (and (> t145 0) (< o145 o222)) (and (> t146 0) (< o146 o222)) (and (> t147 0) (< o147 o222)) (and (> t148 0) (< o148 o222)) (and (> t149 0) (< o149 o222)) (and (> t150 0) (< o150 o222)) (and (> t151 0) (< o151 o222)) (and (> t152 0) (< o152 o222)) (and (> t153 0) (< o153 o222)) (and (> t154 0) (< o154 o222)) (and (> t155 0) (< o155 o222)) (and (> t156 0) (< o156 o222)) (and (> t157 0) (< o157 o222)) (and (> t158 0) (< o158 o222)) (and (> t159 0) (< o159 o222)) (and (> t160 0) (< o160 o222)) (and (> t161 0) (< o161 o222)) (and (> t162 0) (< o162 o222)) (and (> t163 0) (< o163 o222)) (and (> t164 0) (< o164 o222)) (and (> t165 0) (< o165 o222))) (or (and (> t68 0) (< o68 o222)) (and (> t118 0) (< o118 o222)))) (and (or (and (> t15 0) (< o15 o222)) (and (> t286 0) (< o286 o222))) (or (and (> t116 0) (< o116 o222)) (and (> t117 0) (< o117 o222)) (and (> t118 0) (< o118 o222)) (and (> t119 0) (< o119 o222)) (and (> t120 0) (< o120 o222)) (and (> t121 0) (< o121 o222)) (and (> t122 0) (< o122 o222)) (and (> t123 0) (< o123 o222)) (and (> t124 0) (< o124 o222)) (and (> t125 0) (< o125 o222)) (and (> t126 0) (< o126 o222)) (and (> t127 0) (< o127 o222)) (and (> t128 0) (< o128 o222)) (and (> t129 0) (< o129 o222)) (and (> t130 0) (< o130 o222)) (and (> t131 0) (< o131 o222)) (and (> t132 0) (< o132 o222)) (and (> t133 0) (< o133 o222)) (and (> t134 0) (< o134 o222)) (and (> t135 0) (< o135 o222)) (and (> t136 0) (< o136 o222)) (and (> t137 0) (< o137 o222)) (and (> t138 0) (< o138 o222)) (and (> t139 0) (< o139 o222)) (and (> t140 0) (< o140 o222)) (and (> t141 0) (< o141 o222)) (and (> t142 0) (< o142 o222)) (and (> t143 0) (< o143 o222)) (and (> t144 0) (< o144 o222)) (and (> t145 0) (< o145 o222)) (and (> t146 0) (< o146 o222)) (and (> t147 0) (< o147 o222)) (and (> t148 0) (< o148 o222)) (and (> t149 0) (< o149 o222)) (and (> t150 0) (< o150 o222)) (and (> t151 0) (< o151 o222)) (and (> t152 0) (< o152 o222)) (and (> t153 0) (< o153 o222)) (and (> t154 0) (< o154 o222)) (and (> t155 0) (< o155 o222)) (and (> t156 0) (< o156 o222)) (and (> t157 0) (< o157 o222)) (and (> t158 0) (< o158 o222)) (and (> t159 0) (< o159 o222)) (and (> t160 0) (< o160 o222)) (and (> t161 0) (< o161 o222)) (and (> t162 0) (< o162 o222)) (and (> t163 0) (< o163 o222)) (and (> t164 0) (< o164 o222)) (and (> t165 0) (< o165 o222))) (or (and (> t68 0) (< o68 o222)) (and (> t118 0) (< o118 o222)))) (and (or (and (> t16 0) (< o16 o222)) (and (> t287 0) (< o287 o222))) (or (and (> t116 0) (< o116 o222)) (and (> t117 0) (< o117 o222)) (and (> t118 0) (< o118 o222)) (and (> t119 0) (< o119 o222)) (and (> t120 0) (< o120 o222)) (and (> t121 0) (< o121 o222)) (and (> t122 0) (< o122 o222)) (and (> t123 0) (< o123 o222)) (and (> t124 0) (< o124 o222)) (and (> t125 0) (< o125 o222)) (and (> t126 0) (< o126 o222)) (and (> t127 0) (< o127 o222)) (and (> t128 0) (< o128 o222)) (and (> t129 0) (< o129 o222)) (and (> t130 0) (< o130 o222)) (and (> t131 0) (< o131 o222)) (and (> t132 0) (< o132 o222)) (and (> t133 0) (< o133 o222)) (and (> t134 0) (< o134 o222)) (and (> t135 0) (< o135 o222)) (and (> t136 0) (< o136 o222)) (and (> t137 0) (< o137 o222)) (and (> t138 0) (< o138 o222)) (and (> t139 0) (< o139 o222)) (and (> t140 0) (< o140 o222)) (and (> t141 0) (< o141 o222)) (and (> t142 0) (< o142 o222)) (and (> t143 0) (< o143 o222)) (and (> t144 0) (< o144 o222)) (and (> t145 0) (< o145 o222)) (and (> t146 0) (< o146 o222)) (and (> t147 0) (< o147 o222)) (and (> t148 0) (< o148 o222)) (and (> t149 0) (< o149 o222)) (and (> t150 0) (< o150 o222)) (and (> t151 0) (< o151 o222)) (and (> t152 0) (< o152 o222)) (and (> t153 0) (< o153 o222)) (and (> t154 0) (< o154 o222)) (and (> t155 0) (< o155 o222)) (and (> t156 0) (< o156 o222)) (and (> t157 0) (< o157 o222)) (and (> t158 0) (< o158 o222)) (and (> t159 0) (< o159 o222)) (and (> t160 0) (< o160 o222)) (and (> t161 0) (< o161 o222)) (and (> t162 0) (< o162 o222)) (and (> t163 0) (< o163 o222)) (and (> t164 0) (< o164 o222)) (and (> t165 0) (< o165 o222))) (or (and (> t68 0) (< o68 o222)) (and (> t118 0) (< o118 o222)))) (and (or (and (> t17 0) (< o17 o222)) (and (> t288 0) (< o288 o222))) (or (and (> t116 0) (< o116 o222)) (and (> t117 0) (< o117 o222)) (and (> t118 0) (< o118 o222)) (and (> t119 0) (< o119 o222)) (and (> t120 0) (< o120 o222)) (and (> t121 0) (< o121 o222)) (and (> t122 0) (< o122 o222)) (and (> t123 0) (< o123 o222)) (and (> t124 0) (< o124 o222)) (and (> t125 0) (< o125 o222)) (and (> t126 0) (< o126 o222)) (and (> t127 0) (< o127 o222)) (and (> t128 0) (< o128 o222)) (and (> t129 0) (< o129 o222)) (and (> t130 0) (< o130 o222)) (and (> t131 0) (< o131 o222)) (and (> t132 0) (< o132 o222)) (and (> t133 0) (< o133 o222)) (and (> t134 0) (< o134 o222)) (and (> t135 0) (< o135 o222)) (and (> t136 0) (< o136 o222)) (and (> t137 0) (< o137 o222)) (and (> t138 0) (< o138 o222)) (and (> t139 0) (< o139 o222)) (and (> t140 0) (< o140 o222)) (and (> t141 0) (< o141 o222)) (and (> t142 0) (< o142 o222)) (and (> t143 0) (< o143 o222)) (and (> t144 0) (< o144 o222)) (and (> t145 0) (< o145 o222)) (and (> t146 0) (< o146 o222)) (and (> t147 0) (< o147 o222)) (and (> t148 0) (< o148 o222)) (and (> t149 0) (< o149 o222)) (and (> t150 0) (< o150 o222)) (and (> t151 0) (< o151 o222)) (and (> t152 0) (< o152 o222)) (and (> t153 0) (< o153 o222)) (and (> t154 0) (< o154 o222)) (and (> t155 0) (< o155 o222)) (and (> t156 0) (< o156 o222)) (and (> t157 0) (< o157 o222)) (and (> t158 0) (< o158 o222)) (and (> t159 0) (< o159 o222)) (and (> t160 0) (< o160 o222)) (and (> t161 0) (< o161 o222)) (and (> t162 0) (< o162 o222)) (and (> t163 0) (< o163 o222)) (and (> t164 0) (< o164 o222)) (and (> t165 0) (< o165 o222))) (or (and (> t68 0) (< o68 o222)) (and (> t118 0) (< o118 o222)))) (and (or (and (> t18 0) (< o18 o222)) (and (> t289 0) (< o289 o222))) (or (and (> t116 0) (< o116 o222)) (and (> t117 0) (< o117 o222)) (and (> t118 0) (< o118 o222)) (and (> t119 0) (< o119 o222)) (and (> t120 0) (< o120 o222)) (and (> t121 0) (< o121 o222)) (and (> t122 0) (< o122 o222)) (and (> t123 0) (< o123 o222)) (and (> t124 0) (< o124 o222)) (and (> t125 0) (< o125 o222)) (and (> t126 0) (< o126 o222)) (and (> t127 0) (< o127 o222)) (and (> t128 0) (< o128 o222)) (and (> t129 0) (< o129 o222)) (and (> t130 0) (< o130 o222)) (and (> t131 0) (< o131 o222)) (and (> t132 0) (< o132 o222)) (and (> t133 0) (< o133 o222)) (and (> t134 0) (< o134 o222)) (and (> t135 0) (< o135 o222)) (and (> t136 0) (< o136 o222)) (and (> t137 0) (< o137 o222)) (and (> t138 0) (< o138 o222)) (and (> t139 0) (< o139 o222)) (and (> t140 0) (< o140 o222)) (and (> t141 0) (< o141 o222)) (and (> t142 0) (< o142 o222)) (and (> t143 0) (< o143 o222)) (and (> t144 0) (< o144 o222)) (and (> t145 0) (< o145 o222)) (and (> t146 0) (< o146 o222)) (and (> t147 0) (< o147 o222)) (and (> t148 0) (< o148 o222)) (and (> t149 0) (< o149 o222)) (and (> t150 0) (< o150 o222)) (and (> t151 0) (< o151 o222)) (and (> t152 0) (< o152 o222)) (and (> t153 0) (< o153 o222)) (and (> t154 0) (< o154 o222)) (and (> t155 0) (< o155 o222)) (and (> t156 0) (< o156 o222)) (and (> t157 0) (< o157 o222)) (and (> t158 0) (< o158 o222)) (and (> t159 0) (< o159 o222)) (and (> t160 0) (< o160 o222)) (and (> t161 0) (< o161 o222)) (and (> t162 0) (< o162 o222)) (and (> t163 0) (< o163 o222)) (and (> t164 0) (< o164 o222)) (and (> t165 0) (< o165 o222))) (or (and (> t68 0) (< o68 o222)) (and (> t118 0) (< o118 o222)))) (and (and (> t19 0) (< o19 o222)) (or (and (> t116 0) (< o116 o222)) (and (> t117 0) (< o117 o222)) (and (> t118 0) (< o118 o222)) (and (> t119 0) (< o119 o222)) (and (> t120 0) (< o120 o222)) (and (> t121 0) (< o121 o222)) (and (> t122 0) (< o122 o222)) (and (> t123 0) (< o123 o222)) (and (> t124 0) (< o124 o222)) (and (> t125 0) (< o125 o222)) (and (> t126 0) (< o126 o222)) (and (> t127 0) (< o127 o222)) (and (> t128 0) (< o128 o222)) (and (> t129 0) (< o129 o222)) (and (> t130 0) (< o130 o222)) (and (> t131 0) (< o131 o222)) (and (> t132 0) (< o132 o222)) (and (> t133 0) (< o133 o222)) (and (> t134 0) (< o134 o222)) (and (> t135 0) (< o135 o222)) (and (> t136 0) (< o136 o222)) (and (> t137 0) (< o137 o222)) (and (> t138 0) (< o138 o222)) (and (> t139 0) (< o139 o222)) (and (> t140 0) (< o140 o222)) (and (> t141 0) (< o141 o222)) (and (> t142 0) (< o142 o222)) (and (> t143 0) (< o143 o222)) (and (> t144 0) (< o144 o222)) (and (> t145 0) (< o145 o222)) (and (> t146 0) (< o146 o222)) (and (> t147 0) (< o147 o222)) (and (> t148 0) (< o148 o222)) (and (> t149 0) (< o149 o222)) (and (> t150 0) (< o150 o222)) (and (> t151 0) (< o151 o222)) (and (> t152 0) (< o152 o222)) (and (> t153 0) (< o153 o222)) (and (> t154 0) (< o154 o222)) (and (> t155 0) (< o155 o222)) (and (> t156 0) (< o156 o222)) (and (> t157 0) (< o157 o222)) (and (> t158 0) (< o158 o222)) (and (> t159 0) (< o159 o222)) (and (> t160 0) (< o160 o222)) (and (> t161 0) (< o161 o222)) (and (> t162 0) (< o162 o222)) (and (> t163 0) (< o163 o222)) (and (> t164 0) (< o164 o222)) (and (> t165 0) (< o165 o222))) (or (and (> t68 0) (< o68 o222)) (and (> t118 0) (< o118 o222))))))") while checking expression at index 4
[2021-05-13 18:36:31] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2021-05-13 18:36:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:36:31] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2021-05-13 18:36:31] [INFO ] [Real]Added 102 Read/Feed constraints in 24 ms returned sat
[2021-05-13 18:36:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:36:32] [INFO ] [Nat]Absence check using 7 positive place invariants in 12 ms returned sat
[2021-05-13 18:36:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:36:32] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2021-05-13 18:36:32] [INFO ] [Nat]Added 102 Read/Feed constraints in 38 ms returned sat
[2021-05-13 18:36:32] [INFO ] Computed and/alt/rep : 2225/114389/287 causal constraints in 166 ms.
[2021-05-13 18:36:36] [INFO ] Added : 205 causal constraints over 41 iterations in 4773 ms. Result :unknown
[2021-05-13 18:36:37] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2021-05-13 18:36:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:36:37] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2021-05-13 18:36:37] [INFO ] [Real]Added 102 Read/Feed constraints in 46 ms returned sat
[2021-05-13 18:36:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:36:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 14 ms returned sat
[2021-05-13 18:36:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:36:37] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2021-05-13 18:36:37] [INFO ] [Nat]Added 102 Read/Feed constraints in 33 ms returned sat
[2021-05-13 18:36:37] [INFO ] Computed and/alt/rep : 2225/114389/287 causal constraints in 79 ms.
[2021-05-13 18:36:42] [INFO ] Added : 185 causal constraints over 37 iterations in 4767 ms. Result :unknown
[2021-05-13 18:36:42] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2021-05-13 18:36:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:36:42] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2021-05-13 18:36:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:36:42] [INFO ] [Nat]Absence check using 7 positive place invariants in 12 ms returned sat
[2021-05-13 18:36:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:36:42] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2021-05-13 18:36:42] [INFO ] [Nat]Added 102 Read/Feed constraints in 45 ms returned sat
[2021-05-13 18:36:42] [INFO ] Computed and/alt/rep : 2225/114389/287 causal constraints in 105 ms.
[2021-05-13 18:36:47] [INFO ] Added : 175 causal constraints over 35 iterations in 4799 ms. Result :unknown
[2021-05-13 18:36:47] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2021-05-13 18:36:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:36:47] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2021-05-13 18:36:47] [INFO ] [Real]Added 102 Read/Feed constraints in 28 ms returned sat
[2021-05-13 18:36:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:36:47] [INFO ] [Nat]Absence check using 7 positive place invariants in 13 ms returned sat
[2021-05-13 18:36:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:36:47] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2021-05-13 18:36:47] [INFO ] [Nat]Added 102 Read/Feed constraints in 34 ms returned sat
[2021-05-13 18:36:47] [INFO ] Computed and/alt/rep : 2225/114389/287 causal constraints in 80 ms.
[2021-05-13 18:36:51] [INFO ] Added : 174 causal constraints over 36 iterations in 3538 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 129 ms.
[2021-05-13 18:36:51] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2021-05-13 18:36:51] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2021-05-13 18:36:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:36:51] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2021-05-13 18:36:51] [INFO ] [Real]Added 102 Read/Feed constraints in 22 ms returned sat
[2021-05-13 18:36:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:36:51] [INFO ] [Nat]Absence check using 7 positive place invariants in 13 ms returned sat
[2021-05-13 18:36:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:36:51] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2021-05-13 18:36:51] [INFO ] [Nat]Added 102 Read/Feed constraints in 44 ms returned sat
[2021-05-13 18:36:52] [INFO ] Computed and/alt/rep : 2225/114389/287 causal constraints in 139 ms.
[2021-05-13 18:36:56] [INFO ] Added : 205 causal constraints over 41 iterations in 4817 ms. Result :unknown
[2021-05-13 18:36:56] [INFO ] [Real]Absence check using 7 positive place invariants in 11 ms returned unsat
[2021-05-13 18:36:56] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2021-05-13 18:36:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:36:57] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2021-05-13 18:36:57] [INFO ] [Real]Added 102 Read/Feed constraints in 26 ms returned sat
[2021-05-13 18:36:57] [INFO ] Computed and/alt/rep : 2225/114389/287 causal constraints in 108 ms.
[2021-05-13 18:36:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:36:57] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2021-05-13 18:36:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:36:57] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2021-05-13 18:36:57] [INFO ] [Nat]Added 102 Read/Feed constraints in 41 ms returned sat
[2021-05-13 18:36:57] [INFO ] Computed and/alt/rep : 2225/114389/287 causal constraints in 82 ms.
[2021-05-13 18:37:00] [INFO ] Added : 119 causal constraints over 26 iterations in 2928 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 68 ms.
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityFireability-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 19900 steps, including 777 resets, run finished after 242 ms. (steps per millisecond=82 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 1203300 steps, including 8032 resets, run finished after 10485 ms. (steps per millisecond=114 ) properties seen :[0, 0, 0, 0, 0, 1, 0, 1, 1, 0] could not realise parikh vector
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 144700 steps, including 1679 resets, run finished after 1209 ms. (steps per millisecond=119 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 1170000 steps, including 7826 resets, run finished after 8739 ms. (steps per millisecond=133 ) properties seen :[0, 0, 0, 0, 0, 0, 1] could not realise parikh vector
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 429300 steps, including 3229 resets, run finished after 3019 ms. (steps per millisecond=142 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 2564000 steps, including 16069 resets, run finished after 18404 ms. (steps per millisecond=139 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 1216500 steps, including 8034 resets, run finished after 8758 ms. (steps per millisecond=138 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 9 out of 108 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 108/108 places, 2228/2228 transitions.
Discarding 2 places :
Also discarding 0 output transitions
Graph (complete) has 882 edges and 108 vertex of which 106 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.26 ms
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 106 transition count 2228
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 105 transition count 2227
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 103 transition count 2226
Applied a total of 7 rules in 402 ms. Remains 103 /108 variables (removed 5) and now considering 2226/2228 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 103/108 places, 2226/2228 transitions.
Incomplete random walk after 1000000 steps, including 7937 resets, run finished after 6943 ms. (steps per millisecond=144 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 4166 resets, run finished after 3246 ms. (steps per millisecond=308 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 4166 resets, run finished after 3258 ms. (steps per millisecond=306 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 4166 resets, run finished after 3246 ms. (steps per millisecond=308 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 4166 resets, run finished after 3337 ms. (steps per millisecond=299 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3312 resets, run finished after 2960 ms. (steps per millisecond=337 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 3282 resets, run finished after 2805 ms. (steps per millisecond=356 ) properties seen :[0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 4665812 steps, run timeout after 30001 ms. (steps per millisecond=155 ) properties seen :[0, 0, 0, 0, 0, 0]
Probabilistic random walk after 4665812 steps, saw 1241789 distinct states, run finished after 30003 ms. (steps per millisecond=155 ) properties seen :[0, 0, 0, 0, 0, 0]
[2021-05-13 18:38:47] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
// Phase 1: matrix 288 rows 103 cols
[2021-05-13 18:38:47] [INFO ] Computed 4 place invariants in 3 ms
[2021-05-13 18:38:47] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2021-05-13 18:38:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:38:47] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2021-05-13 18:38:47] [INFO ] State equation strengthened by 102 read => feed constraints.
[2021-05-13 18:38:47] [INFO ] [Real]Added 102 Read/Feed constraints in 50 ms returned sat
[2021-05-13 18:38:48] [INFO ] Computed and/alt/rep : 2223/114349/285 causal constraints in 78 ms.
[2021-05-13 18:38:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:38:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 14 ms returned sat
[2021-05-13 18:38:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:38:48] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2021-05-13 18:38:48] [INFO ] [Nat]Added 102 Read/Feed constraints in 29 ms returned sat
[2021-05-13 18:38:48] [INFO ] Computed and/alt/rep : 2223/114349/285 causal constraints in 78 ms.
[2021-05-13 18:38:57] [INFO ] Added : 200 causal constraints over 40 iterations in 9418 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 156 ms.
[2021-05-13 18:38:57] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2021-05-13 18:38:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:38:58] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2021-05-13 18:38:58] [INFO ] [Real]Added 102 Read/Feed constraints in 39 ms returned sat
[2021-05-13 18:38:58] [INFO ] Computed and/alt/rep : 2223/114349/285 causal constraints in 100 ms.
[2021-05-13 18:38:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:38:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 10 ms returned sat
[2021-05-13 18:38:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:38:58] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2021-05-13 18:38:58] [INFO ] [Nat]Added 102 Read/Feed constraints in 27 ms returned sat
[2021-05-13 18:38:58] [INFO ] Computed and/alt/rep : 2223/114349/285 causal constraints in 83 ms.
[2021-05-13 18:39:12] [INFO ] Added : 230 causal constraints over 46 iterations in 13926 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 257 ms.
[2021-05-13 18:39:12] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2021-05-13 18:39:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:39:12] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2021-05-13 18:39:13] [INFO ] [Real]Added 102 Read/Feed constraints in 30 ms returned sat
[2021-05-13 18:39:13] [INFO ] Computed and/alt/rep : 2223/114349/285 causal constraints in 86 ms.
[2021-05-13 18:39:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:39:13] [INFO ] [Nat]Absence check using 4 positive place invariants in 22 ms returned sat
[2021-05-13 18:39:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:39:13] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2021-05-13 18:39:13] [INFO ] [Nat]Added 102 Read/Feed constraints in 34 ms returned sat
[2021-05-13 18:39:13] [INFO ] Computed and/alt/rep : 2223/114349/285 causal constraints in 89 ms.
[2021-05-13 18:39:22] [INFO ] Added : 200 causal constraints over 40 iterations in 9395 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 119 ms.
[2021-05-13 18:39:23] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2021-05-13 18:39:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:39:23] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2021-05-13 18:39:23] [INFO ] [Real]Added 102 Read/Feed constraints in 26 ms returned sat
[2021-05-13 18:39:23] [INFO ] Computed and/alt/rep : 2223/114349/285 causal constraints in 94 ms.
[2021-05-13 18:39:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:39:23] [INFO ] [Nat]Absence check using 4 positive place invariants in 10 ms returned sat
[2021-05-13 18:39:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:39:23] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2021-05-13 18:39:23] [INFO ] [Nat]Added 102 Read/Feed constraints in 28 ms returned sat
[2021-05-13 18:39:23] [INFO ] Computed and/alt/rep : 2223/114349/285 causal constraints in 68 ms.
[2021-05-13 18:39:32] [INFO ] Added : 200 causal constraints over 40 iterations in 9281 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 201 ms.
[2021-05-13 18:39:33] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2021-05-13 18:39:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:39:33] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2021-05-13 18:39:33] [INFO ] [Real]Added 102 Read/Feed constraints in 35 ms returned sat
[2021-05-13 18:39:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:39:33] [INFO ] [Nat]Absence check using 4 positive place invariants in 10 ms returned sat
[2021-05-13 18:39:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:39:33] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2021-05-13 18:39:33] [INFO ] [Nat]Added 102 Read/Feed constraints in 51 ms returned sat
[2021-05-13 18:39:33] [INFO ] Computed and/alt/rep : 2223/114349/285 causal constraints in 202 ms.
[2021-05-13 18:39:51] [INFO ] Added : 265 causal constraints over 53 iterations in 17573 ms. Result :unknown
[2021-05-13 18:39:51] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2021-05-13 18:39:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:39:51] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2021-05-13 18:39:51] [INFO ] [Real]Added 102 Read/Feed constraints in 22 ms returned sat
[2021-05-13 18:39:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:39:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 10 ms returned sat
[2021-05-13 18:39:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:39:51] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2021-05-13 18:39:51] [INFO ] [Nat]Added 102 Read/Feed constraints in 44 ms returned sat
[2021-05-13 18:39:51] [INFO ] Computed and/alt/rep : 2223/114349/285 causal constraints in 75 ms.
[2021-05-13 18:40:01] [INFO ] Added : 240 causal constraints over 48 iterations in 10345 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 194 ms.
Incomplete Parikh walk after 462200 steps, including 4357 resets, run finished after 4637 ms. (steps per millisecond=99 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 1481300 steps, including 12511 resets, run finished after 12986 ms. (steps per millisecond=114 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 1102400 steps, including 9516 resets, run finished after 9841 ms. (steps per millisecond=112 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 1102400 steps, including 9516 resets, run finished after 9833 ms. (steps per millisecond=112 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 1054000 steps, including 9081 resets, run finished after 10304 ms. (steps per millisecond=102 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 1102400 steps, including 9508 resets, run finished after 10795 ms. (steps per millisecond=102 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 9 out of 103 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 103/103 places, 2226/2226 transitions.
Applied a total of 0 rules in 791 ms. Remains 103 /103 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 2226/2226 transitions.
Starting structural reductions, iteration 0 : 103/103 places, 2226/2226 transitions.
Applied a total of 0 rules in 181 ms. Remains 103 /103 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
[2021-05-13 18:41:01] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
// Phase 1: matrix 288 rows 103 cols
[2021-05-13 18:41:01] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-13 18:41:01] [INFO ] Implicit Places using invariants in 266 ms returned []
[2021-05-13 18:41:01] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
// Phase 1: matrix 288 rows 103 cols
[2021-05-13 18:41:01] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 18:41:01] [INFO ] State equation strengthened by 102 read => feed constraints.
[2021-05-13 18:41:02] [INFO ] Implicit Places using invariants and state equation in 978 ms returned [22, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1253 ms to find 2 implicit places.
[2021-05-13 18:41:02] [INFO ] Redundant transitions in 172 ms returned []
[2021-05-13 18:41:02] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
// Phase 1: matrix 288 rows 101 cols
[2021-05-13 18:41:02] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-13 18:41:04] [INFO ] Dead Transitions using invariants and state equation in 1344 ms returned []
Starting structural reductions, iteration 1 : 101/103 places, 2226/2226 transitions.
Applied a total of 0 rules in 248 ms. Remains 101 /101 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
[2021-05-13 18:41:04] [INFO ] Redundant transitions in 174 ms returned []
[2021-05-13 18:41:04] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
// Phase 1: matrix 288 rows 101 cols
[2021-05-13 18:41:04] [INFO ] Computed 4 place invariants in 3 ms
[2021-05-13 18:41:06] [INFO ] Dead Transitions using invariants and state equation in 1328 ms returned []
Finished structural reductions, in 2 iterations. Remains : 101/103 places, 2226/2226 transitions.
Incomplete random walk after 1000000 steps, including 7938 resets, run finished after 6893 ms. (steps per millisecond=145 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 4166 resets, run finished after 4075 ms. (steps per millisecond=245 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 4166 resets, run finished after 3543 ms. (steps per millisecond=282 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 4167 resets, run finished after 3839 ms. (steps per millisecond=260 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 4167 resets, run finished after 3297 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 3310 resets, run finished after 3110 ms. (steps per millisecond=321 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 3279 resets, run finished after 3088 ms. (steps per millisecond=323 ) properties seen :[0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 4893325 steps, run timeout after 30001 ms. (steps per millisecond=163 ) properties seen :[0, 0, 0, 0, 0, 0]
Probabilistic random walk after 4893325 steps, saw 1301851 distinct states, run finished after 30001 ms. (steps per millisecond=163 ) properties seen :[0, 0, 0, 0, 0, 0]
[2021-05-13 18:42:03] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
// Phase 1: matrix 288 rows 101 cols
[2021-05-13 18:42:03] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-13 18:42:03] [INFO ] [Real]Absence check using 4 positive place invariants in 7 ms returned sat
[2021-05-13 18:42:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:42:04] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2021-05-13 18:42:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:42:04] [INFO ] [Nat]Absence check using 4 positive place invariants in 6 ms returned sat
[2021-05-13 18:42:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:42:04] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2021-05-13 18:42:04] [INFO ] State equation strengthened by 102 read => feed constraints.
[2021-05-13 18:42:04] [INFO ] [Nat]Added 102 Read/Feed constraints in 40 ms returned sat
[2021-05-13 18:42:04] [INFO ] Computed and/alt/rep : 2223/113509/285 causal constraints in 82 ms.
[2021-05-13 18:42:28] [INFO ] Added : 280 causal constraints over 56 iterations in 23884 ms.(timeout) Result :unknown
[2021-05-13 18:42:28] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2021-05-13 18:42:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:42:28] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2021-05-13 18:42:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:42:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 9 ms returned sat
[2021-05-13 18:42:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:42:28] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2021-05-13 18:42:28] [INFO ] [Nat]Added 102 Read/Feed constraints in 40 ms returned sat
[2021-05-13 18:42:28] [INFO ] Computed and/alt/rep : 2223/113509/285 causal constraints in 184 ms.
[2021-05-13 18:42:50] [INFO ] Added : 265 causal constraints over 53 iterations in 21451 ms. Result :unknown
[2021-05-13 18:42:50] [INFO ] [Real]Absence check using 4 positive place invariants in 11 ms returned sat
[2021-05-13 18:42:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:42:50] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2021-05-13 18:42:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:42:50] [INFO ] [Nat]Absence check using 4 positive place invariants in 9 ms returned sat
[2021-05-13 18:42:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:42:50] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2021-05-13 18:42:50] [INFO ] [Nat]Added 102 Read/Feed constraints in 41 ms returned sat
[2021-05-13 18:42:50] [INFO ] Computed and/alt/rep : 2223/113509/285 causal constraints in 91 ms.
[2021-05-13 18:43:14] [INFO ] Added : 280 causal constraints over 56 iterations in 23431 ms.(timeout) Result :unknown
[2021-05-13 18:43:14] [INFO ] [Real]Absence check using 4 positive place invariants in 7 ms returned sat
[2021-05-13 18:43:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:43:14] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2021-05-13 18:43:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:43:14] [INFO ] [Nat]Absence check using 4 positive place invariants in 8 ms returned sat
[2021-05-13 18:43:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:43:14] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2021-05-13 18:43:14] [INFO ] [Nat]Added 102 Read/Feed constraints in 26 ms returned sat
[2021-05-13 18:43:14] [INFO ] Computed and/alt/rep : 2223/113509/285 causal constraints in 107 ms.
[2021-05-13 18:43:38] [INFO ] Added : 280 causal constraints over 56 iterations in 23822 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 378 ms.
[2021-05-13 18:43:38] [INFO ] [Real]Absence check using 4 positive place invariants in 7 ms returned sat
[2021-05-13 18:43:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:43:38] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2021-05-13 18:43:38] [INFO ] [Real]Added 102 Read/Feed constraints in 22 ms returned sat
[2021-05-13 18:43:39] [INFO ] Computed and/alt/rep : 2223/113509/285 causal constraints in 191 ms.
[2021-05-13 18:43:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:43:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 11 ms returned sat
[2021-05-13 18:43:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:43:39] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2021-05-13 18:43:39] [INFO ] [Nat]Added 102 Read/Feed constraints in 28 ms returned sat
[2021-05-13 18:43:39] [INFO ] Computed and/alt/rep : 2223/113509/285 causal constraints in 83 ms.
[2021-05-13 18:43:51] [INFO ] Added : 220 causal constraints over 44 iterations in 12076 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 226 ms.
[2021-05-13 18:43:51] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2021-05-13 18:43:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:43:51] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2021-05-13 18:43:51] [INFO ] [Real]Added 102 Read/Feed constraints in 27 ms returned sat
[2021-05-13 18:43:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:43:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 10 ms returned sat
[2021-05-13 18:43:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:43:52] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2021-05-13 18:43:52] [INFO ] [Nat]Added 102 Read/Feed constraints in 23 ms returned sat
[2021-05-13 18:43:52] [INFO ] Computed and/alt/rep : 2223/113509/285 causal constraints in 157 ms.
[2021-05-13 18:44:13] [INFO ] Added : 277 causal constraints over 59 iterations in 21440 ms. Result :unknown
Incomplete Parikh walk after 1175700 steps, including 10117 resets, run finished after 10313 ms. (steps per millisecond=114 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 233400 steps, including 2521 resets, run finished after 2292 ms. (steps per millisecond=101 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 1082400 steps, including 9270 resets, run finished after 9853 ms. (steps per millisecond=109 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 1216800 steps, including 10364 resets, run finished after 10866 ms. (steps per millisecond=111 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 1046700 steps, including 9027 resets, run finished after 9741 ms. (steps per millisecond=107 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 1216800 steps, including 10366 resets, run finished after 12283 ms. (steps per millisecond=99 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 9 out of 101 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 101/101 places, 2226/2226 transitions.
Applied a total of 0 rules in 183 ms. Remains 101 /101 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 101/101 places, 2226/2226 transitions.
Starting structural reductions, iteration 0 : 101/101 places, 2226/2226 transitions.
Applied a total of 0 rules in 180 ms. Remains 101 /101 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
[2021-05-13 18:45:09] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
// Phase 1: matrix 288 rows 101 cols
[2021-05-13 18:45:09] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 18:45:09] [INFO ] Implicit Places using invariants in 300 ms returned []
[2021-05-13 18:45:09] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
// Phase 1: matrix 288 rows 101 cols
[2021-05-13 18:45:09] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 18:45:09] [INFO ] State equation strengthened by 102 read => feed constraints.
[2021-05-13 18:45:10] [INFO ] Implicit Places using invariants and state equation in 1164 ms returned []
Implicit Place search using SMT with State Equation took 1466 ms to find 0 implicit places.
[2021-05-13 18:45:10] [INFO ] Redundant transitions in 58 ms returned []
[2021-05-13 18:45:10] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
// Phase 1: matrix 288 rows 101 cols
[2021-05-13 18:45:10] [INFO ] Computed 4 place invariants in 3 ms
[2021-05-13 18:45:12] [INFO ] Dead Transitions using invariants and state equation in 1263 ms returned []
Finished structural reductions, in 1 iterations. Remains : 101/101 places, 2226/2226 transitions.
Incomplete random walk after 100000 steps, including 793 resets, run finished after 645 ms. (steps per millisecond=155 ) properties seen :[0, 0, 0, 0]
[2021-05-13 18:45:12] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
// Phase 1: matrix 288 rows 101 cols
[2021-05-13 18:45:12] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-13 18:45:12] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2021-05-13 18:45:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:45:12] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2021-05-13 18:45:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:45:12] [INFO ] [Nat]Absence check using 4 positive place invariants in 7 ms returned sat
[2021-05-13 18:45:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:45:12] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2021-05-13 18:45:12] [INFO ] State equation strengthened by 102 read => feed constraints.
[2021-05-13 18:45:13] [INFO ] [Nat]Added 102 Read/Feed constraints in 58 ms returned sat
[2021-05-13 18:45:13] [INFO ] Computed and/alt/rep : 2223/113509/285 causal constraints in 89 ms.
[2021-05-13 18:45:29] [INFO ] Added : 265 causal constraints over 53 iterations in 16197 ms. Result :sat
[2021-05-13 18:45:29] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2021-05-13 18:45:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:45:29] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2021-05-13 18:45:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:45:29] [INFO ] [Nat]Absence check using 4 positive place invariants in 10 ms returned sat
[2021-05-13 18:45:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:45:29] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2021-05-13 18:45:29] [INFO ] [Nat]Added 102 Read/Feed constraints in 37 ms returned sat
[2021-05-13 18:45:29] [INFO ] Computed and/alt/rep : 2223/113509/285 causal constraints in 104 ms.
[2021-05-13 18:45:37] [INFO ] Added : 210 causal constraints over 42 iterations in 8188 ms. Result :sat
[2021-05-13 18:45:37] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2021-05-13 18:45:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:45:38] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2021-05-13 18:45:38] [INFO ] [Real]Added 102 Read/Feed constraints in 19 ms returned sat
[2021-05-13 18:45:38] [INFO ] Computed and/alt/rep : 2223/113509/285 causal constraints in 102 ms.
[2021-05-13 18:45:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:45:38] [INFO ] [Nat]Absence check using 4 positive place invariants in 9 ms returned sat
[2021-05-13 18:45:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:45:38] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2021-05-13 18:45:38] [INFO ] [Nat]Added 102 Read/Feed constraints in 36 ms returned sat
[2021-05-13 18:45:38] [INFO ] Computed and/alt/rep : 2223/113509/285 causal constraints in 109 ms.
[2021-05-13 18:45:51] [INFO ] Added : 220 causal constraints over 44 iterations in 13461 ms. Result :sat
[2021-05-13 18:45:51] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2021-05-13 18:45:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:45:52] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2021-05-13 18:45:52] [INFO ] [Real]Added 102 Read/Feed constraints in 22 ms returned sat
[2021-05-13 18:45:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:45:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 10 ms returned sat
[2021-05-13 18:45:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:45:52] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2021-05-13 18:45:52] [INFO ] [Nat]Added 102 Read/Feed constraints in 24 ms returned sat
[2021-05-13 18:45:52] [INFO ] Computed and/alt/rep : 2223/113509/285 causal constraints in 106 ms.
[2021-05-13 18:46:12] [INFO ] Added : 277 causal constraints over 59 iterations in 19808 ms. Result :unknown
Ensure Unique test removed 1938 transitions
Reduce isomorphic transitions removed 1938 transitions.
Iterating post reduction 0 with 1938 rules applied. Total rules applied 1938 place count 101 transition count 288
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1940 place count 101 transition count 286
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1942 place count 99 transition count 286
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 1943 place count 99 transition count 286
Applied a total of 1943 rules in 27 ms. Remains 99 /101 variables (removed 2) and now considering 286/2226 (removed 1940) transitions.
// Phase 1: matrix 286 rows 99 cols
[2021-05-13 18:46:12] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-13 18:46:12] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2021-05-13 18:46:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:46:12] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2021-05-13 18:46:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-13 18:46:12] [INFO ] [Real]Added 2 Read/Feed constraints in 2 ms returned sat
[2021-05-13 18:46:12] [INFO ] Computed and/alt/rep : 283/8875/283 causal constraints in 21 ms.
[2021-05-13 18:46:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:46:12] [INFO ] [Nat]Absence check using 4 positive place invariants in 10 ms returned sat
[2021-05-13 18:46:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:46:12] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2021-05-13 18:46:12] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2021-05-13 18:46:12] [INFO ] Computed and/alt/rep : 283/8875/283 causal constraints in 17 ms.
[2021-05-13 18:46:19] [INFO ] Added : 280 causal constraints over 56 iterations in 6580 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 128 ms.
[2021-05-13 18:46:19] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2021-05-13 18:46:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:46:19] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2021-05-13 18:46:19] [INFO ] [Real]Added 2 Read/Feed constraints in 3 ms returned sat
[2021-05-13 18:46:19] [INFO ] Computed and/alt/rep : 283/8875/283 causal constraints in 29 ms.
[2021-05-13 18:46:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:46:19] [INFO ] [Nat]Absence check using 4 positive place invariants in 10 ms returned sat
[2021-05-13 18:46:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:46:19] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2021-05-13 18:46:19] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2021-05-13 18:46:19] [INFO ] Computed and/alt/rep : 283/8875/283 causal constraints in 20 ms.
[2021-05-13 18:46:25] [INFO ] Added : 277 causal constraints over 57 iterations in 5988 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 147 ms.
[2021-05-13 18:46:25] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2021-05-13 18:46:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:46:26] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2021-05-13 18:46:26] [INFO ] [Real]Added 2 Read/Feed constraints in 2 ms returned sat
[2021-05-13 18:46:26] [INFO ] Computed and/alt/rep : 283/8875/283 causal constraints in 20 ms.
[2021-05-13 18:46:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:46:26] [INFO ] [Nat]Absence check using 4 positive place invariants in 9 ms returned sat
[2021-05-13 18:46:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:46:26] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2021-05-13 18:46:26] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2021-05-13 18:46:26] [INFO ] Computed and/alt/rep : 283/8875/283 causal constraints in 20 ms.
[2021-05-13 18:46:33] [INFO ] Added : 280 causal constraints over 56 iterations in 6788 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 134 ms.
[2021-05-13 18:46:33] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2021-05-13 18:46:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:46:33] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2021-05-13 18:46:33] [INFO ] [Real]Added 2 Read/Feed constraints in 2 ms returned sat
[2021-05-13 18:46:33] [INFO ] Computed and/alt/rep : 283/8875/283 causal constraints in 32 ms.
[2021-05-13 18:46:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:46:33] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2021-05-13 18:46:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:46:33] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2021-05-13 18:46:33] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2021-05-13 18:46:33] [INFO ] Computed and/alt/rep : 283/8875/283 causal constraints in 19 ms.
[2021-05-13 18:46:39] [INFO ] Added : 280 causal constraints over 56 iterations in 5984 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 180 ms.
[2021-05-13 18:46:39] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2021-05-13 18:46:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:46:40] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2021-05-13 18:46:40] [INFO ] [Real]Added 2 Read/Feed constraints in 2 ms returned sat
[2021-05-13 18:46:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:46:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 9 ms returned sat
[2021-05-13 18:46:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:46:40] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2021-05-13 18:46:40] [INFO ] [Nat]Added 2 Read/Feed constraints in 15 ms returned sat
[2021-05-13 18:46:40] [INFO ] Computed and/alt/rep : 283/8875/283 causal constraints in 18 ms.
[2021-05-13 18:46:42] [INFO ] Added : 173 causal constraints over 39 iterations in 2310 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 41 ms.
[2021-05-13 18:46:42] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2021-05-13 18:46:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:46:42] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2021-05-13 18:46:42] [INFO ] [Real]Added 2 Read/Feed constraints in 2 ms returned sat
[2021-05-13 18:46:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:46:42] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2021-05-13 18:46:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:46:42] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2021-05-13 18:46:42] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2021-05-13 18:46:42] [INFO ] Computed and/alt/rep : 283/8875/283 causal constraints in 23 ms.
[2021-05-13 18:46:48] [INFO ] Added : 270 causal constraints over 54 iterations in 5641 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 114 ms.
[2021-05-13 18:46:48] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2021-05-13 18:46:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 27 ms.
[2021-05-13 18:46:49] [INFO ] Flatten gal took : 207 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ BridgeAndVehicles-PT-V20P20N50 @ 3570 seconds

FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2931
rslt: Output for ReachabilityFireability @ BridgeAndVehicles-PT-V20P20N50

{
"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",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu May 13 18:46:49 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p45) AND (1 <= p100)) OR ((1 <= p46) AND (1 <= p100)))))",
"processed_size": 71,
"rewrites": 1
},
"result":
{
"edges": 3229598,
"markings": 1384692,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 691
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (G ((((p45 <= 0) OR (p100 <= 0)) AND ((p46 <= 0) OR (p100 <= 0)))))",
"processed_size": 71,
"rewrites": 2
},
"result":
{
"edges": 3229598,
"markings": 1384692,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 837
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p45) AND (1 <= p100)) OR ((1 <= p46) AND (1 <= p100)))))",
"processed_size": 71,
"rewrites": 1
},
"result":
{
"edges": 3229598,
"markings": 1384692,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1078
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p45) AND (1 <= p100)) OR ((1 <= p46) AND (1 <= p100)))))",
"processed_size": 71,
"rewrites": 1
},
"result":
{
"edges": 3229598,
"markings": 1384692,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1564
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p6) AND (1 <= p23) AND (1 <= p24) AND (1 <= p73))))",
"processed_size": 64,
"rewrites": 1
},
"result":
{
"edges": 3962247,
"markings": 1488793,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3027
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G (((p11 <= 0) OR (p23 <= 0) OR (p24 <= 0) OR (p83 <= 0))))",
"processed_size": 65,
"rewrites": 2
},
"result":
{
"edges": 3944842,
"markings": 1480214,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 73648,
"runtime": 639.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : A(G(**)) : E(F(**)) : E(F(**)) : E(F(**)) : A(G(**))"
},
"net":
{
"arcs": 17018,
"conflict_clusters": 3,
"places": 101,
"places_significant": 97,
"singleton_clusters": 0,
"transitions": 2226
},
"result":
{
"preliminary_value": "no yes no no no yes ",
"value": "no yes no no 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: 2327/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 3232
lola: finding significant places
lola: 101 places, 2226 transitions, 97 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: E (F ((((1 <= p45) AND (1 <= p100)) OR ((1 <= p46) AND (1 <= p100))))) : A (G ((((p45 <= 0) OR (p100 <= 0)) AND ((p46 <= 0) OR (p100 <= 0))))) : E (F ((((1 <= p45) AND (1 <= p100)) OR ((1 <= p46) AND (1 <= p100))))) : E (F ((((1 <= p45) AND (1 <= p100)) OR ((1 <= p46) AND (1 <= p100))))) : E (F (((1 <= p6) AND (1 <= p23) AND (1 <= p24) AND (1 <= p73)))) : A (G (((p11 <= 0) OR (p23 <= 0) OR (p24 <= 0) OR (p83 <= 0))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p45) AND (1 <= p100)) OR ((1 <= p46) AND (1 <= p100)))))
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 <= p45) AND (1 <= p100)) OR ((1 <= p46) AND (1 <= p100)))))
lola: processed formula length: 71
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 <= p45) AND (1 <= p100)) OR ((1 <= p46) AND (1 <= p100)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 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 || 66053 markings, 133643 edges, 13211 markings/sec, 0 secs
lola: sara is running 5 secs || 127158 markings, 265405 edges, 12221 markings/sec, 5 secs
lola: sara is running 10 secs || 191803 markings, 407689 edges, 12929 markings/sec, 10 secs
lola: sara is running 15 secs || 256668 markings, 553309 edges, 12973 markings/sec, 15 secs
lola: sara is running 20 secs || 321197 markings, 699848 edges, 12906 markings/sec, 20 secs
lola: sara is running 25 secs || 385649 markings, 847477 edges, 12890 markings/sec, 25 secs
lola: sara is running 30 secs || 448819 markings, 993321 edges, 12634 markings/sec, 30 secs
lola: sara is running 35 secs || 513158 markings, 1144101 edges, 12868 markings/sec, 35 secs
lola: sara is running 40 secs || 577901 markings, 1295967 edges, 12949 markings/sec, 40 secs
lola: sara is running 45 secs || 636038 markings, 1432064 edges, 11627 markings/sec, 45 secs
lola: sara is running 50 secs || 691402 markings, 1564183 edges, 11073 markings/sec, 50 secs
lola: sara is running 55 secs || 747184 markings, 1694774 edges, 11156 markings/sec, 55 secs
lola: sara is running 60 secs || 803565 markings, 1830503 edges, 11276 markings/sec, 60 secs
lola: sara is running 65 secs || 868117 markings, 1982728 edges, 12910 markings/sec, 65 secs
lola: sara is running 70 secs || 931971 markings, 2138050 edges, 12771 markings/sec, 70 secs
lola: sara is running 75 secs || 996779 markings, 2290359 edges, 12962 markings/sec, 75 secs
lola: sara is running 80 secs || 1060442 markings, 2446670 edges, 12733 markings/sec, 80 secs
lola: sara is running 85 secs || 1125272 markings, 2600147 edges, 12966 markings/sec, 85 secs
lola: sara is running 90 secs || 1189428 markings, 2757550 edges, 12831 markings/sec, 90 secs
lola: sara is running 95 secs || 1253351 markings, 2911504 edges, 12785 markings/sec, 95 secs
lola: sara is running 100 secs || 1318075 markings, 3068164 edges, 12945 markings/sec, 100 secs
lola: sara is running 105 secs || 1381751 markings, 3223016 edges, 12735 markings/sec, 105 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1384692 markings, 3229598 edges
lola: ========================================
lola: subprocess 1 will run for 691 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p45 <= 0) OR (p100 <= 0)) AND ((p46 <= 0) OR (p100 <= 0)))))
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 ((((p45 <= 0) OR (p100 <= 0)) AND ((p46 <= 0) OR (p100 <= 0)))))
lola: processed formula length: 71
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 <= p45) AND (1 <= p100)) OR ((1 <= p46) AND (1 <= p100)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 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 || 66152 markings, 133856 edges, 13230 markings/sec, 0 secs
lola: sara is running 5 secs || 131271 markings, 274380 edges, 13024 markings/sec, 5 secs
lola: sara is running 10 secs || 196112 markings, 417450 edges, 12968 markings/sec, 10 secs
lola: sara is running 15 secs || 260919 markings, 562951 edges, 12961 markings/sec, 15 secs
lola: sara is running 20 secs || 325558 markings, 710018 edges, 12928 markings/sec, 20 secs
lola: sara is running 25 secs || 390230 markings, 858553 edges, 12934 markings/sec, 25 secs
lola: sara is running 30 secs || 454800 markings, 1007863 edges, 12914 markings/sec, 30 secs
lola: sara is running 35 secs || 519122 markings, 1157980 edges, 12864 markings/sec, 35 secs
lola: sara is running 40 secs || 583905 markings, 1310134 edges, 12957 markings/sec, 40 secs
lola: sara is running 45 secs || 648640 markings, 1461185 edges, 12947 markings/sec, 45 secs
lola: sara is running 50 secs || 712597 markings, 1612309 edges, 12791 markings/sec, 50 secs
lola: sara is running 55 secs || 777120 markings, 1765812 edges, 12905 markings/sec, 55 secs
lola: sara is running 60 secs || 841238 markings, 1919181 edges, 12824 markings/sec, 60 secs
lola: sara is running 65 secs || 905940 markings, 2074437 edges, 12940 markings/sec, 65 secs
lola: sara is running 70 secs || 970003 markings, 2227223 edges, 12813 markings/sec, 70 secs
lola: sara is running 75 secs || 1034818 markings, 2383441 edges, 12963 markings/sec, 75 secs
lola: sara is running 80 secs || 1098857 markings, 2536560 edges, 12808 markings/sec, 80 secs
lola: sara is running 85 secs || 1163472 markings, 2694259 edges, 12923 markings/sec, 85 secs
lola: sara is running 90 secs || 1227368 markings, 2847218 edges, 12779 markings/sec, 90 secs
lola: sara is running 95 secs || 1292103 markings, 3006289 edges, 12947 markings/sec, 95 secs
lola: sara is running 100 secs || 1355923 markings, 3162795 edges, 12764 markings/sec, 100 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1384692 markings, 3229598 edges
lola: ========================================
lola: subprocess 2 will run for 837 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p45) AND (1 <= p100)) OR ((1 <= p46) AND (1 <= p100)))))
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 <= p45) AND (1 <= p100)) OR ((1 <= p46) AND (1 <= p100)))))
lola: processed formula length: 71
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 <= p45) AND (1 <= p100)) OR ((1 <= p46) AND (1 <= p100)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-2-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 62209 markings, 125317 edges, 12442 markings/sec, 0 secs
lola: sara is running 5 secs || 119186 markings, 247578 edges, 11395 markings/sec, 5 secs
lola: sara is running 10 secs || 174867 markings, 370663 edges, 11136 markings/sec, 10 secs
lola: sara is running 15 secs || 230399 markings, 494669 edges, 11106 markings/sec, 15 secs
lola: sara is running 20 secs || 289745 markings, 628515 edges, 11869 markings/sec, 20 secs
lola: sara is running 25 secs || 354111 markings, 776133 edges, 12873 markings/sec, 25 secs
lola: sara is running 30 secs || 418698 markings, 925110 edges, 12917 markings/sec, 30 secs
lola: sara is running 35 secs || 483271 markings, 1074370 edges, 12915 markings/sec, 35 secs
lola: sara is running 40 secs || 547446 markings, 1224489 edges, 12835 markings/sec, 40 secs
lola: sara is running 45 secs || 605855 markings, 1361324 edges, 11682 markings/sec, 45 secs
lola: sara is running 50 secs || 660328 markings, 1489639 edges, 10895 markings/sec, 50 secs
lola: sara is running 55 secs || 717511 markings, 1625482 edges, 11437 markings/sec, 55 secs
lola: sara is running 60 secs || 780395 markings, 1774617 edges, 12577 markings/sec, 60 secs
lola: sara is running 65 secs || 836942 markings, 1907421 edges, 11309 markings/sec, 65 secs
lola: sara is running 70 secs || 895425 markings, 2048201 edges, 11697 markings/sec, 70 secs
lola: sara is running 75 secs || 955552 markings, 2193062 edges, 12025 markings/sec, 75 secs
lola: sara is running 80 secs || 1020439 markings, 2348767 edges, 12977 markings/sec, 80 secs
lola: sara is running 85 secs || 1084012 markings, 2501054 edges, 12715 markings/sec, 85 secs
lola: sara is running 90 secs || 1148984 markings, 2658044 edges, 12994 markings/sec, 90 secs
lola: sara is running 95 secs || 1212259 markings, 2814429 edges, 12655 markings/sec, 95 secs
lola: sara is running 100 secs || 1277147 markings, 2969029 edges, 12978 markings/sec, 100 secs
lola: sara is running 105 secs || 1341094 markings, 3126219 edges, 12789 markings/sec, 105 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1384692 markings, 3229598 edges
lola: ========================================
lola: subprocess 3 will run for 1078 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p45) AND (1 <= p100)) OR ((1 <= p46) AND (1 <= p100)))))
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 <= p45) AND (1 <= p100)) OR ((1 <= p46) AND (1 <= p100)))))
lola: processed formula length: 71
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 <= p45) AND (1 <= p100)) OR ((1 <= p46) AND (1 <= p100)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-3-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 62200 markings, 125300 edges, 12440 markings/sec, 0 secs
lola: sara is running 5 secs || 127206 markings, 265484 edges, 13001 markings/sec, 5 secs
lola: sara is running 10 secs || 191892 markings, 407864 edges, 12937 markings/sec, 10 secs
lola: sara is running 15 secs || 256761 markings, 553567 edges, 12974 markings/sec, 15 secs
lola: sara is running 20 secs || 321348 markings, 700144 edges, 12917 markings/sec, 20 secs
lola: sara is running 25 secs || 385914 markings, 847972 edges, 12913 markings/sec, 25 secs
lola: sara is running 30 secs || 450479 markings, 997321 edges, 12913 markings/sec, 30 secs
lola: sara is running 35 secs || 514614 markings, 1146965 edges, 12827 markings/sec, 35 secs
lola: sara is running 40 secs || 579257 markings, 1299163 edges, 12929 markings/sec, 40 secs
lola: sara is running 45 secs || 643652 markings, 1450594 edges, 12879 markings/sec, 45 secs
lola: sara is running 50 secs || 707646 markings, 1601818 edges, 12799 markings/sec, 50 secs
lola: sara is running 55 secs || 772558 markings, 1755427 edges, 12982 markings/sec, 55 secs
lola: sara is running 60 secs || 836379 markings, 1905843 edges, 12764 markings/sec, 60 secs
lola: sara is running 65 secs || 901003 markings, 2062541 edges, 12925 markings/sec, 65 secs
lola: sara is running 70 secs || 964984 markings, 2214990 edges, 12796 markings/sec, 70 secs
lola: sara is running 75 secs || 1029579 markings, 2371344 edges, 12919 markings/sec, 75 secs
lola: sara is running 80 secs || 1093258 markings, 2523230 edges, 12736 markings/sec, 80 secs
lola: sara is running 85 secs || 1158279 markings, 2680586 edges, 13004 markings/sec, 85 secs
lola: sara is running 90 secs || 1221620 markings, 2835221 edges, 12668 markings/sec, 90 secs
lola: sara is running 95 secs || 1286729 markings, 2991351 edges, 13022 markings/sec, 95 secs
lola: sara is running 100 secs || 1350358 markings, 3148842 edges, 12726 markings/sec, 100 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1384692 markings, 3229598 edges
lola: ========================================
lola: subprocess 4 will run for 1564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p6) AND (1 <= p23) AND (1 <= p24) AND (1 <= p73))))
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 <= p6) AND (1 <= p23) AND (1 <= p24) AND (1 <= p73))))
lola: processed formula length: 64
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 <= p6) AND (1 <= p23) AND (1 <= p24) AND (1 <= p73))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-4-0.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 2)
lola: sara is running 0 secs || 74598 markings, 180738 edges, 14920 markings/sec, 0 secs
lola: sara is running 5 secs || 151858 markings, 378306 edges, 15452 markings/sec, 5 secs
lola: sara is running 10 secs || 226435 markings, 571373 edges, 14915 markings/sec, 10 secs
lola: sara is running 15 secs || 298344 markings, 760305 edges, 14382 markings/sec, 15 secs
lola: sara is running 20 secs || 374563 markings, 960555 edges, 15244 markings/sec, 20 secs
lola: sara is running 25 secs || 445387 markings, 1148953 edges, 14165 markings/sec, 25 secs
lola: sara is running 30 secs || 523863 markings, 1356408 edges, 15695 markings/sec, 30 secs
lola: sara is running 35 secs || 593570 markings, 1543641 edges, 13941 markings/sec, 35 secs
lola: sara is running 40 secs || 672415 markings, 1753756 edges, 15769 markings/sec, 40 secs
lola: sara is running 45 secs || 743265 markings, 1946213 edges, 14170 markings/sec, 45 secs
lola: sara is running 50 secs || 816648 markings, 2136346 edges, 14677 markings/sec, 50 secs
lola: sara is running 55 secs || 893665 markings, 2347174 edges, 15403 markings/sec, 55 secs
lola: sara is running 60 secs || 963365 markings, 2539372 edges, 13940 markings/sec, 60 secs
lola: sara is running 65 secs || 1033327 markings, 2722722 edges, 13992 markings/sec, 65 secs
lola: sara is running 70 secs || 1114004 markings, 2942743 edges, 16135 markings/sec, 70 secs
lola: sara is running 75 secs || 1186030 markings, 3140813 edges, 14405 markings/sec, 75 secs
lola: sara is running 80 secs || 1254514 markings, 3326817 edges, 13697 markings/sec, 80 secs
lola: sara is running 85 secs || 1325612 markings, 3513802 edges, 14220 markings/sec, 85 secs
lola: sara is running 90 secs || 1406168 markings, 3734764 edges, 16111 markings/sec, 90 secs
lola: sara is running 95 secs || 1478594 markings, 3933602 edges, 14485 markings/sec, 95 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1488793 markings, 3962247 edges
lola: ========================================
lola: subprocess 5 will run for 3027 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p11 <= 0) OR (p23 <= 0) OR (p24 <= 0) OR (p83 <= 0))))
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 (((p11 <= 0) OR (p23 <= 0) OR (p24 <= 0) OR (p83 <= 0))))
lola: processed formula length: 65
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 <= p11) AND (1 <= p23) AND (1 <= p24) AND (1 <= p83))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-5-0.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 2)
lola: sara is running 0 secs || 76362 markings, 187446 edges, 15272 markings/sec, 0 secs
lola: sara is running 5 secs || 150717 markings, 376345 edges, 14871 markings/sec, 5 secs
lola: sara is running 10 secs || 228575 markings, 580076 edges, 15572 markings/sec, 10 secs
lola: sara is running 15 secs || 305819 markings, 781157 edges, 15449 markings/sec, 15 secs
lola: sara is running 20 secs || 385588 markings, 992359 edges, 15954 markings/sec, 20 secs
lola: sara is running 25 secs || 462823 markings, 1193933 edges, 15447 markings/sec, 25 secs
lola: sara is running 30 secs || 538589 markings, 1398439 edges, 15153 markings/sec, 30 secs
lola: sara is running 35 secs || 616663 markings, 1603403 edges, 15615 markings/sec, 35 secs
lola: sara is running 40 secs || 693423 markings, 1812852 edges, 15352 markings/sec, 40 secs
lola: sara is running 45 secs || 765079 markings, 2005677 edges, 14331 markings/sec, 45 secs
lola: sara is running 50 secs || 850015 markings, 2231534 edges, 16987 markings/sec, 50 secs
lola: sara is running 55 secs || 922026 markings, 2427683 edges, 14402 markings/sec, 55 secs
lola: sara is running 60 secs || 993712 markings, 2622058 edges, 14337 markings/sec, 60 secs
lola: sara is running 65 secs || 1082736 markings, 2860818 edges, 17805 markings/sec, 65 secs
lola: sara is running 70 secs || 1158034 markings, 3067925 edges, 15060 markings/sec, 70 secs
lola: sara is running 75 secs || 1228314 markings, 3255025 edges, 14056 markings/sec, 75 secs
lola: sara is running 80 secs || 1301774 markings, 3458110 edges, 14692 markings/sec, 80 secs
lola: sara is running 85 secs || 1393344 markings, 3705856 edges, 18314 markings/sec, 85 secs
lola: sara is running 90 secs || 1467825 markings, 3910814 edges, 14896 markings/sec, 90 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1480214 markings, 3944842 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no no no yes
lola:
preliminary result: no yes no no no yes
lola: memory consumption: 73648 KB
lola: time consumption: 639 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="BridgeAndVehicles-PT-V20P20N50"
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 BridgeAndVehicles-PT-V20P20N50, 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 r037-tajo-162038176900112"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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