Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r180-ebro-158987900000287.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-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 itslola
Input is DES-PT-30b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-ebro-158987900000287
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 280K
-rw-r--r-- 1 mcc users 3.3K Mar 30 01:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 30 01:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 28 16:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 8 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K Mar 27 08:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 27 08:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 26 08:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 26 08:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 103K Mar 24 05:37 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 DES-PT-30b-ReachabilityFireability-00
FORMULA_NAME DES-PT-30b-ReachabilityFireability-01
FORMULA_NAME DES-PT-30b-ReachabilityFireability-02
FORMULA_NAME DES-PT-30b-ReachabilityFireability-03
FORMULA_NAME DES-PT-30b-ReachabilityFireability-04
FORMULA_NAME DES-PT-30b-ReachabilityFireability-05
FORMULA_NAME DES-PT-30b-ReachabilityFireability-06
FORMULA_NAME DES-PT-30b-ReachabilityFireability-07
FORMULA_NAME DES-PT-30b-ReachabilityFireability-08
FORMULA_NAME DES-PT-30b-ReachabilityFireability-09
FORMULA_NAME DES-PT-30b-ReachabilityFireability-10
FORMULA_NAME DES-PT-30b-ReachabilityFireability-11
FORMULA_NAME DES-PT-30b-ReachabilityFireability-12
FORMULA_NAME DES-PT-30b-ReachabilityFireability-13
FORMULA_NAME DES-PT-30b-ReachabilityFireability-14
FORMULA_NAME DES-PT-30b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591190469590

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 13:21:13] [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]
[2020-06-03 13:21:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 13:21:14] [INFO ] Load time of PNML (sax parser for PT used): 229 ms
[2020-06-03 13:21:14] [INFO ] Transformed 399 places.
[2020-06-03 13:21:14] [INFO ] Transformed 350 transitions.
[2020-06-03 13:21:14] [INFO ] Found NUPN structural information;
[2020-06-03 13:21:14] [INFO ] Parsed PT model containing 399 places and 350 transitions in 406 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 83 resets, run finished after 175 ms. (steps per millisecond=57 ) properties seen :[0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0]
FORMULA DES-PT-30b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 46 ms. (steps per millisecond=217 ) properties seen :[1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA DES-PT-30b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 50 ms. (steps per millisecond=200 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 71 ms. (steps per millisecond=140 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 76 ms. (steps per millisecond=131 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 1, 0]
FORMULA DES-PT-30b-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 58 ms. (steps per millisecond=172 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 350 rows 399 cols
[2020-06-03 13:21:15] [INFO ] Computed 65 place invariants in 55 ms
[2020-06-03 13:21:15] [INFO ] [Real]Absence check using 39 positive place invariants in 80 ms returned sat
[2020-06-03 13:21:15] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 46 ms returned sat
[2020-06-03 13:21:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:21:16] [INFO ] [Real]Absence check using state equation in 878 ms returned sat
[2020-06-03 13:21:16] [INFO ] Deduced a trap composed of 8 places in 243 ms
[2020-06-03 13:21:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 356 ms
[2020-06-03 13:21:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:21:17] [INFO ] [Nat]Absence check using 39 positive place invariants in 89 ms returned sat
[2020-06-03 13:21:17] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 79 ms returned sat
[2020-06-03 13:21:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:21:18] [INFO ] [Nat]Absence check using state equation in 1104 ms returned sat
[2020-06-03 13:21:18] [INFO ] Deduced a trap composed of 18 places in 172 ms
[2020-06-03 13:21:18] [INFO ] Deduced a trap composed of 10 places in 131 ms
[2020-06-03 13:21:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 443 ms
[2020-06-03 13:21:18] [INFO ] Computed and/alt/rep : 349/847/349 causal constraints in 43 ms.
[2020-06-03 13:21:21] [INFO ] Added : 260 causal constraints over 52 iterations in 3211 ms. Result :(error "Failed to check-sat")
[2020-06-03 13:21:22] [INFO ] [Real]Absence check using 39 positive place invariants in 90 ms returned sat
[2020-06-03 13:21:22] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 61 ms returned sat
[2020-06-03 13:21:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:21:23] [INFO ] [Real]Absence check using state equation in 1705 ms returned sat
[2020-06-03 13:21:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:21:24] [INFO ] [Nat]Absence check using 39 positive place invariants in 79 ms returned sat
[2020-06-03 13:21:24] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 81 ms returned sat
[2020-06-03 13:21:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:21:25] [INFO ] [Nat]Absence check using state equation in 1617 ms returned sat
[2020-06-03 13:21:26] [INFO ] Deduced a trap composed of 45 places in 244 ms
[2020-06-03 13:21:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 327 ms
[2020-06-03 13:21:26] [INFO ] Computed and/alt/rep : 349/847/349 causal constraints in 46 ms.
19timeout
^^^^^^^^^
(error "Invalid token: 19timeout")
[2020-06-03 13:21:28] [INFO ] Added : 230 causal constraints over 46 iterations in 2814 ms. Result :(error "Failed to check-sat")
[2020-06-03 13:21:29] [INFO ] [Real]Absence check using 39 positive place invariants in 58 ms returned sat
[2020-06-03 13:21:29] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 38 ms returned sat
[2020-06-03 13:21:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:21:30] [INFO ] [Real]Absence check using state equation in 832 ms returned sat
[2020-06-03 13:21:30] [INFO ] Deduced a trap composed of 12 places in 286 ms
[2020-06-03 13:21:30] [INFO ] Deduced a trap composed of 14 places in 280 ms
[2020-06-03 13:21:30] [INFO ] Deduced a trap composed of 15 places in 248 ms
[2020-06-03 13:21:31] [INFO ] Deduced a trap composed of 16 places in 256 ms
[2020-06-03 13:21:31] [INFO ] Deduced a trap composed of 12 places in 243 ms
[2020-06-03 13:21:31] [INFO ] Deduced a trap composed of 23 places in 235 ms
[2020-06-03 13:21:32] [INFO ] Deduced a trap composed of 14 places in 233 ms
[2020-06-03 13:21:32] [INFO ] Deduced a trap composed of 20 places in 304 ms
[2020-06-03 13:21:33] [INFO ] Deduced a trap composed of 15 places in 645 ms
[2020-06-03 13:21:33] [INFO ] Deduced a trap composed of 14 places in 361 ms
[2020-06-03 13:21:33] [INFO ] Deduced a trap composed of 28 places in 259 ms
[2020-06-03 13:21:34] [INFO ] Deduced a trap composed of 19 places in 195 ms
[2020-06-03 13:21:34] [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 (> (+ s0 s1 s3 s4 s35 s318 s319 s320 s326 s327 s328 s346 s353 s356 s365 s374 s393 s394 s395) 0)") while checking expression at index 2
[2020-06-03 13:21:34] [INFO ] [Real]Absence check using 39 positive place invariants in 47 ms returned sat
[2020-06-03 13:21:34] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 48 ms returned sat
[2020-06-03 13:21:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:21:35] [INFO ] [Real]Absence check using state equation in 1008 ms returned sat
[2020-06-03 13:21:35] [INFO ] Deduced a trap composed of 14 places in 186 ms
[2020-06-03 13:21:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 279 ms
[2020-06-03 13:21:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:21:35] [INFO ] [Nat]Absence check using 39 positive place invariants in 74 ms returned sat
[2020-06-03 13:21:35] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 115 ms returned sat
[2020-06-03 13:21:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:21:37] [INFO ] [Nat]Absence check using state equation in 1482 ms returned sat
[2020-06-03 13:21:37] [INFO ] Deduced a trap composed of 8 places in 170 ms
[2020-06-03 13:21:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 250 ms
[2020-06-03 13:21:37] [INFO ] Computed and/alt/rep : 349/847/349 causal constraints in 45 ms.
[2020-06-03 13:21:40] [INFO ] Added : 215 causal constraints over 43 iterations in 2985 ms. Result :unknown
[2020-06-03 13:21:40] [INFO ] [Real]Absence check using 39 positive place invariants in 57 ms returned sat
[2020-06-03 13:21:40] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 42 ms returned sat
[2020-06-03 13:21:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:21:41] [INFO ] [Real]Absence check using state equation in 969 ms returned sat
[2020-06-03 13:21:41] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:21:42] [INFO ] [Nat]Absence check using 39 positive place invariants in 75 ms returned sat
[2020-06-03 13:21:42] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 56 ms returned sat
[2020-06-03 13:21:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:21:42] [INFO ] [Nat]Absence check using state equation in 859 ms returned sat
[2020-06-03 13:21:43] [INFO ] Deduced a trap composed of 8 places in 165 ms
[2020-06-03 13:21:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 244 ms
[2020-06-03 13:21:43] [INFO ] Computed and/alt/rep : 349/847/349 causal constraints in 53 ms.
[2020-06-03 13:21:46] [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 (=> (> t144 0) (and (> t293 0) (< o293 o144)))") while checking expression at index 4
[2020-06-03 13:21:46] [INFO ] [Real]Absence check using 39 positive place invariants in 45 ms returned sat
[2020-06-03 13:21:47] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 36 ms returned sat
[2020-06-03 13:21:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:21:47] [INFO ] [Real]Absence check using state equation in 820 ms returned sat
[2020-06-03 13:21:48] [INFO ] Deduced a trap composed of 14 places in 201 ms
[2020-06-03 13:21:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 264 ms
[2020-06-03 13:21:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:21:48] [INFO ] [Nat]Absence check using 39 positive place invariants in 63 ms returned sat
[2020-06-03 13:21:48] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 34 ms returned sat
[2020-06-03 13:21:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:21:49] [INFO ] [Nat]Absence check using state equation in 882 ms returned sat
[2020-06-03 13:21:49] [INFO ] Deduced a trap composed of 9 places in 249 ms
[2020-06-03 13:21:49] [INFO ] Deduced a trap composed of 29 places in 227 ms
[2020-06-03 13:21:49] [INFO ] Deduced a trap composed of 39 places in 140 ms
[2020-06-03 13:21:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 789 ms
[2020-06-03 13:21:50] [INFO ] Computed and/alt/rep : 349/847/349 causal constraints in 48 ms.
[2020-06-03 13:21:53] [INFO ] Added : 220 causal constraints over 44 iterations in 3153 ms. Result :(error "Failed to check-sat")
[2020-06-03 13:21:53] [INFO ] [Real]Absence check using 39 positive place invariants in 55 ms returned sat
[2020-06-03 13:21:53] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 59 ms returned sat
[2020-06-03 13:21:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:21:56] [INFO ] [Real]Absence check using state equation in 3432 ms returned sat
[2020-06-03 13:21:57] [INFO ] Deduced a trap composed of 8 places in 205 ms
[2020-06-03 13:21:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 314 ms
[2020-06-03 13:21:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:21:57] [INFO ] [Nat]Absence check using 39 positive place invariants in 71 ms returned sat
[2020-06-03 13:21:57] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 53 ms returned sat
[2020-06-03 13:21:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:21:59] [INFO ] [Nat]Absence check using state equation in 1672 ms returned sat
[2020-06-03 13:21:59] [INFO ] Deduced a trap composed of 8 places in 211 ms
[2020-06-03 13:21:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 285 ms
[2020-06-03 13:21:59] [INFO ] Computed and/alt/rep : 349/847/349 causal constraints in 46 ms.
[2020-06-03 13:22:02] [INFO ] Added : 215 causal constraints over 43 iterations in 2844 ms. Result :unknown
[2020-06-03 13:22:02] [INFO ] [Real]Absence check using 39 positive place invariants in 48 ms returned sat
[2020-06-03 13:22:02] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 52 ms returned sat
[2020-06-03 13:22:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:22:03] [INFO ] [Real]Absence check using state equation in 1465 ms returned sat
[2020-06-03 13:22:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:22:04] [INFO ] [Nat]Absence check using 39 positive place invariants in 72 ms returned sat
[2020-06-03 13:22:04] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 66 ms returned sat
[2020-06-03 13:22:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:22:05] [INFO ] [Nat]Absence check using state equation in 1794 ms returned sat
[2020-06-03 13:22:06] [INFO ] Deduced a trap composed of 8 places in 194 ms
[2020-06-03 13:22:06] [INFO ] Deduced a trap composed of 14 places in 117 ms
[2020-06-03 13:22:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 473 ms
[2020-06-03 13:22:06] [INFO ] Computed and/alt/rep : 349/847/349 causal constraints in 42 ms.
[2020-06-03 13:22:08] [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 (=> (> t156 0) (and (> t296 0) (< o296 o156)))") while checking expression at index 7
[2020-06-03 13:22:09] [INFO ] [Real]Absence check using 39 positive place invariants in 46 ms returned sat
[2020-06-03 13:22:09] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 48 ms returned sat
[2020-06-03 13:22:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:22:10] [INFO ] [Real]Absence check using state equation in 1047 ms returned sat
[2020-06-03 13:22:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:22:10] [INFO ] [Nat]Absence check using 39 positive place invariants in 75 ms returned sat
[2020-06-03 13:22:10] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 82 ms returned sat
[2020-06-03 13:22:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:22:13] [INFO ] [Nat]Absence check using state equation in 2961 ms returned sat
[2020-06-03 13:22:13] [INFO ] Deduced a trap composed of 17 places in 227 ms
[2020-06-03 13:22:13] [INFO ] Deduced a trap composed of 23 places in 166 ms
[2020-06-03 13:22:14] [INFO ] Deduced a trap composed of 8 places in 113 ms
[2020-06-03 13:22:14] [INFO ] Deduced a trap composed of 32 places in 113 ms
[2020-06-03 13:22:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 802 ms
[2020-06-03 13:22:14] [INFO ] Computed and/alt/rep : 349/847/349 causal constraints in 41 ms.
[2020-06-03 13:22:15] [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 (=> (> t61 0) (and (> t329 0) (< o329 o61)))") while checking expression at index 8
Incomplete Parikh walk after 442300 steps, including 4922 resets, run finished after 2122 ms. (steps per millisecond=208 ) properties seen :[0, 0, 0, 0, 0, 1, 0, 0, 0] could not realise parikh vector
FORMULA DES-PT-30b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 422900 steps, including 4485 resets, run finished after 1913 ms. (steps per millisecond=221 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 72 out of 399 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 399/399 places, 350/350 transitions.
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Graph (complete) has 858 edges and 399 vertex of which 388 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.14 ms
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 388 transition count 333
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 23 place count 378 transition count 333
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 23 place count 378 transition count 326
Deduced a syphon composed of 7 places in 5 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 37 place count 371 transition count 326
Symmetric choice reduction at 2 with 15 rule applications. Total rules 52 place count 371 transition count 326
Deduced a syphon composed of 15 places in 4 ms
Reduce places removed 15 places and 15 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 82 place count 356 transition count 311
Symmetric choice reduction at 2 with 8 rule applications. Total rules 90 place count 356 transition count 311
Deduced a syphon composed of 8 places in 4 ms
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 106 place count 348 transition count 303
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 9 rules applied. Total rules applied 115 place count 348 transition count 294
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 118 place count 346 transition count 293
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 3 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 4 with 84 rules applied. Total rules applied 202 place count 304 transition count 251
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 204 place count 303 transition count 252
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 208 place count 303 transition count 248
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 212 place count 299 transition count 248
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 215 place count 299 transition count 245
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 218 place count 296 transition count 245
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 219 place count 296 transition count 245
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 220 place count 295 transition count 244
Applied a total of 220 rules in 346 ms. Remains 295 /399 variables (removed 104) and now considering 244/350 (removed 106) transitions.
Finished structural reductions, in 1 iterations. Remains : 295/399 places, 244/350 transitions.
Incomplete random walk after 1000000 steps, including 14370 resets, run finished after 4297 ms. (steps per millisecond=232 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 2196 resets, run finished after 1835 ms. (steps per millisecond=544 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2308 resets, run finished after 2008 ms. (steps per millisecond=498 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2226 resets, run finished after 2089 ms. (steps per millisecond=478 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2360 resets, run finished after 2345 ms. (steps per millisecond=426 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 2313 resets, run finished after 2078 ms. (steps per millisecond=481 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2194 resets, run finished after 3063 ms. (steps per millisecond=326 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3099 resets, run finished after 2366 ms. (steps per millisecond=422 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2504 resets, run finished after 3159 ms. (steps per millisecond=316 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 1]
FORMULA DES-PT-30b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 244 rows 295 cols
[2020-06-03 13:22:42] [INFO ] Computed 61 place invariants in 20 ms
[2020-06-03 13:22:42] [INFO ] [Real]Absence check using 36 positive place invariants in 41 ms returned sat
[2020-06-03 13:22:43] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 33 ms returned sat
[2020-06-03 13:22:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:22:43] [INFO ] [Real]Absence check using state equation in 514 ms returned sat
[2020-06-03 13:22:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:22:43] [INFO ] [Nat]Absence check using 36 positive place invariants in 50 ms returned sat
[2020-06-03 13:22:43] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 78 ms returned sat
[2020-06-03 13:22:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:22:44] [INFO ] [Nat]Absence check using state equation in 679 ms returned sat
[2020-06-03 13:22:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2020-06-03 13:22:44] [INFO ] [Nat]Added 2 Read/Feed constraints in 15 ms returned sat
[2020-06-03 13:22:44] [INFO ] Computed and/alt/rep : 242/1006/242 causal constraints in 37 ms.
[2020-06-03 13:22:47] [INFO ] Added : 234 causal constraints over 47 iterations in 3005 ms. Result :sat
[2020-06-03 13:22:47] [INFO ] Deduced a trap composed of 25 places in 168 ms
[2020-06-03 13:22:47] [INFO ] Deduced a trap composed of 21 places in 107 ms
[2020-06-03 13:22:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 446 ms
Attempting to minimize the solution found.
Minimization took 48 ms.
[2020-06-03 13:22:48] [INFO ] [Real]Absence check using 36 positive place invariants in 41 ms returned sat
[2020-06-03 13:22:48] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 48 ms returned sat
[2020-06-03 13:22:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:22:49] [INFO ] [Real]Absence check using state equation in 855 ms returned sat
[2020-06-03 13:22:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:22:49] [INFO ] [Nat]Absence check using 36 positive place invariants in 170 ms returned sat
[2020-06-03 13:22:49] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 302 ms returned sat
[2020-06-03 13:22:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:22:51] [INFO ] [Nat]Absence check using state equation in 2062 ms returned sat
[2020-06-03 13:22:51] [INFO ] [Nat]Added 2 Read/Feed constraints in 29 ms returned sat
[2020-06-03 13:22:52] [INFO ] Computed and/alt/rep : 242/1006/242 causal constraints in 30 ms.
[2020-06-03 13:22:56] [INFO ] Added : 230 causal constraints over 46 iterations in 4034 ms. Result :sat
[2020-06-03 13:22:56] [INFO ] Deduced a trap composed of 24 places in 118 ms
[2020-06-03 13:22:56] [INFO ] Deduced a trap composed of 33 places in 86 ms
[2020-06-03 13:22:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 385 ms
Attempting to minimize the solution found.
Minimization took 30 ms.
[2020-06-03 13:22:56] [INFO ] [Real]Absence check using 36 positive place invariants in 31 ms returned sat
[2020-06-03 13:22:56] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 30 ms returned sat
[2020-06-03 13:22:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:22:57] [INFO ] [Real]Absence check using state equation in 654 ms returned sat
[2020-06-03 13:22:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:22:57] [INFO ] [Nat]Absence check using 36 positive place invariants in 49 ms returned sat
[2020-06-03 13:22:57] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 122 ms returned sat
[2020-06-03 13:22:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:22:58] [INFO ] [Nat]Absence check using state equation in 1011 ms returned sat
[2020-06-03 13:22:58] [INFO ] [Nat]Added 2 Read/Feed constraints in 6 ms returned sat
[2020-06-03 13:22:58] [INFO ] Deduced a trap composed of 25 places in 69 ms
[2020-06-03 13:22:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2020-06-03 13:22:58] [INFO ] Computed and/alt/rep : 242/1006/242 causal constraints in 80 ms.
[2020-06-03 13:23:01] [INFO ] Added : 194 causal constraints over 40 iterations in 2717 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 22 ms.
[2020-06-03 13:23:01] [INFO ] [Real]Absence check using 36 positive place invariants in 33 ms returned sat
[2020-06-03 13:23:01] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 43 ms returned sat
[2020-06-03 13:23:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:23:02] [INFO ] [Real]Absence check using state equation in 880 ms returned sat
[2020-06-03 13:23:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:23:02] [INFO ] [Nat]Absence check using 36 positive place invariants in 53 ms returned sat
[2020-06-03 13:23:02] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 132 ms returned sat
[2020-06-03 13:23:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:23:03] [INFO ] [Nat]Absence check using state equation in 858 ms returned sat
[2020-06-03 13:23:03] [INFO ] [Nat]Added 2 Read/Feed constraints in 13 ms returned sat
[2020-06-03 13:23:03] [INFO ] Computed and/alt/rep : 242/1006/242 causal constraints in 33 ms.
[2020-06-03 13:23:06] [INFO ] Added : 229 causal constraints over 47 iterations in 2954 ms. Result :sat
[2020-06-03 13:23:06] [INFO ] Deduced a trap composed of 23 places in 123 ms
[2020-06-03 13:23:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
Attempting to minimize the solution found.
Minimization took 32 ms.
[2020-06-03 13:23:07] [INFO ] [Real]Absence check using 36 positive place invariants in 34 ms returned sat
[2020-06-03 13:23:07] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 34 ms returned sat
[2020-06-03 13:23:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:23:07] [INFO ] [Real]Absence check using state equation in 536 ms returned sat
[2020-06-03 13:23:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:23:07] [INFO ] [Nat]Absence check using 36 positive place invariants in 52 ms returned sat
[2020-06-03 13:23:08] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 795 ms returned sat
[2020-06-03 13:23:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:23:09] [INFO ] [Nat]Absence check using state equation in 993 ms returned sat
[2020-06-03 13:23:09] [INFO ] [Nat]Added 2 Read/Feed constraints in 6 ms returned sat
[2020-06-03 13:23:09] [INFO ] Computed and/alt/rep : 242/1006/242 causal constraints in 32 ms.
[2020-06-03 13:23:11] [INFO ] Added : 175 causal constraints over 35 iterations in 1919 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 25 ms.
[2020-06-03 13:23:11] [INFO ] [Real]Absence check using 36 positive place invariants in 33 ms returned sat
[2020-06-03 13:23:11] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 40 ms returned sat
[2020-06-03 13:23:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:23:13] [INFO ] [Real]Absence check using state equation in 1726 ms returned sat
[2020-06-03 13:23:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:23:13] [INFO ] [Nat]Absence check using 36 positive place invariants in 48 ms returned sat
[2020-06-03 13:23:13] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 135 ms returned sat
[2020-06-03 13:23:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:23:14] [INFO ] [Nat]Absence check using state equation in 1117 ms returned sat
[2020-06-03 13:23:14] [INFO ] [Nat]Added 2 Read/Feed constraints in 7 ms returned sat
[2020-06-03 13:23:14] [INFO ] Computed and/alt/rep : 242/1006/242 causal constraints in 38 ms.
[2020-06-03 13:23:19] [INFO ] Added : 226 causal constraints over 46 iterations in 4633 ms. Result :sat
[2020-06-03 13:23:20] [INFO ] Deduced a trap composed of 43 places in 609 ms
[2020-06-03 13:23:20] [INFO ] Deduced a trap composed of 34 places in 387 ms
[2020-06-03 13:23:20] [INFO ] Deduced a trap composed of 34 places in 204 ms
[2020-06-03 13:23:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1535 ms
Attempting to minimize the solution found.
Minimization took 44 ms.
[2020-06-03 13:23:21] [INFO ] [Real]Absence check using 36 positive place invariants in 33 ms returned sat
[2020-06-03 13:23:21] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 91 ms returned sat
[2020-06-03 13:23:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:23:22] [INFO ] [Real]Absence check using state equation in 1161 ms returned sat
[2020-06-03 13:23:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:23:22] [INFO ] [Nat]Absence check using 36 positive place invariants in 40 ms returned sat
[2020-06-03 13:23:22] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 207 ms returned sat
[2020-06-03 13:23:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:23:23] [INFO ] [Nat]Absence check using state equation in 737 ms returned sat
[2020-06-03 13:23:23] [INFO ] [Nat]Added 2 Read/Feed constraints in 7 ms returned sat
[2020-06-03 13:23:23] [INFO ] Deduced a trap composed of 16 places in 52 ms
[2020-06-03 13:23:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2020-06-03 13:23:23] [INFO ] Computed and/alt/rep : 242/1006/242 causal constraints in 35 ms.
[2020-06-03 13:23:27] [INFO ] Added : 223 causal constraints over 45 iterations in 3394 ms. Result :sat
[2020-06-03 13:23:27] [INFO ] Deduced a trap composed of 36 places in 166 ms
[2020-06-03 13:23:27] [INFO ] Deduced a trap composed of 37 places in 190 ms
[2020-06-03 13:23:27] [INFO ] Deduced a trap composed of 36 places in 113 ms
[2020-06-03 13:23:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 698 ms
Attempting to minimize the solution found.
Minimization took 25 ms.
Incomplete Parikh walk after 241000 steps, including 4344 resets, run finished after 1062 ms. (steps per millisecond=226 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 96600 steps, including 1620 resets, run finished after 456 ms. (steps per millisecond=211 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 182100 steps, including 3231 resets, run finished after 791 ms. (steps per millisecond=230 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 253900 steps, including 4525 resets, run finished after 1137 ms. (steps per millisecond=223 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 127600 steps, including 2268 resets, run finished after 535 ms. (steps per millisecond=238 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 118900 steps, including 2021 resets, run finished after 497 ms. (steps per millisecond=239 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 160600 steps, including 2930 resets, run finished after 731 ms. (steps per millisecond=219 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 50 out of 295 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 295/295 places, 244/244 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 295 transition count 242
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 293 transition count 242
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4 place count 293 transition count 239
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 290 transition count 239
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 290 transition count 239
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 289 transition count 238
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 289 transition count 237
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 38 place count 277 transition count 225
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 39 place count 276 transition count 224
Applied a total of 39 rules in 108 ms. Remains 276 /295 variables (removed 19) and now considering 224/244 (removed 20) transitions.
Finished structural reductions, in 1 iterations. Remains : 276/295 places, 224/244 transitions.
Incomplete random walk after 1000000 steps, including 17246 resets, run finished after 4196 ms. (steps per millisecond=238 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2711 resets, run finished after 1784 ms. (steps per millisecond=560 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2662 resets, run finished after 2089 ms. (steps per millisecond=478 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2679 resets, run finished after 2052 ms. (steps per millisecond=487 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2742 resets, run finished after 2492 ms. (steps per millisecond=401 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2776 resets, run finished after 2238 ms. (steps per millisecond=446 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2664 resets, run finished after 3191 ms. (steps per millisecond=313 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 3867 resets, run finished after 2484 ms. (steps per millisecond=402 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 7950099 steps, run timeout after 30001 ms. (steps per millisecond=264 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Probabilistic random walk after 7950099 steps, saw 1059026 distinct states, run finished after 30001 ms. (steps per millisecond=264 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 224 rows 276 cols
[2020-06-03 13:24:23] [INFO ] Computed 61 place invariants in 6 ms
[2020-06-03 13:24:23] [INFO ] [Real]Absence check using 37 positive place invariants in 99 ms returned sat
[2020-06-03 13:24:24] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 109 ms returned sat
[2020-06-03 13:24:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:24:25] [INFO ] [Real]Absence check using state equation in 940 ms returned sat
[2020-06-03 13:24:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:24:25] [INFO ] [Nat]Absence check using 37 positive place invariants in 35 ms returned sat
[2020-06-03 13:24:25] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 27 ms returned sat
[2020-06-03 13:24:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:24:26] [INFO ] [Nat]Absence check using state equation in 915 ms returned sat
[2020-06-03 13:24:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2020-06-03 13:24:26] [INFO ] [Nat]Added 2 Read/Feed constraints in 16 ms returned sat
[2020-06-03 13:24:26] [INFO ] Computed and/alt/rep : 220/950/220 causal constraints in 86 ms.
[2020-06-03 13:24:29] [INFO ] Added : 191 causal constraints over 39 iterations in 3034 ms. Result :sat
[2020-06-03 13:24:29] [INFO ] Deduced a trap composed of 12 places in 340 ms
[2020-06-03 13:24:29] [INFO ] Deduced a trap composed of 31 places in 188 ms
[2020-06-03 13:24:30] [INFO ] Deduced a trap composed of 10 places in 153 ms
[2020-06-03 13:24:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 953 ms
Attempting to minimize the solution found.
Minimization took 27 ms.
[2020-06-03 13:24:30] [INFO ] [Real]Absence check using 37 positive place invariants in 71 ms returned sat
[2020-06-03 13:24:30] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 112 ms returned sat
[2020-06-03 13:24:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:24:31] [INFO ] [Real]Absence check using state equation in 699 ms returned sat
[2020-06-03 13:24:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:24:31] [INFO ] [Nat]Absence check using 37 positive place invariants in 44 ms returned sat
[2020-06-03 13:24:31] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 75 ms returned sat
[2020-06-03 13:24:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:24:32] [INFO ] [Nat]Absence check using state equation in 1157 ms returned sat
[2020-06-03 13:24:32] [INFO ] [Nat]Added 2 Read/Feed constraints in 7 ms returned sat
[2020-06-03 13:24:32] [INFO ] Deduced a trap composed of 12 places in 171 ms
[2020-06-03 13:24:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 332 ms
[2020-06-03 13:24:32] [INFO ] Computed and/alt/rep : 220/950/220 causal constraints in 31 ms.
[2020-06-03 13:24:35] [INFO ] Added : 177 causal constraints over 36 iterations in 2137 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 24 ms.
[2020-06-03 13:24:35] [INFO ] [Real]Absence check using 37 positive place invariants in 41 ms returned sat
[2020-06-03 13:24:35] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 28 ms returned sat
[2020-06-03 13:24:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:24:35] [INFO ] [Real]Absence check using state equation in 462 ms returned sat
[2020-06-03 13:24:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:24:35] [INFO ] [Nat]Absence check using 37 positive place invariants in 45 ms returned sat
[2020-06-03 13:24:35] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 146 ms returned sat
[2020-06-03 13:24:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:24:36] [INFO ] [Nat]Absence check using state equation in 664 ms returned sat
[2020-06-03 13:24:36] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2020-06-03 13:24:37] [INFO ] Deduced a trap composed of 10 places in 532 ms
[2020-06-03 13:24:37] [INFO ] Deduced a trap composed of 21 places in 176 ms
[2020-06-03 13:24:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 787 ms
[2020-06-03 13:24:37] [INFO ] Computed and/alt/rep : 220/950/220 causal constraints in 83 ms.
[2020-06-03 13:24:39] [INFO ] Added : 167 causal constraints over 34 iterations in 2184 ms. Result :sat
[2020-06-03 13:24:39] [INFO ] Deduced a trap composed of 22 places in 128 ms
[2020-06-03 13:24:40] [INFO ] Deduced a trap composed of 26 places in 138 ms
[2020-06-03 13:24:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 439 ms
Attempting to minimize the solution found.
Minimization took 25 ms.
[2020-06-03 13:24:40] [INFO ] [Real]Absence check using 37 positive place invariants in 33 ms returned sat
[2020-06-03 13:24:40] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 40 ms returned sat
[2020-06-03 13:24:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:24:41] [INFO ] [Real]Absence check using state equation in 746 ms returned sat
[2020-06-03 13:24:41] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:24:41] [INFO ] [Nat]Absence check using 37 positive place invariants in 38 ms returned sat
[2020-06-03 13:24:41] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 218 ms returned sat
[2020-06-03 13:24:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:24:41] [INFO ] [Nat]Absence check using state equation in 521 ms returned sat
[2020-06-03 13:24:41] [INFO ] [Nat]Added 2 Read/Feed constraints in 15 ms returned sat
[2020-06-03 13:24:41] [INFO ] Computed and/alt/rep : 220/950/220 causal constraints in 28 ms.
[2020-06-03 13:24:44] [INFO ] Added : 208 causal constraints over 42 iterations in 2167 ms. Result :sat
[2020-06-03 13:24:44] [INFO ] Deduced a trap composed of 18 places in 149 ms
[2020-06-03 13:24:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 281 ms
Attempting to minimize the solution found.
Minimization took 23 ms.
[2020-06-03 13:24:44] [INFO ] [Real]Absence check using 37 positive place invariants in 40 ms returned sat
[2020-06-03 13:24:44] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 28 ms returned sat
[2020-06-03 13:24:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:24:45] [INFO ] [Real]Absence check using state equation in 467 ms returned sat
[2020-06-03 13:24:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:24:45] [INFO ] [Nat]Absence check using 37 positive place invariants in 42 ms returned sat
[2020-06-03 13:24:45] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 77 ms returned sat
[2020-06-03 13:24:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:24:46] [INFO ] [Nat]Absence check using state equation in 703 ms returned sat
[2020-06-03 13:24:46] [INFO ] [Nat]Added 2 Read/Feed constraints in 12 ms returned sat
[2020-06-03 13:24:46] [INFO ] Deduced a trap composed of 12 places in 86 ms
[2020-06-03 13:24:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2020-06-03 13:24:46] [INFO ] Computed and/alt/rep : 220/950/220 causal constraints in 29 ms.
[2020-06-03 13:24:48] [INFO ] Added : 151 causal constraints over 31 iterations in 1950 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 42 ms.
[2020-06-03 13:24:48] [INFO ] [Real]Absence check using 37 positive place invariants in 114 ms returned sat
[2020-06-03 13:24:48] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 61 ms returned sat
[2020-06-03 13:24:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:24:50] [INFO ] [Real]Absence check using state equation in 1958 ms returned sat
[2020-06-03 13:24:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:24:50] [INFO ] [Nat]Absence check using 37 positive place invariants in 86 ms returned sat
[2020-06-03 13:24:50] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 75 ms returned sat
[2020-06-03 13:24:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:24:52] [INFO ] [Nat]Absence check using state equation in 1279 ms returned sat
[2020-06-03 13:24:52] [INFO ] [Nat]Added 2 Read/Feed constraints in 60 ms returned sat
[2020-06-03 13:24:52] [INFO ] Computed and/alt/rep : 220/950/220 causal constraints in 42 ms.
[2020-06-03 13:24:55] [INFO ] Added : 205 causal constraints over 41 iterations in 2965 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 31 ms.
[2020-06-03 13:24:55] [INFO ] [Real]Absence check using 37 positive place invariants in 35 ms returned sat
[2020-06-03 13:24:55] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 35 ms returned sat
[2020-06-03 13:24:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:24:57] [INFO ] [Real]Absence check using state equation in 1489 ms returned sat
[2020-06-03 13:24:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:24:57] [INFO ] [Nat]Absence check using 37 positive place invariants in 80 ms returned sat
[2020-06-03 13:24:57] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 80 ms returned sat
[2020-06-03 13:24:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:24:58] [INFO ] [Nat]Absence check using state equation in 1128 ms returned sat
[2020-06-03 13:24:58] [INFO ] [Nat]Added 2 Read/Feed constraints in 14 ms returned sat
[2020-06-03 13:24:58] [INFO ] Deduced a trap composed of 15 places in 52 ms
[2020-06-03 13:24:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2020-06-03 13:24:58] [INFO ] Computed and/alt/rep : 220/950/220 causal constraints in 25 ms.
[2020-06-03 13:25:01] [INFO ] Added : 199 causal constraints over 40 iterations in 2738 ms. Result :sat
[2020-06-03 13:25:01] [INFO ] Deduced a trap composed of 12 places in 151 ms
[2020-06-03 13:25:01] [INFO ] Deduced a trap composed of 21 places in 133 ms
[2020-06-03 13:25:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 437 ms
Attempting to minimize the solution found.
Minimization took 28 ms.
Incomplete Parikh walk after 213500 steps, including 4530 resets, run finished after 1065 ms. (steps per millisecond=200 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 243400 steps, including 5346 resets, run finished after 1284 ms. (steps per millisecond=189 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 153400 steps, including 3278 resets, run finished after 709 ms. (steps per millisecond=216 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 232500 steps, including 5243 resets, run finished after 1063 ms. (steps per millisecond=218 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 126400 steps, including 2712 resets, run finished after 583 ms. (steps per millisecond=216 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 102100 steps, including 2185 resets, run finished after 474 ms. (steps per millisecond=215 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 136000 steps, including 3055 resets, run finished after 628 ms. (steps per millisecond=216 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 50 out of 276 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 276/276 places, 224/224 transitions.
Applied a total of 0 rules in 19 ms. Remains 276 /276 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 276/276 places, 224/224 transitions.
Starting structural reductions, iteration 0 : 276/276 places, 224/224 transitions.
Applied a total of 0 rules in 18 ms. Remains 276 /276 variables (removed 0) and now considering 224/224 (removed 0) transitions.
// Phase 1: matrix 224 rows 276 cols
[2020-06-03 13:25:07] [INFO ] Computed 61 place invariants in 6 ms
[2020-06-03 13:25:09] [INFO ] Implicit Places using invariants in 1570 ms returned []
// Phase 1: matrix 224 rows 276 cols
[2020-06-03 13:25:09] [INFO ] Computed 61 place invariants in 18 ms
[2020-06-03 13:25:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2020-06-03 13:25:11] [INFO ] Implicit Places using invariants and state equation in 2382 ms returned []
Implicit Place search using SMT with State Equation took 3963 ms to find 0 implicit places.
[2020-06-03 13:25:11] [INFO ] Redundant transitions in 28 ms returned []
// Phase 1: matrix 224 rows 276 cols
[2020-06-03 13:25:11] [INFO ] Computed 61 place invariants in 7 ms
[2020-06-03 13:25:12] [INFO ] Dead Transitions using invariants and state equation in 823 ms returned []
Finished structural reductions, in 1 iterations. Remains : 276/276 places, 224/224 transitions.
Incomplete random walk after 100000 steps, including 1696 resets, run finished after 477 ms. (steps per millisecond=209 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 224 rows 276 cols
[2020-06-03 13:25:13] [INFO ] Computed 61 place invariants in 5 ms
[2020-06-03 13:25:13] [INFO ] [Real]Absence check using 37 positive place invariants in 54 ms returned sat
[2020-06-03 13:25:13] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 26 ms returned sat
[2020-06-03 13:25:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:25:13] [INFO ] [Real]Absence check using state equation in 572 ms returned sat
[2020-06-03 13:25:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:25:14] [INFO ] [Nat]Absence check using 37 positive place invariants in 47 ms returned sat
[2020-06-03 13:25:14] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 33 ms returned sat
[2020-06-03 13:25:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:25:14] [INFO ] [Nat]Absence check using state equation in 779 ms returned sat
[2020-06-03 13:25:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2020-06-03 13:25:14] [INFO ] [Nat]Added 2 Read/Feed constraints in 6 ms returned sat
[2020-06-03 13:25:14] [INFO ] Computed and/alt/rep : 220/950/220 causal constraints in 28 ms.
[2020-06-03 13:25:17] [INFO ] Added : 191 causal constraints over 39 iterations in 2625 ms. Result :sat
[2020-06-03 13:25:17] [INFO ] Deduced a trap composed of 12 places in 155 ms
[2020-06-03 13:25:17] [INFO ] Deduced a trap composed of 31 places in 171 ms
[2020-06-03 13:25:18] [INFO ] Deduced a trap composed of 10 places in 122 ms
[2020-06-03 13:25:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 673 ms
[2020-06-03 13:25:18] [INFO ] [Real]Absence check using 37 positive place invariants in 31 ms returned sat
[2020-06-03 13:25:18] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 61 ms returned sat
[2020-06-03 13:25:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:25:19] [INFO ] [Real]Absence check using state equation in 665 ms returned sat
[2020-06-03 13:25:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:25:19] [INFO ] [Nat]Absence check using 37 positive place invariants in 54 ms returned sat
[2020-06-03 13:25:19] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 119 ms returned sat
[2020-06-03 13:25:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:25:20] [INFO ] [Nat]Absence check using state equation in 960 ms returned sat
[2020-06-03 13:25:20] [INFO ] [Nat]Added 2 Read/Feed constraints in 8 ms returned sat
[2020-06-03 13:25:20] [INFO ] Deduced a trap composed of 12 places in 123 ms
[2020-06-03 13:25:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 259 ms
[2020-06-03 13:25:20] [INFO ] Computed and/alt/rep : 220/950/220 causal constraints in 36 ms.
[2020-06-03 13:25:23] [INFO ] Added : 177 causal constraints over 36 iterations in 2304 ms. Result :sat
[2020-06-03 13:25:23] [INFO ] [Real]Absence check using 37 positive place invariants in 36 ms returned sat
[2020-06-03 13:25:23] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 28 ms returned sat
[2020-06-03 13:25:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:25:23] [INFO ] [Real]Absence check using state equation in 652 ms returned sat
[2020-06-03 13:25:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:25:24] [INFO ] [Nat]Absence check using 37 positive place invariants in 34 ms returned sat
[2020-06-03 13:25:24] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 141 ms returned sat
[2020-06-03 13:25:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:25:24] [INFO ] [Nat]Absence check using state equation in 625 ms returned sat
[2020-06-03 13:25:24] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2020-06-03 13:25:25] [INFO ] Deduced a trap composed of 10 places in 229 ms
[2020-06-03 13:25:25] [INFO ] Deduced a trap composed of 21 places in 132 ms
[2020-06-03 13:25:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 445 ms
[2020-06-03 13:25:25] [INFO ] Computed and/alt/rep : 220/950/220 causal constraints in 31 ms.
[2020-06-03 13:25:27] [INFO ] Added : 167 causal constraints over 34 iterations in 2146 ms. Result :sat
[2020-06-03 13:25:27] [INFO ] Deduced a trap composed of 22 places in 129 ms
[2020-06-03 13:25:27] [INFO ] Deduced a trap composed of 26 places in 119 ms
[2020-06-03 13:25:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 432 ms
[2020-06-03 13:25:28] [INFO ] [Real]Absence check using 37 positive place invariants in 33 ms returned sat
[2020-06-03 13:25:28] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 49 ms returned sat
[2020-06-03 13:25:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:25:29] [INFO ] [Real]Absence check using state equation in 1030 ms returned sat
[2020-06-03 13:25:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:25:29] [INFO ] [Nat]Absence check using 37 positive place invariants in 48 ms returned sat
[2020-06-03 13:25:29] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 225 ms returned sat
[2020-06-03 13:25:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:25:30] [INFO ] [Nat]Absence check using state equation in 645 ms returned sat
[2020-06-03 13:25:30] [INFO ] [Nat]Added 2 Read/Feed constraints in 10 ms returned sat
[2020-06-03 13:25:30] [INFO ] Computed and/alt/rep : 220/950/220 causal constraints in 29 ms.
[2020-06-03 13:25:32] [INFO ] Added : 208 causal constraints over 42 iterations in 2223 ms. Result :sat
[2020-06-03 13:25:32] [INFO ] Deduced a trap composed of 18 places in 183 ms
[2020-06-03 13:25:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 301 ms
[2020-06-03 13:25:32] [INFO ] [Real]Absence check using 37 positive place invariants in 44 ms returned sat
[2020-06-03 13:25:32] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 32 ms returned sat
[2020-06-03 13:25:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:25:33] [INFO ] [Real]Absence check using state equation in 526 ms returned sat
[2020-06-03 13:25:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:25:33] [INFO ] [Nat]Absence check using 37 positive place invariants in 42 ms returned sat
[2020-06-03 13:25:33] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 76 ms returned sat
[2020-06-03 13:25:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:25:34] [INFO ] [Nat]Absence check using state equation in 708 ms returned sat
[2020-06-03 13:25:34] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2020-06-03 13:25:34] [INFO ] Deduced a trap composed of 12 places in 57 ms
[2020-06-03 13:25:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2020-06-03 13:25:34] [INFO ] Computed and/alt/rep : 220/950/220 causal constraints in 20 ms.
[2020-06-03 13:25:36] [INFO ] Added : 151 causal constraints over 31 iterations in 1670 ms. Result :sat
[2020-06-03 13:25:36] [INFO ] [Real]Absence check using 37 positive place invariants in 46 ms returned sat
[2020-06-03 13:25:36] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 45 ms returned sat
[2020-06-03 13:25:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:25:37] [INFO ] [Real]Absence check using state equation in 1437 ms returned sat
[2020-06-03 13:25:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:25:37] [INFO ] [Nat]Absence check using 37 positive place invariants in 36 ms returned sat
[2020-06-03 13:25:38] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 69 ms returned sat
[2020-06-03 13:25:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:25:39] [INFO ] [Nat]Absence check using state equation in 1191 ms returned sat
[2020-06-03 13:25:39] [INFO ] [Nat]Added 2 Read/Feed constraints in 31 ms returned sat
[2020-06-03 13:25:39] [INFO ] Computed and/alt/rep : 220/950/220 causal constraints in 80 ms.
[2020-06-03 13:25:42] [INFO ] Added : 205 causal constraints over 41 iterations in 3301 ms. Result :sat
[2020-06-03 13:25:42] [INFO ] [Real]Absence check using 37 positive place invariants in 46 ms returned sat
[2020-06-03 13:25:42] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 40 ms returned sat
[2020-06-03 13:25:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:25:44] [INFO ] [Real]Absence check using state equation in 1469 ms returned sat
[2020-06-03 13:25:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:25:44] [INFO ] [Nat]Absence check using 37 positive place invariants in 46 ms returned sat
[2020-06-03 13:25:44] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 86 ms returned sat
[2020-06-03 13:25:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:25:45] [INFO ] [Nat]Absence check using state equation in 1410 ms returned sat
[2020-06-03 13:25:45] [INFO ] [Nat]Added 2 Read/Feed constraints in 8 ms returned sat
[2020-06-03 13:25:45] [INFO ] Deduced a trap composed of 15 places in 67 ms
[2020-06-03 13:25:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2020-06-03 13:25:46] [INFO ] Computed and/alt/rep : 220/950/220 causal constraints in 31 ms.
[2020-06-03 13:25:48] [INFO ] Added : 199 causal constraints over 40 iterations in 2717 ms. Result :sat
[2020-06-03 13:25:48] [INFO ] Deduced a trap composed of 12 places in 128 ms
[2020-06-03 13:25:49] [INFO ] Deduced a trap composed of 21 places in 224 ms
[2020-06-03 13:25:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 495 ms
Applied a total of 0 rules in 30 ms. Remains 276 /276 variables (removed 0) and now considering 224/224 (removed 0) transitions.
// Phase 1: matrix 224 rows 276 cols
[2020-06-03 13:25:49] [INFO ] Computed 61 place invariants in 5 ms
[2020-06-03 13:25:49] [INFO ] [Real]Absence check using 37 positive place invariants in 32 ms returned sat
[2020-06-03 13:25:49] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 25 ms returned sat
[2020-06-03 13:25:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:25:49] [INFO ] [Real]Absence check using state equation in 456 ms returned sat
[2020-06-03 13:25:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:25:50] [INFO ] [Nat]Absence check using 37 positive place invariants in 52 ms returned sat
[2020-06-03 13:25:50] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 41 ms returned sat
[2020-06-03 13:25:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:25:50] [INFO ] [Nat]Absence check using state equation in 700 ms returned sat
[2020-06-03 13:25:50] [INFO ] Deduced a trap composed of 7 places in 86 ms
[2020-06-03 13:25:50] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2020-06-03 13:25:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 229 ms
[2020-06-03 13:25:51] [INFO ] Computed and/alt/rep : 220/944/220 causal constraints in 23 ms.
[2020-06-03 13:25:53] [INFO ] Added : 213 causal constraints over 43 iterations in 2598 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 26 ms.
[2020-06-03 13:25:53] [INFO ] [Real]Absence check using 37 positive place invariants in 40 ms returned sat
[2020-06-03 13:25:53] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 35 ms returned sat
[2020-06-03 13:25:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:25:54] [INFO ] [Real]Absence check using state equation in 556 ms returned sat
[2020-06-03 13:25:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:25:54] [INFO ] [Nat]Absence check using 37 positive place invariants in 82 ms returned sat
[2020-06-03 13:25:54] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 72 ms returned sat
[2020-06-03 13:25:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:25:55] [INFO ] [Nat]Absence check using state equation in 967 ms returned sat
[2020-06-03 13:25:55] [INFO ] Deduced a trap composed of 12 places in 268 ms
[2020-06-03 13:25:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 368 ms
[2020-06-03 13:25:56] [INFO ] Computed and/alt/rep : 220/944/220 causal constraints in 21 ms.
[2020-06-03 13:25:58] [INFO ] Added : 179 causal constraints over 36 iterations in 2044 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 29 ms.
[2020-06-03 13:25:58] [INFO ] [Real]Absence check using 37 positive place invariants in 80 ms returned sat
[2020-06-03 13:25:58] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 34 ms returned sat
[2020-06-03 13:25:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:25:58] [INFO ] [Real]Absence check using state equation in 468 ms returned sat
[2020-06-03 13:25:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:25:59] [INFO ] [Nat]Absence check using 37 positive place invariants in 41 ms returned sat
[2020-06-03 13:25:59] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 141 ms returned sat
[2020-06-03 13:25:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:25:59] [INFO ] [Nat]Absence check using state equation in 784 ms returned sat
[2020-06-03 13:26:00] [INFO ] Deduced a trap composed of 24 places in 154 ms
[2020-06-03 13:26:00] [INFO ] Deduced a trap composed of 25 places in 355 ms
[2020-06-03 13:26:00] [INFO ] Deduced a trap composed of 10 places in 340 ms
[2020-06-03 13:26:01] [INFO ] Deduced a trap composed of 22 places in 139 ms
[2020-06-03 13:26:01] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1151 ms
[2020-06-03 13:26:01] [INFO ] Computed and/alt/rep : 220/944/220 causal constraints in 29 ms.
[2020-06-03 13:26:02] [INFO ] Added : 154 causal constraints over 31 iterations in 1703 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 22 ms.
[2020-06-03 13:26:03] [INFO ] [Real]Absence check using 37 positive place invariants in 41 ms returned sat
[2020-06-03 13:26:03] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 35 ms returned sat
[2020-06-03 13:26:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:26:03] [INFO ] [Real]Absence check using state equation in 806 ms returned sat
[2020-06-03 13:26:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:26:04] [INFO ] [Nat]Absence check using 37 positive place invariants in 36 ms returned sat
[2020-06-03 13:26:04] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 213 ms returned sat
[2020-06-03 13:26:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:26:05] [INFO ] [Nat]Absence check using state equation in 769 ms returned sat
[2020-06-03 13:26:05] [INFO ] Deduced a trap composed of 5 places in 130 ms
[2020-06-03 13:26:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2020-06-03 13:26:05] [INFO ] Computed and/alt/rep : 220/944/220 causal constraints in 48 ms.
[2020-06-03 13:26:07] [INFO ] Added : 212 causal constraints over 43 iterations in 2181 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 27 ms.
[2020-06-03 13:26:07] [INFO ] [Real]Absence check using 37 positive place invariants in 57 ms returned sat
[2020-06-03 13:26:07] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 28 ms returned sat
[2020-06-03 13:26:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:26:08] [INFO ] [Real]Absence check using state equation in 455 ms returned sat
[2020-06-03 13:26:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:26:08] [INFO ] [Nat]Absence check using 37 positive place invariants in 41 ms returned sat
[2020-06-03 13:26:08] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 86 ms returned sat
[2020-06-03 13:26:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:26:09] [INFO ] [Nat]Absence check using state equation in 662 ms returned sat
[2020-06-03 13:26:09] [INFO ] Deduced a trap composed of 12 places in 67 ms
[2020-06-03 13:26:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2020-06-03 13:26:09] [INFO ] Computed and/alt/rep : 220/944/220 causal constraints in 25 ms.
[2020-06-03 13:26:10] [INFO ] Added : 151 causal constraints over 31 iterations in 1598 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 21 ms.
[2020-06-03 13:26:10] [INFO ] [Real]Absence check using 37 positive place invariants in 45 ms returned sat
[2020-06-03 13:26:11] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 42 ms returned sat
[2020-06-03 13:26:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:26:12] [INFO ] [Real]Absence check using state equation in 1269 ms returned sat
[2020-06-03 13:26:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:26:12] [INFO ] [Nat]Absence check using 37 positive place invariants in 199 ms returned sat
[2020-06-03 13:26:12] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 80 ms returned sat
[2020-06-03 13:26:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:26:14] [INFO ] [Nat]Absence check using state equation in 1457 ms returned sat
[2020-06-03 13:26:14] [INFO ] Computed and/alt/rep : 220/944/220 causal constraints in 23 ms.
[2020-06-03 13:26:16] [INFO ] Added : 181 causal constraints over 37 iterations in 2555 ms. Result :sat
[2020-06-03 13:26:16] [INFO ] Deduced a trap composed of 28 places in 170 ms
[2020-06-03 13:26:17] [INFO ] Deduced a trap composed of 32 places in 128 ms
[2020-06-03 13:26:17] [INFO ] Deduced a trap composed of 31 places in 90 ms
[2020-06-03 13:26:17] [INFO ] Deduced a trap composed of 36 places in 92 ms
[2020-06-03 13:26:17] [INFO ] Deduced a trap composed of 31 places in 86 ms
[2020-06-03 13:26:17] [INFO ] Deduced a trap composed of 35 places in 113 ms
[2020-06-03 13:26:17] [INFO ] Deduced a trap composed of 10 places in 105 ms
[2020-06-03 13:26:17] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1246 ms
Attempting to minimize the solution found.
Minimization took 42 ms.
[2020-06-03 13:26:18] [INFO ] [Real]Absence check using 37 positive place invariants in 31 ms returned sat
[2020-06-03 13:26:18] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 34 ms returned sat
[2020-06-03 13:26:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 13:26:19] [INFO ] [Real]Absence check using state equation in 1523 ms returned sat
[2020-06-03 13:26:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 13:26:19] [INFO ] [Nat]Absence check using 37 positive place invariants in 44 ms returned sat
[2020-06-03 13:26:19] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 83 ms returned sat
[2020-06-03 13:26:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 13:26:20] [INFO ] [Nat]Absence check using state equation in 691 ms returned sat
[2020-06-03 13:26:20] [INFO ] Deduced a trap composed of 15 places in 42 ms
[2020-06-03 13:26:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2020-06-03 13:26:20] [INFO ] Computed and/alt/rep : 220/944/220 causal constraints in 29 ms.
[2020-06-03 13:26:23] [INFO ] Added : 200 causal constraints over 40 iterations in 2303 ms. Result :sat
[2020-06-03 13:26:23] [INFO ] Deduced a trap composed of 37 places in 104 ms
[2020-06-03 13:26:23] [INFO ] Deduced a trap composed of 36 places in 105 ms
[2020-06-03 13:26:23] [INFO ] Deduced a trap composed of 35 places in 102 ms
[2020-06-03 13:26:23] [INFO ] Deduced a trap composed of 30 places in 94 ms
[2020-06-03 13:26:23] [INFO ] Deduced a trap composed of 32 places in 121 ms
[2020-06-03 13:26:23] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 956 ms
Attempting to minimize the solution found.
Minimization took 27 ms.
[2020-06-03 13:26:24] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 13 ms.
[2020-06-03 13:26:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 17 ms.
[2020-06-03 13:26:24] [INFO ] Flatten gal took : 135 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ DES-PT-30b @ 3570 seconds

FORMULA DES-PT-30b-ReachabilityFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-30b-ReachabilityFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-30b-ReachabilityFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-30b-ReachabilityFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-30b-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-30b-ReachabilityFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-30b-ReachabilityFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3345
rslt: Output for ReachabilityFireability @ DES-PT-30b

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 13:26:24 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 593
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p41) AND (1 <= p271)) OR ((1 <= p140) AND (1 <= p72) AND (1 <= p167)))))",
"processed_size": 87,
"rewrites": 1
},
"result":
{
"edges": 110840,
"markings": 55813,
"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": 5,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 712
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (G (((p145 <= 0) OR (p20 <= 0) OR (p173 <= 0) OR ((1 <= p223)) OR ((1 <= p4) AND (1 <= p173)))))",
"processed_size": 102,
"rewrites": 2
},
"result":
{
"edges": 5334306,
"markings": 3780585,
"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": 5,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 884
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "A (G (((p53 <= 0) OR (p271 <= 0) OR ((1 <= p172)) OR ((1 <= p253)) OR (p66 <= 0) OR (p167 <= 0) OR ((1 <= p127)) OR (p255 <= 0))))",
"processed_size": 137,
"rewrites": 2
},
"result":
{
"edges": 386620,
"markings": 255150,
"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": 8,
"problems": 8
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1178
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 5,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p101) AND (1 <= p129) AND (((1 <= p182) AND (1 <= p269)) OR (((p152 <= 0)) AND ((p1 <= 0)))) AND ((p213 <= 0) OR (p265 <= 0)) AND (((1 <= p189)) OR ((1 <= p123))))))",
"processed_size": 181,
"rewrites": 1
},
"result":
{
"edges": 601025,
"markings": 279778,
"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": 48,
"problems": 8
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1767
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 2,
"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": 12,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p34) AND (1 <= p271) AND ((p139 <= 0) OR (p176 <= 0) OR (p266 <= 0)) AND (((1 <= p157) AND (1 <= p161)) OR ((1 <= p262) AND (1 <= p267) AND (1 <= p145) AND (1 <= p37) AND (1 <= p185))))))",
"processed_size": 203,
"rewrites": 1
},
"result":
{
"edges": 44207400,
"markings": 27303709,
"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": 39,
"problems": 6
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3345
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 7,
"adisj": 1,
"aneg": 0,
"comp": 22,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 22,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 18,
"visible_transitions": 0
},
"processed": "A (G (((p76 <= 0) OR (p167 <= 0) OR ((1 <= p55) AND (1 <= p271)) OR ((1 <= p60) AND (1 <= p271)) OR ((1 <= p75) AND (1 <= p167)) OR ((1 <= p135) AND (1 <= p246)) OR ((1 <= p134) AND (1 <= p246) AND (1 <= p26) AND (1 <= p173)) OR ((1 <= p157) AND (1 <= p162) AND (1 <= p202) AND (1 <= p220)) OR ((1 <= p113) AND (1 <= p129) AND (1 <= p90) AND (1 <= p167)))))",
"processed_size": 365,
"rewrites": 2
},
"result":
{
"edges": 13831,
"markings": 9128,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3456,
"problems": 384
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 41372,
"runtime": 225.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : E(F(**)) : A(G(**)) : E(F(**)) : A(G(**)) : A(G(**)) : E(F(**))"
},
"net":
{
"arcs": 950,
"conflict_clusters": 81,
"places": 276,
"places_significant": 215,
"singleton_clusters": 0,
"transitions": 224
},
"result":
{
"preliminary_value": "yes yes no yes no no yes ",
"value": "yes yes no yes 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: 500/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 276
lola: finding significant places
lola: 276 places, 224 transitions, 215 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityFireability.xml
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p167 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p271 <= 1)
lola: LP says that atomic proposition is always true: (p140 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p167 <= 1)
lola: LP says that atomic proposition is always true: (p145 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p173 <= 1)
lola: LP says that atomic proposition is always true: (p223 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p173 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p271 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p176 <= 1)
lola: LP says that atomic proposition is always true: (p266 <= 1)
lola: LP says that atomic proposition is always true: (p157 <= 1)
lola: LP says that atomic proposition is always true: (p161 <= 1)
lola: LP says that atomic proposition is always true: (p262 <= 1)
lola: LP says that atomic proposition is always true: (p267 <= 1)
lola: LP says that atomic proposition is always true: (p145 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p185 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p271 <= 1)
lola: LP says that atomic proposition is always true: (p172 <= 1)
lola: LP says that atomic proposition is always true: (p253 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p167 <= 1)
lola: LP says that atomic proposition is always true: (p127 <= 1)
lola: LP says that atomic proposition is always true: (p255 <= 1)
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: LP says that atomic proposition is always true: (p167 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p271 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p271 <= 1)
lola: LP says that atomic proposition is always true: (p75 <= 1)
lola: LP says that atomic proposition is always true: (p167 <= 1)
lola: LP says that atomic proposition is always true: (p135 <= 1)
lola: LP says that atomic proposition is always true: (p246 <= 1)
lola: LP says that atomic proposition is always true: (p134 <= 1)
lola: LP says that atomic proposition is always true: (p246 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p173 <= 1)
lola: LP says that atomic proposition is always true: (p157 <= 1)
lola: LP says that atomic proposition is always true: (p162 <= 1)
lola: LP says that atomic proposition is always true: (p202 <= 1)
lola: LP says that atomic proposition is always true: (p220 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p129 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p167 <= 1)
lola: LP says that atomic proposition is always true: (p101 <= 1)
lola: LP says that atomic proposition is always true: (p129 <= 1)
lola: LP says that atomic proposition is always true: (p182 <= 1)
lola: LP says that atomic proposition is always true: (p269 <= 1)
lola: LP says that atomic proposition is always true: (p152 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p265 <= 1)
lola: LP says that atomic proposition is always true: (p189 <= 1)
lola: LP says that atomic proposition is always true: (p123 <= 1)
lola: E (F (((1 <= p67) AND (1 <= p167)))) : E (F ((((1 <= p41) AND (1 <= p271)) OR ((1 <= p140) AND (1 <= p72) AND (1 <= p167))))) : A (G (((p145 <= 0) OR (p20 <= 0) OR (p173 <= 0) OR ((1 <= p223)) OR ((1 <= p4) AND (1 <= p173))))) : E (F (((1 <= p34) AND (1 <= p271) AND ((p139 <= 0) OR (p176 <= 0) OR (p266 <= 0)) AND (((1 <= p157) AND (1 <= p161)) OR ((1 <= p262) AND (1 <= p267) AND (1 <= p145) AND (1 <= p37) AND (1 <= p185)))))) : A (G (((p53 <= 0) OR (p271 <= 0) OR ((1 <= p172)) OR ((1 <= p253)) OR (p66 <= 0) OR (p167 <= 0) OR ((1 <= p127)) OR (p255 <= 0)))) : A (G (((p76 <= 0) OR (p167 <= 0) OR ((1 <= p55) AND (1 <= p271)) OR ((1 <= p60) AND (1 <= p271)) OR ((1 <= p75) AND (1 <= p167)) OR ((1 <= p135) AND (1 <= p246)) OR ((1 <= p134) AND (1 <= p246) AND (1 <= p26) AND (1 <= p173)) OR ((1 <= p157) AND (1 <= p162) AND (1 <= p202) AND (1 <= p220)) OR ((1 <= p113) AND (1 <= p129) AND (1 <= p90) AND (1 <= p167))))) : E (F (((1 <= p101) AND (1 <= p129) AND (((1 <= p182) AND (1 <= p269)) OR (((p152 <= 0)) AND ((p1 <= 0)))) AND ((p213 <= 0) OR (p265 <= 0)) AND (((1 <= p189)) OR ((1 <= p123))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p67) AND (1 <= p167))))
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 <= p67) AND (1 <= p167))))
lola: processed formula length: 36
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 <= p67) AND (1 <= p167))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 12332 markings, 18253 edges
lola: ========================================
lola: subprocess 1 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p41) AND (1 <= p271)) OR ((1 <= p140) AND (1 <= p72) AND (1 <= p167)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((1 <= p41) AND (1 <= p271)) OR ((1 <= p140) AND (1 <= p72) AND (1 <= p167)))))
lola: processed formula length: 87
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p41) AND (1 <= p271)) OR ((1 <= p140) AND (1 <= p72) AND (1 <= p167)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 55813 markings, 110840 edges
lola: ========================================
lola: subprocess 2 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p145 <= 0) OR (p20 <= 0) OR (p173 <= 0) OR ((1 <= p223)) OR ((1 <= p4) AND (1 <= p173)))))
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 (((p145 <= 0) OR (p20 <= 0) OR (p173 <= 0) OR ((1 <= p223)) OR ((1 <= p4) AND (1 <= p173)))))
lola: processed formula length: 102
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 <= p145) AND (1 <= p20) AND (1 <= p173) AND ((p223 <= 0)) AND ((p4 <= 0) OR (p173 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 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 || 867495 markings, 1212524 edges, 173499 markings/sec, 0 secs
lola: sara is running 5 secs || 1710383 markings, 2401603 edges, 168578 markings/sec, 5 secs
lola: sara is running 10 secs || 2550471 markings, 3592270 edges, 168018 markings/sec, 10 secs
lola: sara is running 15 secs || 3395436 markings, 4791591 edges, 168993 markings/sec, 15 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3780585 markings, 5334306 edges
lola: ========================================
lola: subprocess 3 will run for 884 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p53 <= 0) OR (p271 <= 0) OR ((1 <= p172)) OR ((1 <= p253)) OR (p66 <= 0) OR (p167 <= 0) OR ((1 <= p127)) OR (p255 <= 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 (((p53 <= 0) OR (p271 <= 0) OR ((1 <= p172)) OR ((1 <= p253)) OR (p66 <= 0) OR (p167 <= 0) OR ((1 <= p127)) OR (p255 <= 0))))
lola: processed formula length: 137
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 <= p53) AND (1 <= p271) AND ((p172 <= 0)) AND ((p253 <= 0)) AND (1 <= p66) AND (1 <= p167) AND ((p127 <= 0)) AND (1 <= p255))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 255150 markings, 386620 edges
lola: ========================================
lola: subprocess 4 will run for 1178 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p101) AND (1 <= p129) AND (((1 <= p182) AND (1 <= p269)) OR (((p152 <= 0)) AND ((p1 <= 0)))) AND ((p213 <= 0) OR (p265 <= 0)) AND (((1 <= p189)) OR ((1 <= p123))))))
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 <= p101) AND (1 <= p129) AND (((1 <= p182) AND (1 <= p269)) OR (((p152 <= 0)) AND ((p1 <= 0)))) AND ((p213 <= 0) OR (p265 <= 0)) AND (((1 <= p189)) OR ((1 <= p123))))))
lola: processed formula length: 181
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 <= p101) AND (1 <= p129) AND (((1 <= p182) AND (1 <= p269)) OR (((p152 <= 0)) AND ((p1 <= 0)))) AND ((p213 <= 0) OR (p265 <= 0)) AND (((1 <= p189)) OR ((1 <= p123))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 48 literals and 8 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
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 279778 markings, 601025 edges
lola: ========================================
lola: subprocess 5 will run for 1767 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p34) AND (1 <= p271) AND ((p139 <= 0) OR (p176 <= 0) OR (p266 <= 0)) AND (((1 <= p157) AND (1 <= p161)) OR ((1 <= p262) AND (1 <= p267) AND (1 <= p145) AND (1 <= p37) AND (1 <= p185))))))
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 <= p34) AND (1 <= p271) AND ((p139 <= 0) OR (p176 <= 0) OR (p266 <= 0)) AND (((1 <= p157) AND (1 <= p161)) OR ((1 <= p262) AND (1 <= p267) AND (1 <= p145) AND (1 <= p37) AND (1 <= p185))))))
lola: processed formula length: 203
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 <= p34) AND (1 <= p271) AND ((p139 <= 0) OR (p176 <= 0) OR (p266 <= 0)) AND (((1 <= p157) AND (1 <= p161)) OR ((1 <= p262) AND (1 <= p267) AND (1 <= p145) AND (1 <= p37) AND (1 <= p185))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 39 literals and 6 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
lola: sara is running 0 secs || 784074 markings, 1174007 edges, 156815 markings/sec, 0 secs
lola: sara is running 5 secs || 1566454 markings, 2362945 edges, 156476 markings/sec, 5 secs
lola: sara is running 10 secs || 2338534 markings, 3547115 edges, 154416 markings/sec, 10 secs
lola: sara is running 15 secs || 2993347 markings, 4759661 edges, 130963 markings/sec, 15 secs
lola: sara is running 20 secs || 3602721 markings, 5929741 edges, 121875 markings/sec, 20 secs
lola: sara is running 25 secs || 4226766 markings, 7113767 edges, 124809 markings/sec, 25 secs
lola: sara is running 30 secs || 4839773 markings, 8287598 edges, 122601 markings/sec, 30 secs
lola: sara is running 35 secs || 5464141 markings, 9468052 edges, 124874 markings/sec, 35 secs
lola: sara is running 40 secs || 6111532 markings, 10633111 edges, 129478 markings/sec, 40 secs
lola: sara is running 45 secs || 6748971 markings, 11808690 edges, 127488 markings/sec, 45 secs
lola: sara is running 50 secs || 7352830 markings, 12934778 edges, 120772 markings/sec, 50 secs
lola: sara is running 55 secs || 7951080 markings, 14083372 edges, 119650 markings/sec, 55 secs
lola: sara is running 60 secs || 8567358 markings, 15255404 edges, 123256 markings/sec, 60 secs
lola: sara is running 65 secs || 9177159 markings, 16405694 edges, 121960 markings/sec, 65 secs
lola: sara is running 70 secs || 9778316 markings, 17561536 edges, 120231 markings/sec, 70 secs
lola: sara is running 75 secs || 10448256 markings, 18695593 edges, 133988 markings/sec, 75 secs
lola: sara is running 80 secs || 11196867 markings, 19832049 edges, 149722 markings/sec, 80 secs
lola: sara is running 85 secs || 11958597 markings, 21005198 edges, 152346 markings/sec, 85 secs
lola: sara is running 90 secs || 12734600 markings, 22182095 edges, 155201 markings/sec, 90 secs
lola: sara is running 95 secs || 13484722 markings, 23333608 edges, 150024 markings/sec, 95 secs
lola: sara is running 100 secs || 14265520 markings, 24516361 edges, 156160 markings/sec, 100 secs
lola: sara is running 105 secs || 15035262 markings, 25696608 edges, 153948 markings/sec, 105 secs
lola: sara is running 110 secs || 15799375 markings, 26853482 edges, 152823 markings/sec, 110 secs
lola: sara is running 115 secs || 16553666 markings, 28015817 edges, 150858 markings/sec, 115 secs
lola: sara is running 120 secs || 17334632 markings, 29199520 edges, 156193 markings/sec, 120 secs
lola: sara is running 125 secs || 18107874 markings, 30387584 edges, 154648 markings/sec, 125 secs
lola: sara is running 130 secs || 18891764 markings, 31576466 edges, 156778 markings/sec, 130 secs
lola: sara is running 135 secs || 19662992 markings, 32758927 edges, 154246 markings/sec, 135 secs
lola: sara is running 140 secs || 20443308 markings, 33941205 edges, 156063 markings/sec, 140 secs
lola: sara is running 145 secs || 21215641 markings, 35132446 edges, 154467 markings/sec, 145 secs
lola: sara is running 150 secs || 21989650 markings, 36306327 edges, 154802 markings/sec, 150 secs
lola: sara is running 155 secs || 22757301 markings, 37480683 edges, 153530 markings/sec, 155 secs
lola: sara is running 160 secs || 23512357 markings, 38633197 edges, 151011 markings/sec, 160 secs
lola: sara is running 165 secs || 24256736 markings, 39789084 edges, 148876 markings/sec, 165 secs
lola: sara is running 170 secs || 25003725 markings, 40936959 edges, 149398 markings/sec, 170 secs
lola: sara is running 175 secs || 25789312 markings, 42086972 edges, 157117 markings/sec, 175 secs
lola: sara is running 180 secs || 26628980 markings, 43247150 edges, 167934 markings/sec, 180 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 27303709 markings, 44207400 edges
lola: ========================================
lola: subprocess 6 will run for 3345 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p76 <= 0) OR (p167 <= 0) OR ((1 <= p55) AND (1 <= p271)) OR ((1 <= p60) AND (1 <= p271)) OR ((1 <= p75) AND (1 <= p167)) OR ((1 <= p135) AND (1 <= p246)) OR ((1 <= p134) AND (1 <= p246) AND (1 <= p26) AND (1 <= p173)) OR ((1 <= p157) AND (1 <= p162) AND (1 <= p202) AND (1 <= p220)) OR ((1 <= p113) AND (1 <= p129) AND (1 <= p90) AND (1 <= p167)))))
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 (((p76 <= 0) OR (p167 <= 0) OR ((1 <= p55) AND (1 <= p271)) OR ((1 <= p60) AND (1 <= p271)) OR ((1 <= p75) AND (1 <= p167)) OR ((1 <= p135) AND (1 <= p246)) OR ((1 <= p134) AND (1 <= p246) AND (1 <= p26) AND (1 <= p173)) OR ((1 <= p157) AND (1 <= p162) AND (1 <= p202) AND (1 <= p220)) OR ((1 <= p113) AND (1 <= p129) AND (1 <= p90) AND (1 <= p167)))))
lola: processed formula length: 365
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 <= p76) AND (1 <= p167) AND ((p55 <= 0) OR (p271 <= 0)) AND ((p60 <= 0) OR (p271 <= 0)) AND ((p75 <= 0) OR (p167 <= 0)) AND ((p135 <= 0) OR (p246 <= 0)) AND ((p134 <= 0) OR (p246 <= 0) OR (p26 <= 0) OR (p173 <= 0)) AND ((p157 <= 0) OR (p162 <= 0) OR (p202 <= 0) OR (p220 <= 0)) AND ((p113 <= 0) OR (p129 <= 0) OR (p90 <= 0) OR (p167 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3456 literals and 384 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-6-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 9128 markings, 13831 edges
lola: RESULT
lola:
SUMMARY: yes yes no yes no no yes
lola:
preliminary result: yes yes no yes no no yes
lola: ========================================
lola: memory consumption: 41372 KB
lola: time consumption: 225 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="DES-PT-30b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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 itslola"
echo " Input is DES-PT-30b, 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 r180-ebro-158987900000287"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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