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-162038176900100.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-V20P10N50, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-162038176900100
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 58K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 292K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0M May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 7.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.8K Mar 28 15:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 35K Mar 28 15:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 230K Mar 28 15:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 673K Mar 28 15:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Mar 23 02:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 33K Mar 23 02:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 147K Mar 22 11:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 418K Mar 22 11:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.4K 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-V20P10N50-ReachabilityFireability-00
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-01
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-02
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-03
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-04
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-05
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-06
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-07
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-08
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-09
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-10
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-11
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-12
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-13
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-14
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620929674202

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 18:14:35] [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:14:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 18:14:36] [INFO ] Load time of PNML (sax parser for PT used): 162 ms
[2021-05-13 18:14:36] [INFO ] Transformed 108 places.
[2021-05-13 18:14:36] [INFO ] Transformed 2228 transitions.
[2021-05-13 18:14:36] [INFO ] Parsed PT model containing 108 places and 2228 transitions in 213 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 97 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 57 resets, run finished after 323 ms. (steps per millisecond=30 ) properties seen :[0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 142 ms. (steps per millisecond=70 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 715 ms. (steps per millisecond=13 ) 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 153 ms. (steps per millisecond=65 ) 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 168 ms. (steps per millisecond=59 ) 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 157 ms. (steps per millisecond=63 ) 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 84 ms. (steps per millisecond=119 ) 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 75 ms. (steps per millisecond=133 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 82 ms. (steps per millisecond=121 ) 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 67 ms. (steps per millisecond=149 ) 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 70 ms. (steps per millisecond=142 ) 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 100 ms. (steps per millisecond=100 ) 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 82 ms. (steps per millisecond=121 ) 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 78 ms. (steps per millisecond=128 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
[2021-05-13 18:14:38] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2021-05-13 18:14:38] [INFO ] Computed 7 place invariants in 10 ms
[2021-05-13 18:14:38] [INFO ] [Real]Absence check using 7 positive place invariants in 18 ms returned unsat
[2021-05-13 18:14:38] [INFO ] [Real]Absence check using 7 positive place invariants in 18 ms returned unsat
[2021-05-13 18:14:38] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-13 18:14:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:14:38] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2021-05-13 18:14:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:14:38] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2021-05-13 18:14:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:14:38] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2021-05-13 18:14:38] [INFO ] State equation strengthened by 102 read => feed constraints.
[2021-05-13 18:14:38] [INFO ] [Nat]Added 102 Read/Feed constraints in 31 ms returned sat
[2021-05-13 18:14:39] [INFO ] Computed and/alt/rep : 2225/114389/287 causal constraints in 217 ms.
[2021-05-13 18:14:43] [INFO ] Added : 220 causal constraints over 44 iterations in 4767 ms. Result :unknown
[2021-05-13 18:14:43] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2021-05-13 18:14:43] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-13 18:14:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:14:43] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2021-05-13 18:14:43] [INFO ] [Real]Added 102 Read/Feed constraints in 36 ms returned sat
[2021-05-13 18:14:44] [INFO ] Computed and/alt/rep : 2225/114389/287 causal constraints in 143 ms.
[2021-05-13 18:14:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:14:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2021-05-13 18:14:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:14:44] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2021-05-13 18:14:44] [INFO ] [Nat]Added 102 Read/Feed constraints in 33 ms returned sat
[2021-05-13 18:14:44] [INFO ] Computed and/alt/rep : 2225/114389/287 causal constraints in 132 ms.
[2021-05-13 18:14:49] [INFO ] Added : 195 causal constraints over 39 iterations in 4802 ms. Result :unknown
[2021-05-13 18:14:49] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2021-05-13 18:14:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:14:49] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2021-05-13 18:14:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:14:49] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2021-05-13 18:14:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:14:49] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2021-05-13 18:14:49] [INFO ] [Nat]Added 102 Read/Feed constraints in 31 ms returned sat
[2021-05-13 18:14:49] [INFO ] Computed and/alt/rep : 2225/114389/287 causal constraints in 127 ms.
[2021-05-13 18:14:54] [INFO ] Added : 205 causal constraints over 41 iterations in 4815 ms. Result :unknown
[2021-05-13 18:14:54] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2021-05-13 18:14:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:14:54] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2021-05-13 18:14:54] [INFO ] [Real]Added 102 Read/Feed constraints in 22 ms returned sat
[2021-05-13 18:14:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:14:54] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2021-05-13 18:14:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:14:54] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2021-05-13 18:14:54] [INFO ] [Nat]Added 102 Read/Feed constraints in 23 ms returned sat
[2021-05-13 18:14:55] [INFO ] Computed and/alt/rep : 2225/114389/287 causal constraints in 101 ms.
[2021-05-13 18:14:59] [INFO ] Added : 210 causal constraints over 42 iterations in 4844 ms. Result :unknown
[2021-05-13 18:14:59] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned unsat
[2021-05-13 18:14:59] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned unsat
[2021-05-13 18:14:59] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2021-05-13 18:14:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:14:59] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2021-05-13 18:15:00] [INFO ] [Real]Added 102 Read/Feed constraints in 35 ms returned sat
[2021-05-13 18:15:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:15:00] [INFO ] [Nat]Absence check using 7 positive place invariants in 55 ms returned sat
[2021-05-13 18:15:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:15:00] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2021-05-13 18:15:00] [INFO ] [Nat]Added 102 Read/Feed constraints in 44 ms returned sat
[2021-05-13 18:15:00] [INFO ] Computed and/alt/rep : 2225/114389/287 causal constraints in 76 ms.
[2021-05-13 18:15:05] [INFO ] Added : 170 causal constraints over 34 iterations in 4746 ms. Result :unknown
[2021-05-13 18:15:05] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2021-05-13 18:15:05] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2021-05-13 18:15:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:15:05] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2021-05-13 18:15:05] [INFO ] [Real]Added 102 Read/Feed constraints in 21 ms returned sat
[2021-05-13 18:15:05] [INFO ] Computed and/alt/rep : 2225/114389/287 causal constraints in 82 ms.
[2021-05-13 18:15:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:15:05] [INFO ] [Nat]Absence check using 7 positive place invariants in 12 ms returned sat
[2021-05-13 18:15:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:15:05] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2021-05-13 18:15:05] [INFO ] [Nat]Added 102 Read/Feed constraints in 41 ms returned sat
[2021-05-13 18:15:05] [INFO ] Computed and/alt/rep : 2225/114389/287 causal constraints in 140 ms.
[2021-05-13 18:15:10] [INFO ] Added : 200 causal constraints over 40 iterations in 4782 ms. Result :(error "Failed to check-sat")
[2021-05-13 18:15:10] [INFO ] [Real]Absence check using 7 positive place invariants in 13 ms returned sat
[2021-05-13 18:15:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:15:10] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2021-05-13 18:15:10] [INFO ] [Real]Added 102 Read/Feed constraints in 17 ms returned sat
[2021-05-13 18:15:10] [INFO ] Computed and/alt/rep : 2225/114389/287 causal constraints in 136 ms.
[2021-05-13 18:15:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:15:10] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2021-05-13 18:15:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:15:10] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2021-05-13 18:15:10] [INFO ] [Nat]Added 102 Read/Feed constraints in 30 ms returned sat
[2021-05-13 18:15:11] [INFO ] Computed and/alt/rep : 2225/114389/287 causal constraints in 159 ms.
[2021-05-13 18:15:15] [INFO ] Added : 200 causal constraints over 40 iterations in 4833 ms. Result :unknown
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 501300 steps, including 3713 resets, run finished after 4533 ms. (steps per millisecond=110 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Interrupted Parikh walk after 3785317 steps, including 23436 resets, run timeout after 30001 ms. (steps per millisecond=126 ) properties seen :[0, 0, 1, 0, 0, 0, 0]
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 388400 steps, including 3063 resets, run finished after 3096 ms. (steps per millisecond=125 ) properties seen :[0, 0, 0, 0, 1, 0] could not realise parikh vector
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 1519200 steps, including 9917 resets, run finished after 11716 ms. (steps per millisecond=129 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 2409200 steps, including 15060 resets, run finished after 17893 ms. (steps per millisecond=134 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 1481400 steps, including 9649 resets, run finished after 10885 ms. (steps per millisecond=136 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Support contains 16 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.41 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 5 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 6 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 560 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 7939 resets, run finished after 7494 ms. (steps per millisecond=133 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 4167 resets, run finished after 3742 ms. (steps per millisecond=267 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 4166 resets, run finished after 3163 ms. (steps per millisecond=316 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3114 resets, run finished after 2708 ms. (steps per millisecond=369 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3212 resets, run finished after 2749 ms. (steps per millisecond=363 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3710 resets, run finished after 3284 ms. (steps per millisecond=304 ) properties seen :[0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 4417507 steps, run timeout after 30001 ms. (steps per millisecond=147 ) properties seen :[0, 0, 0, 0, 0]
Probabilistic random walk after 4417507 steps, saw 1178024 distinct states, run finished after 30002 ms. (steps per millisecond=147 ) properties seen :[0, 0, 0, 0, 0]
[2021-05-13 18:17:27] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
// Phase 1: matrix 288 rows 103 cols
[2021-05-13 18:17:27] [INFO ] Computed 4 place invariants in 10 ms
[2021-05-13 18:17:27] [INFO ] [Real]Absence check using 4 positive place invariants in 7 ms returned sat
[2021-05-13 18:17:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:17:27] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2021-05-13 18:17:27] [INFO ] State equation strengthened by 102 read => feed constraints.
[2021-05-13 18:17:27] [INFO ] [Real]Added 102 Read/Feed constraints in 48 ms returned sat
[2021-05-13 18:17:28] [INFO ] Computed and/alt/rep : 2223/114349/285 causal constraints in 101 ms.
[2021-05-13 18:17:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:17:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 10 ms returned sat
[2021-05-13 18:17:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:17:28] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2021-05-13 18:17:28] [INFO ] [Nat]Added 102 Read/Feed constraints in 33 ms returned sat
[2021-05-13 18:17:28] [INFO ] Computed and/alt/rep : 2223/114349/285 causal constraints in 119 ms.
[2021-05-13 18:17:39] [INFO ] Added : 200 causal constraints over 40 iterations in 10651 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 182 ms.
[2021-05-13 18:17:39] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2021-05-13 18:17:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:17:39] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2021-05-13 18:17:39] [INFO ] [Real]Added 102 Read/Feed constraints in 30 ms returned sat
[2021-05-13 18:17:39] [INFO ] Computed and/alt/rep : 2223/114349/285 causal constraints in 107 ms.
[2021-05-13 18:17:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:17:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 8 ms returned sat
[2021-05-13 18:17:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:17:39] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2021-05-13 18:17:39] [INFO ] [Nat]Added 102 Read/Feed constraints in 30 ms returned sat
[2021-05-13 18:17:40] [INFO ] Computed and/alt/rep : 2223/114349/285 causal constraints in 106 ms.
[2021-05-13 18:17:53] [INFO ] Added : 230 causal constraints over 46 iterations in 13401 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 165 ms.
[2021-05-13 18:17:53] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2021-05-13 18:17:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:17:53] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2021-05-13 18:17:53] [INFO ] [Real]Added 102 Read/Feed constraints in 23 ms returned sat
[2021-05-13 18:17:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:17:53] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2021-05-13 18:17:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:17:53] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2021-05-13 18:17:53] [INFO ] [Nat]Added 102 Read/Feed constraints in 29 ms returned sat
[2021-05-13 18:17:54] [INFO ] Computed and/alt/rep : 2223/114349/285 causal constraints in 84 ms.
[2021-05-13 18:18:10] [INFO ] Added : 260 causal constraints over 52 iterations in 16041 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 273 ms.
[2021-05-13 18:18:10] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2021-05-13 18:18:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:18:10] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2021-05-13 18:18:10] [INFO ] [Real]Added 102 Read/Feed constraints in 25 ms returned sat
[2021-05-13 18:18:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:18:10] [INFO ] [Nat]Absence check using 4 positive place invariants in 9 ms returned sat
[2021-05-13 18:18:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:18:10] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2021-05-13 18:18:10] [INFO ] [Nat]Added 102 Read/Feed constraints in 42 ms returned sat
[2021-05-13 18:18:10] [INFO ] Computed and/alt/rep : 2223/114349/285 causal constraints in 86 ms.
[2021-05-13 18:18:25] [INFO ] Added : 250 causal constraints over 50 iterations in 14428 ms. Result :unknown
[2021-05-13 18:18:25] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2021-05-13 18:18:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:18:25] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2021-05-13 18:18:25] [INFO ] [Real]Added 102 Read/Feed constraints in 16 ms returned sat
[2021-05-13 18:18:25] [INFO ] Computed and/alt/rep : 2223/114349/285 causal constraints in 98 ms.
[2021-05-13 18:18:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:18:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 9 ms returned sat
[2021-05-13 18:18:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:18:25] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2021-05-13 18:18:25] [INFO ] [Nat]Added 102 Read/Feed constraints in 30 ms returned sat
[2021-05-13 18:18:25] [INFO ] Computed and/alt/rep : 2223/114349/285 causal constraints in 101 ms.
[2021-05-13 18:18:41] [INFO ] Added : 245 causal constraints over 49 iterations in 15535 ms. Result :unknown
Incomplete Parikh walk after 912700 steps, including 7967 resets, run finished after 9035 ms. (steps per millisecond=101 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 1425300 steps, including 12112 resets, run finished after 13281 ms. (steps per millisecond=107 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 882600 steps, including 7680 resets, run finished after 8521 ms. (steps per millisecond=103 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 1054000 steps, including 9085 resets, run finished after 9725 ms. (steps per millisecond=108 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 1102400 steps, including 9514 resets, run finished after 10049 ms. (steps per millisecond=109 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Support contains 16 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 188 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 241 ms. Remains 103 /103 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
[2021-05-13 18:19:32] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
// Phase 1: matrix 288 rows 103 cols
[2021-05-13 18:19:32] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 18:19:32] [INFO ] Implicit Places using invariants in 155 ms returned []
[2021-05-13 18:19:32] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
// Phase 1: matrix 288 rows 103 cols
[2021-05-13 18:19:32] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-13 18:19:32] [INFO ] State equation strengthened by 102 read => feed constraints.
[2021-05-13 18:19:33] [INFO ] Implicit Places using invariants and state equation in 800 ms returned [22, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 962 ms to find 2 implicit places.
[2021-05-13 18:19:33] [INFO ] Redundant transitions in 145 ms returned []
[2021-05-13 18:19:33] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
// Phase 1: matrix 288 rows 101 cols
[2021-05-13 18:19:33] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 18:19:34] [INFO ] Dead Transitions using invariants and state equation in 1281 ms returned []
Starting structural reductions, iteration 1 : 101/103 places, 2226/2226 transitions.
Applied a total of 0 rules in 154 ms. Remains 101 /101 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
[2021-05-13 18:19:35] [INFO ] Redundant transitions in 147 ms returned []
[2021-05-13 18:19:35] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
// Phase 1: matrix 288 rows 101 cols
[2021-05-13 18:19:35] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-13 18:19:36] [INFO ] Dead Transitions using invariants and state equation in 1066 ms returned []
Finished structural reductions, in 2 iterations. Remains : 101/103 places, 2226/2226 transitions.
Incomplete random walk after 1000000 steps, including 7939 resets, run finished after 6336 ms. (steps per millisecond=157 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 4167 resets, run finished after 3038 ms. (steps per millisecond=329 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 4166 resets, run finished after 3349 ms. (steps per millisecond=298 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 3117 resets, run finished after 2632 ms. (steps per millisecond=379 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3209 resets, run finished after 2622 ms. (steps per millisecond=381 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 3707 resets, run finished after 2791 ms. (steps per millisecond=358 ) properties seen :[0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 5447408 steps, run timeout after 30001 ms. (steps per millisecond=181 ) properties seen :[0, 0, 0, 0, 0]
Probabilistic random walk after 5447408 steps, saw 1447106 distinct states, run finished after 30002 ms. (steps per millisecond=181 ) properties seen :[0, 0, 0, 0, 0]
[2021-05-13 18:20:26] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
// Phase 1: matrix 288 rows 101 cols
[2021-05-13 18:20:26] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-13 18:20:26] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2021-05-13 18:20:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:20:27] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2021-05-13 18:20:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:20:27] [INFO ] [Nat]Absence check using 4 positive place invariants in 6 ms returned sat
[2021-05-13 18:20:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:20:27] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2021-05-13 18:20:27] [INFO ] State equation strengthened by 102 read => feed constraints.
[2021-05-13 18:20:27] [INFO ] [Nat]Added 102 Read/Feed constraints in 39 ms returned sat
[2021-05-13 18:20:27] [INFO ] Computed and/alt/rep : 2223/113509/285 causal constraints in 70 ms.
[2021-05-13 18:20:50] [INFO ] Added : 280 causal constraints over 56 iterations in 23601 ms.(timeout) Result :unknown
[2021-05-13 18:20:50] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2021-05-13 18:20:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:20:51] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2021-05-13 18:20:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:20:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2021-05-13 18:20:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:20:51] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2021-05-13 18:20:51] [INFO ] [Nat]Added 102 Read/Feed constraints in 66 ms returned sat
[2021-05-13 18:20:51] [INFO ] Computed and/alt/rep : 2223/113509/285 causal constraints in 85 ms.
[2021-05-13 18:21:13] [INFO ] Added : 265 causal constraints over 53 iterations in 22124 ms. Result :unknown
[2021-05-13 18:21:13] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2021-05-13 18:21:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:21:13] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2021-05-13 18:21:13] [INFO ] [Real]Added 102 Read/Feed constraints in 25 ms returned sat
[2021-05-13 18:21:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:21:13] [INFO ] [Nat]Absence check using 4 positive place invariants in 9 ms returned sat
[2021-05-13 18:21:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:21:13] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2021-05-13 18:21:13] [INFO ] [Nat]Added 102 Read/Feed constraints in 29 ms returned sat
[2021-05-13 18:21:13] [INFO ] Computed and/alt/rep : 2223/113509/285 causal constraints in 157 ms.
[2021-05-13 18:21:27] [INFO ] Added : 265 causal constraints over 53 iterations in 13882 ms. Result :unknown
[2021-05-13 18:21:27] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2021-05-13 18:21:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:21:27] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2021-05-13 18:21:27] [INFO ] [Real]Added 102 Read/Feed constraints in 23 ms returned sat
[2021-05-13 18:21:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:21:27] [INFO ] [Nat]Absence check using 4 positive place invariants in 10 ms returned sat
[2021-05-13 18:21:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:21:27] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2021-05-13 18:21:27] [INFO ] [Nat]Added 102 Read/Feed constraints in 23 ms returned sat
[2021-05-13 18:21:28] [INFO ] Computed and/alt/rep : 2223/113509/285 causal constraints in 82 ms.
[2021-05-13 18:21:45] [INFO ] Added : 255 causal constraints over 51 iterations in 17949 ms. Result :unknown
[2021-05-13 18:21:45] [INFO ] [Real]Absence check using 4 positive place invariants in 7 ms returned sat
[2021-05-13 18:21:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:21:46] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2021-05-13 18:21:46] [INFO ] [Real]Added 102 Read/Feed constraints in 25 ms returned sat
[2021-05-13 18:21:46] [INFO ] Computed and/alt/rep : 2223/113509/285 causal constraints in 88 ms.
[2021-05-13 18:21:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:21:46] [INFO ] [Nat]Absence check using 4 positive place invariants in 9 ms returned sat
[2021-05-13 18:21:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:21:46] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2021-05-13 18:21:46] [INFO ] [Nat]Added 102 Read/Feed constraints in 28 ms returned sat
[2021-05-13 18:21:46] [INFO ] Computed and/alt/rep : 2223/113509/285 causal constraints in 103 ms.
[2021-05-13 18:22:02] [INFO ] Added : 250 causal constraints over 50 iterations in 15746 ms. Result :unknown
Incomplete Parikh walk after 1180800 steps, including 10141 resets, run finished after 11151 ms. (steps per millisecond=105 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 1359800 steps, including 11481 resets, run finished after 13357 ms. (steps per millisecond=101 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 1506400 steps, including 12637 resets, run finished after 13025 ms. (steps per millisecond=115 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 1046700 steps, including 9027 resets, run finished after 9428 ms. (steps per millisecond=111 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 1216800 steps, including 10364 resets, run finished after 11446 ms. (steps per millisecond=106 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Support contains 16 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 242 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 192 ms. Remains 101 /101 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
[2021-05-13 18:23:01] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
// Phase 1: matrix 288 rows 101 cols
[2021-05-13 18:23:01] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-13 18:23:01] [INFO ] Implicit Places using invariants in 202 ms returned []
[2021-05-13 18:23:01] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
// Phase 1: matrix 288 rows 101 cols
[2021-05-13 18:23:01] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 18:23:01] [INFO ] State equation strengthened by 102 read => feed constraints.
[2021-05-13 18:23:02] [INFO ] Implicit Places using invariants and state equation in 1120 ms returned []
Implicit Place search using SMT with State Equation took 1324 ms to find 0 implicit places.
[2021-05-13 18:23:02] [INFO ] Redundant transitions in 44 ms returned []
[2021-05-13 18:23:02] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
// Phase 1: matrix 288 rows 101 cols
[2021-05-13 18:23:02] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 18:23:03] [INFO ] Dead Transitions using invariants and state equation in 1385 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 707 ms. (steps per millisecond=141 ) properties seen :[0, 0, 0, 0, 0]
[2021-05-13 18:23:04] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
// Phase 1: matrix 288 rows 101 cols
[2021-05-13 18:23:04] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 18:23:04] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2021-05-13 18:23:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:23:04] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2021-05-13 18:23:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:23:04] [INFO ] [Nat]Absence check using 4 positive place invariants in 8 ms returned sat
[2021-05-13 18:23:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:23:04] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2021-05-13 18:23:04] [INFO ] State equation strengthened by 102 read => feed constraints.
[2021-05-13 18:23:04] [INFO ] [Nat]Added 102 Read/Feed constraints in 47 ms returned sat
[2021-05-13 18:23:05] [INFO ] Computed and/alt/rep : 2223/113509/285 causal constraints in 98 ms.
[2021-05-13 18:23:22] [INFO ] Added : 265 causal constraints over 53 iterations in 17666 ms. Result :sat
[2021-05-13 18:23:22] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2021-05-13 18:23:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:23:22] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2021-05-13 18:23:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:23:22] [INFO ] [Nat]Absence check using 4 positive place invariants in 8 ms returned sat
[2021-05-13 18:23:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:23:23] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2021-05-13 18:23:23] [INFO ] [Nat]Added 102 Read/Feed constraints in 36 ms returned sat
[2021-05-13 18:23:23] [INFO ] Computed and/alt/rep : 2223/113509/285 causal constraints in 63 ms.
[2021-05-13 18:23:42] [INFO ] Added : 265 causal constraints over 53 iterations in 19796 ms. Result :unknown
[2021-05-13 18:23:42] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2021-05-13 18:23:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:23:43] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2021-05-13 18:23:43] [INFO ] [Real]Added 102 Read/Feed constraints in 19 ms returned sat
[2021-05-13 18:23:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:23:43] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2021-05-13 18:23:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:23:43] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2021-05-13 18:23:43] [INFO ] [Nat]Added 102 Read/Feed constraints in 34 ms returned sat
[2021-05-13 18:23:43] [INFO ] Computed and/alt/rep : 2223/113509/285 causal constraints in 212 ms.
[2021-05-13 18:23:57] [INFO ] Added : 265 causal constraints over 53 iterations in 14409 ms. Result :unknown
[2021-05-13 18:23:57] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2021-05-13 18:23:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:23:57] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2021-05-13 18:23:57] [INFO ] [Real]Added 102 Read/Feed constraints in 27 ms returned sat
[2021-05-13 18:23:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:23:57] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2021-05-13 18:23:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:23:57] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2021-05-13 18:23:57] [INFO ] [Nat]Added 102 Read/Feed constraints in 20 ms returned sat
[2021-05-13 18:23:57] [INFO ] Computed and/alt/rep : 2223/113509/285 causal constraints in 80 ms.
[2021-05-13 18:24:13] [INFO ] Added : 255 causal constraints over 51 iterations in 16022 ms. Result :sat
[2021-05-13 18:24:13] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2021-05-13 18:24:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:24:14] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2021-05-13 18:24:14] [INFO ] [Real]Added 102 Read/Feed constraints in 22 ms returned sat
[2021-05-13 18:24:14] [INFO ] Computed and/alt/rep : 2223/113509/285 causal constraints in 87 ms.
[2021-05-13 18:24:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:24:14] [INFO ] [Nat]Absence check using 4 positive place invariants in 8 ms returned sat
[2021-05-13 18:24:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:24:14] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2021-05-13 18:24:14] [INFO ] [Nat]Added 102 Read/Feed constraints in 24 ms returned sat
[2021-05-13 18:24:14] [INFO ] Computed and/alt/rep : 2223/113509/285 causal constraints in 97 ms.
[2021-05-13 18:24:30] [INFO ] Added : 250 causal constraints over 50 iterations in 15901 ms. Result :sat
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
Applied a total of 1942 rules in 17 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:24:30] [INFO ] Computed 4 place invariants in 3 ms
[2021-05-13 18:24:30] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2021-05-13 18:24:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:24:30] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2021-05-13 18:24:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-13 18:24:30] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2021-05-13 18:24:30] [INFO ] Computed and/alt/rep : 283/8825/283 causal constraints in 19 ms.
[2021-05-13 18:24:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:24:30] [INFO ] [Nat]Absence check using 4 positive place invariants in 6 ms returned sat
[2021-05-13 18:24:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:24:30] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2021-05-13 18:24:30] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2021-05-13 18:24:30] [INFO ] Computed and/alt/rep : 283/8825/283 causal constraints in 20 ms.
[2021-05-13 18:24:37] [INFO ] Added : 278 causal constraints over 56 iterations in 6201 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 156 ms.
[2021-05-13 18:24:37] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2021-05-13 18:24:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:24:37] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2021-05-13 18:24:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:24:37] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2021-05-13 18:24:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:24:37] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2021-05-13 18:24:37] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2021-05-13 18:24:37] [INFO ] Computed and/alt/rep : 283/8825/283 causal constraints in 20 ms.
[2021-05-13 18:24:43] [INFO ] Added : 279 causal constraints over 57 iterations in 6040 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 145 ms.
[2021-05-13 18:24:43] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2021-05-13 18:24:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:24:43] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2021-05-13 18:24:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:24:43] [INFO ] [Nat]Absence check using 4 positive place invariants in 11 ms returned sat
[2021-05-13 18:24:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:24:44] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2021-05-13 18:24:44] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2021-05-13 18:24:44] [INFO ] Computed and/alt/rep : 283/8825/283 causal constraints in 29 ms.
[2021-05-13 18:24:51] [INFO ] Added : 258 causal constraints over 52 iterations in 7789 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 112 ms.
[2021-05-13 18:24:52] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2021-05-13 18:24:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:24:52] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2021-05-13 18:24:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:24:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2021-05-13 18:24:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:24:52] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2021-05-13 18:24:52] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2021-05-13 18:24:52] [INFO ] Computed and/alt/rep : 283/8825/283 causal constraints in 18 ms.
[2021-05-13 18:25:02] [INFO ] Added : 268 causal constraints over 54 iterations in 9846 ms. Result :unknown
[2021-05-13 18:25:02] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2021-05-13 18:25:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:25:02] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2021-05-13 18:25:02] [INFO ] [Real]Added 2 Read/Feed constraints in 3 ms returned sat
[2021-05-13 18:25:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:25:02] [INFO ] [Nat]Absence check using 4 positive place invariants in 8 ms returned sat
[2021-05-13 18:25:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:25:02] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2021-05-13 18:25:02] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2021-05-13 18:25:02] [INFO ] Computed and/alt/rep : 283/8825/283 causal constraints in 19 ms.
[2021-05-13 18:25:12] [INFO ] Added : 270 causal constraints over 54 iterations in 10295 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 170 ms.
[2021-05-13 18:25:13] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2021-05-13 18:25:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 39 ms.
[2021-05-13 18:25:13] [INFO ] Flatten gal took : 309 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ BridgeAndVehicles-PT-V20P10N50 @ 3570 seconds

FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3070
rslt: Output for ReachabilityFireability @ BridgeAndVehicles-PT-V20P10N50

{
"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:25:13 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"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": 863
},
"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": 1114
},
"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 <= p13) AND (1 <= p23) AND (1 <= p24) AND (1 <= p87))))",
"processed_size": 65,
"rewrites": 1
},
"result":
{
"edges": 3890364,
"markings": 1460132,
"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": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1623
},
"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 <= p1) AND (1 <= p22) AND (1 <= p39) AND (1 <= p93))))",
"processed_size": 64,
"rewrites": 1
},
"result":
{
"edges": 3690221,
"markings": 1404560,
"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": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3157
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "A (G (((p15 <= 0) OR (p23 <= 0) OR (p24 <= 0) OR (p79 <= 0) OR ((1 <= p1) AND (1 <= p22) AND (1 <= p39) AND (1 <= p66)) OR ((1 <= p1) AND (1 <= p22) AND (1 <= p35) AND (1 <= p90)))))",
"processed_size": 187,
"rewrites": 2
},
"result":
{
"edges": 3873262,
"markings": 1453329,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 96,
"problems": 16
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 76208,
"runtime": 500.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : A(G(**)) : A(G(**)) : E(F(**)) : E(F(**))"
},
"net":
{
"arcs": 17018,
"conflict_clusters": 3,
"places": 101,
"places_significant": 97,
"singleton_clusters": 0,
"transitions": 2226
},
"result":
{
"preliminary_value": "no yes yes no no ",
"value": "no yes yes no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 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))))) : A (G (((p15 <= 0) OR (p23 <= 0) OR (p24 <= 0) OR (p79 <= 0) OR ((1 <= p1) AND (1 <= p22) AND (1 <= p39) AND (1 <= p66)) OR ((1 <= p1) AND (1 <= p22) AND (1 <= p35) AND (1 <= p90))))) : E (F (((1 <= p13) AND (1 <= p23) AND (1 <= p24) AND (1 <= p87)))) : E (F (((1 <= p1) AND (1 <= p22) AND (1 <= p39) AND (1 <= p93))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 713 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 || 58100 markings, 116740 edges, 11620 markings/sec, 0 secs
lola: sara is running 5 secs || 114200 markings, 236768 edges, 11220 markings/sec, 5 secs
lola: sara is running 10 secs || 172012 markings, 364222 edges, 11562 markings/sec, 10 secs
lola: sara is running 15 secs || 230108 markings, 494102 edges, 11619 markings/sec, 15 secs
lola: sara is running 20 secs || 294292 markings, 639278 edges, 12837 markings/sec, 20 secs
lola: sara is running 25 secs || 358790 markings, 785821 edges, 12900 markings/sec, 25 secs
lola: sara is running 30 secs || 423132 markings, 935756 edges, 12868 markings/sec, 30 secs
lola: sara is running 35 secs || 487902 markings, 1085328 edges, 12954 markings/sec, 35 secs
lola: sara is running 40 secs || 552431 markings, 1235141 edges, 12906 markings/sec, 40 secs
lola: sara is running 45 secs || 606908 markings, 1363396 edges, 10895 markings/sec, 45 secs
lola: sara is running 50 secs || 659734 markings, 1488498 edges, 10565 markings/sec, 50 secs
lola: sara is running 55 secs || 717986 markings, 1626398 edges, 11650 markings/sec, 55 secs
lola: sara is running 60 secs || 780203 markings, 1774100 edges, 12443 markings/sec, 60 secs
lola: sara is running 65 secs || 843981 markings, 1925951 edges, 12756 markings/sec, 65 secs
lola: sara is running 70 secs || 908351 markings, 2080007 edges, 12874 markings/sec, 70 secs
lola: sara is running 75 secs || 972276 markings, 2231685 edges, 12785 markings/sec, 75 secs
lola: sara is running 80 secs || 1036630 markings, 2388450 edges, 12871 markings/sec, 80 secs
lola: sara is running 85 secs || 1100352 markings, 2540770 edges, 12744 markings/sec, 85 secs
lola: sara is running 90 secs || 1160785 markings, 2687489 edges, 12087 markings/sec, 90 secs
lola: sara is running 95 secs || 1214887 markings, 2820835 edges, 10820 markings/sec, 95 secs
lola: sara is running 100 secs || 1279683 markings, 2976202 edges, 12959 markings/sec, 100 secs
lola: sara is running 105 secs || 1343729 markings, 3132237 edges, 12809 markings/sec, 105 secs
sara: warning, failure of lp_solve (at job 14288)
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 863 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 || 61934 markings, 124782 edges, 12387 markings/sec, 0 secs
lola: sara is running 5 secs || 127017 markings, 265027 edges, 13017 markings/sec, 5 secs
lola: sara is running 10 secs || 191720 markings, 407526 edges, 12941 markings/sec, 10 secs
lola: sara is running 15 secs || 252673 markings, 544655 edges, 12191 markings/sec, 15 secs
lola: sara is running 20 secs || 317441 markings, 691242 edges, 12954 markings/sec, 20 secs
lola: sara is running 25 secs || 381980 markings, 839487 edges, 12908 markings/sec, 25 secs
lola: sara is running 30 secs || 446367 markings, 988507 edges, 12877 markings/sec, 30 secs
lola: sara is running 35 secs || 510789 markings, 1139489 edges, 12884 markings/sec, 35 secs
lola: sara is running 40 secs || 575724 markings, 1290150 edges, 12987 markings/sec, 40 secs
lola: sara is running 45 secs || 640279 markings, 1441388 edges, 12911 markings/sec, 45 secs
lola: sara is running 50 secs || 704160 markings, 1594880 edges, 12776 markings/sec, 50 secs
lola: sara is running 55 secs || 769223 markings, 1747099 edges, 13013 markings/sec, 55 secs
lola: sara is running 60 secs || 833147 markings, 1899501 edges, 12785 markings/sec, 60 secs
lola: sara is running 65 secs || 898184 markings, 2055272 edges, 13007 markings/sec, 65 secs
lola: sara is running 70 secs || 962281 markings, 2207548 edges, 12819 markings/sec, 70 secs
lola: sara is running 75 secs || 1026989 markings, 2364179 edges, 12942 markings/sec, 75 secs
lola: sara is running 80 secs || 1090525 markings, 2517872 edges, 12707 markings/sec, 80 secs
lola: sara is running 85 secs || 1153665 markings, 2670422 edges, 12628 markings/sec, 85 secs
lola: sara is running 90 secs || 1208416 markings, 2804832 edges, 10950 markings/sec, 90 secs
lola: sara is running 95 secs || 1264087 markings, 2937670 edges, 11134 markings/sec, 95 secs
lola: sara is running 100 secs || 1319741 markings, 3072603 edges, 11131 markings/sec, 100 secs
lola: sara is running 105 secs || 1380015 markings, 3219596 edges, 12055 markings/sec, 105 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 1114 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p13) AND (1 <= p23) AND (1 <= p24) AND (1 <= p87))))
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 <= p13) AND (1 <= p23) AND (1 <= p24) AND (1 <= p87))))
lola: processed formula length: 65
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 <= p13) AND (1 <= p23) AND (1 <= p24) AND (1 <= p87))
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-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 || 76185 markings, 188718 edges, 15237 markings/sec, 0 secs
sara: warning, failure of lp_solve (at job 843)
lola: sara is running 5 secs || 155614 markings, 393160 edges, 15886 markings/sec, 5 secs
lola: sara is running 10 secs || 230099 markings, 587367 edges, 14897 markings/sec, 10 secs
lola: sara is running 15 secs || 307776 markings, 790205 edges, 15535 markings/sec, 15 secs
lola: sara is running 20 secs || 387964 markings, 1001740 edges, 16038 markings/sec, 20 secs
lola: sara is running 25 secs || 466786 markings, 1208615 edges, 15764 markings/sec, 25 secs
lola: sara is running 30 secs || 541609 markings, 1406634 edges, 14965 markings/sec, 30 secs
lola: sara is running 35 secs || 621731 markings, 1621261 edges, 16024 markings/sec, 35 secs
lola: sara is running 40 secs || 697312 markings, 1826611 edges, 15116 markings/sec, 40 secs
lola: sara is running 45 secs || 770756 markings, 2024948 edges, 14689 markings/sec, 45 secs
lola: sara is running 50 secs || 854919 markings, 2248857 edges, 16833 markings/sec, 50 secs
lola: sara is running 55 secs || 926692 markings, 2442368 edges, 14355 markings/sec, 55 secs
lola: sara is running 60 secs || 1000097 markings, 2643224 edges, 14681 markings/sec, 60 secs
lola: sara is running 65 secs || 1087242 markings, 2876481 edges, 17429 markings/sec, 65 secs
lola: sara is running 70 secs || 1158886 markings, 3072114 edges, 14329 markings/sec, 70 secs
lola: sara is running 75 secs || 1228694 markings, 3259098 edges, 13962 markings/sec, 75 secs
lola: sara is running 80 secs || 1308020 markings, 3471199 edges, 15865 markings/sec, 80 secs
lola: sara is running 85 secs || 1393951 markings, 3707670 edges, 17186 markings/sec, 85 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1460132 markings, 3890364 edges
lola: ========================================
lola: subprocess 3 will run for 1623 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p1) AND (1 <= p22) AND (1 <= p39) AND (1 <= p93))))
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 <= p1) AND (1 <= p22) AND (1 <= p39) AND (1 <= p93))))
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 <= p1) AND (1 <= p22) AND (1 <= p39) AND (1 <= p93))
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-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 || 74536 markings, 167990 edges, 14907 markings/sec, 0 secs
lola: sara is running 5 secs || 152802 markings, 359952 edges, 15653 markings/sec, 5 secs
lola: sara is running 10 secs || 237313 markings, 575752 edges, 16902 markings/sec, 10 secs
lola: sara is running 15 secs || 311766 markings, 768621 edges, 14891 markings/sec, 15 secs
lola: sara is running 20 secs || 386874 markings, 965373 edges, 15022 markings/sec, 20 secs
lola: sara is running 25 secs || 467325 markings, 1176933 edges, 16090 markings/sec, 25 secs
lola: sara is running 30 secs || 548664 markings, 1390739 edges, 16268 markings/sec, 30 secs
lola: sara is running 35 secs || 630507 markings, 1606359 edges, 16369 markings/sec, 35 secs
lola: sara is running 40 secs || 713019 markings, 1827394 edges, 16502 markings/sec, 40 secs
lola: sara is running 45 secs || 781039 markings, 2010649 edges, 13604 markings/sec, 45 secs
lola: sara is running 50 secs || 859505 markings, 2216901 edges, 15693 markings/sec, 50 secs
lola: sara is running 55 secs || 939061 markings, 2436022 edges, 15911 markings/sec, 55 secs
lola: sara is running 60 secs || 1010385 markings, 2623088 edges, 14265 markings/sec, 60 secs
lola: sara is running 65 secs || 1094054 markings, 2850312 edges, 16734 markings/sec, 65 secs
lola: sara is running 70 secs || 1164670 markings, 3039270 edges, 14123 markings/sec, 70 secs
lola: sara is running 75 secs || 1246949 markings, 3261289 edges, 16456 markings/sec, 75 secs
lola: sara is running 80 secs || 1317648 markings, 3451623 edges, 14140 markings/sec, 80 secs
lola: sara is running 85 secs || 1401102 markings, 3681665 edges, 16691 markings/sec, 85 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1404560 markings, 3690221 edges
lola: ========================================
lola: subprocess 4 will run for 3157 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p15 <= 0) OR (p23 <= 0) OR (p24 <= 0) OR (p79 <= 0) OR ((1 <= p1) AND (1 <= p22) AND (1 <= p39) AND (1 <= p66)) OR ((1 <= p1) AND (1 <= p22) AND (1 <= p35) AND (1 <= p90)))))
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 (((p15 <= 0) OR (p23 <= 0) OR (p24 <= 0) OR (p79 <= 0) OR ((1 <= p1) AND (1 <= p22) AND (1 <= p39) AND (1 <= p66)) OR ((1 <= p1) AND (1 <= p22) AND (1 <= p35) AND (1 <= p90)))))
lola: processed formula length: 187
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 <= p15) AND (1 <= p23) AND (1 <= p24) AND (1 <= p79) AND ((p1 <= 0) OR (p22 <= 0) OR (p39 <= 0) OR (p66 <= 0)) AND ((p1 <= 0) OR (p22 <= 0) OR (p35 <= 0) OR (p90 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 96 literals and 16 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 195)
lola: sara is running 0 secs || 90735 markings, 212132 edges, 18147 markings/sec, 0 secs
lola: sara is running 5 secs || 188929 markings, 466628 edges, 19639 markings/sec, 5 secs
lola: sara is running 10 secs || 290479 markings, 735198 edges, 20310 markings/sec, 10 secs
lola: sara is running 15 secs || 393383 markings, 1010339 edges, 20581 markings/sec, 15 secs
lola: sara is running 20 secs || 498437 markings, 1294053 edges, 21011 markings/sec, 20 secs
lola: sara is running 25 secs || 599282 markings, 1569787 edges, 20169 markings/sec, 25 secs
lola: sara is running 30 secs || 683953 markings, 1788349 edges, 16934 markings/sec, 30 secs
lola: sara is running 35 secs || 762410 markings, 2004968 edges, 15691 markings/sec, 35 secs
lola: sara is running 40 secs || 836392 markings, 2202903 edges, 14796 markings/sec, 40 secs
lola: sara is running 45 secs || 913925 markings, 2405260 edges, 15507 markings/sec, 45 secs
lola: sara is running 50 secs || 990003 markings, 2617984 edges, 15216 markings/sec, 50 secs
lola: sara is running 55 secs || 1062700 markings, 2809152 edges, 14539 markings/sec, 55 secs
lola: sara is running 60 secs || 1139545 markings, 3021558 edges, 15369 markings/sec, 60 secs
lola: sara is running 65 secs || 1211005 markings, 3210838 edges, 14292 markings/sec, 65 secs
lola: sara is running 70 secs || 1287547 markings, 3422983 edges, 15308 markings/sec, 70 secs
lola: sara is running 75 secs || 1354455 markings, 3599450 edges, 13382 markings/sec, 75 secs
lola: sara is running 80 secs || 1422441 markings, 3790259 edges, 13597 markings/sec, 80 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1453329 markings, 3873262 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes no no
lola:
preliminary result: no yes yes no no
lola: memory consumption: 76208 KB
lola: time consumption: 500 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-V20P10N50"
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-V20P10N50, 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-162038176900100"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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