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-158987900000271.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-20b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-ebro-158987900000271
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 264K
-rw-r--r-- 1 mcc users 3.9K Mar 30 01:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 30 01:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 16:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:18 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.0K Apr 8 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7K Apr 8 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 08:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 08:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 26 08:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K 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 91K 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-20b-ReachabilityFireability-00
FORMULA_NAME DES-PT-20b-ReachabilityFireability-01
FORMULA_NAME DES-PT-20b-ReachabilityFireability-02
FORMULA_NAME DES-PT-20b-ReachabilityFireability-03
FORMULA_NAME DES-PT-20b-ReachabilityFireability-04
FORMULA_NAME DES-PT-20b-ReachabilityFireability-05
FORMULA_NAME DES-PT-20b-ReachabilityFireability-06
FORMULA_NAME DES-PT-20b-ReachabilityFireability-07
FORMULA_NAME DES-PT-20b-ReachabilityFireability-08
FORMULA_NAME DES-PT-20b-ReachabilityFireability-09
FORMULA_NAME DES-PT-20b-ReachabilityFireability-10
FORMULA_NAME DES-PT-20b-ReachabilityFireability-11
FORMULA_NAME DES-PT-20b-ReachabilityFireability-12
FORMULA_NAME DES-PT-20b-ReachabilityFireability-13
FORMULA_NAME DES-PT-20b-ReachabilityFireability-14
FORMULA_NAME DES-PT-20b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591185784418

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 12:03:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 12:03:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 12:03:07] [INFO ] Load time of PNML (sax parser for PT used): 191 ms
[2020-06-03 12:03:08] [INFO ] Transformed 360 places.
[2020-06-03 12:03:08] [INFO ] Transformed 311 transitions.
[2020-06-03 12:03:08] [INFO ] Found NUPN structural information;
[2020-06-03 12:03:08] [INFO ] Parsed PT model containing 360 places and 311 transitions in 337 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 87 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 84 resets, run finished after 172 ms. (steps per millisecond=58 ) properties seen :[1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0]
FORMULA DES-PT-20b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 66 ms. (steps per millisecond=151 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 49 ms. (steps per millisecond=204 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 48 ms. (steps per millisecond=208 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 45 ms. (steps per millisecond=222 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 54 ms. (steps per millisecond=185 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0]
FORMULA DES-PT-20b-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 97 ms. (steps per millisecond=103 ) 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 48 ms. (steps per millisecond=208 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 311 rows 360 cols
[2020-06-03 12:03:08] [INFO ] Computed 65 place invariants in 51 ms
[2020-06-03 12:03:09] [INFO ] [Real]Absence check using 39 positive place invariants in 93 ms returned sat
[2020-06-03 12:03:09] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 51 ms returned sat
[2020-06-03 12:03:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:03:10] [INFO ] [Real]Absence check using state equation in 898 ms returned sat
[2020-06-03 12:03:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:03:10] [INFO ] [Nat]Absence check using 39 positive place invariants in 81 ms returned sat
[2020-06-03 12:03:10] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 71 ms returned sat
[2020-06-03 12:03:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:03:11] [INFO ] [Nat]Absence check using state equation in 964 ms returned sat
[2020-06-03 12:03:12] [INFO ] Deduced a trap composed of 13 places in 250 ms
[2020-06-03 12:03:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 362 ms
[2020-06-03 12:03:12] [INFO ] Computed and/alt/rep : 310/700/310 causal constraints in 36 ms.
[2020-06-03 12:03: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 (=> (> t298 0) (and (or (and (> t84 0) (< o84 o298)) (and (> t118 0) (< o118 o298))) (and (> t101 0) (< o101 o298))))") while checking expression at index 0
[2020-06-03 12:03:15] [INFO ] [Real]Absence check using 39 positive place invariants in 46 ms returned sat
[2020-06-03 12:03:15] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 48 ms returned sat
[2020-06-03 12:03:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:03:16] [INFO ] [Real]Absence check using state equation in 1010 ms returned sat
[2020-06-03 12:03:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:03:17] [INFO ] [Nat]Absence check using 39 positive place invariants in 80 ms returned sat
[2020-06-03 12:03:17] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 69 ms returned sat
[2020-06-03 12:03:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:03:18] [INFO ] [Nat]Absence check using state equation in 930 ms returned sat
[2020-06-03 12:03:18] [INFO ] Deduced a trap composed of 8 places in 220 ms
[2020-06-03 12:03:18] [INFO ] Deduced a trap composed of 35 places in 125 ms
[2020-06-03 12:03:18] [INFO ] Deduced a trap composed of 29 places in 155 ms
[2020-06-03 12:03:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 663 ms
[2020-06-03 12:03:18] [INFO ] Computed and/alt/rep : 310/700/310 causal constraints in 44 ms.
[2020-06-03 12:03:21] [INFO ] Added : 280 causal constraints over 56 iterations in 3036 ms. Result :(error "Failed to check-sat")
[2020-06-03 12:03:22] [INFO ] [Real]Absence check using 39 positive place invariants in 43 ms returned sat
[2020-06-03 12:03:22] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 49 ms returned sat
[2020-06-03 12:03:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:03:23] [INFO ] [Real]Absence check using state equation in 1125 ms returned sat
[2020-06-03 12:03:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:03:23] [INFO ] [Nat]Absence check using 39 positive place invariants in 82 ms returned sat
[2020-06-03 12:03:23] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 53 ms returned sat
[2020-06-03 12:03:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:03:24] [INFO ] [Nat]Absence check using state equation in 789 ms returned sat
[2020-06-03 12:03:24] [INFO ] Deduced a trap composed of 15 places in 257 ms
[2020-06-03 12:03:24] [INFO ] Deduced a trap composed of 9 places in 201 ms
[2020-06-03 12:03:24] [INFO ] Deduced a trap composed of 33 places in 108 ms
[2020-06-03 12:03:25] [INFO ] Deduced a trap composed of 21 places in 191 ms
[2020-06-03 12:03:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 924 ms
[2020-06-03 12:03:25] [INFO ] Computed and/alt/rep : 310/700/310 causal constraints in 49 ms.
[2020-06-03 12:03:28] [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 (=> (> t261 0) (and (and (> t136 0) (< o136 o261)) (or (and (> t28 0) (< o28 o261)) (and (> t33 0) (< o33 o261)) (and (> t36 0) (< o36 o261)) (and (> t38 0) (< o38 o261)))))") while checking expression at index 2
[2020-06-03 12:03:28] [INFO ] [Real]Absence check using 39 positive place invariants in 45 ms returned sat
[2020-06-03 12:03:28] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 132 ms returned sat
[2020-06-03 12:03:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:03:29] [INFO ] [Real]Absence check using state equation in 816 ms returned sat
[2020-06-03 12:03:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:03:29] [INFO ] [Nat]Absence check using 39 positive place invariants in 57 ms returned sat
[2020-06-03 12:03:29] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 53 ms returned sat
[2020-06-03 12:03:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:03:30] [INFO ] [Nat]Absence check using state equation in 737 ms returned sat
[2020-06-03 12:03:30] [INFO ] Deduced a trap composed of 16 places in 149 ms
[2020-06-03 12:03:30] [INFO ] Deduced a trap composed of 10 places in 118 ms
[2020-06-03 12:03:30] [INFO ] Deduced a trap composed of 14 places in 90 ms
[2020-06-03 12:03:30] [INFO ] Deduced a trap composed of 12 places in 81 ms
[2020-06-03 12:03:30] [INFO ] Deduced a trap composed of 12 places in 78 ms
[2020-06-03 12:03:31] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 713 ms
[2020-06-03 12:03:31] [INFO ] Computed and/alt/rep : 310/700/310 causal constraints in 36 ms.
[2020-06-03 12:03:34] [INFO ] Added : 260 causal constraints over 52 iterations in 3117 ms. Result :unsat
[2020-06-03 12:03:34] [INFO ] [Real]Absence check using 39 positive place invariants in 41 ms returned sat
[2020-06-03 12:03:34] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 32 ms returned sat
[2020-06-03 12:03:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:03:34] [INFO ] [Real]Absence check using state equation in 692 ms returned sat
[2020-06-03 12:03:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:03:35] [INFO ] [Nat]Absence check using 39 positive place invariants in 60 ms returned sat
[2020-06-03 12:03:35] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 31 ms returned sat
[2020-06-03 12:03:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:03:35] [INFO ] [Nat]Absence check using state equation in 701 ms returned sat
[2020-06-03 12:03:36] [INFO ] Deduced a trap composed of 8 places in 221 ms
[2020-06-03 12:03:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 284 ms
[2020-06-03 12:03:36] [INFO ] Computed and/alt/rep : 310/700/310 causal constraints in 42 ms.
[2020-06-03 12:03:40] [INFO ] Added : 269 causal constraints over 54 iterations in 3830 ms. Result :unknown
[2020-06-03 12:03:40] [INFO ] [Real]Absence check using 39 positive place invariants in 45 ms returned sat
[2020-06-03 12:03:40] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 47 ms returned sat
[2020-06-03 12:03:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:03:41] [INFO ] [Real]Absence check using state equation in 812 ms returned sat
[2020-06-03 12:03:41] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:03:41] [INFO ] [Nat]Absence check using 39 positive place invariants in 105 ms returned sat
[2020-06-03 12:03:41] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 109 ms returned sat
[2020-06-03 12:03:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:03:42] [INFO ] [Nat]Absence check using state equation in 1062 ms returned sat
[2020-06-03 12:03:42] [INFO ] Deduced a trap composed of 30 places in 299 ms
[2020-06-03 12:03:43] [INFO ] Deduced a trap composed of 35 places in 205 ms
[2020-06-03 12:03:43] [INFO ] Deduced a trap composed of 33 places in 230 ms
[2020-06-03 12:03:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 889 ms
[2020-06-03 12:03:43] [INFO ] Computed and/alt/rep : 310/700/310 causal constraints in 59 ms.
[2020-06-03 12:03:46] [INFO ] Added : 235 causal constraints over 47 iterations in 2741 ms. Result :unknown
[2020-06-03 12:03:46] [INFO ] [Real]Absence check using 39 positive place invariants in 55 ms returned sat
[2020-06-03 12:03:46] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 48 ms returned sat
[2020-06-03 12:03:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:03:47] [INFO ] [Real]Absence check using state equation in 1027 ms returned sat
[2020-06-03 12:03:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:03:47] [INFO ] [Nat]Absence check using 39 positive place invariants in 67 ms returned sat
[2020-06-03 12:03:47] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 66 ms returned sat
[2020-06-03 12:03:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:03:48] [INFO ] [Nat]Absence check using state equation in 791 ms returned sat
[2020-06-03 12:03:48] [INFO ] Deduced a trap composed of 14 places in 221 ms
[2020-06-03 12:03:48] [INFO ] Deduced a trap composed of 16 places in 144 ms
[2020-06-03 12:03:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 465 ms
[2020-06-03 12:03:48] [INFO ] Computed and/alt/rep : 310/700/310 causal constraints in 37 ms.
[2020-06-03 12:03:52] [INFO ] Added : 300 causal constraints over 60 iterations in 3520 ms. Result :unknown
[2020-06-03 12:03:52] [INFO ] [Real]Absence check using 39 positive place invariants in 40 ms returned sat
[2020-06-03 12:03:52] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 35 ms returned sat
[2020-06-03 12:03:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:03:53] [INFO ] [Real]Absence check using state equation in 649 ms returned sat
[2020-06-03 12:03:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:03:53] [INFO ] [Nat]Absence check using 39 positive place invariants in 64 ms returned sat
[2020-06-03 12:03:53] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 47 ms returned sat
[2020-06-03 12:03:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:03:54] [INFO ] [Nat]Absence check using state equation in 689 ms returned sat
[2020-06-03 12:03:54] [INFO ] Deduced a trap composed of 18 places in 150 ms
[2020-06-03 12:03:54] [INFO ] Deduced a trap composed of 9 places in 171 ms
[2020-06-03 12:03:54] [INFO ] Deduced a trap composed of 39 places in 127 ms
[2020-06-03 12:03:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 571 ms
[2020-06-03 12:03:54] [INFO ] Computed and/alt/rep : 310/700/310 causal constraints in 35 ms.
[2020-06-03 12:03:57] [INFO ] Added : 239 causal constraints over 48 iterations in 2677 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 25 ms.
[2020-06-03 12:03:57] [INFO ] [Real]Absence check using 39 positive place invariants in 43 ms returned sat
[2020-06-03 12:03:57] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 10 ms returned unsat
[2020-06-03 12:03:57] [INFO ] [Real]Absence check using 39 positive place invariants in 42 ms returned sat
[2020-06-03 12:03:57] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 45 ms returned sat
[2020-06-03 12:03:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:03:58] [INFO ] [Real]Absence check using state equation in 831 ms returned sat
[2020-06-03 12:03:58] [INFO ] Deduced a trap composed of 7 places in 164 ms
[2020-06-03 12:03:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 233 ms
[2020-06-03 12:03:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:03:59] [INFO ] [Nat]Absence check using 39 positive place invariants in 59 ms returned sat
[2020-06-03 12:03:59] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 51 ms returned sat
[2020-06-03 12:03:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:04:00] [INFO ] [Nat]Absence check using state equation in 1111 ms returned sat
[2020-06-03 12:04:00] [INFO ] Deduced a trap composed of 12 places in 293 ms
[2020-06-03 12:04:01] [INFO ] Deduced a trap composed of 20 places in 365 ms
[2020-06-03 12:04:01] [INFO ] Deduced a trap composed of 16 places in 268 ms
[2020-06-03 12:04:01] [INFO ] Deduced a trap composed of 8 places in 190 ms
[2020-06-03 12:04:01] [INFO ] Deduced a trap composed of 15 places in 102 ms
[2020-06-03 12:04:01] [INFO ] Deduced a trap composed of 17 places in 95 ms
[2020-06-03 12:04:01] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1580 ms
[2020-06-03 12:04:01] [INFO ] Computed and/alt/rep : 310/700/310 causal constraints in 35 ms.
[2020-06-03 12:04:03] [INFO ] Added : 200 causal constraints over 40 iterations in 2122 ms. Result :unknown
FORMULA DES-PT-20b-ReachabilityFireability-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-20b-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 323700 steps, including 3400 resets, run finished after 1507 ms. (steps per millisecond=214 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 60200 steps, including 648 resets, run finished after 278 ms. (steps per millisecond=216 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 306900 steps, including 3175 resets, run finished after 1347 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 203400 steps, including 2241 resets, run finished after 825 ms. (steps per millisecond=246 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 245200 steps, including 2600 resets, run finished after 988 ms. (steps per millisecond=248 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 59 out of 360 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 360/360 places, 311/311 transitions.
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Graph (complete) has 741 edges and 360 vertex of which 349 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.16 ms
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 349 transition count 293
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 26 place count 337 transition count 293
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 26 place count 337 transition count 286
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 40 place count 330 transition count 286
Symmetric choice reduction at 2 with 15 rule applications. Total rules 55 place count 330 transition count 286
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 85 place count 315 transition count 271
Symmetric choice reduction at 2 with 10 rule applications. Total rules 95 place count 315 transition count 271
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 10 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 115 place count 305 transition count 261
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 124 place count 305 transition count 252
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 125 place count 304 transition count 252
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 4 with 104 rules applied. Total rules applied 229 place count 252 transition count 200
Free-agglomeration rule applied 8 times.
Iterating global reduction 4 with 8 rules applied. Total rules applied 237 place count 252 transition count 192
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 245 place count 244 transition count 192
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 247 place count 244 transition count 192
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 248 place count 244 transition count 191
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 249 place count 243 transition count 190
Applied a total of 249 rules in 267 ms. Remains 243 /360 variables (removed 117) and now considering 190/311 (removed 121) transitions.
Finished structural reductions, in 1 iterations. Remains : 243/360 places, 190/311 transitions.
Incomplete random walk after 1000000 steps, including 15840 resets, run finished after 4014 ms. (steps per millisecond=249 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3259 resets, run finished after 2636 ms. (steps per millisecond=379 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 3241 resets, run finished after 2369 ms. (steps per millisecond=422 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3201 resets, run finished after 2006 ms. (steps per millisecond=498 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3776 resets, run finished after 1808 ms. (steps per millisecond=553 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2808 resets, run finished after 2222 ms. (steps per millisecond=450 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2901 resets, run finished after 2279 ms. (steps per millisecond=438 ) properties seen :[0, 0, 0, 0, 0, 1, 0, 0]
FORMULA DES-PT-20b-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 2787 resets, run finished after 1898 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3815 resets, run finished after 2175 ms. (steps per millisecond=459 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 190 rows 243 cols
[2020-06-03 12:04:30] [INFO ] Computed 60 place invariants in 28 ms
[2020-06-03 12:04:30] [INFO ] [Real]Absence check using 33 positive place invariants in 37 ms returned sat
[2020-06-03 12:04:30] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 43 ms returned sat
[2020-06-03 12:04:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:04:31] [INFO ] [Real]Absence check using state equation in 716 ms returned sat
[2020-06-03 12:04:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:04:31] [INFO ] [Nat]Absence check using 33 positive place invariants in 50 ms returned sat
[2020-06-03 12:04:31] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 48 ms returned sat
[2020-06-03 12:04:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:04:32] [INFO ] [Nat]Absence check using state equation in 459 ms returned sat
[2020-06-03 12:04:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 12:04:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 16 ms returned sat
[2020-06-03 12:04:32] [INFO ] Deduced a trap composed of 11 places in 62 ms
[2020-06-03 12:04:32] [INFO ] Deduced a trap composed of 4 places in 130 ms
[2020-06-03 12:04:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 382 ms
[2020-06-03 12:04:32] [INFO ] Computed and/alt/rep : 189/607/189 causal constraints in 29 ms.
[2020-06-03 12:04:34] [INFO ] Added : 167 causal constraints over 34 iterations in 1723 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 15 ms.
[2020-06-03 12:04:34] [INFO ] [Real]Absence check using 33 positive place invariants in 28 ms returned sat
[2020-06-03 12:04:34] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 36 ms returned sat
[2020-06-03 12:04:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:04:35] [INFO ] [Real]Absence check using state equation in 641 ms returned sat
[2020-06-03 12:04:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:04:35] [INFO ] [Nat]Absence check using 33 positive place invariants in 34 ms returned sat
[2020-06-03 12:04:35] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 41 ms returned sat
[2020-06-03 12:04:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:04:35] [INFO ] [Nat]Absence check using state equation in 668 ms returned sat
[2020-06-03 12:04:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 9 ms returned sat
[2020-06-03 12:04:36] [INFO ] Deduced a trap composed of 20 places in 62 ms
[2020-06-03 12:04:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2020-06-03 12:04:36] [INFO ] Computed and/alt/rep : 189/607/189 causal constraints in 21 ms.
[2020-06-03 12:04:37] [INFO ] Added : 139 causal constraints over 28 iterations in 1235 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 24 ms.
[2020-06-03 12:04:37] [INFO ] [Real]Absence check using 33 positive place invariants in 57 ms returned sat
[2020-06-03 12:04:37] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 56 ms returned sat
[2020-06-03 12:04:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:04:38] [INFO ] [Real]Absence check using state equation in 731 ms returned sat
[2020-06-03 12:04:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:04:38] [INFO ] [Nat]Absence check using 33 positive place invariants in 45 ms returned sat
[2020-06-03 12:04:38] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 113 ms returned sat
[2020-06-03 12:04:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:04:39] [INFO ] [Nat]Absence check using state equation in 578 ms returned sat
[2020-06-03 12:04:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2020-06-03 12:04:39] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2020-06-03 12:04:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2020-06-03 12:04:39] [INFO ] Computed and/alt/rep : 189/607/189 causal constraints in 16 ms.
[2020-06-03 12:04:41] [INFO ] Added : 164 causal constraints over 33 iterations in 1633 ms. Result :sat
[2020-06-03 12:04:41] [INFO ] Deduced a trap composed of 18 places in 155 ms
[2020-06-03 12:04:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 235 ms
Attempting to minimize the solution found.
Minimization took 22 ms.
[2020-06-03 12:04:41] [INFO ] [Real]Absence check using 33 positive place invariants in 29 ms returned sat
[2020-06-03 12:04:41] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 26 ms returned sat
[2020-06-03 12:04:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:04:41] [INFO ] [Real]Absence check using state equation in 402 ms returned sat
[2020-06-03 12:04:41] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:04:42] [INFO ] [Nat]Absence check using 33 positive place invariants in 47 ms returned sat
[2020-06-03 12:04:42] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 146 ms returned sat
[2020-06-03 12:04:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:04:42] [INFO ] [Nat]Absence check using state equation in 498 ms returned sat
[2020-06-03 12:04:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 9 ms returned sat
[2020-06-03 12:04:42] [INFO ] Computed and/alt/rep : 189/607/189 causal constraints in 53 ms.
[2020-06-03 12:04:44] [INFO ] Added : 167 causal constraints over 34 iterations in 2038 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 30 ms.
[2020-06-03 12:04:44] [INFO ] [Real]Absence check using 33 positive place invariants in 42 ms returned sat
[2020-06-03 12:04:44] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 49 ms returned sat
[2020-06-03 12:04:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:04:45] [INFO ] [Real]Absence check using state equation in 523 ms returned sat
[2020-06-03 12:04:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:04:45] [INFO ] [Nat]Absence check using 33 positive place invariants in 69 ms returned sat
[2020-06-03 12:04:45] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 176 ms returned sat
[2020-06-03 12:04:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:04:46] [INFO ] [Nat]Absence check using state equation in 620 ms returned sat
[2020-06-03 12:04:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 10 ms returned sat
[2020-06-03 12:04:46] [INFO ] Computed and/alt/rep : 189/607/189 causal constraints in 60 ms.
[2020-06-03 12:04:48] [INFO ] Added : 154 causal constraints over 31 iterations in 1623 ms. Result :sat
[2020-06-03 12:04:48] [INFO ] Deduced a trap composed of 17 places in 73 ms
[2020-06-03 12:04:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 200 ms
Attempting to minimize the solution found.
Minimization took 14 ms.
[2020-06-03 12:04:48] [INFO ] [Real]Absence check using 33 positive place invariants in 33 ms returned sat
[2020-06-03 12:04:48] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 28 ms returned sat
[2020-06-03 12:04:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:04:48] [INFO ] [Real]Absence check using state equation in 367 ms returned sat
[2020-06-03 12:04:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:04:49] [INFO ] [Nat]Absence check using 33 positive place invariants in 42 ms returned sat
[2020-06-03 12:04:49] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 72 ms returned sat
[2020-06-03 12:04:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:04:49] [INFO ] [Nat]Absence check using state equation in 443 ms returned sat
[2020-06-03 12:04:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2020-06-03 12:04:49] [INFO ] Computed and/alt/rep : 189/607/189 causal constraints in 24 ms.
[2020-06-03 12:04:51] [INFO ] Added : 137 causal constraints over 28 iterations in 1429 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 15 ms.
[2020-06-03 12:04:51] [INFO ] [Real]Absence check using 33 positive place invariants in 41 ms returned sat
[2020-06-03 12:04:51] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 46 ms returned sat
[2020-06-03 12:04:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:04:51] [INFO ] [Real]Absence check using state equation in 584 ms returned sat
[2020-06-03 12:04:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:04:52] [INFO ] [Nat]Absence check using 33 positive place invariants in 47 ms returned sat
[2020-06-03 12:04:52] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 116 ms returned sat
[2020-06-03 12:04:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:04:52] [INFO ] [Nat]Absence check using state equation in 621 ms returned sat
[2020-06-03 12:04:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2020-06-03 12:04:52] [INFO ] Deduced a trap composed of 7 places in 72 ms
[2020-06-03 12:04:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2020-06-03 12:04:52] [INFO ] Computed and/alt/rep : 189/607/189 causal constraints in 25 ms.
[2020-06-03 12:04:54] [INFO ] Added : 181 causal constraints over 37 iterations in 1775 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 15 ms.
Incomplete Parikh walk after 161500 steps, including 2549 resets, run finished after 683 ms. (steps per millisecond=236 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 39900 steps, including 642 resets, run finished after 166 ms. (steps per millisecond=240 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 105100 steps, including 1787 resets, run finished after 428 ms. (steps per millisecond=245 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 127000 steps, including 2017 resets, run finished after 542 ms. (steps per millisecond=234 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 126900 steps, including 2227 resets, run finished after 522 ms. (steps per millisecond=243 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 42400 steps, including 816 resets, run finished after 166 ms. (steps per millisecond=255 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 145400 steps, including 2411 resets, run finished after 596 ms. (steps per millisecond=243 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 47 out of 243 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 243/243 places, 190/190 transitions.
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 243 transition count 190
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 242 transition count 189
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 5 place count 242 transition count 187
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 241 transition count 187
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 18 place count 235 transition count 181
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 235 transition count 180
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 21 place count 234 transition count 179
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 22 place count 234 transition count 179
Applied a total of 22 rules in 90 ms. Remains 234 /243 variables (removed 9) and now considering 179/190 (removed 11) transitions.
Finished structural reductions, in 1 iterations. Remains : 234/243 places, 179/190 transitions.
Incomplete random walk after 1000000 steps, including 17540 resets, run finished after 3691 ms. (steps per millisecond=270 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3842 resets, run finished after 2404 ms. (steps per millisecond=415 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3858 resets, run finished after 2204 ms. (steps per millisecond=453 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3472 resets, run finished after 1959 ms. (steps per millisecond=510 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 4177 resets, run finished after 1795 ms. (steps per millisecond=557 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 3441 resets, run finished after 2193 ms. (steps per millisecond=455 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3360 resets, run finished after 1863 ms. (steps per millisecond=536 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 4182 resets, run finished after 2123 ms. (steps per millisecond=471 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 8944124 steps, run timeout after 30001 ms. (steps per millisecond=298 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Probabilistic random walk after 8944124 steps, saw 1054759 distinct states, run finished after 30001 ms. (steps per millisecond=298 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 179 rows 234 cols
[2020-06-03 12:05:46] [INFO ] Computed 60 place invariants in 7 ms
[2020-06-03 12:05:46] [INFO ] [Real]Absence check using 33 positive place invariants in 52 ms returned sat
[2020-06-03 12:05:46] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 51 ms returned sat
[2020-06-03 12:05:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:05:46] [INFO ] [Real]Absence check using state equation in 571 ms returned sat
[2020-06-03 12:05:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:05:47] [INFO ] [Nat]Absence check using 33 positive place invariants in 42 ms returned sat
[2020-06-03 12:05:47] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 128 ms returned sat
[2020-06-03 12:05:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:05:47] [INFO ] [Nat]Absence check using state equation in 530 ms returned sat
[2020-06-03 12:05:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2020-06-03 12:05:47] [INFO ] [Nat]Added 2 Read/Feed constraints in 16 ms returned sat
[2020-06-03 12:05:47] [INFO ] Deduced a trap composed of 26 places in 116 ms
[2020-06-03 12:05:48] [INFO ] Deduced a trap composed of 22 places in 102 ms
[2020-06-03 12:05:48] [INFO ] Deduced a trap composed of 26 places in 100 ms
[2020-06-03 12:05:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 557 ms
[2020-06-03 12:05:48] [INFO ] Computed and/alt/rep : 178/594/178 causal constraints in 19 ms.
[2020-06-03 12:05:49] [INFO ] Added : 156 causal constraints over 32 iterations in 1249 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 19 ms.
[2020-06-03 12:05:49] [INFO ] [Real]Absence check using 33 positive place invariants in 28 ms returned sat
[2020-06-03 12:05:49] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 38 ms returned sat
[2020-06-03 12:05:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:05:50] [INFO ] [Real]Absence check using state equation in 643 ms returned sat
[2020-06-03 12:05:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:05:50] [INFO ] [Nat]Absence check using 33 positive place invariants in 46 ms returned sat
[2020-06-03 12:05:50] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 237 ms returned sat
[2020-06-03 12:05:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:05:51] [INFO ] [Nat]Absence check using state equation in 828 ms returned sat
[2020-06-03 12:05:51] [INFO ] [Nat]Added 2 Read/Feed constraints in 27 ms returned sat
[2020-06-03 12:05:51] [INFO ] Deduced a trap composed of 20 places in 116 ms
[2020-06-03 12:05:51] [INFO ] Deduced a trap composed of 22 places in 46 ms
[2020-06-03 12:05:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 314 ms
[2020-06-03 12:05:51] [INFO ] Computed and/alt/rep : 178/594/178 causal constraints in 21 ms.
[2020-06-03 12:05:53] [INFO ] Added : 120 causal constraints over 25 iterations in 1284 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 20 ms.
[2020-06-03 12:05:53] [INFO ] [Real]Absence check using 33 positive place invariants in 40 ms returned sat
[2020-06-03 12:05:53] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 44 ms returned sat
[2020-06-03 12:05:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:05:53] [INFO ] [Real]Absence check using state equation in 445 ms returned sat
[2020-06-03 12:05:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:05:54] [INFO ] [Nat]Absence check using 33 positive place invariants in 40 ms returned sat
[2020-06-03 12:05:54] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 229 ms returned sat
[2020-06-03 12:05:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:05:54] [INFO ] [Nat]Absence check using state equation in 631 ms returned sat
[2020-06-03 12:05:54] [INFO ] [Nat]Added 2 Read/Feed constraints in 8 ms returned sat
[2020-06-03 12:05:54] [INFO ] Deduced a trap composed of 22 places in 29 ms
[2020-06-03 12:05:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2020-06-03 12:05:55] [INFO ] Computed and/alt/rep : 178/594/178 causal constraints in 22 ms.
[2020-06-03 12:05:56] [INFO ] Added : 154 causal constraints over 31 iterations in 1254 ms. Result :sat
[2020-06-03 12:05:56] [INFO ] Deduced a trap composed of 20 places in 314 ms
[2020-06-03 12:05:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 389 ms
Attempting to minimize the solution found.
Minimization took 23 ms.
[2020-06-03 12:05:56] [INFO ] [Real]Absence check using 33 positive place invariants in 39 ms returned sat
[2020-06-03 12:05:56] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 39 ms returned sat
[2020-06-03 12:05:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:05:57] [INFO ] [Real]Absence check using state equation in 350 ms returned sat
[2020-06-03 12:05:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:05:57] [INFO ] [Nat]Absence check using 33 positive place invariants in 67 ms returned sat
[2020-06-03 12:05:57] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 162 ms returned sat
[2020-06-03 12:05:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:05:58] [INFO ] [Nat]Absence check using state equation in 997 ms returned sat
[2020-06-03 12:05:58] [INFO ] [Nat]Added 2 Read/Feed constraints in 15 ms returned sat
[2020-06-03 12:05:58] [INFO ] Deduced a trap composed of 22 places in 25 ms
[2020-06-03 12:05:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2020-06-03 12:05:58] [INFO ] Computed and/alt/rep : 178/594/178 causal constraints in 81 ms.
[2020-06-03 12:06:00] [INFO ] Added : 157 causal constraints over 32 iterations in 1676 ms. Result :sat
[2020-06-03 12:06:00] [INFO ] Deduced a trap composed of 21 places in 127 ms
[2020-06-03 12:06:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
Attempting to minimize the solution found.
Minimization took 16 ms.
[2020-06-03 12:06:00] [INFO ] [Real]Absence check using 33 positive place invariants in 45 ms returned sat
[2020-06-03 12:06:00] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 47 ms returned sat
[2020-06-03 12:06:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:06:01] [INFO ] [Real]Absence check using state equation in 373 ms returned sat
[2020-06-03 12:06:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:06:01] [INFO ] [Nat]Absence check using 33 positive place invariants in 42 ms returned sat
[2020-06-03 12:06:01] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 82 ms returned sat
[2020-06-03 12:06:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:06:01] [INFO ] [Nat]Absence check using state equation in 526 ms returned sat
[2020-06-03 12:06:02] [INFO ] [Nat]Added 2 Read/Feed constraints in 26 ms returned sat
[2020-06-03 12:06:02] [INFO ] Deduced a trap composed of 22 places in 128 ms
[2020-06-03 12:06:02] [INFO ] Deduced a trap composed of 14 places in 98 ms
[2020-06-03 12:06:02] [INFO ] Deduced a trap composed of 16 places in 94 ms
[2020-06-03 12:06:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 428 ms
[2020-06-03 12:06:02] [INFO ] Computed and/alt/rep : 178/594/178 causal constraints in 26 ms.
[2020-06-03 12:06:04] [INFO ] Added : 155 causal constraints over 31 iterations in 1751 ms. Result :sat
[2020-06-03 12:06:04] [INFO ] Deduced a trap composed of 20 places in 93 ms
[2020-06-03 12:06:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 201 ms
Attempting to minimize the solution found.
Minimization took 16 ms.
[2020-06-03 12:06:04] [INFO ] [Real]Absence check using 33 positive place invariants in 32 ms returned sat
[2020-06-03 12:06:04] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 29 ms returned sat
[2020-06-03 12:06:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:06:04] [INFO ] [Real]Absence check using state equation in 351 ms returned sat
[2020-06-03 12:06:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:06:05] [INFO ] [Nat]Absence check using 33 positive place invariants in 43 ms returned sat
[2020-06-03 12:06:05] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 103 ms returned sat
[2020-06-03 12:06:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:06:05] [INFO ] [Nat]Absence check using state equation in 394 ms returned sat
[2020-06-03 12:06:05] [INFO ] [Nat]Added 2 Read/Feed constraints in 72 ms returned sat
[2020-06-03 12:06:05] [INFO ] Deduced a trap composed of 22 places in 30 ms
[2020-06-03 12:06:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2020-06-03 12:06:05] [INFO ] Computed and/alt/rep : 178/594/178 causal constraints in 19 ms.
[2020-06-03 12:06:06] [INFO ] Added : 112 causal constraints over 23 iterations in 1000 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 15 ms.
[2020-06-03 12:06:06] [INFO ] [Real]Absence check using 33 positive place invariants in 29 ms returned sat
[2020-06-03 12:06:06] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 39 ms returned sat
[2020-06-03 12:06:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:06:07] [INFO ] [Real]Absence check using state equation in 727 ms returned sat
[2020-06-03 12:06:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:06:07] [INFO ] [Nat]Absence check using 33 positive place invariants in 34 ms returned sat
[2020-06-03 12:06:07] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 70 ms returned sat
[2020-06-03 12:06:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:06:08] [INFO ] [Nat]Absence check using state equation in 545 ms returned sat
[2020-06-03 12:06:08] [INFO ] [Nat]Added 2 Read/Feed constraints in 10 ms returned sat
[2020-06-03 12:06:08] [INFO ] Deduced a trap composed of 22 places in 39 ms
[2020-06-03 12:06:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2020-06-03 12:06:08] [INFO ] Computed and/alt/rep : 178/594/178 causal constraints in 20 ms.
[2020-06-03 12:06:09] [INFO ] Added : 173 causal constraints over 35 iterations in 1435 ms. Result :sat
[2020-06-03 12:06:09] [INFO ] Deduced a trap composed of 20 places in 56 ms
[2020-06-03 12:06:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
Attempting to minimize the solution found.
Minimization took 48 ms.
Incomplete Parikh walk after 169400 steps, including 3465 resets, run finished after 687 ms. (steps per millisecond=246 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 32800 steps, including 592 resets, run finished after 137 ms. (steps per millisecond=239 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 111100 steps, including 2351 resets, run finished after 460 ms. (steps per millisecond=241 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 129600 steps, including 2889 resets, run finished after 536 ms. (steps per millisecond=241 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 127300 steps, including 2847 resets, run finished after 525 ms. (steps per millisecond=242 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 52700 steps, including 1005 resets, run finished after 221 ms. (steps per millisecond=238 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 105500 steps, including 1996 resets, run finished after 492 ms. (steps per millisecond=214 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 47 out of 234 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 234/234 places, 179/179 transitions.
Applied a total of 0 rules in 15 ms. Remains 234 /234 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 234/234 places, 179/179 transitions.
Starting structural reductions, iteration 0 : 234/234 places, 179/179 transitions.
Applied a total of 0 rules in 13 ms. Remains 234 /234 variables (removed 0) and now considering 179/179 (removed 0) transitions.
// Phase 1: matrix 179 rows 234 cols
[2020-06-03 12:06:13] [INFO ] Computed 60 place invariants in 7 ms
[2020-06-03 12:06:14] [INFO ] Implicit Places using invariants in 1404 ms returned []
// Phase 1: matrix 179 rows 234 cols
[2020-06-03 12:06:14] [INFO ] Computed 60 place invariants in 10 ms
[2020-06-03 12:06:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2020-06-03 12:06:16] [INFO ] Implicit Places using invariants and state equation in 1465 ms returned []
Implicit Place search using SMT with State Equation took 2877 ms to find 0 implicit places.
[2020-06-03 12:06:16] [INFO ] Redundant transitions in 24 ms returned []
// Phase 1: matrix 179 rows 234 cols
[2020-06-03 12:06:16] [INFO ] Computed 60 place invariants in 8 ms
[2020-06-03 12:06:16] [INFO ] Dead Transitions using invariants and state equation in 726 ms returned []
Finished structural reductions, in 1 iterations. Remains : 234/234 places, 179/179 transitions.
Incomplete random walk after 100000 steps, including 1752 resets, run finished after 386 ms. (steps per millisecond=259 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 179 rows 234 cols
[2020-06-03 12:06:17] [INFO ] Computed 60 place invariants in 4 ms
[2020-06-03 12:06:17] [INFO ] [Real]Absence check using 33 positive place invariants in 29 ms returned sat
[2020-06-03 12:06:17] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 36 ms returned sat
[2020-06-03 12:06:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:06:17] [INFO ] [Real]Absence check using state equation in 483 ms returned sat
[2020-06-03 12:06:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:06:18] [INFO ] [Nat]Absence check using 33 positive place invariants in 44 ms returned sat
[2020-06-03 12:06:18] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 137 ms returned sat
[2020-06-03 12:06:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:06:18] [INFO ] [Nat]Absence check using state equation in 512 ms returned sat
[2020-06-03 12:06:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2020-06-03 12:06:18] [INFO ] [Nat]Added 2 Read/Feed constraints in 17 ms returned sat
[2020-06-03 12:06:18] [INFO ] Deduced a trap composed of 26 places in 128 ms
[2020-06-03 12:06:19] [INFO ] Deduced a trap composed of 22 places in 272 ms
[2020-06-03 12:06:19] [INFO ] Deduced a trap composed of 26 places in 140 ms
[2020-06-03 12:06:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 816 ms
[2020-06-03 12:06:19] [INFO ] Computed and/alt/rep : 178/594/178 causal constraints in 15 ms.
[2020-06-03 12:06:21] [INFO ] Added : 156 causal constraints over 32 iterations in 1492 ms. Result :sat
[2020-06-03 12:06:21] [INFO ] [Real]Absence check using 33 positive place invariants in 42 ms returned sat
[2020-06-03 12:06:21] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 46 ms returned sat
[2020-06-03 12:06:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:06:22] [INFO ] [Real]Absence check using state equation in 945 ms returned sat
[2020-06-03 12:06:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:06:22] [INFO ] [Nat]Absence check using 33 positive place invariants in 48 ms returned sat
[2020-06-03 12:06:22] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 236 ms returned sat
[2020-06-03 12:06:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:06:23] [INFO ] [Nat]Absence check using state equation in 728 ms returned sat
[2020-06-03 12:06:23] [INFO ] [Nat]Added 2 Read/Feed constraints in 27 ms returned sat
[2020-06-03 12:06:23] [INFO ] Deduced a trap composed of 20 places in 118 ms
[2020-06-03 12:06:23] [INFO ] Deduced a trap composed of 22 places in 48 ms
[2020-06-03 12:06:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 345 ms
[2020-06-03 12:06:23] [INFO ] Computed and/alt/rep : 178/594/178 causal constraints in 23 ms.
[2020-06-03 12:06:24] [INFO ] Added : 120 causal constraints over 25 iterations in 1359 ms. Result :sat
[2020-06-03 12:06:25] [INFO ] [Real]Absence check using 33 positive place invariants in 43 ms returned sat
[2020-06-03 12:06:25] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 45 ms returned sat
[2020-06-03 12:06:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:06:25] [INFO ] [Real]Absence check using state equation in 495 ms returned sat
[2020-06-03 12:06:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:06:25] [INFO ] [Nat]Absence check using 33 positive place invariants in 45 ms returned sat
[2020-06-03 12:06:25] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 180 ms returned sat
[2020-06-03 12:06:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:06:26] [INFO ] [Nat]Absence check using state equation in 692 ms returned sat
[2020-06-03 12:06:26] [INFO ] [Nat]Added 2 Read/Feed constraints in 16 ms returned sat
[2020-06-03 12:06:26] [INFO ] Deduced a trap composed of 22 places in 25 ms
[2020-06-03 12:06:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2020-06-03 12:06:26] [INFO ] Computed and/alt/rep : 178/594/178 causal constraints in 28 ms.
[2020-06-03 12:06:28] [INFO ] Added : 154 causal constraints over 31 iterations in 1284 ms. Result :sat
[2020-06-03 12:06:28] [INFO ] Deduced a trap composed of 20 places in 115 ms
[2020-06-03 12:06:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2020-06-03 12:06:28] [INFO ] [Real]Absence check using 33 positive place invariants in 28 ms returned sat
[2020-06-03 12:06:28] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 26 ms returned sat
[2020-06-03 12:06:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:06:28] [INFO ] [Real]Absence check using state equation in 343 ms returned sat
[2020-06-03 12:06:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:06:29] [INFO ] [Nat]Absence check using 33 positive place invariants in 51 ms returned sat
[2020-06-03 12:06:29] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 176 ms returned sat
[2020-06-03 12:06:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:06:29] [INFO ] [Nat]Absence check using state equation in 616 ms returned sat
[2020-06-03 12:06:29] [INFO ] [Nat]Added 2 Read/Feed constraints in 9 ms returned sat
[2020-06-03 12:06:29] [INFO ] Deduced a trap composed of 22 places in 50 ms
[2020-06-03 12:06:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2020-06-03 12:06:29] [INFO ] Computed and/alt/rep : 178/594/178 causal constraints in 20 ms.
[2020-06-03 12:06:31] [INFO ] Added : 157 causal constraints over 32 iterations in 1360 ms. Result :sat
[2020-06-03 12:06:31] [INFO ] Deduced a trap composed of 21 places in 96 ms
[2020-06-03 12:06:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2020-06-03 12:06:31] [INFO ] [Real]Absence check using 33 positive place invariants in 56 ms returned sat
[2020-06-03 12:06:31] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 54 ms returned sat
[2020-06-03 12:06:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:06:32] [INFO ] [Real]Absence check using state equation in 396 ms returned sat
[2020-06-03 12:06:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:06:32] [INFO ] [Nat]Absence check using 33 positive place invariants in 49 ms returned sat
[2020-06-03 12:06:32] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 84 ms returned sat
[2020-06-03 12:06:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:06:33] [INFO ] [Nat]Absence check using state equation in 568 ms returned sat
[2020-06-03 12:06:33] [INFO ] [Nat]Added 2 Read/Feed constraints in 71 ms returned sat
[2020-06-03 12:06:33] [INFO ] Deduced a trap composed of 22 places in 132 ms
[2020-06-03 12:06:33] [INFO ] Deduced a trap composed of 14 places in 97 ms
[2020-06-03 12:06:33] [INFO ] Deduced a trap composed of 16 places in 83 ms
[2020-06-03 12:06:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 418 ms
[2020-06-03 12:06:33] [INFO ] Computed and/alt/rep : 178/594/178 causal constraints in 18 ms.
[2020-06-03 12:06:34] [INFO ] Added : 155 causal constraints over 31 iterations in 1363 ms. Result :sat
[2020-06-03 12:06:34] [INFO ] Deduced a trap composed of 20 places in 84 ms
[2020-06-03 12:06:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 221 ms
[2020-06-03 12:06:35] [INFO ] [Real]Absence check using 33 positive place invariants in 37 ms returned sat
[2020-06-03 12:06:35] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 31 ms returned sat
[2020-06-03 12:06:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:06:35] [INFO ] [Real]Absence check using state equation in 365 ms returned sat
[2020-06-03 12:06:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:06:35] [INFO ] [Nat]Absence check using 33 positive place invariants in 42 ms returned sat
[2020-06-03 12:06:35] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 105 ms returned sat
[2020-06-03 12:06:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:06:36] [INFO ] [Nat]Absence check using state equation in 398 ms returned sat
[2020-06-03 12:06:36] [INFO ] [Nat]Added 2 Read/Feed constraints in 71 ms returned sat
[2020-06-03 12:06:36] [INFO ] Deduced a trap composed of 22 places in 27 ms
[2020-06-03 12:06:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2020-06-03 12:06:36] [INFO ] Computed and/alt/rep : 178/594/178 causal constraints in 18 ms.
[2020-06-03 12:06:37] [INFO ] Added : 112 causal constraints over 23 iterations in 919 ms. Result :sat
[2020-06-03 12:06:37] [INFO ] [Real]Absence check using 33 positive place invariants in 35 ms returned sat
[2020-06-03 12:06:37] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 54 ms returned sat
[2020-06-03 12:06:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:06:38] [INFO ] [Real]Absence check using state equation in 726 ms returned sat
[2020-06-03 12:06:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:06:38] [INFO ] [Nat]Absence check using 33 positive place invariants in 38 ms returned sat
[2020-06-03 12:06:38] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 88 ms returned sat
[2020-06-03 12:06:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:06:39] [INFO ] [Nat]Absence check using state equation in 635 ms returned sat
[2020-06-03 12:06:39] [INFO ] [Nat]Added 2 Read/Feed constraints in 13 ms returned sat
[2020-06-03 12:06:39] [INFO ] Deduced a trap composed of 22 places in 44 ms
[2020-06-03 12:06:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2020-06-03 12:06:39] [INFO ] Computed and/alt/rep : 178/594/178 causal constraints in 35 ms.
[2020-06-03 12:06:40] [INFO ] Added : 173 causal constraints over 35 iterations in 1300 ms. Result :sat
[2020-06-03 12:06:40] [INFO ] Deduced a trap composed of 20 places in 52 ms
[2020-06-03 12:06:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 234 transition count 179
Applied a total of 1 rules in 25 ms. Remains 234 /234 variables (removed 0) and now considering 179/179 (removed 0) transitions.
// Phase 1: matrix 179 rows 234 cols
[2020-06-03 12:06:40] [INFO ] Computed 60 place invariants in 7 ms
[2020-06-03 12:06:40] [INFO ] [Real]Absence check using 33 positive place invariants in 30 ms returned sat
[2020-06-03 12:06:40] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 37 ms returned sat
[2020-06-03 12:06:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:06:41] [INFO ] [Real]Absence check using state equation in 492 ms returned sat
[2020-06-03 12:06:41] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:06:41] [INFO ] [Nat]Absence check using 33 positive place invariants in 34 ms returned sat
[2020-06-03 12:06:41] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 130 ms returned sat
[2020-06-03 12:06:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:06:42] [INFO ] [Nat]Absence check using state equation in 762 ms returned sat
[2020-06-03 12:06:42] [INFO ] Computed and/alt/rep : 178/593/178 causal constraints in 22 ms.
[2020-06-03 12:06:43] [INFO ] Added : 156 causal constraints over 32 iterations in 1274 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 16 ms.
[2020-06-03 12:06:43] [INFO ] [Real]Absence check using 33 positive place invariants in 39 ms returned sat
[2020-06-03 12:06:43] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 38 ms returned sat
[2020-06-03 12:06:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:06:44] [INFO ] [Real]Absence check using state equation in 650 ms returned sat
[2020-06-03 12:06:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:06:44] [INFO ] [Nat]Absence check using 33 positive place invariants in 33 ms returned sat
[2020-06-03 12:06:44] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 259 ms returned sat
[2020-06-03 12:06:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:06:45] [INFO ] [Nat]Absence check using state equation in 783 ms returned sat
[2020-06-03 12:06:45] [INFO ] Deduced a trap composed of 8 places in 139 ms
[2020-06-03 12:06:45] [INFO ] Deduced a trap composed of 15 places in 82 ms
[2020-06-03 12:06:45] [INFO ] Deduced a trap composed of 18 places in 86 ms
[2020-06-03 12:06:46] [INFO ] Deduced a trap composed of 19 places in 58 ms
[2020-06-03 12:06:46] [INFO ] Deduced a trap composed of 14 places in 68 ms
[2020-06-03 12:06:46] [INFO ] Deduced a trap composed of 16 places in 76 ms
[2020-06-03 12:06:46] [INFO ] Deduced a trap composed of 18 places in 57 ms
[2020-06-03 12:06:46] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 761 ms
[2020-06-03 12:06:46] [INFO ] Computed and/alt/rep : 178/593/178 causal constraints in 15 ms.
[2020-06-03 12:06:48] [INFO ] Added : 142 causal constraints over 29 iterations in 1744 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 19 ms.
[2020-06-03 12:06:48] [INFO ] [Real]Absence check using 33 positive place invariants in 28 ms returned sat
[2020-06-03 12:06:48] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 33 ms returned sat
[2020-06-03 12:06:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:06:48] [INFO ] [Real]Absence check using state equation in 444 ms returned sat
[2020-06-03 12:06:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:06:48] [INFO ] [Nat]Absence check using 33 positive place invariants in 45 ms returned sat
[2020-06-03 12:06:49] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 176 ms returned sat
[2020-06-03 12:06:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:06:49] [INFO ] [Nat]Absence check using state equation in 651 ms returned sat
[2020-06-03 12:06:49] [INFO ] Computed and/alt/rep : 178/593/178 causal constraints in 40 ms.
[2020-06-03 12:06:51] [INFO ] Added : 152 causal constraints over 31 iterations in 1788 ms. Result :sat
[2020-06-03 12:06:51] [INFO ] Deduced a trap composed of 20 places in 108 ms
[2020-06-03 12:06:51] [INFO ] Deduced a trap composed of 26 places in 141 ms
[2020-06-03 12:06:51] [INFO ] Deduced a trap composed of 26 places in 78 ms
[2020-06-03 12:06:52] [INFO ] Deduced a trap composed of 28 places in 262 ms
[2020-06-03 12:06:52] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 852 ms
Attempting to minimize the solution found.
Minimization took 17 ms.
[2020-06-03 12:06:52] [INFO ] [Real]Absence check using 33 positive place invariants in 33 ms returned sat
[2020-06-03 12:06:52] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 29 ms returned sat
[2020-06-03 12:06:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:06:52] [INFO ] [Real]Absence check using state equation in 338 ms returned sat
[2020-06-03 12:06:52] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:06:52] [INFO ] [Nat]Absence check using 33 positive place invariants in 43 ms returned sat
[2020-06-03 12:06:53] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 99 ms returned sat
[2020-06-03 12:06:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:06:53] [INFO ] [Nat]Absence check using state equation in 682 ms returned sat
[2020-06-03 12:06:53] [INFO ] Computed and/alt/rep : 178/593/178 causal constraints in 26 ms.
[2020-06-03 12:06:55] [INFO ] Added : 157 causal constraints over 32 iterations in 1455 ms. Result :sat
[2020-06-03 12:06:55] [INFO ] Deduced a trap composed of 26 places in 144 ms
[2020-06-03 12:06:55] [INFO ] Deduced a trap composed of 27 places in 110 ms
[2020-06-03 12:06:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 374 ms
Attempting to minimize the solution found.
Minimization took 18 ms.
[2020-06-03 12:06:55] [INFO ] [Real]Absence check using 33 positive place invariants in 32 ms returned sat
[2020-06-03 12:06:55] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 37 ms returned sat
[2020-06-03 12:06:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:06:56] [INFO ] [Real]Absence check using state equation in 364 ms returned sat
[2020-06-03 12:06:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:06:56] [INFO ] [Nat]Absence check using 33 positive place invariants in 47 ms returned sat
[2020-06-03 12:06:56] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 87 ms returned sat
[2020-06-03 12:06:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:06:56] [INFO ] [Nat]Absence check using state equation in 531 ms returned sat
[2020-06-03 12:06:56] [INFO ] Computed and/alt/rep : 178/593/178 causal constraints in 49 ms.
[2020-06-03 12:06:58] [INFO ] Added : 155 causal constraints over 31 iterations in 1548 ms. Result :sat
[2020-06-03 12:06:58] [INFO ] Deduced a trap composed of 16 places in 105 ms
[2020-06-03 12:06:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
Attempting to minimize the solution found.
Minimization took 16 ms.
[2020-06-03 12:06:58] [INFO ] [Real]Absence check using 33 positive place invariants in 39 ms returned sat
[2020-06-03 12:06:58] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 32 ms returned sat
[2020-06-03 12:06:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:06:59] [INFO ] [Real]Absence check using state equation in 393 ms returned sat
[2020-06-03 12:06:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:06:59] [INFO ] [Nat]Absence check using 33 positive place invariants in 47 ms returned sat
[2020-06-03 12:06:59] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 103 ms returned sat
[2020-06-03 12:06:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:06:59] [INFO ] [Nat]Absence check using state equation in 392 ms returned sat
[2020-06-03 12:06:59] [INFO ] Computed and/alt/rep : 178/593/178 causal constraints in 22 ms.
[2020-06-03 12:07:01] [INFO ] Added : 115 causal constraints over 23 iterations in 1324 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 15 ms.
[2020-06-03 12:07:01] [INFO ] [Real]Absence check using 33 positive place invariants in 41 ms returned sat
[2020-06-03 12:07:01] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 49 ms returned sat
[2020-06-03 12:07:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:07:02] [INFO ] [Real]Absence check using state equation in 536 ms returned sat
[2020-06-03 12:07:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:07:02] [INFO ] [Nat]Absence check using 33 positive place invariants in 48 ms returned sat
[2020-06-03 12:07:02] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 83 ms returned sat
[2020-06-03 12:07:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:07:02] [INFO ] [Nat]Absence check using state equation in 625 ms returned sat
[2020-06-03 12:07:02] [INFO ] Computed and/alt/rep : 178/593/178 causal constraints in 24 ms.
[2020-06-03 12:07:04] [INFO ] Added : 171 causal constraints over 35 iterations in 1696 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 14 ms.
[2020-06-03 12:07:04] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 8 ms.
[2020-06-03 12:07:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 7 ms.
[2020-06-03 12:07:05] [INFO ] Flatten gal took : 110 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ DES-PT-20b @ 3570 seconds

FORMULA DES-PT-20b-ReachabilityFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-20b-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

FORMULA DES-PT-20b-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

{
"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 12:07:05 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"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 <= p70) AND (1 <= p89))))",
"processed_size": 35,
"rewrites": 1
},
"result":
{
"edges": 22007,
"markings": 16381,
"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": 1,
"adisj": 0,
"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 <= p95) AND (1 <= p209) AND (1 <= p19) AND (1 <= p134) AND (1 <= p126))))",
"processed_size": 83,
"rewrites": 1
},
"result":
{
"edges": 1111403,
"markings": 500978,
"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": 5
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 711
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"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": 6,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p71) AND (1 <= p89) AND (1 <= p88) AND ((p125 <= 0)) AND ((p3 <= 0) OR (p134 <= 0)))))",
"processed_size": 100,
"rewrites": 1
},
"result":
{
"edges": 20710,
"markings": 15443,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 10,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 889
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 2,
"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": 8,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p217) AND (1 <= p226) AND (((1 <= p36) AND (1 <= p228)) OR ((1 <= p119) AND (1 <= p124))) AND ((p92 <= 0) OR ((1 <= p100) AND (1 <= p119) AND (1 <= p124))))))",
"processed_size": 173,
"rewrites": 1
},
"result":
{
"edges": 83,
"markings": 84,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 24,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1186
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 2,
"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": 9,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p102) AND ((p101 <= 0) OR ((1 <= p184)) OR ((1 <= p5) AND (1 <= p134))) AND (((1 <= p9) AND (1 <= p134)) OR ((1 <= p94) AND (1 <= p96) AND (1 <= p173))))))",
"processed_size": 171,
"rewrites": 1
},
"result":
{
"edges": 180169844,
"markings": 68284387,
"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": 29,
"problems": 6
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1444
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p63) AND (1 <= p89) AND ((p183 <= 0) OR (p87 <= 0) OR (p121 <= 0) OR ((1 <= p142) AND (1 <= p212) AND (1 <= p105) AND (1 <= p110))))))",
"processed_size": 150,
"rewrites": 1
},
"result":
{
"edges": 38985159,
"markings": 22522804,
"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": 15,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2738
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 14,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "A (G (((p154 <= 0) OR (p171 <= 0) OR ((1 <= p92)) OR (p27 <= 0) OR (p228 <= 0) OR (p141 <= 0) OR ((1 <= p147) AND (1 <= p120) AND (1 <= p122)) OR ((1 <= p186) AND (1 <= p113) AND (1 <= p81) AND (1 <= p231) AND (1 <= p233)))))",
"processed_size": 232,
"rewrites": 2
},
"result":
{
"edges": 34525180,
"markings": 21860597,
"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": 120,
"problems": 15
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 38288,
"runtime": 961.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**))"
},
"net":
{
"arcs": 749,
"conflict_clusters": 80,
"places": 234,
"places_significant": 174,
"singleton_clusters": 0,
"transitions": 179
},
"result":
{
"preliminary_value": "no yes yes yes yes yes yes ",
"value": "no yes yes yes yes yes 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: 413/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 234
lola: finding significant places
lola: 234 places, 179 transitions, 174 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: (p154 <= 1)
lola: LP says that atomic proposition is always true: (p171 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p228 <= 1)
lola: LP says that atomic proposition is always true: (p141 <= 1)
lola: LP says that atomic proposition is always true: (p147 <= 1)
lola: LP says that atomic proposition is always true: (p120 <= 1)
lola: LP says that atomic proposition is always true: (p122 <= 1)
lola: LP says that atomic proposition is always true: (p186 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p81 <= 1)
lola: LP says that atomic proposition is always true: (p231 <= 1)
lola: LP says that atomic proposition is always true: (p233 <= 1)
lola: LP says that atomic proposition is always true: (p217 <= 1)
lola: LP says that atomic proposition is always true: (p226 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p228 <= 1)
lola: LP says that atomic proposition is always true: (p119 <= 1)
lola: LP says that atomic proposition is always true: (p124 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p119 <= 1)
lola: LP says that atomic proposition is always true: (p124 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p125 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p134 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p101 <= 1)
lola: LP says that atomic proposition is always true: (p184 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p134 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p134 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p173 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p209 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p134 <= 1)
lola: LP says that atomic proposition is always true: (p126 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p183 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p121 <= 1)
lola: LP says that atomic proposition is always true: (p142 <= 1)
lola: LP says that atomic proposition is always true: (p212 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: A (G (((p154 <= 0) OR (p171 <= 0) OR ((1 <= p92)) OR (p27 <= 0) OR (p228 <= 0) OR (p141 <= 0) OR ((1 <= p147) AND (1 <= p120) AND (1 <= p122)) OR ((1 <= p186) AND (1 <= p113) AND (1 <= p81) AND (1 <= p231) AND (1 <= p233))))) : E (F (((1 <= p217) AND (1 <= p226) AND (((1 <= p36) AND (1 <= p228)) OR ((1 <= p119) AND (1 <= p124))) AND ((p92 <= 0) OR ((1 <= p100) AND (1 <= p119) AND (1 <= p124)))))) : E (F (((1 <= p71) AND (1 <= p89) AND (1 <= p88) AND ((p125 <= 0)) AND ((p3 <= 0) OR (p134 <= 0))))) : E (F (((1 <= p70) AND (1 <= p89)))) : E (F (((1 <= p102) AND ((p101 <= 0) OR ((1 <= p184)) OR ((1 <= p5) AND (1 <= p134))) AND (((1 <= p9) AND (1 <= p134)) OR ((1 <= p94) AND (1 <= p96) AND (1 <= p173)))))) : E (F (((1 <= p95) AND (1 <= p209) AND (1 <= p19) AND (1 <= p134) AND (1 <= p126)))) : E (F (((1 <= p63) AND (1 <= p89) AND ((p183 <= 0) OR (p87 <= 0) OR (p121 <= 0) OR ((1 <= p142) AND (1 <= p212) AND (1 <= p105) AND (1 <= p110))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p70) AND (1 <= p89))))
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 <= p70) AND (1 <= p89))))
lola: processed formula length: 35
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 <= p70) AND (1 <= p89))
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: error: :370: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 16381 markings, 22007 edges
lola: ========================================
lola: subprocess 1 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p95) AND (1 <= p209) AND (1 <= p19) AND (1 <= p134) AND (1 <= p126))))
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 <= p95) AND (1 <= p209) AND (1 <= p19) AND (1 <= p134) AND (1 <= p126))))
lola: processed formula length: 83
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 <= p95) AND (1 <= p209) AND (1 <= p19) AND (1 <= p134) AND (1 <= p126))
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-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-0.sara.
sara: error: :370: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 500978 markings, 1111403 edges
lola: ========================================
lola: subprocess 2 will run for 711 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p71) AND (1 <= p89) AND (1 <= p88) AND ((p125 <= 0)) AND ((p3 <= 0) OR (p134 <= 0)))))
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 <= p71) AND (1 <= p89) AND (1 <= p88) AND ((p125 <= 0)) AND ((p3 <= 0) OR (p134 <= 0)))))
lola: processed formula length: 100
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 <= p71) AND (1 <= p89) AND (1 <= p88) AND ((p125 <= 0)) AND ((p3 <= 0) OR (p134 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-2-0.sara.
sara: error: :370: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 15443 markings, 20710 edges
lola: ========================================
lola: subprocess 3 will run for 889 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p217) AND (1 <= p226) AND (((1 <= p36) AND (1 <= p228)) OR ((1 <= p119) AND (1 <= p124))) AND ((p92 <= 0) OR ((1 <= p100) AND (1 <= p119) AND (1 <= p124))))))
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 <= p217) AND (1 <= p226) AND (((1 <= p36) AND (1 <= p228)) OR ((1 <= p119) AND (1 <= p124))) AND ((p92 <= 0) OR ((1 <= p100) AND (1 <= p119) AND (1 <= p124))))))
lola: processed formula length: 173
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 <= p217) AND (1 <= p226) AND (((1 <= p36) AND (1 <= p228)) OR ((1 <= p119) AND (1 <= p124))) AND ((p92 <= 0) OR ((1 <= p100) AND (1 <= p119) AND (1 <= p124))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 24 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 84 markings, 83 edges
lola: ========================================
lola: subprocess 4 will run for 1186 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p102) AND ((p101 <= 0) OR ((1 <= p184)) OR ((1 <= p5) AND (1 <= p134))) AND (((1 <= p9) AND (1 <= p134)) OR ((1 <= p94) AND (1 <= p96) AND (1 <= p173))))))
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 <= p102) AND ((p101 <= 0) OR ((1 <= p184)) OR ((1 <= p5) AND (1 <= p134))) AND (((1 <= p9) AND (1 <= p134)) OR ((1 <= p94) AND (1 <= p96) AND (1 <= p173))))))
lola: processed formula length: 171
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 <= p102) AND ((p101 <= 0) OR ((1 <= p184)) OR ((1 <= p5) AND (1 <= p134))) AND (((1 <= p9) AND (1 <= p134)) OR ((1 <= p94) AND (1 <= p96) AND (1 <= p173))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 29 literals and 6 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: error: :370: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: sara is running 0 secs || 564312 markings, 1500929 edges, 112862 markings/sec, 0 secs
lola: sara is running 5 secs || 1127237 markings, 3003582 edges, 112585 markings/sec, 5 secs
lola: sara is running 10 secs || 1692285 markings, 4486786 edges, 113010 markings/sec, 10 secs
lola: sara is running 15 secs || 2234710 markings, 5959192 edges, 108485 markings/sec, 15 secs
lola: sara is running 20 secs || 2790261 markings, 7408969 edges, 111110 markings/sec, 20 secs
lola: sara is running 25 secs || 3335018 markings, 8899458 edges, 108951 markings/sec, 25 secs
lola: sara is running 30 secs || 3881748 markings, 10353038 edges, 109346 markings/sec, 30 secs
lola: sara is running 35 secs || 4399995 markings, 11751552 edges, 103649 markings/sec, 35 secs
lola: sara is running 40 secs || 4928045 markings, 13124519 edges, 105610 markings/sec, 40 secs
lola: sara is running 45 secs || 5449379 markings, 14506857 edges, 104267 markings/sec, 45 secs
lola: sara is running 50 secs || 5974084 markings, 15952946 edges, 104941 markings/sec, 50 secs
lola: sara is running 55 secs || 6517492 markings, 17326571 edges, 108682 markings/sec, 55 secs
lola: sara is running 60 secs || 7048104 markings, 18740604 edges, 106122 markings/sec, 60 secs
lola: sara is running 65 secs || 7578251 markings, 20161889 edges, 106029 markings/sec, 65 secs
lola: sara is running 70 secs || 8101467 markings, 21512370 edges, 104643 markings/sec, 70 secs
lola: sara is running 75 secs || 8601753 markings, 22846727 edges, 100057 markings/sec, 75 secs
lola: sara is running 80 secs || 9104951 markings, 24223349 edges, 100640 markings/sec, 80 secs
lola: sara is running 85 secs || 9626308 markings, 25576770 edges, 104271 markings/sec, 85 secs
lola: sara is running 90 secs || 10146965 markings, 26923991 edges, 104131 markings/sec, 90 secs
lola: sara is running 95 secs || 10622601 markings, 28316056 edges, 95127 markings/sec, 95 secs
lola: sara is running 100 secs || 11195422 markings, 29725303 edges, 114564 markings/sec, 100 secs
lola: sara is running 105 secs || 11663186 markings, 31187301 edges, 93553 markings/sec, 105 secs
lola: sara is running 110 secs || 12181913 markings, 32581603 edges, 103745 markings/sec, 110 secs
lola: sara is running 115 secs || 12708810 markings, 33970885 edges, 105379 markings/sec, 115 secs
lola: sara is running 120 secs || 13218223 markings, 35321136 edges, 101883 markings/sec, 120 secs
lola: sara is running 125 secs || 13740067 markings, 36666746 edges, 104369 markings/sec, 125 secs
lola: sara is running 130 secs || 14252453 markings, 38016798 edges, 102477 markings/sec, 130 secs
lola: sara is running 135 secs || 14743559 markings, 39414924 edges, 98221 markings/sec, 135 secs
lola: sara is running 140 secs || 15283770 markings, 40785770 edges, 108042 markings/sec, 140 secs
lola: sara is running 145 secs || 15783468 markings, 42109333 edges, 99940 markings/sec, 145 secs
lola: sara is running 150 secs || 16280078 markings, 43479853 edges, 99322 markings/sec, 150 secs
lola: sara is running 155 secs || 16830903 markings, 44868716 edges, 110165 markings/sec, 155 secs
lola: sara is running 160 secs || 17265030 markings, 46293881 edges, 86825 markings/sec, 160 secs
lola: sara is running 165 secs || 17816062 markings, 47653397 edges, 110206 markings/sec, 165 secs
lola: sara is running 170 secs || 18352281 markings, 49062359 edges, 107244 markings/sec, 170 secs
lola: sara is running 175 secs || 18928675 markings, 50447014 edges, 115279 markings/sec, 175 secs
lola: sara is running 180 secs || 19464942 markings, 51815611 edges, 107253 markings/sec, 180 secs
lola: sara is running 185 secs || 19956363 markings, 53161722 edges, 98284 markings/sec, 185 secs
lola: sara is running 190 secs || 20446788 markings, 54512220 edges, 98085 markings/sec, 190 secs
lola: sara is running 195 secs || 20974631 markings, 55865973 edges, 105569 markings/sec, 195 secs
lola: sara is running 200 secs || 21482432 markings, 57184861 edges, 101560 markings/sec, 200 secs
lola: sara is running 205 secs || 21987170 markings, 58511834 edges, 100948 markings/sec, 205 secs
lola: sara is running 210 secs || 22468881 markings, 59881459 edges, 96342 markings/sec, 210 secs
lola: sara is running 215 secs || 22990863 markings, 61211089 edges, 104396 markings/sec, 215 secs
lola: sara is running 220 secs || 23487550 markings, 62511820 edges, 99337 markings/sec, 220 secs
lola: sara is running 225 secs || 24022812 markings, 63822591 edges, 107052 markings/sec, 225 secs
lola: sara is running 230 secs || 24509208 markings, 65182509 edges, 97279 markings/sec, 230 secs
lola: sara is running 235 secs || 24927745 markings, 66555309 edges, 83707 markings/sec, 235 secs
lola: sara is running 240 secs || 25444060 markings, 67880284 edges, 103263 markings/sec, 240 secs
lola: sara is running 245 secs || 25970889 markings, 69233893 edges, 105366 markings/sec, 245 secs
lola: sara is running 250 secs || 26531898 markings, 70588511 edges, 112202 markings/sec, 250 secs
lola: sara is running 255 secs || 27055798 markings, 71945328 edges, 104780 markings/sec, 255 secs
lola: sara is running 260 secs || 27535634 markings, 73301178 edges, 95967 markings/sec, 260 secs
lola: sara is running 265 secs || 28024666 markings, 74659372 edges, 97806 markings/sec, 265 secs
lola: sara is running 270 secs || 28593027 markings, 76038831 edges, 113672 markings/sec, 270 secs
lola: sara is running 275 secs || 29079852 markings, 77386595 edges, 97365 markings/sec, 275 secs
lola: sara is running 280 secs || 29555674 markings, 78761086 edges, 95164 markings/sec, 280 secs
lola: sara is running 285 secs || 30040462 markings, 80153334 edges, 96958 markings/sec, 285 secs
lola: sara is running 290 secs || 30552908 markings, 81512925 edges, 102489 markings/sec, 290 secs
lola: sara is running 295 secs || 31069450 markings, 82823491 edges, 103308 markings/sec, 295 secs
lola: sara is running 300 secs || 31618448 markings, 84205721 edges, 109800 markings/sec, 300 secs
lola: sara is running 305 secs || 32114433 markings, 85535807 edges, 99197 markings/sec, 305 secs
lola: sara is running 310 secs || 32619719 markings, 86828895 edges, 101057 markings/sec, 310 secs
lola: sara is running 315 secs || 33121990 markings, 88122076 edges, 100454 markings/sec, 315 secs
lola: sara is running 320 secs || 33588211 markings, 89458440 edges, 93244 markings/sec, 320 secs
lola: sara is running 325 secs || 34095175 markings, 90778755 edges, 101393 markings/sec, 325 secs
lola: sara is running 330 secs || 34597147 markings, 92083310 edges, 100394 markings/sec, 330 secs
lola: sara is running 335 secs || 35097385 markings, 93386784 edges, 100048 markings/sec, 335 secs
lola: sara is running 340 secs || 35625063 markings, 94713386 edges, 105536 markings/sec, 340 secs
lola: sara is running 345 secs || 36035881 markings, 96056813 edges, 82164 markings/sec, 345 secs
lola: sara is running 350 secs || 36529670 markings, 97403713 edges, 98758 markings/sec, 350 secs
lola: sara is running 355 secs || 37035854 markings, 98718425 edges, 101237 markings/sec, 355 secs
lola: sara is running 360 secs || 37586861 markings, 100063812 edges, 110201 markings/sec, 360 secs
lola: sara is running 365 secs || 38096607 markings, 101399858 edges, 101949 markings/sec, 365 secs
lola: sara is running 370 secs || 38611176 markings, 102726466 edges, 102914 markings/sec, 370 secs
lola: sara is running 375 secs || 39109878 markings, 104058280 edges, 99740 markings/sec, 375 secs
lola: sara is running 380 secs || 39655458 markings, 105399300 edges, 109116 markings/sec, 380 secs
lola: sara is running 385 secs || 40131620 markings, 106720430 edges, 95232 markings/sec, 385 secs
lola: sara is running 390 secs || 40611677 markings, 108083985 edges, 96011 markings/sec, 390 secs
lola: sara is running 395 secs || 41069441 markings, 109429524 edges, 91553 markings/sec, 395 secs
lola: sara is running 400 secs || 41573864 markings, 110819862 edges, 100885 markings/sec, 400 secs
lola: sara is running 405 secs || 42156329 markings, 112178167 edges, 116493 markings/sec, 405 secs
lola: sara is running 410 secs || 42698779 markings, 113547234 edges, 108490 markings/sec, 410 secs
lola: sara is running 415 secs || 43261973 markings, 114903473 edges, 112639 markings/sec, 415 secs
lola: sara is running 420 secs || 43735192 markings, 116218415 edges, 94644 markings/sec, 420 secs
lola: sara is running 425 secs || 44217734 markings, 117528282 edges, 96508 markings/sec, 425 secs
lola: sara is running 430 secs || 44742723 markings, 118870051 edges, 104998 markings/sec, 430 secs
lola: sara is running 435 secs || 45242104 markings, 120171341 edges, 99876 markings/sec, 435 secs
lola: sara is running 440 secs || 45731957 markings, 121458126 edges, 97971 markings/sec, 440 secs
lola: sara is running 445 secs || 46227788 markings, 122741204 edges, 99166 markings/sec, 445 secs
lola: sara is running 450 secs || 46707784 markings, 124023530 edges, 95999 markings/sec, 450 secs
lola: sara is running 455 secs || 47171481 markings, 125327280 edges, 92739 markings/sec, 455 secs
lola: sara is running 460 secs || 47664764 markings, 126613513 edges, 98657 markings/sec, 460 secs
lola: sara is running 465 secs || 48156442 markings, 127913500 edges, 98336 markings/sec, 465 secs
lola: sara is running 470 secs || 48653069 markings, 129221182 edges, 99325 markings/sec, 470 secs
lola: sara is running 475 secs || 49137774 markings, 130528656 edges, 96941 markings/sec, 475 secs
lola: sara is running 480 secs || 49659340 markings, 131831128 edges, 104313 markings/sec, 480 secs
lola: sara is running 485 secs || 50118122 markings, 133129572 edges, 91756 markings/sec, 485 secs
lola: sara is running 490 secs || 50614900 markings, 134440506 edges, 99356 markings/sec, 490 secs
lola: sara is running 495 secs || 51050812 markings, 135769408 edges, 87182 markings/sec, 495 secs
lola: sara is running 500 secs || 51593570 markings, 137101545 edges, 108552 markings/sec, 500 secs
lola: sara is running 505 secs || 52117946 markings, 138424635 edges, 104875 markings/sec, 505 secs
lola: sara is running 510 secs || 52633275 markings, 139726248 edges, 103066 markings/sec, 510 secs
lola: sara is running 515 secs || 53146067 markings, 141033541 edges, 102558 markings/sec, 515 secs
lola: sara is running 520 secs || 53662968 markings, 142375557 edges, 103380 markings/sec, 520 secs
lola: sara is running 525 secs || 54177126 markings, 143681396 edges, 102832 markings/sec, 525 secs
lola: sara is running 530 secs || 54709457 markings, 144993770 edges, 106466 markings/sec, 530 secs
lola: sara is running 535 secs || 55182243 markings, 146294915 edges, 94557 markings/sec, 535 secs
lola: sara is running 540 secs || 55705172 markings, 147586890 edges, 104586 markings/sec, 540 secs
lola: sara is running 545 secs || 56154364 markings, 148933684 edges, 89838 markings/sec, 545 secs
lola: sara is running 550 secs || 56691205 markings, 150241922 edges, 107368 markings/sec, 550 secs
lola: sara is running 555 secs || 57278845 markings, 151548962 edges, 117528 markings/sec, 555 secs
lola: sara is running 560 secs || 57774489 markings, 152870959 edges, 99129 markings/sec, 560 secs
lola: sara is running 565 secs || 58271663 markings, 154158551 edges, 99435 markings/sec, 565 secs
lola: sara is running 570 secs || 58757155 markings, 155407992 edges, 97098 markings/sec, 570 secs
lola: sara is running 575 secs || 59230574 markings, 156662228 edges, 94684 markings/sec, 575 secs
lola: sara is running 580 secs || 59720476 markings, 157943677 edges, 97980 markings/sec, 580 secs
lola: sara is running 585 secs || 60168250 markings, 159244388 edges, 89555 markings/sec, 585 secs
lola: sara is running 590 secs || 60667310 markings, 160513997 edges, 99812 markings/sec, 590 secs
lola: sara is running 595 secs || 61143877 markings, 161801316 edges, 95313 markings/sec, 595 secs
lola: sara is running 600 secs || 61642681 markings, 163092180 edges, 99761 markings/sec, 600 secs
lola: sara is running 605 secs || 62117676 markings, 164378658 edges, 94999 markings/sec, 605 secs
lola: sara is running 610 secs || 62623317 markings, 165654738 edges, 101128 markings/sec, 610 secs
lola: sara is running 615 secs || 63074300 markings, 166927459 edges, 90197 markings/sec, 615 secs
lola: sara is running 620 secs || 63567263 markings, 168225977 edges, 98593 markings/sec, 620 secs
lola: sara is running 625 secs || 63996630 markings, 169536244 edges, 85873 markings/sec, 625 secs
lola: sara is running 630 secs || 64529382 markings, 170848862 edges, 106550 markings/sec, 630 secs
lola: sara is running 635 secs || 65054130 markings, 172158202 edges, 104950 markings/sec, 635 secs
lola: sara is running 640 secs || 65555126 markings, 173450044 edges, 100199 markings/sec, 640 secs
lola: sara is running 645 secs || 66049689 markings, 174750845 edges, 98913 markings/sec, 645 secs
lola: sara is running 650 secs || 66591610 markings, 176067068 edges, 108384 markings/sec, 650 secs
lola: sara is running 655 secs || 67123152 markings, 177366023 edges, 106308 markings/sec, 655 secs
lola: sara is running 660 secs || 67616308 markings, 178639882 edges, 98631 markings/sec, 660 secs
lola: sara is running 665 secs || 68191879 markings, 179952535 edges, 115114 markings/sec, 665 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 68284387 markings, 180169844 edges
lola: ========================================
lola: subprocess 5 will run for 1444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p63) AND (1 <= p89) AND ((p183 <= 0) OR (p87 <= 0) OR (p121 <= 0) OR ((1 <= p142) AND (1 <= p212) AND (1 <= p105) AND (1 <= p110))))))
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 <= p63) AND (1 <= p89) AND ((p183 <= 0) OR (p87 <= 0) OR (p121 <= 0) OR ((1 <= p142) AND (1 <= p212) AND (1 <= p105) AND (1 <= p110))))))
lola: processed formula length: 150
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 <= p63) AND (1 <= p89) AND ((p183 <= 0) OR (p87 <= 0) OR (p121 <= 0) OR ((1 <= p142) AND (1 <= p212) AND (1 <= p105) AND (1 <= p110))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 15 literals and 4 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: error: :370: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: sara is running 0 secs || 777356 markings, 1384617 edges, 155471 markings/sec, 0 secs
lola: sara is running 5 secs || 1555575 markings, 2762739 edges, 155644 markings/sec, 5 secs
lola: sara is running 10 secs || 2303547 markings, 4155268 edges, 149594 markings/sec, 10 secs
lola: sara is running 15 secs || 3117468 markings, 5511759 edges, 162784 markings/sec, 15 secs
lola: sara is running 20 secs || 3827726 markings, 6869342 edges, 142052 markings/sec, 20 secs
lola: sara is running 25 secs || 4560678 markings, 8229539 edges, 146590 markings/sec, 25 secs
lola: sara is running 30 secs || 5297906 markings, 9578340 edges, 147446 markings/sec, 30 secs
lola: sara is running 35 secs || 6088523 markings, 10896733 edges, 158123 markings/sec, 35 secs
lola: sara is running 40 secs || 6869997 markings, 12244653 edges, 156295 markings/sec, 40 secs
lola: sara is running 45 secs || 7493936 markings, 13592641 edges, 124788 markings/sec, 45 secs
lola: sara is running 50 secs || 8209245 markings, 14916146 edges, 143062 markings/sec, 50 secs
lola: sara is running 55 secs || 8931401 markings, 16231607 edges, 144431 markings/sec, 55 secs
lola: sara is running 60 secs || 9669841 markings, 17545312 edges, 147688 markings/sec, 60 secs
lola: sara is running 65 secs || 10485268 markings, 18840942 edges, 163085 markings/sec, 65 secs
lola: sara is running 70 secs || 11196083 markings, 20140574 edges, 142163 markings/sec, 70 secs
lola: sara is running 75 secs || 12023608 markings, 21425637 edges, 165505 markings/sec, 75 secs
lola: sara is running 80 secs || 12850418 markings, 22714396 edges, 165362 markings/sec, 80 secs
lola: sara is running 85 secs || 13569146 markings, 23959316 edges, 143746 markings/sec, 85 secs
lola: sara is running 90 secs || 14319547 markings, 25199613 edges, 150080 markings/sec, 90 secs
lola: sara is running 95 secs || 15137480 markings, 26445965 edges, 163587 markings/sec, 95 secs
lola: sara is running 100 secs || 15922576 markings, 27722296 edges, 157019 markings/sec, 100 secs
lola: sara is running 105 secs || 16657378 markings, 29005662 edges, 146960 markings/sec, 105 secs
lola: sara is running 110 secs || 17379888 markings, 30339439 edges, 144502 markings/sec, 110 secs
lola: sara is running 115 secs || 18065790 markings, 31595426 edges, 137180 markings/sec, 115 secs
lola: sara is running 120 secs || 18751130 markings, 32824803 edges, 137068 markings/sec, 120 secs
lola: sara is running 125 secs || 19490696 markings, 34075738 edges, 147913 markings/sec, 125 secs
lola: sara is running 130 secs || 20287232 markings, 35310010 edges, 159307 markings/sec, 130 secs
lola: sara is running 135 secs || 21098980 markings, 36544356 edges, 162350 markings/sec, 135 secs
lola: sara is running 140 secs || 21853317 markings, 37835724 edges, 150867 markings/sec, 140 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 22522804 markings, 38985159 edges
lola: ========================================
lola: subprocess 6 will run for 2738 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p154 <= 0) OR (p171 <= 0) OR ((1 <= p92)) OR (p27 <= 0) OR (p228 <= 0) OR (p141 <= 0) OR ((1 <= p147) AND (1 <= p120) AND (1 <= p122)) OR ((1 <= p186) AND (1 <= p113) AND (1 <= p81) AND (1 <= p231) AND (1 <= p233)))))
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 (((p154 <= 0) OR (p171 <= 0) OR ((1 <= p92)) OR (p27 <= 0) OR (p228 <= 0) OR (p141 <= 0) OR ((1 <= p147) AND (1 <= p120) AND (1 <= p122)) OR ((1 <= p186) AND (1 <= p113) AND (1 <= p81) AND (1 <= p231) AND (1 <= p233)))))
lola: processed formula length: 232
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 <= p154) AND (1 <= p171) AND ((p92 <= 0)) AND (1 <= p27) AND (1 <= p228) AND (1 <= p141) AND ((p147 <= 0) OR (p120 <= 0) OR (p122 <= 0)) AND ((p186 <= 0) OR (p113 <= 0) OR (p81 <= 0) OR (p231 <= 0) OR (p233 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 120 literals and 15 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.
sara: error: :370: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: sara is running 0 secs || 894542 markings, 1389126 edges, 178908 markings/sec, 0 secs
lola: sara is running 5 secs || 1778034 markings, 2777334 edges, 176698 markings/sec, 5 secs
lola: sara is running 10 secs || 2652324 markings, 4174098 edges, 174858 markings/sec, 10 secs
lola: sara is running 15 secs || 3538993 markings, 5514959 edges, 177334 markings/sec, 15 secs
lola: sara is running 20 secs || 4449062 markings, 6919050 edges, 182014 markings/sec, 20 secs
lola: sara is running 25 secs || 5256765 markings, 8262065 edges, 161541 markings/sec, 25 secs
lola: sara is running 30 secs || 6091439 markings, 9599404 edges, 166935 markings/sec, 30 secs
lola: sara is running 35 secs || 6927888 markings, 10914741 edges, 167290 markings/sec, 35 secs
lola: sara is running 40 secs || 7791860 markings, 12258352 edges, 172794 markings/sec, 40 secs
lola: sara is running 45 secs || 8634704 markings, 13624188 edges, 168569 markings/sec, 45 secs
lola: sara is running 50 secs || 9461343 markings, 14975841 edges, 165328 markings/sec, 50 secs
lola: sara is running 55 secs || 10333221 markings, 16317856 edges, 174376 markings/sec, 55 secs
lola: sara is running 60 secs || 11192543 markings, 17701192 edges, 171864 markings/sec, 60 secs
lola: sara is running 65 secs || 12045562 markings, 19051608 edges, 170604 markings/sec, 65 secs
lola: sara is running 70 secs || 12944453 markings, 20392444 edges, 179778 markings/sec, 70 secs
lola: sara is running 75 secs || 13737560 markings, 21700594 edges, 158621 markings/sec, 75 secs
lola: sara is running 80 secs || 14531516 markings, 22977414 edges, 158791 markings/sec, 80 secs
lola: sara is running 85 secs || 15350292 markings, 24344124 edges, 163755 markings/sec, 85 secs
lola: sara is running 90 secs || 16168773 markings, 25615124 edges, 163696 markings/sec, 90 secs
lola: sara is running 95 secs || 17001431 markings, 26943113 edges, 166532 markings/sec, 95 secs
lola: sara is running 100 secs || 17821746 markings, 28226604 edges, 164063 markings/sec, 100 secs
lola: sara is running 105 secs || 18649716 markings, 29516668 edges, 165594 markings/sec, 105 secs
lola: sara is running 110 secs || 19478731 markings, 30835104 edges, 165803 markings/sec, 110 secs
lola: sara is running 115 secs || 20294422 markings, 32111342 edges, 163138 markings/sec, 115 secs
lola: sara is running 120 secs || 21168715 markings, 33419245 edges, 174859 markings/sec, 120 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 21860597 markings, 34525180 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes yes yes yes yes
lola:
preliminary result: no yes yes yes yes yes yes
lola: memory consumption: 38288 KB
lola: time consumption: 961 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-20b"
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-20b, 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-158987900000271"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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