Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r182-oct2-158987914100580.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is BusinessProcesses-PT-17, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987914100580
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 356K
-rw-r--r-- 1 mcc users 4.3K Mar 26 02:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 26 02:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 22:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 22:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 8 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 25 17:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 25 17:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 25 14:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 161K 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 BusinessProcesses-PT-17-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591165767172

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 06:29:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 06:29:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 06:29:28] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2020-06-03 06:29:28] [INFO ] Transformed 650 places.
[2020-06-03 06:29:28] [INFO ] Transformed 580 transitions.
[2020-06-03 06:29:28] [INFO ] Found NUPN structural information;
[2020-06-03 06:29:28] [INFO ] Parsed PT model containing 650 places and 580 transitions in 104 ms.
Deduced a syphon composed of 4 places in 7 ms
Reduce places removed 4 places and 4 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 29 ms.
Incomplete random walk after 100000 steps, including 658 resets, run finished after 273 ms. (steps per millisecond=366 ) properties seen :[1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0]
// Phase 1: matrix 576 rows 646 cols
[2020-06-03 06:29:28] [INFO ] Computed 108 place invariants in 23 ms
[2020-06-03 06:29:29] [INFO ] [Real]Absence check using 62 positive place invariants in 47 ms returned sat
[2020-06-03 06:29:29] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 21 ms returned sat
[2020-06-03 06:29:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:29:29] [INFO ] [Real]Absence check using state equation in 794 ms returned sat
[2020-06-03 06:29:30] [INFO ] Deduced a trap composed of 8 places in 210 ms
[2020-06-03 06:29:30] [INFO ] Deduced a trap composed of 11 places in 185 ms
[2020-06-03 06:29:30] [INFO ] Deduced a trap composed of 22 places in 162 ms
[2020-06-03 06:29:30] [INFO ] Deduced a trap composed of 18 places in 162 ms
[2020-06-03 06:29:31] [INFO ] Deduced a trap composed of 17 places in 179 ms
[2020-06-03 06:29:31] [INFO ] Deduced a trap composed of 20 places in 163 ms
[2020-06-03 06:29:31] [INFO ] Deduced a trap composed of 18 places in 171 ms
[2020-06-03 06:29:31] [INFO ] Deduced a trap composed of 20 places in 101 ms
[2020-06-03 06:29:31] [INFO ] Deduced a trap composed of 22 places in 136 ms
[2020-06-03 06:29:31] [INFO ] Deduced a trap composed of 20 places in 104 ms
[2020-06-03 06:29:31] [INFO ] Deduced a trap composed of 21 places in 81 ms
[2020-06-03 06:29:32] [INFO ] Deduced a trap composed of 24 places in 89 ms
[2020-06-03 06:29:32] [INFO ] Deduced a trap composed of 41 places in 84 ms
[2020-06-03 06:29:32] [INFO ] Deduced a trap composed of 15 places in 80 ms
[2020-06-03 06:29:32] [INFO ] Deduced a trap composed of 38 places in 80 ms
[2020-06-03 06:29:32] [INFO ] Deduced a trap composed of 27 places in 78 ms
[2020-06-03 06:29:32] [INFO ] Deduced a trap composed of 30 places in 79 ms
[2020-06-03 06:29:32] [INFO ] Deduced a trap composed of 25 places in 76 ms
[2020-06-03 06:29:32] [INFO ] Deduced a trap composed of 40 places in 78 ms
[2020-06-03 06:29:32] [INFO ] Deduced a trap composed of 42 places in 47 ms
[2020-06-03 06:29:32] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2866 ms
[2020-06-03 06:29:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:29:33] [INFO ] [Nat]Absence check using 62 positive place invariants in 78 ms returned sat
[2020-06-03 06:29:33] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 23 ms returned sat
[2020-06-03 06:29:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:29:33] [INFO ] [Nat]Absence check using state equation in 734 ms returned sat
[2020-06-03 06:29:34] [INFO ] Deduced a trap composed of 15 places in 191 ms
[2020-06-03 06:29:34] [INFO ] Deduced a trap composed of 20 places in 147 ms
[2020-06-03 06:29:34] [INFO ] Deduced a trap composed of 8 places in 143 ms
[2020-06-03 06:29:34] [INFO ] Deduced a trap composed of 11 places in 158 ms
[2020-06-03 06:29:34] [INFO ] Deduced a trap composed of 124 places in 183 ms
[2020-06-03 06:29:34] [INFO ] Deduced a trap composed of 16 places in 142 ms
[2020-06-03 06:29:35] [INFO ] Deduced a trap composed of 26 places in 147 ms
[2020-06-03 06:29:35] [INFO ] Deduced a trap composed of 30 places in 162 ms
[2020-06-03 06:29:35] [INFO ] Deduced a trap composed of 21 places in 171 ms
[2020-06-03 06:29:35] [INFO ] Deduced a trap composed of 131 places in 177 ms
[2020-06-03 06:29:35] [INFO ] Deduced a trap composed of 40 places in 175 ms
[2020-06-03 06:29:36] [INFO ] Deduced a trap composed of 18 places in 158 ms
[2020-06-03 06:29:36] [INFO ] Deduced a trap composed of 27 places in 95 ms
[2020-06-03 06:29:36] [INFO ] Deduced a trap composed of 43 places in 97 ms
[2020-06-03 06:29:36] [INFO ] Deduced a trap composed of 32 places in 89 ms
[2020-06-03 06:29:36] [INFO ] Deduced a trap composed of 26 places in 92 ms
[2020-06-03 06:29:36] [INFO ] Deduced a trap composed of 33 places in 93 ms
[2020-06-03 06:29:36] [INFO ] Deduced a trap composed of 42 places in 87 ms
[2020-06-03 06:29:36] [INFO ] Deduced a trap composed of 39 places in 63 ms
[2020-06-03 06:29:36] [INFO ] Deduced a trap composed of 30 places in 55 ms
[2020-06-03 06:29:36] [INFO ] Deduced a trap composed of 32 places in 55 ms
[2020-06-03 06:29:37] [INFO ] Deduced a trap composed of 35 places in 60 ms
[2020-06-03 06:29:37] [INFO ] Deduced a trap composed of 43 places in 57 ms
[2020-06-03 06:29:37] [INFO ] Deduced a trap composed of 42 places in 53 ms
[2020-06-03 06:29:37] [INFO ] Deduced a trap composed of 34 places in 44 ms
[2020-06-03 06:29:37] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 3512 ms
[2020-06-03 06:29:37] [INFO ] Computed and/alt/rep : 575/2602/575 causal constraints in 30 ms.
[2020-06-03 06:29:40] [INFO ] Added : 348 causal constraints over 70 iterations in 3320 ms. Result :sat
[2020-06-03 06:29:40] [INFO ] [Real]Absence check using 62 positive place invariants in 37 ms returned sat
[2020-06-03 06:29:40] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 22 ms returned sat
[2020-06-03 06:29:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:29:41] [INFO ] [Real]Absence check using state equation in 780 ms returned sat
[2020-06-03 06:29:41] [INFO ] Deduced a trap composed of 19 places in 179 ms
[2020-06-03 06:29:41] [INFO ] Deduced a trap composed of 11 places in 187 ms
[2020-06-03 06:29:42] [INFO ] Deduced a trap composed of 112 places in 173 ms
[2020-06-03 06:29:42] [INFO ] Deduced a trap composed of 15 places in 176 ms
[2020-06-03 06:29:42] [INFO ] Deduced a trap composed of 12 places in 173 ms
[2020-06-03 06:29:42] [INFO ] Deduced a trap composed of 20 places in 170 ms
[2020-06-03 06:29:42] [INFO ] Deduced a trap composed of 8 places in 172 ms
[2020-06-03 06:29:43] [INFO ] Deduced a trap composed of 18 places in 200 ms
[2020-06-03 06:29:43] [INFO ] Deduced a trap composed of 21 places in 171 ms
[2020-06-03 06:29:43] [INFO ] Deduced a trap composed of 136 places in 168 ms
[2020-06-03 06:29:43] [INFO ] Deduced a trap composed of 21 places in 159 ms
[2020-06-03 06:29:43] [INFO ] Deduced a trap composed of 24 places in 191 ms
[2020-06-03 06:29:44] [INFO ] Deduced a trap composed of 21 places in 186 ms
[2020-06-03 06:29:44] [INFO ] Deduced a trap composed of 27 places in 188 ms
[2020-06-03 06:29:44] [INFO ] Deduced a trap composed of 17 places in 191 ms
[2020-06-03 06:29:44] [INFO ] Deduced a trap composed of 23 places in 191 ms
[2020-06-03 06:29:45] [INFO ] Deduced a trap composed of 30 places in 186 ms
[2020-06-03 06:29:45] [INFO ] Deduced a trap composed of 26 places in 184 ms
[2020-06-03 06:29:45] [INFO ] Deduced a trap composed of 49 places in 176 ms
[2020-06-03 06:29:45] [INFO ] Deduced a trap composed of 42 places in 171 ms
[2020-06-03 06:29:45] [INFO ] Deduced a trap composed of 46 places in 169 ms
[2020-06-03 06:29:46] [INFO ] Deduced a trap composed of 35 places in 166 ms
[2020-06-03 06:29:46] [INFO ] Deduced a trap composed of 32 places in 176 ms
[2020-06-03 06:29:46] [INFO ] Deduced a trap composed of 29 places in 162 ms
[2020-06-03 06:29:46] [INFO ] Deduced a trap composed of 31 places in 168 ms
[2020-06-03 06:29:46] [INFO ] Deduced a trap composed of 26 places in 166 ms
[2020-06-03 06:29:47] [INFO ] Deduced a trap composed of 30 places in 161 ms
[2020-06-03 06:29:47] [INFO ] Deduced a trap composed of 152 places in 163 ms
[2020-06-03 06:29:47] [INFO ] Deduced a trap composed of 149 places in 165 ms
[2020-06-03 06:29:47] [INFO ] Deduced a trap composed of 142 places in 161 ms
[2020-06-03 06:29:47] [INFO ] Deduced a trap composed of 32 places in 164 ms
[2020-06-03 06:29:47] [INFO ] Deduced a trap composed of 44 places in 155 ms
[2020-06-03 06:29:48] [INFO ] Deduced a trap composed of 179 places in 163 ms
[2020-06-03 06:29:48] [INFO ] Deduced a trap composed of 44 places in 158 ms
[2020-06-03 06:29:48] [INFO ] Deduced a trap composed of 176 places in 162 ms
[2020-06-03 06:29:48] [INFO ] Deduced a trap composed of 153 places in 155 ms
[2020-06-03 06:29:48] [INFO ] Deduced a trap composed of 161 places in 151 ms
[2020-06-03 06:29:49] [INFO ] Deduced a trap composed of 35 places in 157 ms
[2020-06-03 06:29:49] [INFO ] Deduced a trap composed of 15 places in 160 ms
[2020-06-03 06:29:49] [INFO ] Deduced a trap composed of 46 places in 158 ms
[2020-06-03 06:29:49] [INFO ] Deduced a trap composed of 48 places in 154 ms
[2020-06-03 06:29:49] [INFO ] Deduced a trap composed of 22 places in 159 ms
[2020-06-03 06:29:49] [INFO ] Deduced a trap composed of 46 places in 161 ms
[2020-06-03 06:29:50] [INFO ] Deduced a trap composed of 52 places in 165 ms
[2020-06-03 06:29:50] [INFO ] Deduced a trap composed of 156 places in 158 ms
[2020-06-03 06:29:50] [INFO ] Deduced a trap composed of 144 places in 155 ms
[2020-06-03 06:29:50] [INFO ] Deduced a trap composed of 148 places in 158 ms
[2020-06-03 06:29:50] [INFO ] Deduced a trap composed of 151 places in 156 ms
[2020-06-03 06:29:51] [INFO ] Deduced a trap composed of 60 places in 170 ms
[2020-06-03 06:29:51] [INFO ] Deduced a trap composed of 68 places in 150 ms
[2020-06-03 06:29:51] [INFO ] Deduced a trap composed of 60 places in 174 ms
[2020-06-03 06:29:51] [INFO ] Deduced a trap composed of 147 places in 172 ms
[2020-06-03 06:29:51] [INFO ] Deduced a trap composed of 136 places in 159 ms
[2020-06-03 06:29:52] [INFO ] Deduced a trap composed of 51 places in 154 ms
[2020-06-03 06:29:52] [INFO ] Deduced a trap composed of 55 places in 150 ms
[2020-06-03 06:29:52] [INFO ] Deduced a trap composed of 73 places in 150 ms
[2020-06-03 06:29:52] [INFO ] Deduced a trap composed of 153 places in 163 ms
[2020-06-03 06:29:52] [INFO ] Deduced a trap composed of 157 places in 156 ms
[2020-06-03 06:29:52] [INFO ] Deduced a trap composed of 154 places in 158 ms
[2020-06-03 06:29:53] [INFO ] Deduced a trap composed of 158 places in 159 ms
[2020-06-03 06:29:53] [INFO ] Deduced a trap composed of 55 places in 152 ms
[2020-06-03 06:29:53] [INFO ] Deduced a trap composed of 27 places in 277 ms
[2020-06-03 06:29:53] [INFO ] Deduced a trap composed of 38 places in 156 ms
[2020-06-03 06:29:54] [INFO ] Deduced a trap composed of 142 places in 154 ms
[2020-06-03 06:29:54] [INFO ] Deduced a trap composed of 43 places in 148 ms
[2020-06-03 06:29:54] [INFO ] Deduced a trap composed of 28 places in 148 ms
[2020-06-03 06:29:54] [INFO ] Deduced a trap composed of 26 places in 146 ms
[2020-06-03 06:29:54] [INFO ] Deduced a trap composed of 35 places in 141 ms
[2020-06-03 06:29:54] [INFO ] Deduced a trap composed of 148 places in 143 ms
[2020-06-03 06:29:55] [INFO ] Deduced a trap composed of 158 places in 146 ms
[2020-06-03 06:29:55] [INFO ] Deduced a trap composed of 45 places in 167 ms
[2020-06-03 06:29:55] [INFO ] Deduced a trap composed of 154 places in 150 ms
[2020-06-03 06:29:55] [INFO ] Deduced a trap composed of 55 places in 146 ms
[2020-06-03 06:29:55] [INFO ] Deduced a trap composed of 55 places in 145 ms
[2020-06-03 06:29:55] [INFO ] Deduced a trap composed of 145 places in 153 ms
[2020-06-03 06:29:56] [INFO ] Deduced a trap composed of 156 places in 150 ms
[2020-06-03 06:29:56] [INFO ] Deduced a trap composed of 71 places in 149 ms
[2020-06-03 06:29:56] [INFO ] Deduced a trap composed of 143 places in 153 ms
[2020-06-03 06:29:56] [INFO ] Deduced a trap composed of 148 places in 148 ms
[2020-06-03 06:29:56] [INFO ] Deduced a trap composed of 148 places in 149 ms
[2020-06-03 06:29:57] [INFO ] Deduced a trap composed of 157 places in 148 ms
[2020-06-03 06:29:57] [INFO ] Deduced a trap composed of 151 places in 149 ms
[2020-06-03 06:29:57] [INFO ] Deduced a trap composed of 150 places in 141 ms
[2020-06-03 06:29:57] [INFO ] Deduced a trap composed of 155 places in 146 ms
[2020-06-03 06:29:57] [INFO ] Deduced a trap composed of 161 places in 142 ms
[2020-06-03 06:29:57] [INFO ] Deduced a trap composed of 154 places in 143 ms
[2020-06-03 06:29:58] [INFO ] Deduced a trap composed of 157 places in 143 ms
[2020-06-03 06:29:58] [INFO ] Deduced a trap composed of 147 places in 147 ms
[2020-06-03 06:29:58] [INFO ] Deduced a trap composed of 139 places in 137 ms
[2020-06-03 06:29:58] [INFO ] Deduced a trap composed of 155 places in 164 ms
[2020-06-03 06:29:58] [INFO ] Deduced a trap composed of 144 places in 158 ms
[2020-06-03 06:29:58] [INFO ] Deduced a trap composed of 167 places in 157 ms
[2020-06-03 06:29:59] [INFO ] Deduced a trap composed of 149 places in 168 ms
[2020-06-03 06:29:59] [INFO ] Deduced a trap composed of 146 places in 151 ms
[2020-06-03 06:29:59] [INFO ] Deduced a trap composed of 147 places in 150 ms
[2020-06-03 06:29:59] [INFO ] Deduced a trap composed of 148 places in 147 ms
[2020-06-03 06:29:59] [INFO ] Deduced a trap composed of 142 places in 147 ms
[2020-06-03 06:30:00] [INFO ] Deduced a trap composed of 146 places in 150 ms
[2020-06-03 06:30:00] [INFO ] Deduced a trap composed of 150 places in 145 ms
[2020-06-03 06:30:00] [INFO ] Deduced a trap composed of 148 places in 145 ms
[2020-06-03 06:30:00] [INFO ] Deduced a trap composed of 161 places in 145 ms
[2020-06-03 06:30:00] [INFO ] Deduced a trap composed of 153 places in 144 ms
[2020-06-03 06:30:00] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s30 s31 s34 s35 s41 s42 s46 s47 s48 s54 s55 s59 s60 s61 s89 s90 s91 s92 s94 s98 s101 s102 s103 s104 s105 s106 s110 s111 s119 s131 s143 s144 s145 s149 s150 s151 s168 s171 s172 s188 s189 s190 s199 s200 s208 s220 s221 s222 s246 s247 s248 s251 s252 s253 s297 s307 s312 s317 s331 s335 s337 s340 s341 s342 s351 s361 s371 s376 s381 s386 s396 s416 s421 s431 s440 s442 s446 s456 s460 s463 s464 s465 s466 s469 s470 s471 s472 s473 s474 s488 s489 s492 s493 s496 s499 s500 s503 s504 s509 s510 s511 s512 s519 s520 s523 s524 s533 s540 s541 s544 s545 s548 s549 s552 s553 s556 s557 s558 s559 s562 s563 s568 s569 s570 s571 s572 s577 s578 s585 s586 s587 s588 s589 s590 s595 s596 s601 s602 s607 s621 s622 s623 s630 s631 s632 s644 s645) 0)") while checking expression at index 1
[2020-06-03 06:30:00] [INFO ] [Real]Absence check using 62 positive place invariants in 38 ms returned sat
[2020-06-03 06:30:00] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 23 ms returned sat
[2020-06-03 06:30:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:30:01] [INFO ] [Real]Absence check using state equation in 784 ms returned sat
[2020-06-03 06:30:01] [INFO ] Deduced a trap composed of 11 places in 189 ms
[2020-06-03 06:30:02] [INFO ] Deduced a trap composed of 18 places in 190 ms
[2020-06-03 06:30:02] [INFO ] Deduced a trap composed of 23 places in 163 ms
[2020-06-03 06:30:02] [INFO ] Deduced a trap composed of 21 places in 159 ms
[2020-06-03 06:30:02] [INFO ] Deduced a trap composed of 27 places in 187 ms
[2020-06-03 06:30:02] [INFO ] Deduced a trap composed of 22 places in 185 ms
[2020-06-03 06:30:03] [INFO ] Deduced a trap composed of 26 places in 185 ms
[2020-06-03 06:30:03] [INFO ] Deduced a trap composed of 38 places in 156 ms
[2020-06-03 06:30:03] [INFO ] Deduced a trap composed of 32 places in 151 ms
[2020-06-03 06:30:03] [INFO ] Deduced a trap composed of 39 places in 143 ms
[2020-06-03 06:30:03] [INFO ] Deduced a trap composed of 124 places in 143 ms
[2020-06-03 06:30:03] [INFO ] Deduced a trap composed of 36 places in 157 ms
[2020-06-03 06:30:04] [INFO ] Deduced a trap composed of 21 places in 156 ms
[2020-06-03 06:30:04] [INFO ] Deduced a trap composed of 38 places in 141 ms
[2020-06-03 06:30:04] [INFO ] Deduced a trap composed of 121 places in 141 ms
[2020-06-03 06:30:04] [INFO ] Deduced a trap composed of 45 places in 154 ms
[2020-06-03 06:30:04] [INFO ] Deduced a trap composed of 123 places in 142 ms
[2020-06-03 06:30:05] [INFO ] Deduced a trap composed of 122 places in 141 ms
[2020-06-03 06:30:05] [INFO ] Deduced a trap composed of 44 places in 140 ms
[2020-06-03 06:30:05] [INFO ] Deduced a trap composed of 37 places in 138 ms
[2020-06-03 06:30:05] [INFO ] Deduced a trap composed of 32 places in 139 ms
[2020-06-03 06:30:05] [INFO ] Deduced a trap composed of 40 places in 143 ms
[2020-06-03 06:30:05] [INFO ] Deduced a trap composed of 57 places in 143 ms
[2020-06-03 06:30:05] [INFO ] Deduced a trap composed of 41 places in 155 ms
[2020-06-03 06:30:06] [INFO ] Deduced a trap composed of 29 places in 148 ms
[2020-06-03 06:30:06] [INFO ] Deduced a trap composed of 126 places in 149 ms
[2020-06-03 06:30:06] [INFO ] Deduced a trap composed of 131 places in 135 ms
[2020-06-03 06:30:06] [INFO ] Deduced a trap composed of 48 places in 145 ms
[2020-06-03 06:30:06] [INFO ] Deduced a trap composed of 129 places in 147 ms
[2020-06-03 06:30:06] [INFO ] Deduced a trap composed of 44 places in 34 ms
[2020-06-03 06:30:06] [INFO ] Deduced a trap composed of 42 places in 38 ms
[2020-06-03 06:30:07] [INFO ] Deduced a trap composed of 32 places in 33 ms
[2020-06-03 06:30:07] [INFO ] Deduced a trap composed of 30 places in 37 ms
[2020-06-03 06:30:07] [INFO ] Deduced a trap composed of 35 places in 26 ms
[2020-06-03 06:30:07] [INFO ] Deduced a trap composed of 55 places in 72 ms
[2020-06-03 06:30:07] [INFO ] Deduced a trap composed of 70 places in 73 ms
[2020-06-03 06:30:07] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 5672 ms
[2020-06-03 06:30:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:30:07] [INFO ] [Nat]Absence check using 62 positive place invariants in 66 ms returned sat
[2020-06-03 06:30:07] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 21 ms returned sat
[2020-06-03 06:30:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:30:08] [INFO ] [Nat]Absence check using state equation in 802 ms returned sat
[2020-06-03 06:30:08] [INFO ] Deduced a trap composed of 20 places in 238 ms
[2020-06-03 06:30:08] [INFO ] Deduced a trap composed of 19 places in 172 ms
[2020-06-03 06:30:08] [INFO ] Deduced a trap composed of 23 places in 170 ms
[2020-06-03 06:30:09] [INFO ] Deduced a trap composed of 27 places in 171 ms
[2020-06-03 06:30:09] [INFO ] Deduced a trap composed of 123 places in 167 ms
[2020-06-03 06:30:09] [INFO ] Deduced a trap composed of 121 places in 170 ms
[2020-06-03 06:30:09] [INFO ] Deduced a trap composed of 11 places in 166 ms
[2020-06-03 06:30:09] [INFO ] Deduced a trap composed of 17 places in 167 ms
[2020-06-03 06:30:10] [INFO ] Deduced a trap composed of 28 places in 171 ms
[2020-06-03 06:30:10] [INFO ] Deduced a trap composed of 119 places in 163 ms
[2020-06-03 06:30:10] [INFO ] Deduced a trap composed of 121 places in 164 ms
[2020-06-03 06:30:10] [INFO ] Deduced a trap composed of 32 places in 161 ms
[2020-06-03 06:30:10] [INFO ] Deduced a trap composed of 28 places in 158 ms
[2020-06-03 06:30:11] [INFO ] Deduced a trap composed of 33 places in 159 ms
[2020-06-03 06:30:11] [INFO ] Deduced a trap composed of 31 places in 161 ms
[2020-06-03 06:30:11] [INFO ] Deduced a trap composed of 129 places in 160 ms
[2020-06-03 06:30:11] [INFO ] Deduced a trap composed of 25 places in 158 ms
[2020-06-03 06:30:11] [INFO ] Deduced a trap composed of 121 places in 156 ms
[2020-06-03 06:30:11] [INFO ] Deduced a trap composed of 130 places in 152 ms
[2020-06-03 06:30:12] [INFO ] Deduced a trap composed of 36 places in 156 ms
[2020-06-03 06:30:12] [INFO ] Deduced a trap composed of 124 places in 151 ms
[2020-06-03 06:30:12] [INFO ] Deduced a trap composed of 123 places in 152 ms
[2020-06-03 06:30:12] [INFO ] Deduced a trap composed of 39 places in 148 ms
[2020-06-03 06:30:12] [INFO ] Deduced a trap composed of 36 places in 154 ms
[2020-06-03 06:30:13] [INFO ] Deduced a trap composed of 121 places in 151 ms
[2020-06-03 06:30:13] [INFO ] Deduced a trap composed of 117 places in 152 ms
[2020-06-03 06:30:13] [INFO ] Deduced a trap composed of 48 places in 149 ms
[2020-06-03 06:30:13] [INFO ] Deduced a trap composed of 22 places in 155 ms
[2020-06-03 06:30:13] [INFO ] Deduced a trap composed of 27 places in 153 ms
[2020-06-03 06:30:13] [INFO ] Deduced a trap composed of 118 places in 156 ms
[2020-06-03 06:30:14] [INFO ] Deduced a trap composed of 129 places in 156 ms
[2020-06-03 06:30:14] [INFO ] Deduced a trap composed of 36 places in 149 ms
[2020-06-03 06:30:14] [INFO ] Deduced a trap composed of 43 places in 149 ms
[2020-06-03 06:30:14] [INFO ] Deduced a trap composed of 131 places in 152 ms
[2020-06-03 06:30:14] [INFO ] Deduced a trap composed of 40 places in 147 ms
[2020-06-03 06:30:15] [INFO ] Deduced a trap composed of 118 places in 153 ms
[2020-06-03 06:30:15] [INFO ] Deduced a trap composed of 25 places in 158 ms
[2020-06-03 06:30:15] [INFO ] Deduced a trap composed of 128 places in 158 ms
[2020-06-03 06:30:15] [INFO ] Deduced a trap composed of 130 places in 141 ms
[2020-06-03 06:30:15] [INFO ] Deduced a trap composed of 41 places in 148 ms
[2020-06-03 06:30:15] [INFO ] Deduced a trap composed of 35 places in 226 ms
[2020-06-03 06:30:16] [INFO ] Deduced a trap composed of 53 places in 213 ms
[2020-06-03 06:30:16] [INFO ] Deduced a trap composed of 40 places in 209 ms
[2020-06-03 06:30:16] [INFO ] Deduced a trap composed of 46 places in 209 ms
[2020-06-03 06:30:16] [INFO ] Deduced a trap composed of 57 places in 210 ms
[2020-06-03 06:30:17] [INFO ] Deduced a trap composed of 65 places in 217 ms
[2020-06-03 06:30:17] [INFO ] Deduced a trap composed of 50 places in 183 ms
[2020-06-03 06:30:17] [INFO ] Deduced a trap composed of 27 places in 165 ms
[2020-06-03 06:30:17] [INFO ] Deduced a trap composed of 46 places in 168 ms
[2020-06-03 06:30:17] [INFO ] Deduced a trap composed of 48 places in 161 ms
[2020-06-03 06:30:18] [INFO ] Deduced a trap composed of 48 places in 364 ms
[2020-06-03 06:30:18] [INFO ] Deduced a trap composed of 125 places in 350 ms
[2020-06-03 06:30:19] [INFO ] Deduced a trap composed of 49 places in 344 ms
[2020-06-03 06:30:19] [INFO ] Deduced a trap composed of 127 places in 345 ms
[2020-06-03 06:30:19] [INFO ] Deduced a trap composed of 125 places in 316 ms
[2020-06-03 06:30:20] [INFO ] Deduced a trap composed of 78 places in 314 ms
[2020-06-03 06:30:20] [INFO ] Deduced a trap composed of 125 places in 357 ms
[2020-06-03 06:30:20] [INFO ] Deduced a trap composed of 55 places in 175 ms
[2020-06-03 06:30:20] [INFO ] Deduced a trap composed of 125 places in 156 ms
[2020-06-03 06:30:21] [INFO ] Deduced a trap composed of 32 places in 88 ms
[2020-06-03 06:30:21] [INFO ] Deduced a trap composed of 43 places in 42 ms
[2020-06-03 06:30:21] [INFO ] Deduced a trap composed of 43 places in 42 ms
[2020-06-03 06:30:21] [INFO ] Deduced a trap composed of 43 places in 40 ms
[2020-06-03 06:30:21] [INFO ] Deduced a trap composed of 43 places in 163 ms
[2020-06-03 06:30:21] [INFO ] Deduced a trap composed of 127 places in 160 ms
[2020-06-03 06:30:21] [INFO ] Deduced a trap composed of 132 places in 160 ms
[2020-06-03 06:30:21] [INFO ] Deduced a trap composed of 35 places in 36 ms
[2020-06-03 06:30:21] [INFO ] Deduced a trap composed of 39 places in 140 ms
[2020-06-03 06:30:22] [INFO ] Deduced a trap composed of 54 places in 145 ms
[2020-06-03 06:30:22] [INFO ] Deduced a trap composed of 58 places in 142 ms
[2020-06-03 06:30:22] [INFO ] Deduced a trap composed of 137 places in 140 ms
[2020-06-03 06:30:22] [INFO ] Deduced a trap composed of 42 places in 32 ms
[2020-06-03 06:30:22] [INFO ] Trap strengthening (SAT) tested/added 73/72 trap constraints in 14259 ms
[2020-06-03 06:30:22] [INFO ] Computed and/alt/rep : 575/2602/575 causal constraints in 33 ms.
[2020-06-03 06:30:25] [INFO ] Added : 378 causal constraints over 76 iterations in 3351 ms. Result :sat
[2020-06-03 06:30:26] [INFO ] [Real]Absence check using 62 positive place invariants in 37 ms returned sat
[2020-06-03 06:30:26] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 22 ms returned sat
[2020-06-03 06:30:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:30:26] [INFO ] [Real]Absence check using state equation in 767 ms returned sat
[2020-06-03 06:30:27] [INFO ] Deduced a trap composed of 11 places in 179 ms
[2020-06-03 06:30:27] [INFO ] Deduced a trap composed of 123 places in 181 ms
[2020-06-03 06:30:27] [INFO ] Deduced a trap composed of 15 places in 179 ms
[2020-06-03 06:30:27] [INFO ] Deduced a trap composed of 123 places in 181 ms
[2020-06-03 06:30:27] [INFO ] Deduced a trap composed of 37 places in 178 ms
[2020-06-03 06:30:28] [INFO ] Deduced a trap composed of 15 places in 175 ms
[2020-06-03 06:30:28] [INFO ] Deduced a trap composed of 11 places in 175 ms
[2020-06-03 06:30:28] [INFO ] Deduced a trap composed of 22 places in 172 ms
[2020-06-03 06:30:28] [INFO ] Deduced a trap composed of 20 places in 170 ms
[2020-06-03 06:30:28] [INFO ] Deduced a trap composed of 22 places in 170 ms
[2020-06-03 06:30:29] [INFO ] Deduced a trap composed of 32 places in 170 ms
[2020-06-03 06:30:29] [INFO ] Deduced a trap composed of 21 places in 172 ms
[2020-06-03 06:30:29] [INFO ] Deduced a trap composed of 31 places in 168 ms
[2020-06-03 06:30:29] [INFO ] Deduced a trap composed of 48 places in 168 ms
[2020-06-03 06:30:29] [INFO ] Deduced a trap composed of 128 places in 165 ms
[2020-06-03 06:30:30] [INFO ] Deduced a trap composed of 28 places in 166 ms
[2020-06-03 06:30:30] [INFO ] Deduced a trap composed of 137 places in 174 ms
[2020-06-03 06:30:30] [INFO ] Deduced a trap composed of 144 places in 169 ms
[2020-06-03 06:30:30] [INFO ] Deduced a trap composed of 21 places in 165 ms
[2020-06-03 06:30:30] [INFO ] Deduced a trap composed of 43 places in 160 ms
[2020-06-03 06:30:30] [INFO ] Deduced a trap composed of 47 places in 165 ms
[2020-06-03 06:30:31] [INFO ] Deduced a trap composed of 20 places in 166 ms
[2020-06-03 06:30:31] [INFO ] Deduced a trap composed of 35 places in 161 ms
[2020-06-03 06:30:31] [INFO ] Deduced a trap composed of 17 places in 161 ms
[2020-06-03 06:30:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 24 trap constraints in 4678 ms
[2020-06-03 06:30:31] [INFO ] [Real]Absence check using 62 positive place invariants in 39 ms returned sat
[2020-06-03 06:30:31] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 24 ms returned sat
[2020-06-03 06:30:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:30:32] [INFO ] [Real]Absence check using state equation in 763 ms returned sat
[2020-06-03 06:30:32] [INFO ] Deduced a trap composed of 8 places in 192 ms
[2020-06-03 06:30:32] [INFO ] Deduced a trap composed of 15 places in 189 ms
[2020-06-03 06:30:33] [INFO ] Deduced a trap composed of 136 places in 182 ms
[2020-06-03 06:30:33] [INFO ] Deduced a trap composed of 11 places in 400 ms
[2020-06-03 06:30:33] [INFO ] Deduced a trap composed of 18 places in 422 ms
[2020-06-03 06:30:34] [INFO ] Deduced a trap composed of 112 places in 408 ms
[2020-06-03 06:30:34] [INFO ] Deduced a trap composed of 23 places in 415 ms
[2020-06-03 06:30:35] [INFO ] Deduced a trap composed of 17 places in 270 ms
[2020-06-03 06:30:35] [INFO ] Deduced a trap composed of 17 places in 255 ms
[2020-06-03 06:30:35] [INFO ] Deduced a trap composed of 14 places in 255 ms
[2020-06-03 06:30:36] [INFO ] Deduced a trap composed of 23 places in 404 ms
[2020-06-03 06:30:36] [INFO ] Deduced a trap composed of 22 places in 387 ms
[2020-06-03 06:30:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 4096 ms
[2020-06-03 06:30:36] [INFO ] [Real]Absence check using 62 positive place invariants in 65 ms returned sat
[2020-06-03 06:30:36] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 40 ms returned sat
[2020-06-03 06:30:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:30:38] [INFO ] [Real]Absence check using state equation in 1909 ms returned sat
[2020-06-03 06:30:38] [INFO ] Deduced a trap composed of 8 places in 177 ms
[2020-06-03 06:30:39] [INFO ] Deduced a trap composed of 11 places in 178 ms
[2020-06-03 06:30:39] [INFO ] Deduced a trap composed of 20 places in 178 ms
[2020-06-03 06:30:39] [INFO ] Deduced a trap composed of 12 places in 167 ms
[2020-06-03 06:30:39] [INFO ] Deduced a trap composed of 15 places in 169 ms
[2020-06-03 06:30:39] [INFO ] Deduced a trap composed of 27 places in 159 ms
[2020-06-03 06:30:40] [INFO ] Deduced a trap composed of 129 places in 166 ms
[2020-06-03 06:30:40] [INFO ] Deduced a trap composed of 127 places in 170 ms
[2020-06-03 06:30:40] [INFO ] Deduced a trap composed of 12 places in 159 ms
[2020-06-03 06:30:40] [INFO ] Deduced a trap composed of 16 places in 163 ms
[2020-06-03 06:30:40] [INFO ] Deduced a trap composed of 139 places in 166 ms
[2020-06-03 06:30:41] [INFO ] Deduced a trap composed of 22 places in 164 ms
[2020-06-03 06:30:41] [INFO ] Deduced a trap composed of 21 places in 161 ms
[2020-06-03 06:30:41] [INFO ] Deduced a trap composed of 123 places in 158 ms
[2020-06-03 06:30:41] [INFO ] Deduced a trap composed of 44 places in 158 ms
[2020-06-03 06:30:41] [INFO ] Deduced a trap composed of 120 places in 160 ms
[2020-06-03 06:30:41] [INFO ] Deduced a trap composed of 30 places in 154 ms
[2020-06-03 06:30:42] [INFO ] Deduced a trap composed of 44 places in 156 ms
[2020-06-03 06:30:42] [INFO ] Deduced a trap composed of 38 places in 160 ms
[2020-06-03 06:30:42] [INFO ] Deduced a trap composed of 15 places in 165 ms
[2020-06-03 06:30:42] [INFO ] Deduced a trap composed of 26 places in 165 ms
[2020-06-03 06:30:42] [INFO ] Deduced a trap composed of 38 places in 160 ms
[2020-06-03 06:30:43] [INFO ] Deduced a trap composed of 19 places in 158 ms
[2020-06-03 06:30:43] [INFO ] Deduced a trap composed of 37 places in 160 ms
[2020-06-03 06:30:43] [INFO ] Deduced a trap composed of 27 places in 156 ms
[2020-06-03 06:30:43] [INFO ] Deduced a trap composed of 29 places in 158 ms
[2020-06-03 06:30:43] [INFO ] Deduced a trap composed of 122 places in 159 ms
[2020-06-03 06:30:44] [INFO ] Deduced a trap composed of 137 places in 151 ms
[2020-06-03 06:30:44] [INFO ] Deduced a trap composed of 23 places in 150 ms
[2020-06-03 06:30:44] [INFO ] Deduced a trap composed of 47 places in 95 ms
[2020-06-03 06:30:44] [INFO ] Deduced a trap composed of 43 places in 96 ms
[2020-06-03 06:30:44] [INFO ] Deduced a trap composed of 34 places in 96 ms
[2020-06-03 06:30:44] [INFO ] Deduced a trap composed of 26 places in 89 ms
[2020-06-03 06:30:44] [INFO ] Deduced a trap composed of 50 places in 93 ms
[2020-06-03 06:30:44] [INFO ] Deduced a trap composed of 50 places in 93 ms
[2020-06-03 06:30:44] [INFO ] Deduced a trap composed of 43 places in 48 ms
[2020-06-03 06:30:45] [INFO ] Deduced a trap composed of 30 places in 42 ms
[2020-06-03 06:30:45] [INFO ] Deduced a trap composed of 42 places in 39 ms
[2020-06-03 06:30:45] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 6405 ms
[2020-06-03 06:30:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:30:45] [INFO ] [Nat]Absence check using 62 positive place invariants in 66 ms returned sat
[2020-06-03 06:30:45] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 22 ms returned sat
[2020-06-03 06:30:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:30:46] [INFO ] [Nat]Absence check using state equation in 762 ms returned sat
[2020-06-03 06:30:46] [INFO ] Deduced a trap composed of 10 places in 168 ms
[2020-06-03 06:30:46] [INFO ] Deduced a trap composed of 11 places in 191 ms
[2020-06-03 06:30:46] [INFO ] Deduced a trap composed of 8 places in 164 ms
[2020-06-03 06:30:46] [INFO ] Deduced a trap composed of 13 places in 157 ms
[2020-06-03 06:30:46] [INFO ] Deduced a trap composed of 17 places in 158 ms
[2020-06-03 06:30:47] [INFO ] Deduced a trap composed of 11 places in 188 ms
[2020-06-03 06:30:47] [INFO ] Deduced a trap composed of 18 places in 184 ms
[2020-06-03 06:30:47] [INFO ] Deduced a trap composed of 15 places in 162 ms
[2020-06-03 06:30:47] [INFO ] Deduced a trap composed of 15 places in 189 ms
[2020-06-03 06:30:47] [INFO ] Deduced a trap composed of 22 places in 159 ms
[2020-06-03 06:30:48] [INFO ] Deduced a trap composed of 22 places in 185 ms
[2020-06-03 06:30:48] [INFO ] Deduced a trap composed of 29 places in 184 ms
[2020-06-03 06:30:48] [INFO ] Deduced a trap composed of 30 places in 157 ms
[2020-06-03 06:30:48] [INFO ] Deduced a trap composed of 28 places in 152 ms
[2020-06-03 06:30:48] [INFO ] Deduced a trap composed of 138 places in 152 ms
[2020-06-03 06:30:49] [INFO ] Deduced a trap composed of 32 places in 151 ms
[2020-06-03 06:30:49] [INFO ] Deduced a trap composed of 21 places in 174 ms
[2020-06-03 06:30:49] [INFO ] Deduced a trap composed of 33 places in 169 ms
[2020-06-03 06:30:49] [INFO ] Deduced a trap composed of 48 places in 154 ms
[2020-06-03 06:30:49] [INFO ] Deduced a trap composed of 118 places in 173 ms
[2020-06-03 06:30:50] [INFO ] Deduced a trap composed of 32 places in 150 ms
[2020-06-03 06:30:50] [INFO ] Deduced a trap composed of 40 places in 148 ms
[2020-06-03 06:30:50] [INFO ] Deduced a trap composed of 22 places in 170 ms
[2020-06-03 06:30:50] [INFO ] Deduced a trap composed of 48 places in 152 ms
[2020-06-03 06:30:50] [INFO ] Deduced a trap composed of 125 places in 156 ms
[2020-06-03 06:30:50] [INFO ] Deduced a trap composed of 133 places in 157 ms
[2020-06-03 06:30:51] [INFO ] Deduced a trap composed of 23 places in 154 ms
[2020-06-03 06:30:51] [INFO ] Deduced a trap composed of 131 places in 163 ms
[2020-06-03 06:30:51] [INFO ] Deduced a trap composed of 35 places in 148 ms
[2020-06-03 06:30:51] [INFO ] Deduced a trap composed of 122 places in 146 ms
[2020-06-03 06:30:51] [INFO ] Deduced a trap composed of 50 places in 145 ms
[2020-06-03 06:30:52] [INFO ] Deduced a trap composed of 30 places in 287 ms
[2020-06-03 06:30:52] [INFO ] Deduced a trap composed of 46 places in 137 ms
[2020-06-03 06:30:52] [INFO ] Deduced a trap composed of 42 places in 250 ms
[2020-06-03 06:30:52] [INFO ] Deduced a trap composed of 45 places in 142 ms
[2020-06-03 06:30:52] [INFO ] Deduced a trap composed of 30 places in 136 ms
[2020-06-03 06:30:53] [INFO ] Deduced a trap composed of 119 places in 143 ms
[2020-06-03 06:30:53] [INFO ] Deduced a trap composed of 125 places in 134 ms
[2020-06-03 06:30:53] [INFO ] Deduced a trap composed of 124 places in 152 ms
[2020-06-03 06:30:53] [INFO ] Deduced a trap composed of 130 places in 142 ms
[2020-06-03 06:30:53] [INFO ] Deduced a trap composed of 43 places in 144 ms
[2020-06-03 06:30:53] [INFO ] Deduced a trap composed of 23 places in 133 ms
[2020-06-03 06:30:54] [INFO ] Deduced a trap composed of 23 places in 80 ms
[2020-06-03 06:30:54] [INFO ] Deduced a trap composed of 51 places in 87 ms
[2020-06-03 06:30:54] [INFO ] Deduced a trap composed of 23 places in 73 ms
[2020-06-03 06:30:54] [INFO ] Deduced a trap composed of 30 places in 80 ms
[2020-06-03 06:30:54] [INFO ] Deduced a trap composed of 34 places in 80 ms
[2020-06-03 06:30:54] [INFO ] Deduced a trap composed of 43 places in 68 ms
[2020-06-03 06:30:54] [INFO ] Deduced a trap composed of 42 places in 66 ms
[2020-06-03 06:30:54] [INFO ] Deduced a trap composed of 46 places in 62 ms
[2020-06-03 06:30:54] [INFO ] Deduced a trap composed of 43 places in 70 ms
[2020-06-03 06:30:54] [INFO ] Deduced a trap composed of 42 places in 80 ms
[2020-06-03 06:30:55] [INFO ] Deduced a trap composed of 34 places in 90 ms
[2020-06-03 06:30:55] [INFO ] Deduced a trap composed of 44 places in 82 ms
[2020-06-03 06:30:55] [INFO ] Deduced a trap composed of 34 places in 78 ms
[2020-06-03 06:30:55] [INFO ] Deduced a trap composed of 38 places in 87 ms
[2020-06-03 06:30:55] [INFO ] Deduced a trap composed of 48 places in 83 ms
[2020-06-03 06:30:55] [INFO ] Deduced a trap composed of 46 places in 102 ms
[2020-06-03 06:30:55] [INFO ] Trap strengthening (SAT) tested/added 59/58 trap constraints in 9521 ms
[2020-06-03 06:30:55] [INFO ] Computed and/alt/rep : 575/2602/575 causal constraints in 26 ms.
[2020-06-03 06:30:59] [INFO ] Added : 372 causal constraints over 75 iterations in 3468 ms. Result :sat
[2020-06-03 06:30:59] [INFO ] [Real]Absence check using 62 positive place invariants in 35 ms returned sat
[2020-06-03 06:30:59] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 20 ms returned sat
[2020-06-03 06:30:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:30:59] [INFO ] [Real]Absence check using state equation in 765 ms returned sat
[2020-06-03 06:31:00] [INFO ] Deduced a trap composed of 8 places in 165 ms
[2020-06-03 06:31:00] [INFO ] Deduced a trap composed of 11 places in 152 ms
[2020-06-03 06:31:00] [INFO ] Deduced a trap composed of 21 places in 154 ms
[2020-06-03 06:31:00] [INFO ] Deduced a trap composed of 19 places in 154 ms
[2020-06-03 06:31:00] [INFO ] Deduced a trap composed of 23 places in 158 ms
[2020-06-03 06:31:01] [INFO ] Deduced a trap composed of 25 places in 147 ms
[2020-06-03 06:31:01] [INFO ] Deduced a trap composed of 16 places in 232 ms
[2020-06-03 06:31:01] [INFO ] Deduced a trap composed of 19 places in 168 ms
[2020-06-03 06:31:01] [INFO ] Deduced a trap composed of 22 places in 97 ms
[2020-06-03 06:31:01] [INFO ] Deduced a trap composed of 17 places in 99 ms
[2020-06-03 06:31:01] [INFO ] Deduced a trap composed of 32 places in 90 ms
[2020-06-03 06:31:01] [INFO ] Deduced a trap composed of 22 places in 103 ms
[2020-06-03 06:31:02] [INFO ] Deduced a trap composed of 27 places in 112 ms
[2020-06-03 06:31:02] [INFO ] Deduced a trap composed of 37 places in 98 ms
[2020-06-03 06:31:02] [INFO ] Deduced a trap composed of 35 places in 92 ms
[2020-06-03 06:31:02] [INFO ] Deduced a trap composed of 39 places in 88 ms
[2020-06-03 06:31:02] [INFO ] Deduced a trap composed of 31 places in 86 ms
[2020-06-03 06:31:02] [INFO ] Deduced a trap composed of 23 places in 84 ms
[2020-06-03 06:31:02] [INFO ] Deduced a trap composed of 23 places in 87 ms
[2020-06-03 06:31:02] [INFO ] Deduced a trap composed of 15 places in 60 ms
[2020-06-03 06:31:02] [INFO ] Deduced a trap composed of 38 places in 57 ms
[2020-06-03 06:31:02] [INFO ] Deduced a trap composed of 43 places in 47 ms
[2020-06-03 06:31:03] [INFO ] Deduced a trap composed of 30 places in 45 ms
[2020-06-03 06:31:03] [INFO ] Deduced a trap composed of 42 places in 45 ms
[2020-06-03 06:31:03] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 3183 ms
[2020-06-03 06:31:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:31:03] [INFO ] [Nat]Absence check using 62 positive place invariants in 67 ms returned sat
[2020-06-03 06:31:03] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 22 ms returned sat
[2020-06-03 06:31:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:31:04] [INFO ] [Nat]Absence check using state equation in 781 ms returned sat
[2020-06-03 06:31:04] [INFO ] Deduced a trap composed of 13 places in 174 ms
[2020-06-03 06:31:04] [INFO ] Deduced a trap composed of 23 places in 154 ms
[2020-06-03 06:31:04] [INFO ] Deduced a trap composed of 15 places in 168 ms
[2020-06-03 06:31:04] [INFO ] Deduced a trap composed of 8 places in 165 ms
[2020-06-03 06:31:05] [INFO ] Deduced a trap composed of 17 places in 165 ms
[2020-06-03 06:31:05] [INFO ] Deduced a trap composed of 18 places in 163 ms
[2020-06-03 06:31:05] [INFO ] Deduced a trap composed of 11 places in 165 ms
[2020-06-03 06:31:05] [INFO ] Deduced a trap composed of 19 places in 143 ms
[2020-06-03 06:31:05] [INFO ] Deduced a trap composed of 35 places in 89 ms
[2020-06-03 06:31:05] [INFO ] Deduced a trap composed of 21 places in 78 ms
[2020-06-03 06:31:05] [INFO ] Deduced a trap composed of 25 places in 74 ms
[2020-06-03 06:31:05] [INFO ] Deduced a trap composed of 21 places in 75 ms
[2020-06-03 06:31:06] [INFO ] Deduced a trap composed of 24 places in 73 ms
[2020-06-03 06:31:06] [INFO ] Deduced a trap composed of 34 places in 65 ms
[2020-06-03 06:31:06] [INFO ] Deduced a trap composed of 30 places in 59 ms
[2020-06-03 06:31:06] [INFO ] Deduced a trap composed of 42 places in 59 ms
[2020-06-03 06:31:06] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2248 ms
[2020-06-03 06:31:06] [INFO ] Computed and/alt/rep : 575/2602/575 causal constraints in 28 ms.
[2020-06-03 06:31:09] [INFO ] Added : 342 causal constraints over 69 iterations in 2841 ms. Result :sat
[2020-06-03 06:31:09] [INFO ] [Real]Absence check using 62 positive place invariants in 53 ms returned sat
[2020-06-03 06:31:09] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 21 ms returned sat
[2020-06-03 06:31:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:31:10] [INFO ] [Real]Absence check using state equation in 748 ms returned sat
[2020-06-03 06:31:10] [INFO ] Deduced a trap composed of 11 places in 140 ms
[2020-06-03 06:31:10] [INFO ] Deduced a trap composed of 14 places in 136 ms
[2020-06-03 06:31:10] [INFO ] Deduced a trap composed of 17 places in 139 ms
[2020-06-03 06:31:10] [INFO ] Deduced a trap composed of 119 places in 151 ms
[2020-06-03 06:31:10] [INFO ] Deduced a trap composed of 21 places in 147 ms
[2020-06-03 06:31:11] [INFO ] Deduced a trap composed of 17 places in 177 ms
[2020-06-03 06:31:11] [INFO ] Deduced a trap composed of 12 places in 123 ms
[2020-06-03 06:31:11] [INFO ] Deduced a trap composed of 130 places in 126 ms
[2020-06-03 06:31:11] [INFO ] Deduced a trap composed of 145 places in 137 ms
[2020-06-03 06:31:11] [INFO ] Deduced a trap composed of 27 places in 127 ms
[2020-06-03 06:31:11] [INFO ] Deduced a trap composed of 21 places in 124 ms
[2020-06-03 06:31:12] [INFO ] Deduced a trap composed of 121 places in 123 ms
[2020-06-03 06:31:12] [INFO ] Deduced a trap composed of 129 places in 122 ms
[2020-06-03 06:31:12] [INFO ] Deduced a trap composed of 131 places in 121 ms
[2020-06-03 06:31:12] [INFO ] Deduced a trap composed of 45 places in 124 ms
[2020-06-03 06:31:12] [INFO ] Deduced a trap composed of 126 places in 124 ms
[2020-06-03 06:31:12] [INFO ] Deduced a trap composed of 24 places in 117 ms
[2020-06-03 06:31:12] [INFO ] Deduced a trap composed of 142 places in 121 ms
[2020-06-03 06:31:13] [INFO ] Deduced a trap composed of 129 places in 121 ms
[2020-06-03 06:31:13] [INFO ] Deduced a trap composed of 145 places in 123 ms
[2020-06-03 06:31:13] [INFO ] Deduced a trap composed of 123 places in 127 ms
[2020-06-03 06:31:13] [INFO ] Deduced a trap composed of 130 places in 120 ms
[2020-06-03 06:31:13] [INFO ] Deduced a trap composed of 125 places in 117 ms
[2020-06-03 06:31:13] [INFO ] Deduced a trap composed of 126 places in 118 ms
[2020-06-03 06:31:13] [INFO ] Deduced a trap composed of 133 places in 118 ms
[2020-06-03 06:31:14] [INFO ] Deduced a trap composed of 45 places in 117 ms
[2020-06-03 06:31:14] [INFO ] Deduced a trap composed of 48 places in 116 ms
[2020-06-03 06:31:14] [INFO ] Deduced a trap composed of 49 places in 121 ms
[2020-06-03 06:31:14] [INFO ] Deduced a trap composed of 127 places in 115 ms
[2020-06-03 06:31:14] [INFO ] Deduced a trap composed of 123 places in 142 ms
[2020-06-03 06:31:14] [INFO ] Deduced a trap composed of 144 places in 143 ms
[2020-06-03 06:31:14] [INFO ] Deduced a trap composed of 48 places in 140 ms
[2020-06-03 06:31:15] [INFO ] Deduced a trap composed of 58 places in 139 ms
[2020-06-03 06:31:15] [INFO ] Deduced a trap composed of 133 places in 145 ms
[2020-06-03 06:31:15] [INFO ] Deduced a trap composed of 145 places in 137 ms
[2020-06-03 06:31:15] [INFO ] Deduced a trap composed of 127 places in 146 ms
[2020-06-03 06:31:15] [INFO ] Deduced a trap composed of 125 places in 145 ms
[2020-06-03 06:31:15] [INFO ] Deduced a trap composed of 135 places in 131 ms
[2020-06-03 06:31:16] [INFO ] Deduced a trap composed of 127 places in 117 ms
[2020-06-03 06:31:16] [INFO ] Deduced a trap composed of 145 places in 117 ms
[2020-06-03 06:31:16] [INFO ] Deduced a trap composed of 137 places in 125 ms
[2020-06-03 06:31:16] [INFO ] Deduced a trap composed of 125 places in 113 ms
[2020-06-03 06:31:16] [INFO ] Deduced a trap composed of 147 places in 116 ms
[2020-06-03 06:31:16] [INFO ] Deduced a trap composed of 138 places in 165 ms
[2020-06-03 06:31:17] [INFO ] Deduced a trap composed of 152 places in 147 ms
[2020-06-03 06:31:17] [INFO ] Deduced a trap composed of 131 places in 127 ms
[2020-06-03 06:31:17] [INFO ] Deduced a trap composed of 136 places in 128 ms
[2020-06-03 06:31:17] [INFO ] Deduced a trap composed of 151 places in 125 ms
[2020-06-03 06:31:17] [INFO ] Deduced a trap composed of 137 places in 124 ms
[2020-06-03 06:31:17] [INFO ] Deduced a trap composed of 148 places in 121 ms
[2020-06-03 06:31:17] [INFO ] Deduced a trap composed of 143 places in 120 ms
[2020-06-03 06:31:18] [INFO ] Deduced a trap composed of 141 places in 117 ms
[2020-06-03 06:31:18] [INFO ] Deduced a trap composed of 140 places in 106 ms
[2020-06-03 06:31:18] [INFO ] Deduced a trap composed of 56 places in 111 ms
[2020-06-03 06:31:18] [INFO ] Deduced a trap composed of 135 places in 110 ms
[2020-06-03 06:31:18] [INFO ] Deduced a trap composed of 139 places in 115 ms
[2020-06-03 06:31:18] [INFO ] Deduced a trap composed of 142 places in 116 ms
[2020-06-03 06:31:18] [INFO ] Deduced a trap composed of 142 places in 115 ms
[2020-06-03 06:31:19] [INFO ] Deduced a trap composed of 130 places in 114 ms
[2020-06-03 06:31:19] [INFO ] Deduced a trap composed of 126 places in 117 ms
[2020-06-03 06:31:19] [INFO ] Deduced a trap composed of 153 places in 121 ms
[2020-06-03 06:31:19] [INFO ] Deduced a trap composed of 131 places in 116 ms
[2020-06-03 06:31:19] [INFO ] Deduced a trap composed of 152 places in 116 ms
[2020-06-03 06:31:19] [INFO ] Deduced a trap composed of 122 places in 116 ms
[2020-06-03 06:31:19] [INFO ] Deduced a trap composed of 128 places in 122 ms
[2020-06-03 06:31:20] [INFO ] Deduced a trap composed of 131 places in 119 ms
[2020-06-03 06:31:20] [INFO ] Deduced a trap composed of 129 places in 114 ms
[2020-06-03 06:31:20] [INFO ] Deduced a trap composed of 136 places in 114 ms
[2020-06-03 06:31:20] [INFO ] Deduced a trap composed of 117 places in 113 ms
[2020-06-03 06:31:20] [INFO ] Deduced a trap composed of 22 places in 115 ms
[2020-06-03 06:31:20] [INFO ] Deduced a trap composed of 121 places in 113 ms
[2020-06-03 06:31:20] [INFO ] Deduced a trap composed of 126 places in 117 ms
[2020-06-03 06:31:21] [INFO ] Deduced a trap composed of 124 places in 134 ms
[2020-06-03 06:31:21] [INFO ] Deduced a trap composed of 121 places in 112 ms
[2020-06-03 06:31:21] [INFO ] Deduced a trap composed of 122 places in 111 ms
[2020-06-03 06:31:21] [INFO ] Deduced a trap composed of 126 places in 112 ms
[2020-06-03 06:31:21] [INFO ] Deduced a trap composed of 142 places in 114 ms
[2020-06-03 06:31:21] [INFO ] Deduced a trap composed of 151 places in 111 ms
[2020-06-03 06:31:21] [INFO ] Deduced a trap composed of 152 places in 111 ms
[2020-06-03 06:31:22] [INFO ] Deduced a trap composed of 131 places in 110 ms
[2020-06-03 06:31:22] [INFO ] Deduced a trap composed of 135 places in 127 ms
[2020-06-03 06:31:22] [INFO ] Deduced a trap composed of 51 places in 123 ms
[2020-06-03 06:31:22] [INFO ] Deduced a trap composed of 138 places in 116 ms
[2020-06-03 06:31:22] [INFO ] Deduced a trap composed of 139 places in 121 ms
[2020-06-03 06:31:22] [INFO ] Deduced a trap composed of 140 places in 122 ms
[2020-06-03 06:31:23] [INFO ] Deduced a trap composed of 152 places in 122 ms
[2020-06-03 06:31:23] [INFO ] Deduced a trap composed of 137 places in 117 ms
[2020-06-03 06:31:23] [INFO ] Deduced a trap composed of 57 places in 109 ms
[2020-06-03 06:31:23] [INFO ] Deduced a trap composed of 52 places in 120 ms
[2020-06-03 06:31:23] [INFO ] Deduced a trap composed of 49 places in 114 ms
[2020-06-03 06:31:23] [INFO ] Deduced a trap composed of 142 places in 114 ms
[2020-06-03 06:31:23] [INFO ] Deduced a trap composed of 153 places in 109 ms
[2020-06-03 06:31:24] [INFO ] Deduced a trap composed of 148 places in 114 ms
[2020-06-03 06:31:24] [INFO ] Deduced a trap composed of 143 places in 119 ms
[2020-06-03 06:31:24] [INFO ] Deduced a trap composed of 154 places in 122 ms
[2020-06-03 06:31:24] [INFO ] Deduced a trap composed of 143 places in 117 ms
[2020-06-03 06:31:24] [INFO ] Deduced a trap composed of 147 places in 114 ms
[2020-06-03 06:31:24] [INFO ] Deduced a trap composed of 146 places in 117 ms
[2020-06-03 06:31:24] [INFO ] Deduced a trap composed of 142 places in 115 ms
[2020-06-03 06:31:25] [INFO ] Deduced a trap composed of 139 places in 115 ms
[2020-06-03 06:31:25] [INFO ] Deduced a trap composed of 141 places in 119 ms
[2020-06-03 06:31:25] [INFO ] Deduced a trap composed of 140 places in 111 ms
[2020-06-03 06:31:25] [INFO ] Deduced a trap composed of 143 places in 115 ms
[2020-06-03 06:31:25] [INFO ] Deduced a trap composed of 143 places in 112 ms
[2020-06-03 06:31:25] [INFO ] Deduced a trap composed of 139 places in 115 ms
[2020-06-03 06:31:25] [INFO ] Deduced a trap composed of 142 places in 115 ms
[2020-06-03 06:31:26] [INFO ] Deduced a trap composed of 141 places in 119 ms
[2020-06-03 06:31:26] [INFO ] Deduced a trap composed of 144 places in 109 ms
[2020-06-03 06:31:26] [INFO ] Deduced a trap composed of 154 places in 211 ms
[2020-06-03 06:31:26] [INFO ] Deduced a trap composed of 156 places in 108 ms
[2020-06-03 06:31:26] [INFO ] Deduced a trap composed of 148 places in 111 ms
[2020-06-03 06:31:26] [INFO ] Deduced a trap composed of 149 places in 138 ms
[2020-06-03 06:31:27] [INFO ] Deduced a trap composed of 142 places in 136 ms
[2020-06-03 06:31:27] [INFO ] Deduced a trap composed of 150 places in 136 ms
[2020-06-03 06:31:27] [INFO ] Deduced a trap composed of 145 places in 112 ms
[2020-06-03 06:31:27] [INFO ] Deduced a trap composed of 147 places in 105 ms
[2020-06-03 06:31:27] [INFO ] Deduced a trap composed of 144 places in 118 ms
[2020-06-03 06:31:27] [INFO ] Deduced a trap composed of 139 places in 114 ms
[2020-06-03 06:31:27] [INFO ] Deduced a trap composed of 150 places in 111 ms
[2020-06-03 06:31:28] [INFO ] Deduced a trap composed of 141 places in 112 ms
[2020-06-03 06:31:28] [INFO ] Deduced a trap composed of 141 places in 113 ms
[2020-06-03 06:31:28] [INFO ] Deduced a trap composed of 142 places in 114 ms
[2020-06-03 06:31:28] [INFO ] Deduced a trap composed of 144 places in 112 ms
[2020-06-03 06:31:28] [INFO ] Deduced a trap composed of 148 places in 112 ms
[2020-06-03 06:31:28] [INFO ] Deduced a trap composed of 149 places in 108 ms
[2020-06-03 06:31:28] [INFO ] Deduced a trap composed of 151 places in 109 ms
[2020-06-03 06:31:29] [INFO ] Deduced a trap composed of 144 places in 109 ms
[2020-06-03 06:31:29] [INFO ] Deduced a trap composed of 18 places in 123 ms
[2020-06-03 06:31:29] [INFO ] Deduced a trap composed of 6 places in 274 ms
[2020-06-03 06:31:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s254) 0)") while checking expression at index 7
[2020-06-03 06:31:29] [INFO ] [Real]Absence check using 62 positive place invariants in 58 ms returned sat
[2020-06-03 06:31:29] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 23 ms returned sat
[2020-06-03 06:31:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:31:30] [INFO ] [Real]Absence check using state equation in 812 ms returned sat
[2020-06-03 06:31:30] [INFO ] Deduced a trap composed of 11 places in 98 ms
[2020-06-03 06:31:30] [INFO ] Deduced a trap composed of 18 places in 96 ms
[2020-06-03 06:31:30] [INFO ] Deduced a trap composed of 20 places in 120 ms
[2020-06-03 06:31:30] [INFO ] Deduced a trap composed of 17 places in 112 ms
[2020-06-03 06:31:31] [INFO ] Deduced a trap composed of 8 places in 92 ms
[2020-06-03 06:31:31] [INFO ] Deduced a trap composed of 15 places in 93 ms
[2020-06-03 06:31:31] [INFO ] Deduced a trap composed of 24 places in 130 ms
[2020-06-03 06:31:31] [INFO ] Deduced a trap composed of 22 places in 97 ms
[2020-06-03 06:31:31] [INFO ] Deduced a trap composed of 21 places in 91 ms
[2020-06-03 06:31:31] [INFO ] Deduced a trap composed of 20 places in 90 ms
[2020-06-03 06:31:31] [INFO ] Deduced a trap composed of 22 places in 93 ms
[2020-06-03 06:31:31] [INFO ] Deduced a trap composed of 21 places in 89 ms
[2020-06-03 06:31:32] [INFO ] Deduced a trap composed of 21 places in 87 ms
[2020-06-03 06:31:32] [INFO ] Deduced a trap composed of 39 places in 89 ms
[2020-06-03 06:31:32] [INFO ] Deduced a trap composed of 19 places in 87 ms
[2020-06-03 06:31:32] [INFO ] Deduced a trap composed of 26 places in 100 ms
[2020-06-03 06:31:32] [INFO ] Deduced a trap composed of 47 places in 81 ms
[2020-06-03 06:31:32] [INFO ] Deduced a trap composed of 33 places in 75 ms
[2020-06-03 06:31:32] [INFO ] Deduced a trap composed of 37 places in 75 ms
[2020-06-03 06:31:32] [INFO ] Deduced a trap composed of 49 places in 76 ms
[2020-06-03 06:31:32] [INFO ] Deduced a trap composed of 44 places in 76 ms
[2020-06-03 06:31:32] [INFO ] Deduced a trap composed of 24 places in 74 ms
[2020-06-03 06:31:33] [INFO ] Deduced a trap composed of 29 places in 85 ms
[2020-06-03 06:31:33] [INFO ] Deduced a trap composed of 43 places in 74 ms
[2020-06-03 06:31:33] [INFO ] Deduced a trap composed of 39 places in 51 ms
[2020-06-03 06:31:33] [INFO ] Deduced a trap composed of 43 places in 58 ms
[2020-06-03 06:31:33] [INFO ] Deduced a trap composed of 41 places in 50 ms
[2020-06-03 06:31:33] [INFO ] Deduced a trap composed of 48 places in 171 ms
[2020-06-03 06:31:33] [INFO ] Deduced a trap composed of 56 places in 93 ms
[2020-06-03 06:31:33] [INFO ] Deduced a trap composed of 54 places in 80 ms
[2020-06-03 06:31:33] [INFO ] Deduced a trap composed of 52 places in 81 ms
[2020-06-03 06:31:34] [INFO ] Deduced a trap composed of 72 places in 80 ms
[2020-06-03 06:31:34] [INFO ] Deduced a trap composed of 66 places in 81 ms
[2020-06-03 06:31:34] [INFO ] Deduced a trap composed of 70 places in 81 ms
[2020-06-03 06:31:34] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 3797 ms
[2020-06-03 06:31:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:31:34] [INFO ] [Nat]Absence check using 62 positive place invariants in 72 ms returned sat
[2020-06-03 06:31:34] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 24 ms returned sat
[2020-06-03 06:31:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:31:35] [INFO ] [Nat]Absence check using state equation in 787 ms returned sat
[2020-06-03 06:31:35] [INFO ] Deduced a trap composed of 8 places in 95 ms
[2020-06-03 06:31:35] [INFO ] Deduced a trap composed of 23 places in 104 ms
[2020-06-03 06:31:35] [INFO ] Deduced a trap composed of 20 places in 89 ms
[2020-06-03 06:31:35] [INFO ] Deduced a trap composed of 19 places in 91 ms
[2020-06-03 06:31:35] [INFO ] Deduced a trap composed of 11 places in 98 ms
[2020-06-03 06:31:35] [INFO ] Deduced a trap composed of 15 places in 88 ms
[2020-06-03 06:31:35] [INFO ] Deduced a trap composed of 24 places in 85 ms
[2020-06-03 06:31:36] [INFO ] Deduced a trap composed of 18 places in 86 ms
[2020-06-03 06:31:36] [INFO ] Deduced a trap composed of 25 places in 88 ms
[2020-06-03 06:31:36] [INFO ] Deduced a trap composed of 28 places in 84 ms
[2020-06-03 06:31:36] [INFO ] Deduced a trap composed of 22 places in 80 ms
[2020-06-03 06:31:36] [INFO ] Deduced a trap composed of 21 places in 82 ms
[2020-06-03 06:31:36] [INFO ] Deduced a trap composed of 29 places in 84 ms
[2020-06-03 06:31:36] [INFO ] Deduced a trap composed of 32 places in 95 ms
[2020-06-03 06:31:36] [INFO ] Deduced a trap composed of 26 places in 89 ms
[2020-06-03 06:31:36] [INFO ] Deduced a trap composed of 25 places in 73 ms
[2020-06-03 06:31:37] [INFO ] Deduced a trap composed of 47 places in 140 ms
[2020-06-03 06:31:37] [INFO ] Deduced a trap composed of 21 places in 70 ms
[2020-06-03 06:31:37] [INFO ] Deduced a trap composed of 33 places in 68 ms
[2020-06-03 06:31:37] [INFO ] Deduced a trap composed of 49 places in 65 ms
[2020-06-03 06:31:37] [INFO ] Deduced a trap composed of 36 places in 49 ms
[2020-06-03 06:31:37] [INFO ] Deduced a trap composed of 42 places in 43 ms
[2020-06-03 06:31:37] [INFO ] Deduced a trap composed of 41 places in 44 ms
[2020-06-03 06:31:37] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 2387 ms
[2020-06-03 06:31:37] [INFO ] Computed and/alt/rep : 575/2602/575 causal constraints in 22 ms.
[2020-06-03 06:31:41] [INFO ] Added : 403 causal constraints over 82 iterations in 4303 ms. Result :sat
[2020-06-03 06:31:42] [INFO ] [Real]Absence check using 62 positive place invariants in 36 ms returned sat
[2020-06-03 06:31:42] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 22 ms returned sat
[2020-06-03 06:31:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:31:42] [INFO ] [Real]Absence check using state equation in 777 ms returned sat
[2020-06-03 06:31:43] [INFO ] Deduced a trap composed of 10 places in 170 ms
[2020-06-03 06:31:43] [INFO ] Deduced a trap composed of 16 places in 167 ms
[2020-06-03 06:31:43] [INFO ] Deduced a trap composed of 8 places in 164 ms
[2020-06-03 06:31:43] [INFO ] Deduced a trap composed of 18 places in 168 ms
[2020-06-03 06:31:43] [INFO ] Deduced a trap composed of 11 places in 168 ms
[2020-06-03 06:31:43] [INFO ] Deduced a trap composed of 29 places in 163 ms
[2020-06-03 06:31:44] [INFO ] Deduced a trap composed of 117 places in 162 ms
[2020-06-03 06:31:44] [INFO ] Deduced a trap composed of 20 places in 158 ms
[2020-06-03 06:31:44] [INFO ] Deduced a trap composed of 31 places in 156 ms
[2020-06-03 06:31:44] [INFO ] Deduced a trap composed of 120 places in 154 ms
[2020-06-03 06:31:44] [INFO ] Deduced a trap composed of 32 places in 152 ms
[2020-06-03 06:31:45] [INFO ] Deduced a trap composed of 28 places in 154 ms
[2020-06-03 06:31:45] [INFO ] Deduced a trap composed of 12 places in 150 ms
[2020-06-03 06:31:45] [INFO ] Deduced a trap composed of 28 places in 149 ms
[2020-06-03 06:31:45] [INFO ] Deduced a trap composed of 34 places in 151 ms
[2020-06-03 06:31:45] [INFO ] Deduced a trap composed of 21 places in 155 ms
[2020-06-03 06:31:45] [INFO ] Deduced a trap composed of 26 places in 149 ms
[2020-06-03 06:31:46] [INFO ] Deduced a trap composed of 25 places in 148 ms
[2020-06-03 06:31:46] [INFO ] Deduced a trap composed of 116 places in 139 ms
[2020-06-03 06:31:46] [INFO ] Deduced a trap composed of 23 places in 81 ms
[2020-06-03 06:31:46] [INFO ] Deduced a trap composed of 30 places in 80 ms
[2020-06-03 06:31:46] [INFO ] Deduced a trap composed of 33 places in 80 ms
[2020-06-03 06:31:46] [INFO ] Deduced a trap composed of 60 places in 133 ms
[2020-06-03 06:31:46] [INFO ] Deduced a trap composed of 47 places in 137 ms
[2020-06-03 06:31:47] [INFO ] Deduced a trap composed of 122 places in 139 ms
[2020-06-03 06:31:47] [INFO ] Deduced a trap composed of 32 places in 137 ms
[2020-06-03 06:31:47] [INFO ] Deduced a trap composed of 47 places in 137 ms
[2020-06-03 06:31:47] [INFO ] Deduced a trap composed of 50 places in 142 ms
[2020-06-03 06:31:47] [INFO ] Deduced a trap composed of 26 places in 140 ms
[2020-06-03 06:31:47] [INFO ] Deduced a trap composed of 23 places in 127 ms
[2020-06-03 06:31:48] [INFO ] Deduced a trap composed of 38 places in 124 ms
[2020-06-03 06:31:48] [INFO ] Deduced a trap composed of 121 places in 120 ms
[2020-06-03 06:31:48] [INFO ] Deduced a trap composed of 34 places in 117 ms
[2020-06-03 06:31:48] [INFO ] Deduced a trap composed of 128 places in 121 ms
[2020-06-03 06:31:48] [INFO ] Deduced a trap composed of 47 places in 123 ms
[2020-06-03 06:31:48] [INFO ] Deduced a trap composed of 43 places in 119 ms
[2020-06-03 06:31:48] [INFO ] Deduced a trap composed of 128 places in 123 ms
[2020-06-03 06:31:49] [INFO ] Deduced a trap composed of 122 places in 122 ms
[2020-06-03 06:31:49] [INFO ] Deduced a trap composed of 121 places in 125 ms
[2020-06-03 06:31:49] [INFO ] Deduced a trap composed of 133 places in 122 ms
[2020-06-03 06:31:49] [INFO ] Deduced a trap composed of 123 places in 118 ms
[2020-06-03 06:31:49] [INFO ] Deduced a trap composed of 32 places in 34 ms
[2020-06-03 06:31:49] [INFO ] Deduced a trap composed of 52 places in 77 ms
[2020-06-03 06:31:49] [INFO ] Deduced a trap composed of 58 places in 78 ms
[2020-06-03 06:31:49] [INFO ] Trap strengthening (SAT) tested/added 45/44 trap constraints in 6964 ms
[2020-06-03 06:31:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:31:49] [INFO ] [Nat]Absence check using 62 positive place invariants in 66 ms returned sat
[2020-06-03 06:31:49] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 22 ms returned sat
[2020-06-03 06:31:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:31:50] [INFO ] [Nat]Absence check using state equation in 809 ms returned sat
[2020-06-03 06:31:50] [INFO ] Deduced a trap composed of 11 places in 167 ms
[2020-06-03 06:31:51] [INFO ] Deduced a trap composed of 123 places in 165 ms
[2020-06-03 06:31:51] [INFO ] Deduced a trap composed of 15 places in 160 ms
[2020-06-03 06:31:51] [INFO ] Deduced a trap composed of 29 places in 160 ms
[2020-06-03 06:31:51] [INFO ] Deduced a trap composed of 8 places in 160 ms
[2020-06-03 06:31:51] [INFO ] Deduced a trap composed of 17 places in 147 ms
[2020-06-03 06:31:52] [INFO ] Deduced a trap composed of 129 places in 159 ms
[2020-06-03 06:31:52] [INFO ] Deduced a trap composed of 16 places in 153 ms
[2020-06-03 06:31:52] [INFO ] Deduced a trap composed of 35 places in 152 ms
[2020-06-03 06:31:52] [INFO ] Deduced a trap composed of 11 places in 149 ms
[2020-06-03 06:31:52] [INFO ] Deduced a trap composed of 18 places in 150 ms
[2020-06-03 06:31:52] [INFO ] Deduced a trap composed of 32 places in 153 ms
[2020-06-03 06:31:53] [INFO ] Deduced a trap composed of 16 places in 158 ms
[2020-06-03 06:31:53] [INFO ] Deduced a trap composed of 21 places in 153 ms
[2020-06-03 06:31:53] [INFO ] Deduced a trap composed of 23 places in 160 ms
[2020-06-03 06:31:53] [INFO ] Deduced a trap composed of 20 places in 147 ms
[2020-06-03 06:31:53] [INFO ] Deduced a trap composed of 41 places in 151 ms
[2020-06-03 06:31:54] [INFO ] Deduced a trap composed of 120 places in 150 ms
[2020-06-03 06:31:54] [INFO ] Deduced a trap composed of 26 places in 147 ms
[2020-06-03 06:31:54] [INFO ] Deduced a trap composed of 36 places in 86 ms
[2020-06-03 06:31:54] [INFO ] Deduced a trap composed of 20 places in 86 ms
[2020-06-03 06:31:54] [INFO ] Deduced a trap composed of 36 places in 86 ms
[2020-06-03 06:31:54] [INFO ] Deduced a trap composed of 29 places in 76 ms
[2020-06-03 06:31:54] [INFO ] Deduced a trap composed of 26 places in 77 ms
[2020-06-03 06:31:54] [INFO ] Deduced a trap composed of 37 places in 74 ms
[2020-06-03 06:31:54] [INFO ] Deduced a trap composed of 23 places in 75 ms
[2020-06-03 06:31:54] [INFO ] Deduced a trap composed of 32 places in 75 ms
[2020-06-03 06:31:55] [INFO ] Deduced a trap composed of 22 places in 78 ms
[2020-06-03 06:31:55] [INFO ] Deduced a trap composed of 36 places in 76 ms
[2020-06-03 06:31:55] [INFO ] Deduced a trap composed of 30 places in 75 ms
[2020-06-03 06:31:55] [INFO ] Deduced a trap composed of 37 places in 75 ms
[2020-06-03 06:31:55] [INFO ] Deduced a trap composed of 40 places in 73 ms
[2020-06-03 06:31:55] [INFO ] Deduced a trap composed of 40 places in 72 ms
[2020-06-03 06:31:55] [INFO ] Deduced a trap composed of 24 places in 74 ms
[2020-06-03 06:31:55] [INFO ] Deduced a trap composed of 24 places in 71 ms
[2020-06-03 06:31:55] [INFO ] Deduced a trap composed of 20 places in 70 ms
[2020-06-03 06:31:55] [INFO ] Deduced a trap composed of 39 places in 74 ms
[2020-06-03 06:31:56] [INFO ] Deduced a trap composed of 30 places in 72 ms
[2020-06-03 06:31:56] [INFO ] Deduced a trap composed of 34 places in 72 ms
[2020-06-03 06:31:56] [INFO ] Deduced a trap composed of 27 places in 70 ms
[2020-06-03 06:31:56] [INFO ] Deduced a trap composed of 40 places in 69 ms
[2020-06-03 06:31:56] [INFO ] Deduced a trap composed of 43 places in 73 ms
[2020-06-03 06:31:56] [INFO ] Deduced a trap composed of 21 places in 74 ms
[2020-06-03 06:31:56] [INFO ] Deduced a trap composed of 24 places in 70 ms
[2020-06-03 06:31:56] [INFO ] Deduced a trap composed of 43 places in 71 ms
[2020-06-03 06:31:56] [INFO ] Deduced a trap composed of 54 places in 73 ms
[2020-06-03 06:31:56] [INFO ] Deduced a trap composed of 32 places in 71 ms
[2020-06-03 06:31:56] [INFO ] Deduced a trap composed of 45 places in 72 ms
[2020-06-03 06:31:57] [INFO ] Deduced a trap composed of 43 places in 72 ms
[2020-06-03 06:31:57] [INFO ] Deduced a trap composed of 46 places in 70 ms
[2020-06-03 06:31:57] [INFO ] Deduced a trap composed of 41 places in 67 ms
[2020-06-03 06:31:57] [INFO ] Deduced a trap composed of 58 places in 64 ms
[2020-06-03 06:31:57] [INFO ] Deduced a trap composed of 61 places in 64 ms
[2020-06-03 06:31:57] [INFO ] Deduced a trap composed of 55 places in 70 ms
[2020-06-03 06:31:57] [INFO ] Deduced a trap composed of 37 places in 68 ms
[2020-06-03 06:31:57] [INFO ] Deduced a trap composed of 55 places in 72 ms
[2020-06-03 06:31:57] [INFO ] Deduced a trap composed of 24 places in 76 ms
[2020-06-03 06:31:57] [INFO ] Deduced a trap composed of 30 places in 72 ms
[2020-06-03 06:31:57] [INFO ] Deduced a trap composed of 39 places in 72 ms
[2020-06-03 06:31:58] [INFO ] Deduced a trap composed of 30 places in 72 ms
[2020-06-03 06:31:58] [INFO ] Deduced a trap composed of 29 places in 69 ms
[2020-06-03 06:31:58] [INFO ] Deduced a trap composed of 31 places in 66 ms
[2020-06-03 06:31:58] [INFO ] Deduced a trap composed of 45 places in 64 ms
[2020-06-03 06:31:58] [INFO ] Deduced a trap composed of 42 places in 66 ms
[2020-06-03 06:31:58] [INFO ] Deduced a trap composed of 54 places in 66 ms
[2020-06-03 06:31:58] [INFO ] Deduced a trap composed of 66 places in 65 ms
[2020-06-03 06:31:58] [INFO ] Deduced a trap composed of 28 places in 57 ms
[2020-06-03 06:31:58] [INFO ] Deduced a trap composed of 33 places in 56 ms
[2020-06-03 06:31:58] [INFO ] Deduced a trap composed of 39 places in 58 ms
[2020-06-03 06:31:58] [INFO ] Deduced a trap composed of 54 places in 62 ms
[2020-06-03 06:31:58] [INFO ] Deduced a trap composed of 62 places in 75 ms
[2020-06-03 06:31:59] [INFO ] Deduced a trap composed of 22 places in 30 ms
[2020-06-03 06:31:59] [INFO ] Deduced a trap composed of 46 places in 68 ms
[2020-06-03 06:31:59] [INFO ] Deduced a trap composed of 15 places in 31 ms
[2020-06-03 06:31:59] [INFO ] Trap strengthening (SAT) tested/added 75/74 trap constraints in 8408 ms
[2020-06-03 06:31:59] [INFO ] Computed and/alt/rep : 575/2602/575 causal constraints in 27 ms.
[2020-06-03 06:32:03] [INFO ] Added : 400 causal constraints over 81 iterations in 4505 ms. Result :sat
[2020-06-03 06:32:03] [INFO ] Deduced a trap composed of 46 places in 35 ms
[2020-06-03 06:32:03] [INFO ] Deduced a trap composed of 42 places in 28 ms
[2020-06-03 06:32:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 274 ms
[2020-06-03 06:32:04] [INFO ] [Real]Absence check using 62 positive place invariants in 35 ms returned sat
[2020-06-03 06:32:04] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 22 ms returned sat
[2020-06-03 06:32:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:32:04] [INFO ] [Real]Absence check using state equation in 773 ms returned sat
[2020-06-03 06:32:05] [INFO ] Deduced a trap composed of 16 places in 171 ms
[2020-06-03 06:32:05] [INFO ] Deduced a trap composed of 8 places in 160 ms
[2020-06-03 06:32:05] [INFO ] Deduced a trap composed of 12 places in 196 ms
[2020-06-03 06:32:05] [INFO ] Deduced a trap composed of 26 places in 189 ms
[2020-06-03 06:32:05] [INFO ] Deduced a trap composed of 21 places in 184 ms
[2020-06-03 06:32:06] [INFO ] Deduced a trap composed of 18 places in 183 ms
[2020-06-03 06:32:06] [INFO ] Deduced a trap composed of 23 places in 180 ms
[2020-06-03 06:32:06] [INFO ] Deduced a trap composed of 16 places in 179 ms
[2020-06-03 06:32:06] [INFO ] Deduced a trap composed of 17 places in 183 ms
[2020-06-03 06:32:06] [INFO ] Deduced a trap composed of 19 places in 189 ms
[2020-06-03 06:32:07] [INFO ] Deduced a trap composed of 33 places in 196 ms
[2020-06-03 06:32:07] [INFO ] Deduced a trap composed of 32 places in 180 ms
[2020-06-03 06:32:07] [INFO ] Deduced a trap composed of 33 places in 199 ms
[2020-06-03 06:32:07] [INFO ] Deduced a trap composed of 124 places in 187 ms
[2020-06-03 06:32:08] [INFO ] Deduced a trap composed of 29 places in 195 ms
[2020-06-03 06:32:08] [INFO ] Deduced a trap composed of 21 places in 193 ms
[2020-06-03 06:32:08] [INFO ] Deduced a trap composed of 27 places in 213 ms
[2020-06-03 06:32:08] [INFO ] Deduced a trap composed of 27 places in 170 ms
[2020-06-03 06:32:08] [INFO ] Deduced a trap composed of 139 places in 306 ms
[2020-06-03 06:32:09] [INFO ] Deduced a trap composed of 36 places in 160 ms
[2020-06-03 06:32:09] [INFO ] Deduced a trap composed of 22 places in 173 ms
[2020-06-03 06:32:09] [INFO ] Deduced a trap composed of 22 places in 155 ms
[2020-06-03 06:32:09] [INFO ] Deduced a trap composed of 26 places in 133 ms
[2020-06-03 06:32:09] [INFO ] Deduced a trap composed of 39 places in 98 ms
[2020-06-03 06:32:09] [INFO ] Deduced a trap composed of 35 places in 101 ms
[2020-06-03 06:32:10] [INFO ] Deduced a trap composed of 15 places in 124 ms
[2020-06-03 06:32:10] [INFO ] Deduced a trap composed of 39 places in 132 ms
[2020-06-03 06:32:10] [INFO ] Deduced a trap composed of 40 places in 112 ms
[2020-06-03 06:32:10] [INFO ] Deduced a trap composed of 18 places in 100 ms
[2020-06-03 06:32:10] [INFO ] Deduced a trap composed of 42 places in 92 ms
[2020-06-03 06:32:10] [INFO ] Deduced a trap composed of 17 places in 85 ms
[2020-06-03 06:32:10] [INFO ] Deduced a trap composed of 29 places in 86 ms
[2020-06-03 06:32:10] [INFO ] Deduced a trap composed of 27 places in 86 ms
[2020-06-03 06:32:11] [INFO ] Deduced a trap composed of 19 places in 78 ms
[2020-06-03 06:32:11] [INFO ] Deduced a trap composed of 42 places in 74 ms
[2020-06-03 06:32:11] [INFO ] Deduced a trap composed of 43 places in 57 ms
[2020-06-03 06:32:11] [INFO ] Deduced a trap composed of 32 places in 51 ms
[2020-06-03 06:32:11] [INFO ] Deduced a trap composed of 35 places in 57 ms
[2020-06-03 06:32:11] [INFO ] Deduced a trap composed of 38 places in 57 ms
[2020-06-03 06:32:11] [INFO ] Deduced a trap composed of 43 places in 45 ms
[2020-06-03 06:32:11] [INFO ] Deduced a trap composed of 30 places in 46 ms
[2020-06-03 06:32:11] [INFO ] Deduced a trap composed of 42 places in 43 ms
[2020-06-03 06:32:11] [INFO ] Trap strengthening (SAT) tested/added 43/42 trap constraints in 6835 ms
[2020-06-03 06:32:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:32:11] [INFO ] [Nat]Absence check using 62 positive place invariants in 67 ms returned sat
[2020-06-03 06:32:11] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 22 ms returned sat
[2020-06-03 06:32:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:32:12] [INFO ] [Nat]Absence check using state equation in 810 ms returned sat
[2020-06-03 06:32:12] [INFO ] Deduced a trap composed of 8 places in 94 ms
[2020-06-03 06:32:12] [INFO ] Deduced a trap composed of 11 places in 104 ms
[2020-06-03 06:32:13] [INFO ] Deduced a trap composed of 21 places in 94 ms
[2020-06-03 06:32:13] [INFO ] Deduced a trap composed of 19 places in 96 ms
[2020-06-03 06:32:13] [INFO ] Deduced a trap composed of 26 places in 94 ms
[2020-06-03 06:32:13] [INFO ] Deduced a trap composed of 19 places in 96 ms
[2020-06-03 06:32:13] [INFO ] Deduced a trap composed of 20 places in 90 ms
[2020-06-03 06:32:13] [INFO ] Deduced a trap composed of 26 places in 102 ms
[2020-06-03 06:32:13] [INFO ] Deduced a trap composed of 40 places in 107 ms
[2020-06-03 06:32:13] [INFO ] Deduced a trap composed of 37 places in 92 ms
[2020-06-03 06:32:13] [INFO ] Deduced a trap composed of 24 places in 87 ms
[2020-06-03 06:32:14] [INFO ] Deduced a trap composed of 38 places in 87 ms
[2020-06-03 06:32:14] [INFO ] Deduced a trap composed of 44 places in 86 ms
[2020-06-03 06:32:14] [INFO ] Deduced a trap composed of 48 places in 82 ms
[2020-06-03 06:32:14] [INFO ] Deduced a trap composed of 30 places in 69 ms
[2020-06-03 06:32:14] [INFO ] Deduced a trap composed of 43 places in 66 ms
[2020-06-03 06:32:14] [INFO ] Deduced a trap composed of 43 places in 82 ms
[2020-06-03 06:32:14] [INFO ] Deduced a trap composed of 18 places in 82 ms
[2020-06-03 06:32:14] [INFO ] Deduced a trap composed of 42 places in 79 ms
[2020-06-03 06:32:14] [INFO ] Deduced a trap composed of 45 places in 70 ms
[2020-06-03 06:32:14] [INFO ] Deduced a trap composed of 18 places in 63 ms
[2020-06-03 06:32:14] [INFO ] Deduced a trap composed of 43 places in 66 ms
[2020-06-03 06:32:15] [INFO ] Deduced a trap composed of 36 places in 68 ms
[2020-06-03 06:32:15] [INFO ] Deduced a trap composed of 32 places in 67 ms
[2020-06-03 06:32:15] [INFO ] Deduced a trap composed of 38 places in 66 ms
[2020-06-03 06:32:15] [INFO ] Deduced a trap composed of 39 places in 68 ms
[2020-06-03 06:32:15] [INFO ] Deduced a trap composed of 28 places in 138 ms
[2020-06-03 06:32:15] [INFO ] Deduced a trap composed of 46 places in 70 ms
[2020-06-03 06:32:15] [INFO ] Deduced a trap composed of 21 places in 75 ms
[2020-06-03 06:32:15] [INFO ] Deduced a trap composed of 38 places in 71 ms
[2020-06-03 06:32:15] [INFO ] Deduced a trap composed of 47 places in 71 ms
[2020-06-03 06:32:15] [INFO ] Deduced a trap composed of 28 places in 78 ms
[2020-06-03 06:32:16] [INFO ] Deduced a trap composed of 25 places in 75 ms
[2020-06-03 06:32:16] [INFO ] Deduced a trap composed of 43 places in 76 ms
[2020-06-03 06:32:16] [INFO ] Deduced a trap composed of 26 places in 77 ms
[2020-06-03 06:32:16] [INFO ] Deduced a trap composed of 47 places in 74 ms
[2020-06-03 06:32:16] [INFO ] Deduced a trap composed of 39 places in 52 ms
[2020-06-03 06:32:16] [INFO ] Deduced a trap composed of 43 places in 40 ms
[2020-06-03 06:32:16] [INFO ] Deduced a trap composed of 34 places in 40 ms
[2020-06-03 06:32:16] [INFO ] Deduced a trap composed of 43 places in 38 ms
[2020-06-03 06:32:16] [INFO ] Deduced a trap composed of 43 places in 39 ms
[2020-06-03 06:32:16] [INFO ] Deduced a trap composed of 42 places in 37 ms
[2020-06-03 06:32:16] [INFO ] Trap strengthening (SAT) tested/added 43/42 trap constraints in 4019 ms
[2020-06-03 06:32:16] [INFO ] Computed and/alt/rep : 575/2602/575 causal constraints in 25 ms.
[2020-06-03 06:32:20] [INFO ] Added : 350 causal constraints over 70 iterations in 3340 ms. Result :sat
[2020-06-03 06:32:20] [INFO ] [Real]Absence check using 62 positive place invariants in 36 ms returned sat
[2020-06-03 06:32:20] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 22 ms returned sat
[2020-06-03 06:32:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:32:20] [INFO ] [Real]Absence check using state equation in 755 ms returned sat
[2020-06-03 06:32:21] [INFO ] Deduced a trap composed of 14 places in 177 ms
[2020-06-03 06:32:21] [INFO ] Deduced a trap composed of 16 places in 168 ms
[2020-06-03 06:32:21] [INFO ] Deduced a trap composed of 51 places in 163 ms
[2020-06-03 06:32:21] [INFO ] Deduced a trap composed of 22 places in 164 ms
[2020-06-03 06:32:21] [INFO ] Deduced a trap composed of 125 places in 163 ms
[2020-06-03 06:32:22] [INFO ] Deduced a trap composed of 133 places in 166 ms
[2020-06-03 06:32:22] [INFO ] Deduced a trap composed of 37 places in 161 ms
[2020-06-03 06:32:22] [INFO ] Deduced a trap composed of 123 places in 161 ms
[2020-06-03 06:32:22] [INFO ] Deduced a trap composed of 141 places in 163 ms
[2020-06-03 06:32:22] [INFO ] Deduced a trap composed of 141 places in 161 ms
[2020-06-03 06:32:23] [INFO ] Deduced a trap composed of 137 places in 156 ms
[2020-06-03 06:32:23] [INFO ] Deduced a trap composed of 11 places in 155 ms
[2020-06-03 06:32:23] [INFO ] Deduced a trap composed of 139 places in 160 ms
[2020-06-03 06:32:23] [INFO ] Deduced a trap composed of 143 places in 159 ms
[2020-06-03 06:32:23] [INFO ] Deduced a trap composed of 140 places in 158 ms
[2020-06-03 06:32:23] [INFO ] Deduced a trap composed of 146 places in 150 ms
[2020-06-03 06:32:24] [INFO ] Deduced a trap composed of 143 places in 151 ms
[2020-06-03 06:32:24] [INFO ] Deduced a trap composed of 149 places in 152 ms
[2020-06-03 06:32:24] [INFO ] Deduced a trap composed of 145 places in 158 ms
[2020-06-03 06:32:24] [INFO ] Deduced a trap composed of 145 places in 156 ms
[2020-06-03 06:32:24] [INFO ] Deduced a trap composed of 140 places in 163 ms
[2020-06-03 06:32:25] [INFO ] Deduced a trap composed of 20 places in 156 ms
[2020-06-03 06:32:25] [INFO ] Deduced a trap composed of 29 places in 152 ms
[2020-06-03 06:32:25] [INFO ] Deduced a trap composed of 145 places in 151 ms
[2020-06-03 06:32:25] [INFO ] Deduced a trap composed of 145 places in 151 ms
[2020-06-03 06:32:25] [INFO ] Deduced a trap composed of 127 places in 155 ms
[2020-06-03 06:32:25] [INFO ] Deduced a trap composed of 25 places in 145 ms
[2020-06-03 06:32:26] [INFO ] Deduced a trap composed of 26 places in 150 ms
[2020-06-03 06:32:26] [INFO ] Deduced a trap composed of 134 places in 134 ms
[2020-06-03 06:32:26] [INFO ] Deduced a trap composed of 141 places in 148 ms
[2020-06-03 06:32:26] [INFO ] Deduced a trap composed of 151 places in 148 ms
[2020-06-03 06:32:26] [INFO ] Deduced a trap composed of 142 places in 147 ms
[2020-06-03 06:32:27] [INFO ] Deduced a trap composed of 150 places in 148 ms
[2020-06-03 06:32:27] [INFO ] Deduced a trap composed of 28 places in 145 ms
[2020-06-03 06:32:27] [INFO ] Deduced a trap composed of 139 places in 150 ms
[2020-06-03 06:32:27] [INFO ] Deduced a trap composed of 139 places in 145 ms
[2020-06-03 06:32:27] [INFO ] Deduced a trap composed of 141 places in 147 ms
[2020-06-03 06:32:27] [INFO ] Deduced a trap composed of 139 places in 145 ms
[2020-06-03 06:32:28] [INFO ] Deduced a trap composed of 147 places in 144 ms
[2020-06-03 06:32:28] [INFO ] Deduced a trap composed of 138 places in 143 ms
[2020-06-03 06:32:28] [INFO ] Deduced a trap composed of 141 places in 139 ms
[2020-06-03 06:32:28] [INFO ] Deduced a trap composed of 143 places in 140 ms
[2020-06-03 06:32:28] [INFO ] Deduced a trap composed of 54 places in 134 ms
[2020-06-03 06:32:28] [INFO ] Deduced a trap composed of 146 places in 146 ms
[2020-06-03 06:32:29] [INFO ] Deduced a trap composed of 145 places in 149 ms
[2020-06-03 06:32:29] [INFO ] Deduced a trap composed of 141 places in 145 ms
[2020-06-03 06:32:29] [INFO ] Deduced a trap composed of 140 places in 142 ms
[2020-06-03 06:32:29] [INFO ] Deduced a trap composed of 141 places in 140 ms
[2020-06-03 06:32:29] [INFO ] Deduced a trap composed of 144 places in 144 ms
[2020-06-03 06:32:29] [INFO ] Deduced a trap composed of 140 places in 139 ms
[2020-06-03 06:32:30] [INFO ] Deduced a trap composed of 132 places in 141 ms
[2020-06-03 06:32:30] [INFO ] Deduced a trap composed of 150 places in 142 ms
[2020-06-03 06:32:30] [INFO ] Deduced a trap composed of 140 places in 141 ms
[2020-06-03 06:32:30] [INFO ] Deduced a trap composed of 129 places in 128 ms
[2020-06-03 06:32:30] [INFO ] Deduced a trap composed of 56 places in 129 ms
[2020-06-03 06:32:30] [INFO ] Deduced a trap composed of 134 places in 127 ms
[2020-06-03 06:32:31] [INFO ] Deduced a trap composed of 131 places in 127 ms
[2020-06-03 06:32:31] [INFO ] Deduced a trap composed of 143 places in 147 ms
[2020-06-03 06:32:31] [INFO ] Deduced a trap composed of 139 places in 143 ms
[2020-06-03 06:32:31] [INFO ] Deduced a trap composed of 135 places in 136 ms
[2020-06-03 06:32:31] [INFO ] Deduced a trap composed of 136 places in 127 ms
[2020-06-03 06:32:31] [INFO ] Deduced a trap composed of 145 places in 136 ms
[2020-06-03 06:32:32] [INFO ] Deduced a trap composed of 140 places in 134 ms
[2020-06-03 06:32:32] [INFO ] Deduced a trap composed of 142 places in 133 ms
[2020-06-03 06:32:32] [INFO ] Deduced a trap composed of 147 places in 136 ms
[2020-06-03 06:32:32] [INFO ] Deduced a trap composed of 150 places in 141 ms
[2020-06-03 06:32:32] [INFO ] Deduced a trap composed of 148 places in 136 ms
[2020-06-03 06:32:32] [INFO ] Deduced a trap composed of 149 places in 134 ms
[2020-06-03 06:32:32] [INFO ] Deduced a trap composed of 147 places in 129 ms
[2020-06-03 06:32:33] [INFO ] Deduced a trap composed of 152 places in 133 ms
[2020-06-03 06:32:33] [INFO ] Deduced a trap composed of 142 places in 128 ms
[2020-06-03 06:32:33] [INFO ] Deduced a trap composed of 148 places in 146 ms
[2020-06-03 06:32:33] [INFO ] Deduced a trap composed of 154 places in 122 ms
[2020-06-03 06:32:33] [INFO ] Deduced a trap composed of 147 places in 124 ms
[2020-06-03 06:32:33] [INFO ] Deduced a trap composed of 18 places in 134 ms
[2020-06-03 06:32:34] [INFO ] Deduced a trap composed of 155 places in 137 ms
[2020-06-03 06:32:34] [INFO ] Deduced a trap composed of 159 places in 133 ms
[2020-06-03 06:32:34] [INFO ] Deduced a trap composed of 144 places in 133 ms
[2020-06-03 06:32:34] [INFO ] Deduced a trap composed of 145 places in 125 ms
[2020-06-03 06:32:34] [INFO ] Deduced a trap composed of 154 places in 136 ms
[2020-06-03 06:32:34] [INFO ] Deduced a trap composed of 154 places in 133 ms
[2020-06-03 06:32:35] [INFO ] Deduced a trap composed of 140 places in 121 ms
[2020-06-03 06:32:35] [INFO ] Deduced a trap composed of 145 places in 118 ms
[2020-06-03 06:32:35] [INFO ] Deduced a trap composed of 155 places in 131 ms
[2020-06-03 06:32:35] [INFO ] Deduced a trap composed of 156 places in 123 ms
[2020-06-03 06:32:35] [INFO ] Deduced a trap composed of 153 places in 117 ms
[2020-06-03 06:32:35] [INFO ] Deduced a trap composed of 152 places in 118 ms
[2020-06-03 06:32:35] [INFO ] Deduced a trap composed of 146 places in 117 ms
[2020-06-03 06:32:36] [INFO ] Deduced a trap composed of 156 places in 131 ms
[2020-06-03 06:32:36] [INFO ] Deduced a trap composed of 156 places in 126 ms
[2020-06-03 06:32:36] [INFO ] Deduced a trap composed of 162 places in 119 ms
[2020-06-03 06:32:36] [INFO ] Deduced a trap composed of 149 places in 115 ms
[2020-06-03 06:32:36] [INFO ] Deduced a trap composed of 149 places in 120 ms
[2020-06-03 06:32:36] [INFO ] Deduced a trap composed of 143 places in 119 ms
[2020-06-03 06:32:36] [INFO ] Deduced a trap composed of 159 places in 130 ms
[2020-06-03 06:32:37] [INFO ] Deduced a trap composed of 160 places in 130 ms
[2020-06-03 06:32:37] [INFO ] Deduced a trap composed of 141 places in 121 ms
[2020-06-03 06:32:37] [INFO ] Deduced a trap composed of 153 places in 119 ms
[2020-06-03 06:32:37] [INFO ] Deduced a trap composed of 50 places in 116 ms
[2020-06-03 06:32:37] [INFO ] Deduced a trap composed of 56 places in 114 ms
[2020-06-03 06:32:37] [INFO ] Deduced a trap composed of 160 places in 116 ms
[2020-06-03 06:32:37] [INFO ] Deduced a trap composed of 152 places in 132 ms
[2020-06-03 06:32:38] [INFO ] Deduced a trap composed of 146 places in 115 ms
[2020-06-03 06:32:38] [INFO ] Deduced a trap composed of 154 places in 125 ms
[2020-06-03 06:32:38] [INFO ] Deduced a trap composed of 150 places in 128 ms
[2020-06-03 06:32:38] [INFO ] Deduced a trap composed of 147 places in 127 ms
[2020-06-03 06:32:38] [INFO ] Deduced a trap composed of 152 places in 114 ms
[2020-06-03 06:32:38] [INFO ] Deduced a trap composed of 152 places in 128 ms
[2020-06-03 06:32:39] [INFO ] Deduced a trap composed of 149 places in 124 ms
[2020-06-03 06:32:39] [INFO ] Deduced a trap composed of 150 places in 130 ms
[2020-06-03 06:32:39] [INFO ] Deduced a trap composed of 158 places in 115 ms
[2020-06-03 06:32:39] [INFO ] Deduced a trap composed of 143 places in 114 ms
[2020-06-03 06:32:39] [INFO ] Deduced a trap composed of 138 places in 118 ms
[2020-06-03 06:32:39] [INFO ] Deduced a trap composed of 145 places in 114 ms
[2020-06-03 06:32:39] [INFO ] Trap strengthening (SAT) tested/added 115/114 trap constraints in 18832 ms
[2020-06-03 06:32:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:32:39] [INFO ] [Nat]Absence check using 62 positive place invariants in 66 ms returned sat
[2020-06-03 06:32:39] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 22 ms returned sat
[2020-06-03 06:32:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:32:40] [INFO ] [Nat]Absence check using state equation in 740 ms returned sat
[2020-06-03 06:32:40] [INFO ] Deduced a trap composed of 21 places in 164 ms
[2020-06-03 06:32:41] [INFO ] Deduced a trap composed of 21 places in 155 ms
[2020-06-03 06:32:41] [INFO ] Deduced a trap composed of 17 places in 155 ms
[2020-06-03 06:32:41] [INFO ] Deduced a trap composed of 19 places in 146 ms
[2020-06-03 06:32:41] [INFO ] Deduced a trap composed of 23 places in 149 ms
[2020-06-03 06:32:41] [INFO ] Deduced a trap composed of 14 places in 149 ms
[2020-06-03 06:32:41] [INFO ] Deduced a trap composed of 15 places in 146 ms
[2020-06-03 06:32:42] [INFO ] Deduced a trap composed of 20 places in 159 ms
[2020-06-03 06:32:42] [INFO ] Deduced a trap composed of 25 places in 143 ms
[2020-06-03 06:32:42] [INFO ] Deduced a trap composed of 132 places in 147 ms
[2020-06-03 06:32:42] [INFO ] Deduced a trap composed of 28 places in 144 ms
[2020-06-03 06:32:42] [INFO ] Deduced a trap composed of 72 places in 140 ms
[2020-06-03 06:32:42] [INFO ] Deduced a trap composed of 142 places in 152 ms
[2020-06-03 06:32:43] [INFO ] Deduced a trap composed of 134 places in 155 ms
[2020-06-03 06:32:43] [INFO ] Deduced a trap composed of 141 places in 153 ms
[2020-06-03 06:32:43] [INFO ] Deduced a trap composed of 27 places in 154 ms
[2020-06-03 06:32:43] [INFO ] Deduced a trap composed of 140 places in 152 ms
[2020-06-03 06:32:43] [INFO ] Deduced a trap composed of 138 places in 151 ms
[2020-06-03 06:32:44] [INFO ] Deduced a trap composed of 50 places in 147 ms
[2020-06-03 06:32:44] [INFO ] Deduced a trap composed of 12 places in 152 ms
[2020-06-03 06:32:44] [INFO ] Deduced a trap composed of 52 places in 150 ms
[2020-06-03 06:32:44] [INFO ] Deduced a trap composed of 141 places in 149 ms
[2020-06-03 06:32:44] [INFO ] Deduced a trap composed of 11 places in 148 ms
[2020-06-03 06:32:44] [INFO ] Deduced a trap composed of 153 places in 149 ms
[2020-06-03 06:32:45] [INFO ] Deduced a trap composed of 28 places in 147 ms
[2020-06-03 06:32:45] [INFO ] Deduced a trap composed of 136 places in 148 ms
[2020-06-03 06:32:45] [INFO ] Deduced a trap composed of 145 places in 143 ms
[2020-06-03 06:32:45] [INFO ] Deduced a trap composed of 151 places in 146 ms
[2020-06-03 06:32:45] [INFO ] Deduced a trap composed of 143 places in 143 ms
[2020-06-03 06:32:45] [INFO ] Deduced a trap composed of 145 places in 142 ms
[2020-06-03 06:32:46] [INFO ] Deduced a trap composed of 142 places in 142 ms
[2020-06-03 06:32:46] [INFO ] Deduced a trap composed of 142 places in 143 ms
[2020-06-03 06:32:46] [INFO ] Deduced a trap composed of 11 places in 141 ms
[2020-06-03 06:32:46] [INFO ] Deduced a trap composed of 142 places in 143 ms
[2020-06-03 06:32:46] [INFO ] Deduced a trap composed of 147 places in 141 ms
[2020-06-03 06:32:46] [INFO ] Deduced a trap composed of 138 places in 150 ms
[2020-06-03 06:32:47] [INFO ] Deduced a trap composed of 150 places in 156 ms
[2020-06-03 06:32:47] [INFO ] Deduced a trap composed of 137 places in 166 ms
[2020-06-03 06:32:47] [INFO ] Deduced a trap composed of 138 places in 156 ms
[2020-06-03 06:32:47] [INFO ] Deduced a trap composed of 145 places in 222 ms
[2020-06-03 06:32:47] [INFO ] Deduced a trap composed of 143 places in 134 ms
[2020-06-03 06:32:48] [INFO ] Deduced a trap composed of 155 places in 144 ms
[2020-06-03 06:32:48] [INFO ] Deduced a trap composed of 140 places in 135 ms
[2020-06-03 06:32:48] [INFO ] Deduced a trap composed of 147 places in 127 ms
[2020-06-03 06:32:48] [INFO ] Deduced a trap composed of 135 places in 134 ms
[2020-06-03 06:32:48] [INFO ] Deduced a trap composed of 143 places in 131 ms
[2020-06-03 06:32:48] [INFO ] Deduced a trap composed of 140 places in 123 ms
[2020-06-03 06:32:48] [INFO ] Deduced a trap composed of 137 places in 132 ms
[2020-06-03 06:32:49] [INFO ] Deduced a trap composed of 147 places in 149 ms
[2020-06-03 06:32:49] [INFO ] Deduced a trap composed of 147 places in 134 ms
[2020-06-03 06:32:49] [INFO ] Deduced a trap composed of 148 places in 129 ms
[2020-06-03 06:32:49] [INFO ] Deduced a trap composed of 149 places in 131 ms
[2020-06-03 06:32:49] [INFO ] Deduced a trap composed of 147 places in 126 ms
[2020-06-03 06:32:49] [INFO ] Deduced a trap composed of 151 places in 133 ms
[2020-06-03 06:32:50] [INFO ] Deduced a trap composed of 152 places in 129 ms
[2020-06-03 06:32:50] [INFO ] Deduced a trap composed of 149 places in 132 ms
[2020-06-03 06:32:50] [INFO ] Deduced a trap composed of 156 places in 130 ms
[2020-06-03 06:32:50] [INFO ] Deduced a trap composed of 149 places in 152 ms
[2020-06-03 06:32:50] [INFO ] Deduced a trap composed of 23 places in 151 ms
[2020-06-03 06:32:50] [INFO ] Deduced a trap composed of 153 places in 148 ms
[2020-06-03 06:32:51] [INFO ] Deduced a trap composed of 32 places in 183 ms
[2020-06-03 06:32:51] [INFO ] Deduced a trap composed of 154 places in 153 ms
[2020-06-03 06:32:51] [INFO ] Deduced a trap composed of 31 places in 148 ms
[2020-06-03 06:32:51] [INFO ] Deduced a trap composed of 17 places in 161 ms
[2020-06-03 06:32:51] [INFO ] Deduced a trap composed of 152 places in 129 ms
[2020-06-03 06:32:52] [INFO ] Deduced a trap composed of 143 places in 161 ms
[2020-06-03 06:32:52] [INFO ] Deduced a trap composed of 21 places in 161 ms
[2020-06-03 06:32:52] [INFO ] Deduced a trap composed of 163 places in 130 ms
[2020-06-03 06:32:52] [INFO ] Deduced a trap composed of 153 places in 128 ms
[2020-06-03 06:32:52] [INFO ] Deduced a trap composed of 21 places in 133 ms
[2020-06-03 06:32:52] [INFO ] Deduced a trap composed of 144 places in 128 ms
[2020-06-03 06:32:53] [INFO ] Deduced a trap composed of 153 places in 129 ms
[2020-06-03 06:32:53] [INFO ] Deduced a trap composed of 141 places in 131 ms
[2020-06-03 06:32:53] [INFO ] Deduced a trap composed of 147 places in 162 ms
[2020-06-03 06:32:53] [INFO ] Deduced a trap composed of 152 places in 131 ms
[2020-06-03 06:32:53] [INFO ] Deduced a trap composed of 146 places in 160 ms
[2020-06-03 06:32:53] [INFO ] Deduced a trap composed of 147 places in 155 ms
[2020-06-03 06:32:54] [INFO ] Deduced a trap composed of 26 places in 166 ms
[2020-06-03 06:32:54] [INFO ] Deduced a trap composed of 148 places in 131 ms
[2020-06-03 06:32:54] [INFO ] Deduced a trap composed of 147 places in 160 ms
[2020-06-03 06:32:54] [INFO ] Deduced a trap composed of 65 places in 123 ms
[2020-06-03 06:32:55] [INFO ] Deduced a trap composed of 144 places in 156 ms
[2020-06-03 06:32:55] [INFO ] Deduced a trap composed of 52 places in 125 ms
[2020-06-03 06:32:55] [INFO ] Deduced a trap composed of 91 places in 153 ms
[2020-06-03 06:32:55] [INFO ] Deduced a trap composed of 141 places in 148 ms
[2020-06-03 06:32:55] [INFO ] Deduced a trap composed of 153 places in 151 ms
[2020-06-03 06:32:55] [INFO ] Deduced a trap composed of 28 places in 126 ms
[2020-06-03 06:32:56] [INFO ] Deduced a trap composed of 42 places in 120 ms
[2020-06-03 06:32:56] [INFO ] Deduced a trap composed of 144 places in 115 ms
[2020-06-03 06:32:56] [INFO ] Deduced a trap composed of 140 places in 118 ms
[2020-06-03 06:32:56] [INFO ] Deduced a trap composed of 140 places in 118 ms
[2020-06-03 06:32:56] [INFO ] Deduced a trap composed of 147 places in 115 ms
[2020-06-03 06:32:56] [INFO ] Deduced a trap composed of 144 places in 117 ms
[2020-06-03 06:32:56] [INFO ] Deduced a trap composed of 145 places in 115 ms
[2020-06-03 06:32:57] [INFO ] Deduced a trap composed of 142 places in 116 ms
[2020-06-03 06:32:57] [INFO ] Deduced a trap composed of 152 places in 115 ms
[2020-06-03 06:32:57] [INFO ] Deduced a trap composed of 151 places in 115 ms
[2020-06-03 06:32:57] [INFO ] Deduced a trap composed of 159 places in 113 ms
[2020-06-03 06:32:57] [INFO ] Deduced a trap composed of 145 places in 117 ms
[2020-06-03 06:32:57] [INFO ] Deduced a trap composed of 151 places in 118 ms
[2020-06-03 06:32:57] [INFO ] Deduced a trap composed of 143 places in 117 ms
[2020-06-03 06:32:58] [INFO ] Deduced a trap composed of 149 places in 117 ms
[2020-06-03 06:32:58] [INFO ] Deduced a trap composed of 169 places in 117 ms
[2020-06-03 06:32:58] [INFO ] Trap strengthening (SAT) tested/added 104/103 trap constraints in 17600 ms
[2020-06-03 06:32:58] [INFO ] Computed and/alt/rep : 575/2602/575 causal constraints in 21 ms.
[2020-06-03 06:32:59] [INFO ] Added : 200 causal constraints over 40 iterations in 1526 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-03 06:32:59] [INFO ] [Real]Absence check using 62 positive place invariants in 53 ms returned sat
[2020-06-03 06:32:59] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 22 ms returned sat
[2020-06-03 06:32:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:33:00] [INFO ] [Real]Absence check using state equation in 810 ms returned sat
[2020-06-03 06:33:00] [INFO ] Deduced a trap composed of 14 places in 91 ms
[2020-06-03 06:33:01] [INFO ] Deduced a trap composed of 12 places in 104 ms
[2020-06-03 06:33:01] [INFO ] Deduced a trap composed of 27 places in 102 ms
[2020-06-03 06:33:01] [INFO ] Deduced a trap composed of 30 places in 87 ms
[2020-06-03 06:33:01] [INFO ] Deduced a trap composed of 20 places in 101 ms
[2020-06-03 06:33:01] [INFO ] Deduced a trap composed of 13 places in 86 ms
[2020-06-03 06:33:01] [INFO ] Deduced a trap composed of 18 places in 85 ms
[2020-06-03 06:33:01] [INFO ] Deduced a trap composed of 12 places in 81 ms
[2020-06-03 06:33:01] [INFO ] Deduced a trap composed of 15 places in 84 ms
[2020-06-03 06:33:01] [INFO ] Deduced a trap composed of 32 places in 99 ms
[2020-06-03 06:33:02] [INFO ] Deduced a trap composed of 20 places in 94 ms
[2020-06-03 06:33:02] [INFO ] Deduced a trap composed of 41 places in 94 ms
[2020-06-03 06:33:02] [INFO ] Deduced a trap composed of 37 places in 85 ms
[2020-06-03 06:33:02] [INFO ] Deduced a trap composed of 41 places in 98 ms
[2020-06-03 06:33:02] [INFO ] Deduced a trap composed of 16 places in 90 ms
[2020-06-03 06:33:02] [INFO ] Deduced a trap composed of 21 places in 83 ms
[2020-06-03 06:33:02] [INFO ] Deduced a trap composed of 29 places in 81 ms
[2020-06-03 06:33:02] [INFO ] Deduced a trap composed of 23 places in 80 ms
[2020-06-03 06:33:02] [INFO ] Deduced a trap composed of 45 places in 77 ms
[2020-06-03 06:33:02] [INFO ] Deduced a trap composed of 28 places in 77 ms
[2020-06-03 06:33:03] [INFO ] Deduced a trap composed of 46 places in 76 ms
[2020-06-03 06:33:03] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 2296 ms
[2020-06-03 06:33:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:33:03] [INFO ] [Nat]Absence check using 62 positive place invariants in 67 ms returned sat
[2020-06-03 06:33:03] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 23 ms returned sat
[2020-06-03 06:33:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:33:04] [INFO ] [Nat]Absence check using state equation in 784 ms returned sat
[2020-06-03 06:33:04] [INFO ] Deduced a trap composed of 17 places in 100 ms
[2020-06-03 06:33:04] [INFO ] Deduced a trap composed of 21 places in 85 ms
[2020-06-03 06:33:04] [INFO ] Deduced a trap composed of 21 places in 81 ms
[2020-06-03 06:33:04] [INFO ] Deduced a trap composed of 11 places in 96 ms
[2020-06-03 06:33:04] [INFO ] Deduced a trap composed of 20 places in 93 ms
[2020-06-03 06:33:04] [INFO ] Deduced a trap composed of 28 places in 85 ms
[2020-06-03 06:33:04] [INFO ] Deduced a trap composed of 30 places in 80 ms
[2020-06-03 06:33:04] [INFO ] Deduced a trap composed of 30 places in 76 ms
[2020-06-03 06:33:04] [INFO ] Deduced a trap composed of 23 places in 77 ms
[2020-06-03 06:33:05] [INFO ] Deduced a trap composed of 17 places in 79 ms
[2020-06-03 06:33:05] [INFO ] Deduced a trap composed of 37 places in 75 ms
[2020-06-03 06:33:05] [INFO ] Deduced a trap composed of 20 places in 82 ms
[2020-06-03 06:33:05] [INFO ] Deduced a trap composed of 37 places in 77 ms
[2020-06-03 06:33:05] [INFO ] Deduced a trap composed of 26 places in 72 ms
[2020-06-03 06:33:05] [INFO ] Deduced a trap composed of 33 places in 70 ms
[2020-06-03 06:33:05] [INFO ] Deduced a trap composed of 38 places in 70 ms
[2020-06-03 06:33:05] [INFO ] Deduced a trap composed of 37 places in 73 ms
[2020-06-03 06:33:05] [INFO ] Deduced a trap composed of 26 places in 69 ms
[2020-06-03 06:33:05] [INFO ] Deduced a trap composed of 39 places in 73 ms
[2020-06-03 06:33:06] [INFO ] Deduced a trap composed of 40 places in 65 ms
[2020-06-03 06:33:06] [INFO ] Deduced a trap composed of 29 places in 65 ms
[2020-06-03 06:33:06] [INFO ] Deduced a trap composed of 43 places in 64 ms
[2020-06-03 06:33:06] [INFO ] Deduced a trap composed of 35 places in 63 ms
[2020-06-03 06:33:06] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 2252 ms
[2020-06-03 06:33:06] [INFO ] Computed and/alt/rep : 575/2602/575 causal constraints in 31 ms.
[2020-06-03 06:33:08] [INFO ] Added : 333 causal constraints over 68 iterations in 2607 ms. Result :sat
[2020-06-03 06:33:09] [INFO ] [Real]Absence check using 62 positive place invariants in 41 ms returned sat
[2020-06-03 06:33:09] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 23 ms returned sat
[2020-06-03 06:33:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:33:09] [INFO ] [Real]Absence check using state equation in 802 ms returned sat
[2020-06-03 06:33:10] [INFO ] Deduced a trap composed of 17 places in 186 ms
[2020-06-03 06:33:10] [INFO ] Deduced a trap composed of 8 places in 189 ms
[2020-06-03 06:33:10] [INFO ] Deduced a trap composed of 118 places in 184 ms
[2020-06-03 06:33:10] [INFO ] Deduced a trap composed of 120 places in 184 ms
[2020-06-03 06:33:10] [INFO ] Deduced a trap composed of 128 places in 180 ms
[2020-06-03 06:33:11] [INFO ] Deduced a trap composed of 11 places in 178 ms
[2020-06-03 06:33:11] [INFO ] Deduced a trap composed of 118 places in 183 ms
[2020-06-03 06:33:11] [INFO ] Deduced a trap composed of 19 places in 182 ms
[2020-06-03 06:33:11] [INFO ] Deduced a trap composed of 144 places in 182 ms
[2020-06-03 06:33:11] [INFO ] Deduced a trap composed of 22 places in 178 ms
[2020-06-03 06:33:12] [INFO ] Deduced a trap composed of 124 places in 177 ms
[2020-06-03 06:33:12] [INFO ] Deduced a trap composed of 29 places in 177 ms
[2020-06-03 06:33:12] [INFO ] Deduced a trap composed of 26 places in 174 ms
[2020-06-03 06:33:12] [INFO ] Deduced a trap composed of 33 places in 173 ms
[2020-06-03 06:33:12] [INFO ] Deduced a trap composed of 129 places in 181 ms
[2020-06-03 06:33:13] [INFO ] Deduced a trap composed of 22 places in 168 ms
[2020-06-03 06:33:13] [INFO ] Deduced a trap composed of 25 places in 175 ms
[2020-06-03 06:33:13] [INFO ] Deduced a trap composed of 34 places in 171 ms
[2020-06-03 06:33:13] [INFO ] Deduced a trap composed of 36 places in 167 ms
[2020-06-03 06:33:13] [INFO ] Deduced a trap composed of 26 places in 167 ms
[2020-06-03 06:33:14] [INFO ] Deduced a trap composed of 153 places in 168 ms
[2020-06-03 06:33:14] [INFO ] Deduced a trap composed of 32 places in 156 ms
[2020-06-03 06:33:14] [INFO ] Deduced a trap composed of 54 places in 167 ms
[2020-06-03 06:33:14] [INFO ] Deduced a trap composed of 147 places in 172 ms
[2020-06-03 06:33:14] [INFO ] Deduced a trap composed of 50 places in 169 ms
[2020-06-03 06:33:15] [INFO ] Deduced a trap composed of 44 places in 171 ms
[2020-06-03 06:33:15] [INFO ] Deduced a trap composed of 48 places in 170 ms
[2020-06-03 06:33:15] [INFO ] Deduced a trap composed of 50 places in 165 ms
[2020-06-03 06:33:15] [INFO ] Deduced a trap composed of 26 places in 163 ms
[2020-06-03 06:33:15] [INFO ] Deduced a trap composed of 34 places in 162 ms
[2020-06-03 06:33:16] [INFO ] Deduced a trap composed of 35 places in 161 ms
[2020-06-03 06:33:16] [INFO ] Deduced a trap composed of 27 places in 163 ms
[2020-06-03 06:33:16] [INFO ] Deduced a trap composed of 44 places in 155 ms
[2020-06-03 06:33:16] [INFO ] Deduced a trap composed of 30 places in 160 ms
[2020-06-03 06:33:16] [INFO ] Deduced a trap composed of 146 places in 156 ms
[2020-06-03 06:33:17] [INFO ] Deduced a trap composed of 161 places in 158 ms
[2020-06-03 06:33:17] [INFO ] Deduced a trap composed of 46 places in 157 ms
[2020-06-03 06:33:17] [INFO ] Deduced a trap composed of 155 places in 159 ms
[2020-06-03 06:33:17] [INFO ] Deduced a trap composed of 167 places in 155 ms
[2020-06-03 06:33:17] [INFO ] Deduced a trap composed of 68 places in 158 ms
[2020-06-03 06:33:17] [INFO ] Deduced a trap composed of 150 places in 150 ms
[2020-06-03 06:33:18] [INFO ] Deduced a trap composed of 150 places in 155 ms
[2020-06-03 06:33:18] [INFO ] Deduced a trap composed of 146 places in 150 ms
[2020-06-03 06:33:18] [INFO ] Deduced a trap composed of 142 places in 157 ms
[2020-06-03 06:33:18] [INFO ] Deduced a trap composed of 138 places in 150 ms
[2020-06-03 06:33:18] [INFO ] Deduced a trap composed of 42 places in 33 ms
[2020-06-03 06:33:18] [INFO ] Trap strengthening (SAT) tested/added 47/46 trap constraints in 8870 ms
[2020-06-03 06:33:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:33:18] [INFO ] [Nat]Absence check using 62 positive place invariants in 67 ms returned sat
[2020-06-03 06:33:18] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 21 ms returned sat
[2020-06-03 06:33:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:33:19] [INFO ] [Nat]Absence check using state equation in 795 ms returned sat
[2020-06-03 06:33:19] [INFO ] Deduced a trap composed of 19 places in 208 ms
[2020-06-03 06:33:20] [INFO ] Deduced a trap composed of 17 places in 210 ms
[2020-06-03 06:33:20] [INFO ] Deduced a trap composed of 20 places in 172 ms
[2020-06-03 06:33:20] [INFO ] Deduced a trap composed of 8 places in 173 ms
[2020-06-03 06:33:20] [INFO ] Deduced a trap composed of 11 places in 168 ms
[2020-06-03 06:33:20] [INFO ] Deduced a trap composed of 15 places in 203 ms
[2020-06-03 06:33:21] [INFO ] Deduced a trap composed of 15 places in 200 ms
[2020-06-03 06:33:21] [INFO ] Deduced a trap composed of 12 places in 174 ms
[2020-06-03 06:33:21] [INFO ] Deduced a trap composed of 27 places in 164 ms
[2020-06-03 06:33:21] [INFO ] Deduced a trap composed of 11 places in 163 ms
[2020-06-03 06:33:21] [INFO ] Deduced a trap composed of 25 places in 160 ms
[2020-06-03 06:33:22] [INFO ] Deduced a trap composed of 138 places in 163 ms
[2020-06-03 06:33:22] [INFO ] Deduced a trap composed of 21 places in 159 ms
[2020-06-03 06:33:22] [INFO ] Deduced a trap composed of 22 places in 159 ms
[2020-06-03 06:33:22] [INFO ] Deduced a trap composed of 22 places in 154 ms
[2020-06-03 06:33:22] [INFO ] Deduced a trap composed of 30 places in 161 ms
[2020-06-03 06:33:23] [INFO ] Deduced a trap composed of 121 places in 158 ms
[2020-06-03 06:33:23] [INFO ] Deduced a trap composed of 43 places in 154 ms
[2020-06-03 06:33:23] [INFO ] Deduced a trap composed of 26 places in 153 ms
[2020-06-03 06:33:23] [INFO ] Deduced a trap composed of 32 places in 155 ms
[2020-06-03 06:33:23] [INFO ] Deduced a trap composed of 42 places in 153 ms
[2020-06-03 06:33:23] [INFO ] Deduced a trap composed of 37 places in 78 ms
[2020-06-03 06:33:23] [INFO ] Deduced a trap composed of 40 places in 70 ms
[2020-06-03 06:33:24] [INFO ] Deduced a trap composed of 30 places in 77 ms
[2020-06-03 06:33:24] [INFO ] Deduced a trap composed of 42 places in 71 ms
[2020-06-03 06:33:24] [INFO ] Deduced a trap composed of 42 places in 72 ms
[2020-06-03 06:33:24] [INFO ] Deduced a trap composed of 56 places in 73 ms
[2020-06-03 06:33:24] [INFO ] Deduced a trap composed of 29 places in 71 ms
[2020-06-03 06:33:24] [INFO ] Deduced a trap composed of 50 places in 160 ms
[2020-06-03 06:33:24] [INFO ] Deduced a trap composed of 30 places in 78 ms
[2020-06-03 06:33:24] [INFO ] Deduced a trap composed of 28 places in 76 ms
[2020-06-03 06:33:24] [INFO ] Deduced a trap composed of 25 places in 74 ms
[2020-06-03 06:33:24] [INFO ] Deduced a trap composed of 30 places in 73 ms
[2020-06-03 06:33:25] [INFO ] Deduced a trap composed of 28 places in 75 ms
[2020-06-03 06:33:25] [INFO ] Deduced a trap composed of 53 places in 78 ms
[2020-06-03 06:33:25] [INFO ] Deduced a trap composed of 40 places in 65 ms
[2020-06-03 06:33:25] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 5560 ms
[2020-06-03 06:33:25] [INFO ] Computed and/alt/rep : 575/2602/575 causal constraints in 28 ms.
[2020-06-03 06:33:29] [INFO ] Added : 415 causal constraints over 83 iterations in 4704 ms. Result :sat
[2020-06-03 06:33:30] [INFO ] Deduced a trap composed of 143 places in 141 ms
[2020-06-03 06:33:30] [INFO ] Deduced a trap composed of 146 places in 132 ms
[2020-06-03 06:33:30] [INFO ] Deduced a trap composed of 139 places in 130 ms
[2020-06-03 06:33:30] [INFO ] Deduced a trap composed of 147 places in 130 ms
[2020-06-03 06:33:30] [INFO ] Deduced a trap composed of 148 places in 128 ms
[2020-06-03 06:33:31] [INFO ] Deduced a trap composed of 154 places in 131 ms
[2020-06-03 06:33:31] [INFO ] Deduced a trap composed of 148 places in 139 ms
[2020-06-03 06:33:31] [INFO ] Deduced a trap composed of 143 places in 135 ms
[2020-06-03 06:33:31] [INFO ] Deduced a trap composed of 163 places in 135 ms
[2020-06-03 06:33:32] [INFO ] Deduced a trap composed of 140 places in 133 ms
[2020-06-03 06:33:32] [INFO ] Deduced a trap composed of 140 places in 124 ms
[2020-06-03 06:33:32] [INFO ] Deduced a trap composed of 146 places in 134 ms
[2020-06-03 06:33:32] [INFO ] Deduced a trap composed of 144 places in 126 ms
[2020-06-03 06:33:32] [INFO ] Deduced a trap composed of 148 places in 131 ms
[2020-06-03 06:33:33] [INFO ] Deduced a trap composed of 141 places in 126 ms
[2020-06-03 06:33:33] [INFO ] Deduced a trap composed of 135 places in 131 ms
[2020-06-03 06:33:33] [INFO ] Deduced a trap composed of 139 places in 130 ms
[2020-06-03 06:33:33] [INFO ] Deduced a trap composed of 148 places in 133 ms
[2020-06-03 06:33:33] [INFO ] Deduced a trap composed of 153 places in 130 ms
[2020-06-03 06:33:34] [INFO ] Deduced a trap composed of 144 places in 132 ms
[2020-06-03 06:33:34] [INFO ] Deduced a trap composed of 143 places in 131 ms
[2020-06-03 06:33:34] [INFO ] Deduced a trap composed of 132 places in 139 ms
[2020-06-03 06:33:34] [INFO ] Deduced a trap composed of 135 places in 132 ms
[2020-06-03 06:33:34] [INFO ] Deduced a trap composed of 138 places in 135 ms
[2020-06-03 06:33:35] [INFO ] Deduced a trap composed of 135 places in 136 ms
[2020-06-03 06:33:35] [INFO ] Deduced a trap composed of 147 places in 154 ms
[2020-06-03 06:33:35] [INFO ] Deduced a trap composed of 149 places in 149 ms
[2020-06-03 06:33:35] [INFO ] Deduced a trap composed of 139 places in 151 ms
[2020-06-03 06:33:36] [INFO ] Deduced a trap composed of 145 places in 138 ms
[2020-06-03 06:33:36] [INFO ] Deduced a trap composed of 147 places in 169 ms
[2020-06-03 06:33:36] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 6414 ms
[2020-06-03 06:33:36] [INFO ] [Real]Absence check using 62 positive place invariants in 41 ms returned sat
[2020-06-03 06:33:36] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 26 ms returned sat
[2020-06-03 06:33:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:33:37] [INFO ] [Real]Absence check using state equation in 831 ms returned sat
[2020-06-03 06:33:37] [INFO ] Deduced a trap composed of 11 places in 194 ms
[2020-06-03 06:33:37] [INFO ] Deduced a trap composed of 19 places in 187 ms
[2020-06-03 06:33:37] [INFO ] Deduced a trap composed of 14 places in 185 ms
[2020-06-03 06:33:38] [INFO ] Deduced a trap composed of 15 places in 183 ms
[2020-06-03 06:33:38] [INFO ] Deduced a trap composed of 16 places in 175 ms
[2020-06-03 06:33:38] [INFO ] Deduced a trap composed of 17 places in 179 ms
[2020-06-03 06:33:38] [INFO ] Deduced a trap composed of 19 places in 177 ms
[2020-06-03 06:33:39] [INFO ] Deduced a trap composed of 15 places in 177 ms
[2020-06-03 06:33:39] [INFO ] Deduced a trap composed of 23 places in 180 ms
[2020-06-03 06:33:39] [INFO ] Deduced a trap composed of 144 places in 181 ms
[2020-06-03 06:33:39] [INFO ] Deduced a trap composed of 22 places in 177 ms
[2020-06-03 06:33:39] [INFO ] Deduced a trap composed of 20 places in 174 ms
[2020-06-03 06:33:40] [INFO ] Deduced a trap composed of 35 places in 176 ms
[2020-06-03 06:33:40] [INFO ] Deduced a trap composed of 28 places in 177 ms
[2020-06-03 06:33:40] [INFO ] Deduced a trap composed of 24 places in 170 ms
[2020-06-03 06:33:40] [INFO ] Deduced a trap composed of 44 places in 163 ms
[2020-06-03 06:33:40] [INFO ] Deduced a trap composed of 132 places in 167 ms
[2020-06-03 06:33:41] [INFO ] Deduced a trap composed of 24 places in 171 ms
[2020-06-03 06:33:41] [INFO ] Deduced a trap composed of 149 places in 188 ms
[2020-06-03 06:33:41] [INFO ] Deduced a trap composed of 130 places in 172 ms
[2020-06-03 06:33:41] [INFO ] Deduced a trap composed of 38 places in 170 ms
[2020-06-03 06:33:41] [INFO ] Deduced a trap composed of 36 places in 169 ms
[2020-06-03 06:33:42] [INFO ] Deduced a trap composed of 147 places in 165 ms
[2020-06-03 06:33:42] [INFO ] Deduced a trap composed of 31 places in 156 ms
[2020-06-03 06:33:42] [INFO ] Deduced a trap composed of 145 places in 150 ms
[2020-06-03 06:33:42] [INFO ] Deduced a trap composed of 41 places in 150 ms
[2020-06-03 06:33:42] [INFO ] Deduced a trap composed of 42 places in 151 ms
[2020-06-03 06:33:42] [INFO ] Deduced a trap composed of 140 places in 151 ms
[2020-06-03 06:33:43] [INFO ] Deduced a trap composed of 58 places in 149 ms
[2020-06-03 06:33:43] [INFO ] Deduced a trap composed of 147 places in 147 ms
[2020-06-03 06:33:43] [INFO ] Deduced a trap composed of 152 places in 152 ms
[2020-06-03 06:33:43] [INFO ] Deduced a trap composed of 45 places in 166 ms
[2020-06-03 06:33:43] [INFO ] Deduced a trap composed of 44 places in 161 ms
[2020-06-03 06:33:44] [INFO ] Deduced a trap composed of 57 places in 158 ms
[2020-06-03 06:33:44] [INFO ] Deduced a trap composed of 145 places in 164 ms
[2020-06-03 06:33:44] [INFO ] Deduced a trap composed of 152 places in 148 ms
[2020-06-03 06:33:44] [INFO ] Deduced a trap composed of 153 places in 147 ms
[2020-06-03 06:33:44] [INFO ] Deduced a trap composed of 51 places in 143 ms
[2020-06-03 06:33:44] [INFO ] Deduced a trap composed of 125 places in 140 ms
[2020-06-03 06:33:45] [INFO ] Deduced a trap composed of 141 places in 145 ms
[2020-06-03 06:33:45] [INFO ] Deduced a trap composed of 145 places in 157 ms
[2020-06-03 06:33:45] [INFO ] Deduced a trap composed of 150 places in 154 ms
[2020-06-03 06:33:45] [INFO ] Deduced a trap composed of 154 places in 150 ms
[2020-06-03 06:33:45] [INFO ] Deduced a trap composed of 167 places in 153 ms
[2020-06-03 06:33:45] [INFO ] Deduced a trap composed of 25 places in 139 ms
[2020-06-03 06:33:46] [INFO ] Deduced a trap composed of 157 places in 134 ms
[2020-06-03 06:33:46] [INFO ] Deduced a trap composed of 145 places in 137 ms
[2020-06-03 06:33:46] [INFO ] Deduced a trap composed of 160 places in 132 ms
[2020-06-03 06:33:46] [INFO ] Deduced a trap composed of 143 places in 133 ms
[2020-06-03 06:33:46] [INFO ] Deduced a trap composed of 145 places in 130 ms
[2020-06-03 06:33:46] [INFO ] Deduced a trap composed of 159 places in 138 ms
[2020-06-03 06:33:47] [INFO ] Deduced a trap composed of 156 places in 153 ms
[2020-06-03 06:33:47] [INFO ] Deduced a trap composed of 147 places in 154 ms
[2020-06-03 06:33:47] [INFO ] Deduced a trap composed of 145 places in 138 ms
[2020-06-03 06:33:47] [INFO ] Deduced a trap composed of 163 places in 148 ms
[2020-06-03 06:33:47] [INFO ] Deduced a trap composed of 147 places in 134 ms
[2020-06-03 06:33:47] [INFO ] Deduced a trap composed of 158 places in 139 ms
[2020-06-03 06:33:48] [INFO ] Deduced a trap composed of 137 places in 149 ms
[2020-06-03 06:33:48] [INFO ] Deduced a trap composed of 160 places in 141 ms
[2020-06-03 06:33:48] [INFO ] Deduced a trap composed of 57 places in 138 ms
[2020-06-03 06:33:48] [INFO ] Deduced a trap composed of 147 places in 141 ms
[2020-06-03 06:33:48] [INFO ] Deduced a trap composed of 167 places in 155 ms
[2020-06-03 06:33:49] [INFO ] Deduced a trap composed of 142 places in 141 ms
[2020-06-03 06:33:49] [INFO ] Deduced a trap composed of 43 places in 147 ms
[2020-06-03 06:33:49] [INFO ] Deduced a trap composed of 150 places in 140 ms
[2020-06-03 06:33:49] [INFO ] Deduced a trap composed of 143 places in 139 ms
[2020-06-03 06:33:49] [INFO ] Deduced a trap composed of 153 places in 136 ms
[2020-06-03 06:33:49] [INFO ] Deduced a trap composed of 149 places in 140 ms
[2020-06-03 06:33:50] [INFO ] Deduced a trap composed of 160 places in 142 ms
[2020-06-03 06:33:50] [INFO ] Deduced a trap composed of 162 places in 135 ms
[2020-06-03 06:33:50] [INFO ] Trap strengthening (SAT) tested/added 71/70 trap constraints in 12897 ms
[2020-06-03 06:33:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:33:50] [INFO ] [Nat]Absence check using 62 positive place invariants in 48 ms returned sat
[2020-06-03 06:33:50] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 26 ms returned sat
[2020-06-03 06:33:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:33:51] [INFO ] [Nat]Absence check using state equation in 842 ms returned sat
[2020-06-03 06:33:51] [INFO ] Deduced a trap composed of 12 places in 200 ms
[2020-06-03 06:33:51] [INFO ] Deduced a trap composed of 18 places in 186 ms
[2020-06-03 06:33:51] [INFO ] Deduced a trap composed of 11 places in 187 ms
[2020-06-03 06:33:52] [INFO ] Deduced a trap composed of 16 places in 185 ms
[2020-06-03 06:33:52] [INFO ] Deduced a trap composed of 17 places in 189 ms
[2020-06-03 06:33:52] [INFO ] Deduced a trap composed of 135 places in 199 ms
[2020-06-03 06:33:52] [INFO ] Deduced a trap composed of 15 places in 184 ms
[2020-06-03 06:33:57] [INFO ] Deduced a trap composed of 15 places in 4337 ms
[2020-06-03 06:33:57] [INFO ] Deduced a trap composed of 15 places in 176 ms
[2020-06-03 06:33:57] [INFO ] Deduced a trap composed of 20 places in 167 ms
[2020-06-03 06:33:57] [INFO ] Deduced a trap composed of 18 places in 164 ms
[2020-06-03 06:33:57] [INFO ] Deduced a trap composed of 26 places in 179 ms
[2020-06-03 06:33:58] [INFO ] Deduced a trap composed of 26 places in 175 ms
[2020-06-03 06:33:58] [INFO ] Deduced a trap composed of 16 places in 174 ms
[2020-06-03 06:33:58] [INFO ] Deduced a trap composed of 36 places in 175 ms
[2020-06-03 06:33:58] [INFO ] Deduced a trap composed of 38 places in 171 ms
[2020-06-03 06:33:58] [INFO ] Deduced a trap composed of 30 places in 158 ms
[2020-06-03 06:33:59] [INFO ] Deduced a trap composed of 114 places in 169 ms
[2020-06-03 06:33:59] [INFO ] Deduced a trap composed of 18 places in 159 ms
[2020-06-03 06:33:59] [INFO ] Deduced a trap composed of 37 places in 159 ms
[2020-06-03 06:33:59] [INFO ] Deduced a trap composed of 18 places in 165 ms
[2020-06-03 06:33:59] [INFO ] Deduced a trap composed of 30 places in 167 ms
[2020-06-03 06:34:00] [INFO ] Deduced a trap composed of 38 places in 164 ms
[2020-06-03 06:34:00] [INFO ] Deduced a trap composed of 43 places in 167 ms
[2020-06-03 06:34:00] [INFO ] Deduced a trap composed of 36 places in 179 ms
[2020-06-03 06:34:00] [INFO ] Deduced a trap composed of 21 places in 182 ms
[2020-06-03 06:34:00] [INFO ] Deduced a trap composed of 145 places in 164 ms
[2020-06-03 06:34:01] [INFO ] Deduced a trap composed of 156 places in 164 ms
[2020-06-03 06:34:01] [INFO ] Deduced a trap composed of 160 places in 168 ms
[2020-06-03 06:34:01] [INFO ] Deduced a trap composed of 23 places in 158 ms
[2020-06-03 06:34:01] [INFO ] Deduced a trap composed of 32 places in 167 ms
[2020-06-03 06:34:01] [INFO ] Deduced a trap composed of 28 places in 182 ms
[2020-06-03 06:34:02] [INFO ] Deduced a trap composed of 24 places in 162 ms
[2020-06-03 06:34:02] [INFO ] Deduced a trap composed of 32 places in 169 ms
[2020-06-03 06:34:02] [INFO ] Deduced a trap composed of 145 places in 170 ms
[2020-06-03 06:34:02] [INFO ] Deduced a trap composed of 29 places in 168 ms
[2020-06-03 06:34:02] [INFO ] Deduced a trap composed of 22 places in 168 ms
[2020-06-03 06:34:02] [INFO ] Deduced a trap composed of 32 places in 165 ms
[2020-06-03 06:34:03] [INFO ] Deduced a trap composed of 146 places in 170 ms
[2020-06-03 06:34:03] [INFO ] Deduced a trap composed of 140 places in 175 ms
[2020-06-03 06:34:03] [INFO ] Deduced a trap composed of 26 places in 167 ms
[2020-06-03 06:34:03] [INFO ] Deduced a trap composed of 143 places in 152 ms
[2020-06-03 06:34:03] [INFO ] Deduced a trap composed of 27 places in 157 ms
[2020-06-03 06:34:04] [INFO ] Deduced a trap composed of 158 places in 180 ms
[2020-06-03 06:34:04] [INFO ] Deduced a trap composed of 157 places in 211 ms
[2020-06-03 06:34:04] [INFO ] Deduced a trap composed of 156 places in 157 ms
[2020-06-03 06:34:04] [INFO ] Deduced a trap composed of 150 places in 174 ms
[2020-06-03 06:34:05] [INFO ] Deduced a trap composed of 163 places in 214 ms
[2020-06-03 06:34:05] [INFO ] Deduced a trap composed of 152 places in 151 ms
[2020-06-03 06:34:05] [INFO ] Deduced a trap composed of 146 places in 168 ms
[2020-06-03 06:34:05] [INFO ] Deduced a trap composed of 25 places in 152 ms
[2020-06-03 06:34:05] [INFO ] Deduced a trap composed of 24 places in 144 ms
[2020-06-03 06:34:05] [INFO ] Deduced a trap composed of 140 places in 185 ms
[2020-06-03 06:34:06] [INFO ] Deduced a trap composed of 34 places in 163 ms
[2020-06-03 06:34:06] [INFO ] Deduced a trap composed of 21 places in 191 ms
[2020-06-03 06:34:06] [INFO ] Deduced a trap composed of 21 places in 163 ms
[2020-06-03 06:34:06] [INFO ] Deduced a trap composed of 144 places in 176 ms
[2020-06-03 06:34:06] [INFO ] Deduced a trap composed of 23 places in 197 ms
[2020-06-03 06:34:07] [INFO ] Deduced a trap composed of 151 places in 144 ms
[2020-06-03 06:34:07] [INFO ] Deduced a trap composed of 154 places in 152 ms
[2020-06-03 06:34:07] [INFO ] Deduced a trap composed of 27 places in 145 ms
[2020-06-03 06:34:07] [INFO ] Deduced a trap composed of 40 places in 149 ms
[2020-06-03 06:34:07] [INFO ] Deduced a trap composed of 137 places in 148 ms
[2020-06-03 06:34:08] [INFO ] Deduced a trap composed of 144 places in 148 ms
[2020-06-03 06:34:08] [INFO ] Deduced a trap composed of 21 places in 162 ms
[2020-06-03 06:34:08] [INFO ] Deduced a trap composed of 155 places in 151 ms
[2020-06-03 06:34:08] [INFO ] Deduced a trap composed of 42 places in 205 ms
[2020-06-03 06:34:08] [INFO ] Deduced a trap composed of 151 places in 161 ms
[2020-06-03 06:34:08] [INFO ] Deduced a trap composed of 159 places in 141 ms
[2020-06-03 06:34:09] [INFO ] Deduced a trap composed of 153 places in 141 ms
[2020-06-03 06:34:09] [INFO ] Deduced a trap composed of 149 places in 144 ms
[2020-06-03 06:34:09] [INFO ] Deduced a trap composed of 36 places in 142 ms
[2020-06-03 06:34:09] [INFO ] Deduced a trap composed of 43 places in 139 ms
[2020-06-03 06:34:09] [INFO ] Deduced a trap composed of 152 places in 139 ms
[2020-06-03 06:34:09] [INFO ] Deduced a trap composed of 28 places in 140 ms
[2020-06-03 06:34:10] [INFO ] Deduced a trap composed of 34 places in 139 ms
[2020-06-03 06:34:10] [INFO ] Deduced a trap composed of 36 places in 145 ms
[2020-06-03 06:34:10] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s50 s51 s54 s55 s238 s239 s240 s259 s262 s317 s415 s416 s417 s421 s426 s431 s436 s441 s446 s451 s456 s577 s578 s581 s582 s585 s586 s589 s590 s599 s600 s603 s604) 0)") while checking expression at index 14
[2020-06-03 06:34:10] [INFO ] [Real]Absence check using 62 positive place invariants in 37 ms returned sat
[2020-06-03 06:34:10] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 24 ms returned sat
[2020-06-03 06:34:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:34:11] [INFO ] [Real]Absence check using state equation in 755 ms returned unsat
[2020-06-03 06:34:11] [INFO ] [Real]Absence check using 62 positive place invariants in 37 ms returned sat
[2020-06-03 06:34:11] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 22 ms returned sat
[2020-06-03 06:34:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:34:12] [INFO ] [Real]Absence check using state equation in 723 ms returned unsat
[2020-06-03 06:34:12] [INFO ] [Real]Absence check using 62 positive place invariants in 38 ms returned sat
[2020-06-03 06:34:12] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 22 ms returned sat
[2020-06-03 06:34:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:34:12] [INFO ] [Real]Absence check using state equation in 787 ms returned sat
[2020-06-03 06:34:13] [INFO ] Deduced a trap composed of 13 places in 97 ms
[2020-06-03 06:34:13] [INFO ] Deduced a trap composed of 11 places in 97 ms
[2020-06-03 06:34:13] [INFO ] Deduced a trap composed of 12 places in 95 ms
[2020-06-03 06:34:13] [INFO ] Deduced a trap composed of 12 places in 99 ms
[2020-06-03 06:34:13] [INFO ] Deduced a trap composed of 18 places in 92 ms
[2020-06-03 06:34:13] [INFO ] Deduced a trap composed of 20 places in 88 ms
[2020-06-03 06:34:13] [INFO ] Deduced a trap composed of 21 places in 87 ms
[2020-06-03 06:34:13] [INFO ] Deduced a trap composed of 18 places in 85 ms
[2020-06-03 06:34:13] [INFO ] Deduced a trap composed of 16 places in 89 ms
[2020-06-03 06:34:14] [INFO ] Deduced a trap composed of 23 places in 85 ms
[2020-06-03 06:34:14] [INFO ] Deduced a trap composed of 20 places in 86 ms
[2020-06-03 06:34:14] [INFO ] Deduced a trap composed of 18 places in 88 ms
[2020-06-03 06:34:14] [INFO ] Deduced a trap composed of 21 places in 83 ms
[2020-06-03 06:34:14] [INFO ] Deduced a trap composed of 44 places in 82 ms
[2020-06-03 06:34:14] [INFO ] Deduced a trap composed of 27 places in 80 ms
[2020-06-03 06:34:14] [INFO ] Deduced a trap composed of 28 places in 82 ms
[2020-06-03 06:34:14] [INFO ] Deduced a trap composed of 44 places in 96 ms
[2020-06-03 06:34:14] [INFO ] Deduced a trap composed of 26 places in 92 ms
[2020-06-03 06:34:14] [INFO ] Deduced a trap composed of 18 places in 80 ms
[2020-06-03 06:34:15] [INFO ] Deduced a trap composed of 36 places in 83 ms
[2020-06-03 06:34:15] [INFO ] Deduced a trap composed of 25 places in 81 ms
[2020-06-03 06:34:15] [INFO ] Deduced a trap composed of 34 places in 80 ms
[2020-06-03 06:34:15] [INFO ] Deduced a trap composed of 37 places in 80 ms
[2020-06-03 06:34:15] [INFO ] Deduced a trap composed of 23 places in 94 ms
[2020-06-03 06:34:15] [INFO ] Deduced a trap composed of 35 places in 91 ms
[2020-06-03 06:34:15] [INFO ] Deduced a trap composed of 26 places in 88 ms
[2020-06-03 06:34:15] [INFO ] Deduced a trap composed of 38 places in 81 ms
[2020-06-03 06:34:15] [INFO ] Deduced a trap composed of 35 places in 78 ms
[2020-06-03 06:34:16] [INFO ] Deduced a trap composed of 48 places in 76 ms
[2020-06-03 06:34:16] [INFO ] Deduced a trap composed of 46 places in 75 ms
[2020-06-03 06:34:16] [INFO ] Deduced a trap composed of 26 places in 60 ms
[2020-06-03 06:34:16] [INFO ] Deduced a trap composed of 40 places in 61 ms
[2020-06-03 06:34:16] [INFO ] Deduced a trap composed of 43 places in 58 ms
[2020-06-03 06:34:16] [INFO ] Deduced a trap composed of 32 places in 41 ms
[2020-06-03 06:34:16] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 3501 ms
[2020-06-03 06:34:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:34:16] [INFO ] [Nat]Absence check using 62 positive place invariants in 66 ms returned sat
[2020-06-03 06:34:16] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 22 ms returned sat
[2020-06-03 06:34:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:34:17] [INFO ] [Nat]Absence check using state equation in 767 ms returned sat
[2020-06-03 06:34:17] [INFO ] Deduced a trap composed of 21 places in 97 ms
[2020-06-03 06:34:17] [INFO ] Deduced a trap composed of 18 places in 88 ms
[2020-06-03 06:34:17] [INFO ] Deduced a trap composed of 11 places in 87 ms
[2020-06-03 06:34:17] [INFO ] Deduced a trap composed of 17 places in 84 ms
[2020-06-03 06:34:17] [INFO ] Deduced a trap composed of 19 places in 83 ms
[2020-06-03 06:34:17] [INFO ] Deduced a trap composed of 12 places in 83 ms
[2020-06-03 06:34:18] [INFO ] Deduced a trap composed of 17 places in 101 ms
[2020-06-03 06:34:18] [INFO ] Deduced a trap composed of 15 places in 107 ms
[2020-06-03 06:34:18] [INFO ] Deduced a trap composed of 22 places in 88 ms
[2020-06-03 06:34:18] [INFO ] Deduced a trap composed of 20 places in 88 ms
[2020-06-03 06:34:18] [INFO ] Deduced a trap composed of 38 places in 87 ms
[2020-06-03 06:34:18] [INFO ] Deduced a trap composed of 41 places in 97 ms
[2020-06-03 06:34:18] [INFO ] Deduced a trap composed of 40 places in 87 ms
[2020-06-03 06:34:18] [INFO ] Deduced a trap composed of 24 places in 86 ms
[2020-06-03 06:34:19] [INFO ] Deduced a trap composed of 28 places in 169 ms
[2020-06-03 06:34:19] [INFO ] Deduced a trap composed of 21 places in 174 ms
[2020-06-03 06:34:19] [INFO ] Deduced a trap composed of 26 places in 91 ms
[2020-06-03 06:34:19] [INFO ] Deduced a trap composed of 46 places in 76 ms
[2020-06-03 06:34:19] [INFO ] Deduced a trap composed of 43 places in 78 ms
[2020-06-03 06:34:19] [INFO ] Deduced a trap composed of 29 places in 67 ms
[2020-06-03 06:34:19] [INFO ] Deduced a trap composed of 44 places in 77 ms
[2020-06-03 06:34:19] [INFO ] Deduced a trap composed of 28 places in 68 ms
[2020-06-03 06:34:19] [INFO ] Deduced a trap composed of 48 places in 74 ms
[2020-06-03 06:34:20] [INFO ] Deduced a trap composed of 49 places in 70 ms
[2020-06-03 06:34:20] [INFO ] Deduced a trap composed of 43 places in 71 ms
[2020-06-03 06:34:20] [INFO ] Deduced a trap composed of 26 places in 72 ms
[2020-06-03 06:34:20] [INFO ] Deduced a trap composed of 43 places in 67 ms
[2020-06-03 06:34:20] [INFO ] Deduced a trap composed of 35 places in 63 ms
[2020-06-03 06:34:20] [INFO ] Deduced a trap composed of 21 places in 75 ms
[2020-06-03 06:34:20] [INFO ] Deduced a trap composed of 26 places in 64 ms
[2020-06-03 06:34:20] [INFO ] Deduced a trap composed of 22 places in 73 ms
[2020-06-03 06:34:20] [INFO ] Deduced a trap composed of 20 places in 68 ms
[2020-06-03 06:34:20] [INFO ] Deduced a trap composed of 18 places in 62 ms
[2020-06-03 06:34:20] [INFO ] Deduced a trap composed of 27 places in 71 ms
[2020-06-03 06:34:20] [INFO ] Deduced a trap composed of 35 places in 65 ms
[2020-06-03 06:34:21] [INFO ] Deduced a trap composed of 17 places in 58 ms
[2020-06-03 06:34:21] [INFO ] Deduced a trap composed of 45 places in 69 ms
[2020-06-03 06:34:21] [INFO ] Deduced a trap composed of 28 places in 61 ms
[2020-06-03 06:34:21] [INFO ] Deduced a trap composed of 26 places in 62 ms
[2020-06-03 06:34:21] [INFO ] Deduced a trap composed of 42 places in 59 ms
[2020-06-03 06:34:21] [INFO ] Deduced a trap composed of 43 places in 57 ms
[2020-06-03 06:34:21] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 4144 ms
[2020-06-03 06:34:21] [INFO ] Computed and/alt/rep : 575/2602/575 causal constraints in 21 ms.
[2020-06-03 06:34:24] [INFO ] Added : 375 causal constraints over 75 iterations in 3478 ms. Result :sat
[2020-06-03 06:34:25] [INFO ] [Real]Absence check using 62 positive place invariants in 37 ms returned sat
[2020-06-03 06:34:25] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 22 ms returned sat
[2020-06-03 06:34:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:34:25] [INFO ] [Real]Absence check using state equation in 768 ms returned sat
[2020-06-03 06:34:26] [INFO ] Deduced a trap composed of 12 places in 88 ms
[2020-06-03 06:34:26] [INFO ] Deduced a trap composed of 22 places in 82 ms
[2020-06-03 06:34:26] [INFO ] Deduced a trap composed of 39 places in 81 ms
[2020-06-03 06:34:26] [INFO ] Deduced a trap composed of 24 places in 85 ms
[2020-06-03 06:34:26] [INFO ] Deduced a trap composed of 27 places in 78 ms
[2020-06-03 06:34:26] [INFO ] Deduced a trap composed of 12 places in 77 ms
[2020-06-03 06:34:26] [INFO ] Deduced a trap composed of 16 places in 79 ms
[2020-06-03 06:34:26] [INFO ] Deduced a trap composed of 17 places in 76 ms
[2020-06-03 06:34:26] [INFO ] Deduced a trap composed of 20 places in 90 ms
[2020-06-03 06:34:26] [INFO ] Deduced a trap composed of 32 places in 89 ms
[2020-06-03 06:34:27] [INFO ] Deduced a trap composed of 33 places in 85 ms
[2020-06-03 06:34:27] [INFO ] Deduced a trap composed of 35 places in 79 ms
[2020-06-03 06:34:27] [INFO ] Deduced a trap composed of 22 places in 73 ms
[2020-06-03 06:34:27] [INFO ] Deduced a trap composed of 19 places in 79 ms
[2020-06-03 06:34:27] [INFO ] Deduced a trap composed of 44 places in 72 ms
[2020-06-03 06:34:27] [INFO ] Deduced a trap composed of 45 places in 71 ms
[2020-06-03 06:34:27] [INFO ] Deduced a trap composed of 23 places in 72 ms
[2020-06-03 06:34:27] [INFO ] Deduced a trap composed of 25 places in 70 ms
[2020-06-03 06:34:27] [INFO ] Deduced a trap composed of 47 places in 68 ms
[2020-06-03 06:34:27] [INFO ] Deduced a trap composed of 42 places in 68 ms
[2020-06-03 06:34:27] [INFO ] Deduced a trap composed of 28 places in 69 ms
[2020-06-03 06:34:28] [INFO ] Deduced a trap composed of 30 places in 69 ms
[2020-06-03 06:34:28] [INFO ] Deduced a trap composed of 21 places in 68 ms
[2020-06-03 06:34:28] [INFO ] Deduced a trap composed of 27 places in 71 ms
[2020-06-03 06:34:28] [INFO ] Deduced a trap composed of 49 places in 74 ms
[2020-06-03 06:34:28] [INFO ] Deduced a trap composed of 21 places in 67 ms
[2020-06-03 06:34:28] [INFO ] Deduced a trap composed of 32 places in 66 ms
[2020-06-03 06:34:28] [INFO ] Deduced a trap composed of 18 places in 77 ms
[2020-06-03 06:34:28] [INFO ] Deduced a trap composed of 21 places in 78 ms
[2020-06-03 06:34:28] [INFO ] Deduced a trap composed of 26 places in 78 ms
[2020-06-03 06:34:28] [INFO ] Deduced a trap composed of 25 places in 83 ms
[2020-06-03 06:34:28] [INFO ] Deduced a trap composed of 28 places in 81 ms
[2020-06-03 06:34:29] [INFO ] Deduced a trap composed of 17 places in 78 ms
[2020-06-03 06:34:29] [INFO ] Deduced a trap composed of 33 places in 78 ms
[2020-06-03 06:34:29] [INFO ] Deduced a trap composed of 35 places in 77 ms
[2020-06-03 06:34:29] [INFO ] Deduced a trap composed of 28 places in 75 ms
[2020-06-03 06:34:29] [INFO ] Deduced a trap composed of 37 places in 77 ms
[2020-06-03 06:34:29] [INFO ] Deduced a trap composed of 41 places in 78 ms
[2020-06-03 06:34:29] [INFO ] Deduced a trap composed of 22 places in 80 ms
[2020-06-03 06:34:29] [INFO ] Deduced a trap composed of 30 places in 91 ms
[2020-06-03 06:34:29] [INFO ] Deduced a trap composed of 39 places in 81 ms
[2020-06-03 06:34:29] [INFO ] Deduced a trap composed of 41 places in 68 ms
[2020-06-03 06:34:30] [INFO ] Deduced a trap composed of 39 places in 66 ms
[2020-06-03 06:34:30] [INFO ] Deduced a trap composed of 44 places in 65 ms
[2020-06-03 06:34:30] [INFO ] Deduced a trap composed of 35 places in 65 ms
[2020-06-03 06:34:30] [INFO ] Deduced a trap composed of 52 places in 68 ms
[2020-06-03 06:34:30] [INFO ] Trap strengthening (SAT) tested/added 47/46 trap constraints in 4436 ms
[2020-06-03 06:34:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:34:30] [INFO ] [Nat]Absence check using 62 positive place invariants in 67 ms returned sat
[2020-06-03 06:34:30] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 21 ms returned sat
[2020-06-03 06:34:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:34:31] [INFO ] [Nat]Absence check using state equation in 758 ms returned sat
[2020-06-03 06:34:31] [INFO ] Deduced a trap composed of 12 places in 97 ms
[2020-06-03 06:34:31] [INFO ] Deduced a trap composed of 22 places in 94 ms
[2020-06-03 06:34:31] [INFO ] Deduced a trap composed of 39 places in 94 ms
[2020-06-03 06:34:31] [INFO ] Deduced a trap composed of 24 places in 92 ms
[2020-06-03 06:34:31] [INFO ] Deduced a trap composed of 27 places in 91 ms
[2020-06-03 06:34:31] [INFO ] Deduced a trap composed of 12 places in 91 ms
[2020-06-03 06:34:32] [INFO ] Deduced a trap composed of 17 places in 89 ms
[2020-06-03 06:34:32] [INFO ] Deduced a trap composed of 20 places in 94 ms
[2020-06-03 06:34:32] [INFO ] Deduced a trap composed of 37 places in 88 ms
[2020-06-03 06:34:32] [INFO ] Deduced a trap composed of 15 places in 91 ms
[2020-06-03 06:34:32] [INFO ] Deduced a trap composed of 18 places in 89 ms
[2020-06-03 06:34:32] [INFO ] Deduced a trap composed of 25 places in 91 ms
[2020-06-03 06:34:32] [INFO ] Deduced a trap composed of 17 places in 89 ms
[2020-06-03 06:34:32] [INFO ] Deduced a trap composed of 19 places in 88 ms
[2020-06-03 06:34:32] [INFO ] Deduced a trap composed of 32 places in 89 ms
[2020-06-03 06:34:33] [INFO ] Deduced a trap composed of 31 places in 81 ms
[2020-06-03 06:34:33] [INFO ] Deduced a trap composed of 27 places in 90 ms
[2020-06-03 06:34:33] [INFO ] Deduced a trap composed of 20 places in 82 ms
[2020-06-03 06:34:33] [INFO ] Deduced a trap composed of 38 places in 80 ms
[2020-06-03 06:34:33] [INFO ] Deduced a trap composed of 38 places in 81 ms
[2020-06-03 06:34:33] [INFO ] Deduced a trap composed of 27 places in 83 ms
[2020-06-03 06:34:33] [INFO ] Deduced a trap composed of 36 places in 82 ms
[2020-06-03 06:34:33] [INFO ] Deduced a trap composed of 32 places in 79 ms
[2020-06-03 06:34:33] [INFO ] Deduced a trap composed of 39 places in 81 ms
[2020-06-03 06:34:33] [INFO ] Deduced a trap composed of 46 places in 69 ms
[2020-06-03 06:34:34] [INFO ] Deduced a trap composed of 34 places in 70 ms
[2020-06-03 06:34:34] [INFO ] Deduced a trap composed of 21 places in 78 ms
[2020-06-03 06:34:34] [INFO ] Deduced a trap composed of 46 places in 77 ms
[2020-06-03 06:34:34] [INFO ] Deduced a trap composed of 46 places in 68 ms
[2020-06-03 06:34:34] [INFO ] Deduced a trap composed of 53 places in 69 ms
[2020-06-03 06:34:34] [INFO ] Deduced a trap composed of 43 places in 61 ms
[2020-06-03 06:34:34] [INFO ] Deduced a trap composed of 46 places in 55 ms
[2020-06-03 06:34:34] [INFO ] Deduced a trap composed of 50 places in 49 ms
[2020-06-03 06:34:34] [INFO ] Deduced a trap composed of 43 places in 48 ms
[2020-06-03 06:34:34] [INFO ] Deduced a trap composed of 21 places in 50 ms
[2020-06-03 06:34:34] [INFO ] Deduced a trap composed of 22 places in 50 ms
[2020-06-03 06:34:34] [INFO ] Deduced a trap composed of 43 places in 56 ms
[2020-06-03 06:34:34] [INFO ] Deduced a trap composed of 20 places in 57 ms
[2020-06-03 06:34:35] [INFO ] Deduced a trap composed of 39 places in 55 ms
[2020-06-03 06:34:35] [INFO ] Deduced a trap composed of 56 places in 76 ms
[2020-06-03 06:34:35] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 3885 ms
[2020-06-03 06:34:35] [INFO ] Computed and/alt/rep : 575/2602/575 causal constraints in 20 ms.
[2020-06-03 06:34:38] [INFO ] Added : 379 causal constraints over 77 iterations in 3572 ms. Result :sat
[2020-06-03 06:34:38] [INFO ] [Real]Absence check using 62 positive place invariants in 65 ms returned sat
[2020-06-03 06:34:38] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 41 ms returned sat
[2020-06-03 06:34:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:34:40] [INFO ] [Real]Absence check using state equation in 1615 ms returned unsat
[2020-06-03 06:34:40] [INFO ] [Real]Absence check using 62 positive place invariants in 38 ms returned sat
[2020-06-03 06:34:40] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 23 ms returned sat
[2020-06-03 06:34:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:34:41] [INFO ] [Real]Absence check using state equation in 804 ms returned sat
[2020-06-03 06:34:41] [INFO ] Deduced a trap composed of 138 places in 300 ms
[2020-06-03 06:34:42] [INFO ] Deduced a trap composed of 141 places in 199 ms
[2020-06-03 06:34:42] [INFO ] Deduced a trap composed of 18 places in 180 ms
[2020-06-03 06:34:42] [INFO ] Deduced a trap composed of 136 places in 173 ms
[2020-06-03 06:34:42] [INFO ] Deduced a trap composed of 15 places in 169 ms
[2020-06-03 06:34:42] [INFO ] Deduced a trap composed of 11 places in 165 ms
[2020-06-03 06:34:43] [INFO ] Deduced a trap composed of 19 places in 167 ms
[2020-06-03 06:34:43] [INFO ] Deduced a trap composed of 142 places in 166 ms
[2020-06-03 06:34:43] [INFO ] Deduced a trap composed of 22 places in 191 ms
[2020-06-03 06:34:43] [INFO ] Deduced a trap composed of 150 places in 174 ms
[2020-06-03 06:34:43] [INFO ] Deduced a trap composed of 30 places in 193 ms
[2020-06-03 06:34:44] [INFO ] Deduced a trap composed of 22 places in 186 ms
[2020-06-03 06:34:44] [INFO ] Deduced a trap composed of 22 places in 164 ms
[2020-06-03 06:34:44] [INFO ] Deduced a trap composed of 24 places in 160 ms
[2020-06-03 06:34:44] [INFO ] Deduced a trap composed of 24 places in 161 ms
[2020-06-03 06:34:44] [INFO ] Deduced a trap composed of 35 places in 158 ms
[2020-06-03 06:34:45] [INFO ] Deduced a trap composed of 149 places in 190 ms
[2020-06-03 06:34:45] [INFO ] Deduced a trap composed of 32 places in 154 ms
[2020-06-03 06:34:45] [INFO ] Deduced a trap composed of 30 places in 147 ms
[2020-06-03 06:34:45] [INFO ] Deduced a trap composed of 22 places in 146 ms
[2020-06-03 06:34:45] [INFO ] Deduced a trap composed of 40 places in 146 ms
[2020-06-03 06:34:45] [INFO ] Deduced a trap composed of 149 places in 155 ms
[2020-06-03 06:34:46] [INFO ] Deduced a trap composed of 153 places in 181 ms
[2020-06-03 06:34:46] [INFO ] Deduced a trap composed of 141 places in 179 ms
[2020-06-03 06:34:46] [INFO ] Deduced a trap composed of 29 places in 181 ms
[2020-06-03 06:34:46] [INFO ] Deduced a trap composed of 150 places in 180 ms
[2020-06-03 06:34:46] [INFO ] Deduced a trap composed of 41 places in 173 ms
[2020-06-03 06:34:47] [INFO ] Deduced a trap composed of 32 places in 172 ms
[2020-06-03 06:34:47] [INFO ] Deduced a trap composed of 31 places in 170 ms
[2020-06-03 06:34:47] [INFO ] Deduced a trap composed of 142 places in 177 ms
[2020-06-03 06:34:47] [INFO ] Deduced a trap composed of 31 places in 170 ms
[2020-06-03 06:34:47] [INFO ] Deduced a trap composed of 136 places in 170 ms
[2020-06-03 06:34:48] [INFO ] Deduced a trap composed of 27 places in 170 ms
[2020-06-03 06:34:48] [INFO ] Deduced a trap composed of 43 places in 169 ms
[2020-06-03 06:34:48] [INFO ] Deduced a trap composed of 62 places in 172 ms
[2020-06-03 06:34:48] [INFO ] Deduced a trap composed of 148 places in 172 ms
[2020-06-03 06:34:48] [INFO ] Deduced a trap composed of 32 places in 167 ms
[2020-06-03 06:34:49] [INFO ] Deduced a trap composed of 58 places in 179 ms
[2020-06-03 06:34:49] [INFO ] Deduced a trap composed of 138 places in 177 ms
[2020-06-03 06:34:49] [INFO ] Deduced a trap composed of 60 places in 179 ms
[2020-06-03 06:34:49] [INFO ] Deduced a trap composed of 36 places in 181 ms
[2020-06-03 06:34:49] [INFO ] Deduced a trap composed of 35 places in 176 ms
[2020-06-03 06:34:50] [INFO ] Deduced a trap composed of 150 places in 156 ms
[2020-06-03 06:34:50] [INFO ] Deduced a trap composed of 135 places in 142 ms
[2020-06-03 06:34:50] [INFO ] Deduced a trap composed of 145 places in 134 ms
[2020-06-03 06:34:50] [INFO ] Deduced a trap composed of 35 places in 134 ms
[2020-06-03 06:34:50] [INFO ] Deduced a trap composed of 36 places in 141 ms
[2020-06-03 06:34:50] [INFO ] Deduced a trap composed of 39 places in 140 ms
[2020-06-03 06:34:51] [INFO ] Deduced a trap composed of 26 places in 138 ms
[2020-06-03 06:34:51] [INFO ] Deduced a trap composed of 25 places in 145 ms
[2020-06-03 06:34:51] [INFO ] Deduced a trap composed of 158 places in 167 ms
[2020-06-03 06:34:51] [INFO ] Deduced a trap composed of 30 places in 166 ms
[2020-06-03 06:34:51] [INFO ] Deduced a trap composed of 35 places in 177 ms
[2020-06-03 06:34:52] [INFO ] Deduced a trap composed of 167 places in 174 ms
[2020-06-03 06:34:52] [INFO ] Deduced a trap composed of 142 places in 174 ms
[2020-06-03 06:34:52] [INFO ] Deduced a trap composed of 48 places in 174 ms
[2020-06-03 06:34:52] [INFO ] Deduced a trap composed of 155 places in 179 ms
[2020-06-03 06:34:52] [INFO ] Deduced a trap composed of 41 places in 177 ms
[2020-06-03 06:34:53] [INFO ] Deduced a trap composed of 34 places in 173 ms
[2020-06-03 06:34:53] [INFO ] Deduced a trap composed of 38 places in 171 ms
[2020-06-03 06:34:53] [INFO ] Deduced a trap composed of 146 places in 172 ms
[2020-06-03 06:34:53] [INFO ] Deduced a trap composed of 137 places in 171 ms
[2020-06-03 06:34:53] [INFO ] Deduced a trap composed of 137 places in 173 ms
[2020-06-03 06:34:54] [INFO ] Deduced a trap composed of 140 places in 172 ms
[2020-06-03 06:34:54] [INFO ] Deduced a trap composed of 151 places in 167 ms
[2020-06-03 06:34:54] [INFO ] Deduced a trap composed of 142 places in 176 ms
[2020-06-03 06:34:54] [INFO ] Deduced a trap composed of 145 places in 173 ms
[2020-06-03 06:34:54] [INFO ] Deduced a trap composed of 151 places in 166 ms
[2020-06-03 06:34:55] [INFO ] Deduced a trap composed of 148 places in 166 ms
[2020-06-03 06:34:55] [INFO ] Deduced a trap composed of 141 places in 165 ms
[2020-06-03 06:34:55] [INFO ] Deduced a trap composed of 153 places in 166 ms
[2020-06-03 06:34:55] [INFO ] Deduced a trap composed of 142 places in 161 ms
[2020-06-03 06:34:55] [INFO ] Deduced a trap composed of 42 places in 164 ms
[2020-06-03 06:34:56] [INFO ] Deduced a trap composed of 158 places in 159 ms
[2020-06-03 06:34:56] [INFO ] Deduced a trap composed of 153 places in 166 ms
[2020-06-03 06:34:56] [INFO ] Deduced a trap composed of 153 places in 162 ms
[2020-06-03 06:34:56] [INFO ] Deduced a trap composed of 158 places in 159 ms
[2020-06-03 06:34:56] [INFO ] Deduced a trap composed of 173 places in 158 ms
[2020-06-03 06:34:56] [INFO ] Deduced a trap composed of 148 places in 156 ms
[2020-06-03 06:34:57] [INFO ] Deduced a trap composed of 146 places in 161 ms
[2020-06-03 06:34:57] [INFO ] Deduced a trap composed of 144 places in 160 ms
[2020-06-03 06:34:57] [INFO ] Deduced a trap composed of 162 places in 164 ms
[2020-06-03 06:34:57] [INFO ] Deduced a trap composed of 151 places in 159 ms
[2020-06-03 06:34:57] [INFO ] Deduced a trap composed of 160 places in 163 ms
[2020-06-03 06:34:58] [INFO ] Deduced a trap composed of 149 places in 159 ms
[2020-06-03 06:34:58] [INFO ] Deduced a trap composed of 135 places in 161 ms
[2020-06-03 06:34:58] [INFO ] Deduced a trap composed of 137 places in 157 ms
[2020-06-03 06:34:58] [INFO ] Deduced a trap composed of 171 places in 154 ms
[2020-06-03 06:34:58] [INFO ] Deduced a trap composed of 164 places in 150 ms
[2020-06-03 06:34:59] [INFO ] Deduced a trap composed of 140 places in 134 ms
[2020-06-03 06:34:59] [INFO ] Deduced a trap composed of 166 places in 132 ms
[2020-06-03 06:34:59] [INFO ] Deduced a trap composed of 154 places in 163 ms
[2020-06-03 06:34:59] [INFO ] Deduced a trap composed of 140 places in 157 ms
[2020-06-03 06:34:59] [INFO ] Deduced a trap composed of 152 places in 157 ms
[2020-06-03 06:34:59] [INFO ] Deduced a trap composed of 140 places in 164 ms
[2020-06-03 06:35:00] [INFO ] Deduced a trap composed of 141 places in 163 ms
[2020-06-03 06:35:00] [INFO ] Deduced a trap composed of 144 places in 162 ms
[2020-06-03 06:35:00] [INFO ] Deduced a trap composed of 136 places in 159 ms
[2020-06-03 06:35:00] [INFO ] Deduced a trap composed of 161 places in 164 ms
[2020-06-03 06:35:00] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s50 s51 s54 s55 s59 s60 s61 s65 s66 s69 s70 s71 s72 s73 s74 s75 s76 s94 s96 s98 s100 s106 s112 s116 s125 s131 s134 s149 s150 s151 s152 s153 s154 s162 s163 s164 s168 s171 s172 s174 s175 s177 s178 s182 s183 s184 s188 s189 s190 s199 s200 s201 s202 s214 s215 s216 s226 s227 s228 s248 s297 s302 s307 s312 s331 s346 s350 s352 s376 s381 s386 s391 s396 s401 s416 s421 s435 s437 s440 s441 s442 s460 s463 s464 s465 s466 s469 s470 s471 s472 s473 s474 s475 s476 s479 s480 s481 s486 s487 s490 s491 s494 s495 s499 s500 s509 s510 s511 s512 s517 s521 s523 s525 s526 s527 s531 s532 s533 s534 s535 s536 s537 s538 s539 s540 s541 s546 s547 s548 s549 s570 s571 s587 s588 s589 s590 s591 s592 s597 s598 s599 s600 s601 s602 s603 s604 s605 s606 s607 s616 s617 s628 s629 s634 s635) 0)") while checking expression at index 20
[2020-06-03 06:35:00] [INFO ] [Real]Absence check using 62 positive place invariants in 20 ms returned unsat
[2020-06-03 06:35:00] [INFO ] [Real]Absence check using 62 positive place invariants in 36 ms returned sat
[2020-06-03 06:35:00] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 22 ms returned sat
[2020-06-03 06:35:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:35:01] [INFO ] [Real]Absence check using state equation in 598 ms returned unsat
[2020-06-03 06:35:01] [INFO ] [Real]Absence check using 62 positive place invariants in 34 ms returned sat
[2020-06-03 06:35:01] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 21 ms returned sat
[2020-06-03 06:35:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:35:02] [INFO ] [Real]Absence check using state equation in 707 ms returned sat
[2020-06-03 06:35:02] [INFO ] Deduced a trap composed of 21 places in 151 ms
[2020-06-03 06:35:02] [INFO ] Deduced a trap composed of 25 places in 172 ms
[2020-06-03 06:35:02] [INFO ] Deduced a trap composed of 11 places in 169 ms
[2020-06-03 06:35:03] [INFO ] Deduced a trap composed of 14 places in 146 ms
[2020-06-03 06:35:03] [INFO ] Deduced a trap composed of 21 places in 150 ms
[2020-06-03 06:35:03] [INFO ] Deduced a trap composed of 15 places in 141 ms
[2020-06-03 06:35:03] [INFO ] Deduced a trap composed of 12 places in 140 ms
[2020-06-03 06:35:03] [INFO ] Deduced a trap composed of 19 places in 138 ms
[2020-06-03 06:35:03] [INFO ] Deduced a trap composed of 20 places in 136 ms
[2020-06-03 06:35:04] [INFO ] Deduced a trap composed of 29 places in 137 ms
[2020-06-03 06:35:04] [INFO ] Deduced a trap composed of 25 places in 135 ms
[2020-06-03 06:35:04] [INFO ] Deduced a trap composed of 20 places in 136 ms
[2020-06-03 06:35:04] [INFO ] Deduced a trap composed of 121 places in 140 ms
[2020-06-03 06:35:04] [INFO ] Deduced a trap composed of 127 places in 133 ms
[2020-06-03 06:35:04] [INFO ] Deduced a trap composed of 24 places in 131 ms
[2020-06-03 06:35:05] [INFO ] Deduced a trap composed of 28 places in 127 ms
[2020-06-03 06:35:05] [INFO ] Deduced a trap composed of 125 places in 128 ms
[2020-06-03 06:35:05] [INFO ] Deduced a trap composed of 121 places in 125 ms
[2020-06-03 06:35:05] [INFO ] Deduced a trap composed of 35 places in 126 ms
[2020-06-03 06:35:05] [INFO ] Deduced a trap composed of 22 places in 139 ms
[2020-06-03 06:35:05] [INFO ] Deduced a trap composed of 119 places in 131 ms
[2020-06-03 06:35:05] [INFO ] Deduced a trap composed of 23 places in 132 ms
[2020-06-03 06:35:06] [INFO ] Deduced a trap composed of 18 places in 134 ms
[2020-06-03 06:35:06] [INFO ] Deduced a trap composed of 26 places in 155 ms
[2020-06-03 06:35:06] [INFO ] Deduced a trap composed of 18 places in 84 ms
[2020-06-03 06:35:06] [INFO ] Deduced a trap composed of 17 places in 84 ms
[2020-06-03 06:35:06] [INFO ] Deduced a trap composed of 14 places in 85 ms
[2020-06-03 06:35:06] [INFO ] Deduced a trap composed of 21 places in 85 ms
[2020-06-03 06:35:06] [INFO ] Deduced a trap composed of 37 places in 87 ms
[2020-06-03 06:35:06] [INFO ] Deduced a trap composed of 23 places in 81 ms
[2020-06-03 06:35:07] [INFO ] Deduced a trap composed of 21 places in 85 ms
[2020-06-03 06:35:07] [INFO ] Deduced a trap composed of 25 places in 83 ms
[2020-06-03 06:35:07] [INFO ] Deduced a trap composed of 39 places in 81 ms
[2020-06-03 06:35:07] [INFO ] Deduced a trap composed of 27 places in 79 ms
[2020-06-03 06:35:07] [INFO ] Deduced a trap composed of 40 places in 79 ms
[2020-06-03 06:35:07] [INFO ] Deduced a trap composed of 44 places in 79 ms
[2020-06-03 06:35:07] [INFO ] Deduced a trap composed of 27 places in 81 ms
[2020-06-03 06:35:07] [INFO ] Deduced a trap composed of 29 places in 77 ms
[2020-06-03 06:35:07] [INFO ] Deduced a trap composed of 28 places in 81 ms
[2020-06-03 06:35:07] [INFO ] Deduced a trap composed of 53 places in 77 ms
[2020-06-03 06:35:08] [INFO ] Deduced a trap composed of 41 places in 76 ms
[2020-06-03 06:35:08] [INFO ] Deduced a trap composed of 39 places in 76 ms
[2020-06-03 06:35:08] [INFO ] Deduced a trap composed of 46 places in 79 ms
[2020-06-03 06:35:08] [INFO ] Deduced a trap composed of 26 places in 77 ms
[2020-06-03 06:35:08] [INFO ] Deduced a trap composed of 36 places in 76 ms
[2020-06-03 06:35:08] [INFO ] Deduced a trap composed of 64 places in 75 ms
[2020-06-03 06:35:08] [INFO ] Deduced a trap composed of 31 places in 76 ms
[2020-06-03 06:35:08] [INFO ] Deduced a trap composed of 52 places in 70 ms
[2020-06-03 06:35:08] [INFO ] Deduced a trap composed of 45 places in 66 ms
[2020-06-03 06:35:08] [INFO ] Deduced a trap composed of 28 places in 67 ms
[2020-06-03 06:35:08] [INFO ] Deduced a trap composed of 50 places in 65 ms
[2020-06-03 06:35:09] [INFO ] Deduced a trap composed of 31 places in 64 ms
[2020-06-03 06:35:09] [INFO ] Deduced a trap composed of 45 places in 63 ms
[2020-06-03 06:35:09] [INFO ] Deduced a trap composed of 50 places in 65 ms
[2020-06-03 06:35:09] [INFO ] Deduced a trap composed of 43 places in 64 ms
[2020-06-03 06:35:09] [INFO ] Deduced a trap composed of 52 places in 63 ms
[2020-06-03 06:35:09] [INFO ] Deduced a trap composed of 33 places in 71 ms
[2020-06-03 06:35:09] [INFO ] Deduced a trap composed of 39 places in 71 ms
[2020-06-03 06:35:09] [INFO ] Deduced a trap composed of 45 places in 72 ms
[2020-06-03 06:35:09] [INFO ] Deduced a trap composed of 30 places in 70 ms
[2020-06-03 06:35:09] [INFO ] Deduced a trap composed of 46 places in 69 ms
[2020-06-03 06:35:09] [INFO ] Deduced a trap composed of 52 places in 68 ms
[2020-06-03 06:35:10] [INFO ] Deduced a trap composed of 38 places in 64 ms
[2020-06-03 06:35:10] [INFO ] Deduced a trap composed of 52 places in 64 ms
[2020-06-03 06:35:10] [INFO ] Deduced a trap composed of 62 places in 64 ms
[2020-06-03 06:35:10] [INFO ] Deduced a trap composed of 50 places in 63 ms
[2020-06-03 06:35:10] [INFO ] Deduced a trap composed of 54 places in 65 ms
[2020-06-03 06:35:10] [INFO ] Deduced a trap composed of 43 places in 74 ms
[2020-06-03 06:35:10] [INFO ] Deduced a trap composed of 44 places in 72 ms
[2020-06-03 06:35:10] [INFO ] Deduced a trap composed of 31 places in 71 ms
[2020-06-03 06:35:10] [INFO ] Deduced a trap composed of 38 places in 71 ms
[2020-06-03 06:35:10] [INFO ] Deduced a trap composed of 32 places in 70 ms
[2020-06-03 06:35:10] [INFO ] Deduced a trap composed of 43 places in 67 ms
[2020-06-03 06:35:11] [INFO ] Deduced a trap composed of 37 places in 67 ms
[2020-06-03 06:35:11] [INFO ] Deduced a trap composed of 40 places in 69 ms
[2020-06-03 06:35:11] [INFO ] Deduced a trap composed of 71 places in 72 ms
[2020-06-03 06:35:11] [INFO ] Deduced a trap composed of 53 places in 132 ms
[2020-06-03 06:35:11] [INFO ] Deduced a trap composed of 43 places in 67 ms
[2020-06-03 06:35:11] [INFO ] Deduced a trap composed of 55 places in 69 ms
[2020-06-03 06:35:11] [INFO ] Deduced a trap composed of 57 places in 68 ms
[2020-06-03 06:35:11] [INFO ] Deduced a trap composed of 48 places in 77 ms
[2020-06-03 06:35:11] [INFO ] Deduced a trap composed of 48 places in 78 ms
[2020-06-03 06:35:11] [INFO ] Deduced a trap composed of 43 places in 74 ms
[2020-06-03 06:35:12] [INFO ] Deduced a trap composed of 55 places in 74 ms
[2020-06-03 06:35:12] [INFO ] Deduced a trap composed of 41 places in 71 ms
[2020-06-03 06:35:12] [INFO ] Deduced a trap composed of 48 places in 71 ms
[2020-06-03 06:35:12] [INFO ] Deduced a trap composed of 69 places in 71 ms
[2020-06-03 06:35:12] [INFO ] Deduced a trap composed of 53 places in 71 ms
[2020-06-03 06:35:12] [INFO ] Deduced a trap composed of 70 places in 74 ms
[2020-06-03 06:35:12] [INFO ] Deduced a trap composed of 76 places in 77 ms
[2020-06-03 06:35:12] [INFO ] Trap strengthening (SAT) tested/added 91/90 trap constraints in 10269 ms
[2020-06-03 06:35:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:35:12] [INFO ] [Nat]Absence check using 62 positive place invariants in 69 ms returned sat
[2020-06-03 06:35:12] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 22 ms returned sat
[2020-06-03 06:35:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:35:13] [INFO ] [Nat]Absence check using state equation in 784 ms returned sat
[2020-06-03 06:35:13] [INFO ] Deduced a trap composed of 12 places in 162 ms
[2020-06-03 06:35:13] [INFO ] Deduced a trap composed of 25 places in 157 ms
[2020-06-03 06:35:14] [INFO ] Deduced a trap composed of 22 places in 156 ms
[2020-06-03 06:35:14] [INFO ] Deduced a trap composed of 14 places in 158 ms
[2020-06-03 06:35:14] [INFO ] Deduced a trap composed of 17 places in 156 ms
[2020-06-03 06:35:14] [INFO ] Deduced a trap composed of 35 places in 154 ms
[2020-06-03 06:35:14] [INFO ] Deduced a trap composed of 20 places in 153 ms
[2020-06-03 06:35:15] [INFO ] Deduced a trap composed of 24 places in 147 ms
[2020-06-03 06:35:15] [INFO ] Deduced a trap composed of 22 places in 153 ms
[2020-06-03 06:35:15] [INFO ] Deduced a trap composed of 15 places in 148 ms
[2020-06-03 06:35:15] [INFO ] Deduced a trap composed of 19 places in 149 ms
[2020-06-03 06:35:15] [INFO ] Deduced a trap composed of 21 places in 152 ms
[2020-06-03 06:35:15] [INFO ] Deduced a trap composed of 25 places in 146 ms
[2020-06-03 06:35:16] [INFO ] Deduced a trap composed of 26 places in 152 ms
[2020-06-03 06:35:16] [INFO ] Deduced a trap composed of 20 places in 145 ms
[2020-06-03 06:35:16] [INFO ] Deduced a trap composed of 23 places in 150 ms
[2020-06-03 06:35:16] [INFO ] Deduced a trap composed of 22 places in 145 ms
[2020-06-03 06:35:16] [INFO ] Deduced a trap composed of 20 places in 144 ms
[2020-06-03 06:35:16] [INFO ] Deduced a trap composed of 127 places in 147 ms
[2020-06-03 06:35:17] [INFO ] Deduced a trap composed of 27 places in 140 ms
[2020-06-03 06:35:17] [INFO ] Deduced a trap composed of 15 places in 135 ms
[2020-06-03 06:35:17] [INFO ] Deduced a trap composed of 125 places in 133 ms
[2020-06-03 06:35:17] [INFO ] Deduced a trap composed of 118 places in 136 ms
[2020-06-03 06:35:17] [INFO ] Deduced a trap composed of 42 places in 72 ms
[2020-06-03 06:35:17] [INFO ] Deduced a trap composed of 22 places in 69 ms
[2020-06-03 06:35:17] [INFO ] Deduced a trap composed of 31 places in 77 ms
[2020-06-03 06:35:17] [INFO ] Deduced a trap composed of 41 places in 66 ms
[2020-06-03 06:35:18] [INFO ] Deduced a trap composed of 42 places in 71 ms
[2020-06-03 06:35:18] [INFO ] Deduced a trap composed of 50 places in 69 ms
[2020-06-03 06:35:18] [INFO ] Deduced a trap composed of 29 places in 73 ms
[2020-06-03 06:35:18] [INFO ] Deduced a trap composed of 43 places in 70 ms
[2020-06-03 06:35:18] [INFO ] Deduced a trap composed of 120 places in 135 ms
[2020-06-03 06:35:18] [INFO ] Deduced a trap composed of 26 places in 140 ms
[2020-06-03 06:35:18] [INFO ] Deduced a trap composed of 28 places in 136 ms
[2020-06-03 06:35:18] [INFO ] Deduced a trap composed of 30 places in 132 ms
[2020-06-03 06:35:19] [INFO ] Deduced a trap composed of 50 places in 131 ms
[2020-06-03 06:35:19] [INFO ] Deduced a trap composed of 54 places in 128 ms
[2020-06-03 06:35:19] [INFO ] Deduced a trap composed of 22 places in 135 ms
[2020-06-03 06:35:19] [INFO ] Deduced a trap composed of 42 places in 130 ms
[2020-06-03 06:35:19] [INFO ] Deduced a trap composed of 43 places in 131 ms
[2020-06-03 06:35:19] [INFO ] Deduced a trap composed of 122 places in 135 ms
[2020-06-03 06:35:20] [INFO ] Deduced a trap composed of 62 places in 137 ms
[2020-06-03 06:35:20] [INFO ] Deduced a trap composed of 122 places in 133 ms
[2020-06-03 06:35:20] [INFO ] Deduced a trap composed of 55 places in 130 ms
[2020-06-03 06:35:20] [INFO ] Deduced a trap composed of 29 places in 128 ms
[2020-06-03 06:35:20] [INFO ] Deduced a trap composed of 33 places in 122 ms
[2020-06-03 06:35:20] [INFO ] Deduced a trap composed of 25 places in 124 ms
[2020-06-03 06:35:20] [INFO ] Deduced a trap composed of 125 places in 139 ms
[2020-06-03 06:35:21] [INFO ] Deduced a trap composed of 48 places in 196 ms
[2020-06-03 06:35:21] [INFO ] Deduced a trap composed of 67 places in 144 ms
[2020-06-03 06:35:21] [INFO ] Deduced a trap composed of 129 places in 133 ms
[2020-06-03 06:35:21] [INFO ] Deduced a trap composed of 124 places in 135 ms
[2020-06-03 06:35:21] [INFO ] Deduced a trap composed of 124 places in 130 ms
[2020-06-03 06:35:21] [INFO ] Deduced a trap composed of 131 places in 133 ms
[2020-06-03 06:35:22] [INFO ] Deduced a trap composed of 71 places in 133 ms
[2020-06-03 06:35:22] [INFO ] Deduced a trap composed of 130 places in 141 ms
[2020-06-03 06:35:22] [INFO ] Deduced a trap composed of 54 places in 138 ms
[2020-06-03 06:35:22] [INFO ] Deduced a trap composed of 82 places in 134 ms
[2020-06-03 06:35:22] [INFO ] Deduced a trap composed of 130 places in 136 ms
[2020-06-03 06:35:22] [INFO ] Deduced a trap composed of 130 places in 134 ms
[2020-06-03 06:35:22] [INFO ] Trap strengthening (SAT) tested/added 61/60 trap constraints in 9358 ms
[2020-06-03 06:35:22] [INFO ] Computed and/alt/rep : 575/2602/575 causal constraints in 26 ms.
[2020-06-03 06:35:27] [INFO ] Added : 410 causal constraints over 82 iterations in 4279 ms. Result :sat
[2020-06-03 06:35:27] [INFO ] Deduced a trap composed of 148 places in 127 ms
[2020-06-03 06:35:27] [INFO ] Deduced a trap composed of 143 places in 124 ms
[2020-06-03 06:35:27] [INFO ] Deduced a trap composed of 147 places in 127 ms
[2020-06-03 06:35:27] [INFO ] Deduced a trap composed of 146 places in 123 ms
[2020-06-03 06:35:28] [INFO ] Deduced a trap composed of 148 places in 122 ms
[2020-06-03 06:35:28] [INFO ] Deduced a trap composed of 149 places in 126 ms
[2020-06-03 06:35:28] [INFO ] Deduced a trap composed of 144 places in 123 ms
[2020-06-03 06:35:28] [INFO ] Deduced a trap composed of 151 places in 121 ms
[2020-06-03 06:35:28] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1695 ms
[2020-06-03 06:35:29] [INFO ] [Real]Absence check using 62 positive place invariants in 36 ms returned sat
[2020-06-03 06:35:29] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 23 ms returned sat
[2020-06-03 06:35:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:35:29] [INFO ] [Real]Absence check using state equation in 756 ms returned sat
[2020-06-03 06:35:29] [INFO ] Deduced a trap composed of 8 places in 172 ms
[2020-06-03 06:35:30] [INFO ] Deduced a trap composed of 16 places in 167 ms
[2020-06-03 06:35:30] [INFO ] Deduced a trap composed of 121 places in 167 ms
[2020-06-03 06:35:30] [INFO ] Deduced a trap composed of 118 places in 169 ms
[2020-06-03 06:35:30] [INFO ] Deduced a trap composed of 19 places in 170 ms
[2020-06-03 06:35:30] [INFO ] Deduced a trap composed of 11 places in 162 ms
[2020-06-03 06:35:31] [INFO ] Deduced a trap composed of 16 places in 162 ms
[2020-06-03 06:35:31] [INFO ] Deduced a trap composed of 139 places in 164 ms
[2020-06-03 06:35:31] [INFO ] Deduced a trap composed of 120 places in 161 ms
[2020-06-03 06:35:31] [INFO ] Deduced a trap composed of 19 places in 159 ms
[2020-06-03 06:35:31] [INFO ] Deduced a trap composed of 23 places in 162 ms
[2020-06-03 06:35:32] [INFO ] Deduced a trap composed of 21 places in 160 ms
[2020-06-03 06:35:32] [INFO ] Deduced a trap composed of 20 places in 154 ms
[2020-06-03 06:35:32] [INFO ] Deduced a trap composed of 26 places in 159 ms
[2020-06-03 06:35:32] [INFO ] Deduced a trap composed of 11 places in 157 ms
[2020-06-03 06:35:32] [INFO ] Deduced a trap composed of 29 places in 154 ms
[2020-06-03 06:35:32] [INFO ] Deduced a trap composed of 18 places in 151 ms
[2020-06-03 06:35:33] [INFO ] Deduced a trap composed of 21 places in 151 ms
[2020-06-03 06:35:33] [INFO ] Deduced a trap composed of 129 places in 148 ms
[2020-06-03 06:35:33] [INFO ] Deduced a trap composed of 32 places in 148 ms
[2020-06-03 06:35:33] [INFO ] Deduced a trap composed of 31 places in 147 ms
[2020-06-03 06:35:33] [INFO ] Deduced a trap composed of 42 places in 151 ms
[2020-06-03 06:35:34] [INFO ] Deduced a trap composed of 45 places in 145 ms
[2020-06-03 06:35:34] [INFO ] Deduced a trap composed of 23 places in 148 ms
[2020-06-03 06:35:34] [INFO ] Deduced a trap composed of 35 places in 148 ms
[2020-06-03 06:35:34] [INFO ] Deduced a trap composed of 127 places in 147 ms
[2020-06-03 06:35:34] [INFO ] Deduced a trap composed of 143 places in 145 ms
[2020-06-03 06:35:34] [INFO ] Deduced a trap composed of 28 places in 142 ms
[2020-06-03 06:35:35] [INFO ] Deduced a trap composed of 115 places in 142 ms
[2020-06-03 06:35:35] [INFO ] Deduced a trap composed of 29 places in 137 ms
[2020-06-03 06:35:35] [INFO ] Deduced a trap composed of 38 places in 150 ms
[2020-06-03 06:35:35] [INFO ] Deduced a trap composed of 48 places in 150 ms
[2020-06-03 06:35:35] [INFO ] Deduced a trap composed of 27 places in 144 ms
[2020-06-03 06:35:35] [INFO ] Deduced a trap composed of 35 places in 145 ms
[2020-06-03 06:35:36] [INFO ] Deduced a trap composed of 124 places in 150 ms
[2020-06-03 06:35:36] [INFO ] Deduced a trap composed of 33 places in 147 ms
[2020-06-03 06:35:36] [INFO ] Deduced a trap composed of 24 places in 144 ms
[2020-06-03 06:35:36] [INFO ] Deduced a trap composed of 121 places in 141 ms
[2020-06-03 06:35:36] [INFO ] Deduced a trap composed of 37 places in 140 ms
[2020-06-03 06:35:36] [INFO ] Deduced a trap composed of 28 places in 149 ms
[2020-06-03 06:35:37] [INFO ] Deduced a trap composed of 25 places in 140 ms
[2020-06-03 06:35:37] [INFO ] Deduced a trap composed of 26 places in 136 ms
[2020-06-03 06:35:37] [INFO ] Deduced a trap composed of 24 places in 134 ms
[2020-06-03 06:35:37] [INFO ] Deduced a trap composed of 48 places in 82 ms
[2020-06-03 06:35:37] [INFO ] Deduced a trap composed of 59 places in 78 ms
[2020-06-03 06:35:37] [INFO ] Deduced a trap composed of 68 places in 80 ms
[2020-06-03 06:35:37] [INFO ] Deduced a trap composed of 51 places in 79 ms
[2020-06-03 06:35:37] [INFO ] Deduced a trap composed of 59 places in 83 ms
[2020-06-03 06:35:38] [INFO ] Deduced a trap composed of 50 places in 81 ms
[2020-06-03 06:35:38] [INFO ] Deduced a trap composed of 49 places in 80 ms
[2020-06-03 06:35:38] [INFO ] Deduced a trap composed of 22 places in 80 ms
[2020-06-03 06:35:38] [INFO ] Deduced a trap composed of 34 places in 79 ms
[2020-06-03 06:35:38] [INFO ] Deduced a trap composed of 21 places in 80 ms
[2020-06-03 06:35:38] [INFO ] Deduced a trap composed of 29 places in 79 ms
[2020-06-03 06:35:38] [INFO ] Deduced a trap composed of 34 places in 80 ms
[2020-06-03 06:35:38] [INFO ] Deduced a trap composed of 66 places in 86 ms
[2020-06-03 06:35:38] [INFO ] Trap strengthening (SAT) tested/added 57/56 trap constraints in 8956 ms
[2020-06-03 06:35:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:35:38] [INFO ] [Nat]Absence check using 62 positive place invariants in 68 ms returned sat
[2020-06-03 06:35:38] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 23 ms returned sat
[2020-06-03 06:35:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:35:39] [INFO ] [Nat]Absence check using state equation in 789 ms returned sat
[2020-06-03 06:35:39] [INFO ] Deduced a trap composed of 8 places in 154 ms
[2020-06-03 06:35:40] [INFO ] Deduced a trap composed of 16 places in 150 ms
[2020-06-03 06:35:40] [INFO ] Deduced a trap composed of 11 places in 149 ms
[2020-06-03 06:35:40] [INFO ] Deduced a trap composed of 21 places in 149 ms
[2020-06-03 06:35:40] [INFO ] Deduced a trap composed of 20 places in 147 ms
[2020-06-03 06:35:40] [INFO ] Deduced a trap composed of 16 places in 146 ms
[2020-06-03 06:35:40] [INFO ] Deduced a trap composed of 28 places in 145 ms
[2020-06-03 06:35:41] [INFO ] Deduced a trap composed of 21 places in 137 ms
[2020-06-03 06:35:41] [INFO ] Deduced a trap composed of 143 places in 138 ms
[2020-06-03 06:35:41] [INFO ] Deduced a trap composed of 15 places in 136 ms
[2020-06-03 06:35:41] [INFO ] Deduced a trap composed of 22 places in 137 ms
[2020-06-03 06:35:41] [INFO ] Deduced a trap composed of 22 places in 137 ms
[2020-06-03 06:35:41] [INFO ] Deduced a trap composed of 21 places in 138 ms
[2020-06-03 06:35:42] [INFO ] Deduced a trap composed of 24 places in 137 ms
[2020-06-03 06:35:42] [INFO ] Deduced a trap composed of 34 places in 136 ms
[2020-06-03 06:35:42] [INFO ] Deduced a trap composed of 35 places in 134 ms
[2020-06-03 06:35:42] [INFO ] Deduced a trap composed of 129 places in 136 ms
[2020-06-03 06:35:42] [INFO ] Deduced a trap composed of 122 places in 135 ms
[2020-06-03 06:35:42] [INFO ] Deduced a trap composed of 120 places in 133 ms
[2020-06-03 06:35:43] [INFO ] Deduced a trap composed of 36 places in 129 ms
[2020-06-03 06:35:43] [INFO ] Deduced a trap composed of 142 places in 132 ms
[2020-06-03 06:35:43] [INFO ] Deduced a trap composed of 22 places in 133 ms
[2020-06-03 06:35:43] [INFO ] Deduced a trap composed of 36 places in 129 ms
[2020-06-03 06:35:43] [INFO ] Deduced a trap composed of 39 places in 131 ms
[2020-06-03 06:35:43] [INFO ] Deduced a trap composed of 49 places in 135 ms
[2020-06-03 06:35:43] [INFO ] Deduced a trap composed of 25 places in 130 ms
[2020-06-03 06:35:44] [INFO ] Deduced a trap composed of 37 places in 130 ms
[2020-06-03 06:35:44] [INFO ] Deduced a trap composed of 33 places in 79 ms
[2020-06-03 06:35:44] [INFO ] Deduced a trap composed of 55 places in 75 ms
[2020-06-03 06:35:44] [INFO ] Deduced a trap composed of 40 places in 72 ms
[2020-06-03 06:35:44] [INFO ] Deduced a trap composed of 41 places in 69 ms
[2020-06-03 06:35:44] [INFO ] Deduced a trap composed of 39 places in 69 ms
[2020-06-03 06:35:44] [INFO ] Deduced a trap composed of 42 places in 75 ms
[2020-06-03 06:35:44] [INFO ] Deduced a trap composed of 26 places in 74 ms
[2020-06-03 06:35:44] [INFO ] Deduced a trap composed of 31 places in 71 ms
[2020-06-03 06:35:44] [INFO ] Deduced a trap composed of 54 places in 68 ms
[2020-06-03 06:35:45] [INFO ] Deduced a trap composed of 35 places in 78 ms
[2020-06-03 06:35:45] [INFO ] Deduced a trap composed of 29 places in 77 ms
[2020-06-03 06:35:45] [INFO ] Deduced a trap composed of 42 places in 81 ms
[2020-06-03 06:35:45] [INFO ] Deduced a trap composed of 46 places in 81 ms
[2020-06-03 06:35:45] [INFO ] Deduced a trap composed of 52 places in 77 ms
[2020-06-03 06:35:45] [INFO ] Deduced a trap composed of 64 places in 81 ms
[2020-06-03 06:35:45] [INFO ] Deduced a trap composed of 37 places in 80 ms
[2020-06-03 06:35:45] [INFO ] Deduced a trap composed of 67 places in 76 ms
[2020-06-03 06:35:45] [INFO ] Trap strengthening (SAT) tested/added 45/44 trap constraints in 5979 ms
[2020-06-03 06:35:45] [INFO ] Computed and/alt/rep : 575/2602/575 causal constraints in 24 ms.
[2020-06-03 06:35:49] [INFO ] Added : 376 causal constraints over 76 iterations in 3315 ms. Result :sat
[2020-06-03 06:35:49] [INFO ] Deduced a trap composed of 47 places in 50 ms
[2020-06-03 06:35:49] [INFO ] Deduced a trap composed of 46 places in 49 ms
[2020-06-03 06:35:49] [INFO ] Deduced a trap composed of 43 places in 41 ms
[2020-06-03 06:35:49] [INFO ] Deduced a trap composed of 42 places in 40 ms
[2020-06-03 06:35:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 482 ms
[2020-06-03 06:35:49] [INFO ] [Real]Absence check using 62 positive place invariants in 19 ms returned unsat
Successfully simplified 8 atomic propositions for a total of 8 simplifications.
[2020-06-03 06:35:49] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-03 06:35:49] [INFO ] Flatten gal took : 66 ms
[2020-06-03 06:35:49] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-03 06:35:49] [INFO ] Flatten gal took : 27 ms
FORMULA BusinessProcesses-PT-17-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-CTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-CTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 06:35:49] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2020-06-03 06:35:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 7 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ BusinessProcesses-PT-17 @ 3570 seconds

FORMULA BusinessProcesses-PT-17-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-17-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-17-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-17-CTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-17-CTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-17-CTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-17-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-17-CTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-17-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-17-CTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-17-CTLFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-17-CTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-17-CTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3564
rslt: Output for CTLFireability @ BusinessProcesses-PT-17

{
"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=CTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 06:35:49 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 2,
"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": "EX(AG((((p536 <= 0)) AND ((p87 <= 0)))))",
"processed_size": 40,
"rewrites": 35
},
"net":
{
"conflict_clusters": 487,
"singleton_clusters": 0
},
"result":
{
"edges": 330,
"markings": 329,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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": "((p360 <= 0) OR (p156 <= 0))",
"processed_size": 29,
"rewrites": 36
},
"result":
{
"edges": 141,
"markings": 141,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p51))))",
"processed_size": 20,
"rewrites": 34
},
"result":
{
"edges": 68,
"markings": 69,
"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": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p105))))",
"processed_size": 21,
"rewrites": 34
},
"result":
{
"edges": 8095,
"markings": 6565,
"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": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

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

{
"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": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p58))))",
"processed_size": 20,
"rewrites": 34
},
"result":
{
"edges": 83,
"markings": 83,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E(((1 <= p165) AND (1 <= p531)) U AG(((p164 <= 0))))",
"processed_size": 52,
"rewrites": 35
},
"net":
{
"conflict_clusters": 487,
"singleton_clusters": 0
},
"result":
{
"edges": 305,
"markings": 303,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((1 <= p565))",
"processed_size": 13,
"rewrites": 33
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((p428 <= 0) OR ((1 <= p118) AND (1 <= p461)))",
"processed_size": 47,
"rewrites": 33
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3564
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3564
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p190))))",
"processed_size": 21,
"rewrites": 34
},
"result":
{
"edges": 552,
"markings": 425,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 33460,
"runtime": 6.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(A(G(E(X(*)))) AND A(G(**))) : A(G(**)) : (A(F(**)) AND **) : (E(F(A(G(**)))) OR E(F(**))) : (** OR E(F(**))) : A(G(*)) : E((** U A(G(*)))) : E(F(*)) : E(F(**)) : E(X(A(G(**)))) : E(F(**)) : (E(X(**)) AND A(F(**))) : E(F(**))"
},
"net":
{
"arcs": 1701,
"conflict_clusters": 487,
"places": 646,
"places_significant": 538,
"singleton_clusters": 0,
"transitions": 576
},
"result":
{
"preliminary_value": "no no no yes yes no no yes yes no yes no yes ",
"value": "no no no yes yes no no yes yes no yes no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 1222/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 646
lola: finding significant places
lola: 646 places, 576 transitions, 538 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 CTLFireability.xml
lola: LP says that atomic proposition is always true: (p315 <= 1)
lola: LP says that atomic proposition is always true: (p195 <= 1)
lola: LP says that atomic proposition is always true: (p124 <= 1)
lola: LP says that atomic proposition is always true: (p580 <= 1)
lola: LP says that atomic proposition is always true: (p158 <= 1)
lola: LP says that atomic proposition is always true: (p428 <= 1)
lola: LP says that atomic proposition is always true: (p118 <= 1)
lola: LP says that atomic proposition is always true: (p461 <= 1)
lola: LP says that atomic proposition is always true: (p349 <= 1)
lola: LP says that atomic proposition is always true: (p190 <= 1)
lola: LP says that atomic proposition is always true: (p565 <= 1)
lola: LP says that atomic proposition is always true: (p186 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p165 <= 1)
lola: LP says that atomic proposition is always true: (p531 <= 1)
lola: LP says that atomic proposition is always true: (p164 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p545 <= 1)
lola: LP says that atomic proposition is always true: (p191 <= 1)
lola: LP says that atomic proposition is always true: (p411 <= 1)
lola: LP says that atomic proposition is always true: (p607 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p536 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p487 <= 1)
lola: LP says that atomic proposition is always true: (p103 <= 1)
lola: LP says that atomic proposition is always true: (p323 <= 1)
lola: LP says that atomic proposition is always true: (p527 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p360 <= 1)
lola: LP says that atomic proposition is always true: (p156 <= 1)
lola: LP says that atomic proposition is always true: (p304 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p332 <= 1)
lola: LP says that atomic proposition is always true: (p469 <= 1)
lola: LP says that atomic proposition is always true: (p623 <= 1)
lola: A (G ((NOT(A (X (((1 <= p315))))) AND ((p195 <= 0))))) : A (G (((p124 <= 0)))) : (E ((E (F (((1 <= p580)))) U (1 <= 0))) OR (A (F (((1 <= p158)))) AND ((p428 <= 0) OR ((1 <= p118) AND (1 <= p461))))) : E (F ((A (G (((1 <= p349)))) OR ((1 <= p190))))) : (((1 <= p565)) OR E (F (((1 <= p186))))) : NOT(E (F (((1 <= p61))))) : E ((((1 <= p165) AND (1 <= p531)) U NOT(E (F (((1 <= p164))))))) : E (F (NOT(A (G (((p51 <= 0))))))) : E (((((1 <= p545)) AND E (X (((1 <= p191) AND (1 <= p411) AND (1 <= p607))))) U E (F (((1 <= p105)))))) : E (X (A (G ((((p536 <= 0)) AND ((p87 <= 0))))))) : E (F (((1 <= p58)))) : (E (X (((((1 <= p487)) OR ((1 <= p103) AND (1 <= p323) AND (1 <= p527)) OR (p13 <= 0)) OR E (G ((1 <= 0)))))) AND ((A (F (((1 <= p360) AND (1 <= p156)))) OR E ((((p304 <= 0)) U (1 <= 0)))) OR (A (G (((1 <= p65) AND (1 <= p332) AND (1 <= p469)))) AND E (G ((1 <= 0)))))) : E (F (((1 <= p623))))
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:401
lola: rewrite Frontend/Parser/formula_rewrite.k:473
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (E (X (((p315 <= 0)))))) AND A (G (((p195 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p195 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p195 <= 0))))
lola: processed formula length: 21
lola: 35 rewrites
lola: closed formula file CTLFireability.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 <= p195))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 426 markings, 553 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (G ((((p536 <= 0)) AND ((p87 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AG((((p536 <= 0)) AND ((p87 <= 0)))))
lola: processed formula length: 40
lola: 35 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 329 markings, 330 edges
lola: ========================================
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X ((((1 <= p487)) OR ((1 <= p103) AND (1 <= p323) AND (1 <= p527)) OR (p13 <= 0)))) AND A (F (((1 <= p360) AND (1 <= p156)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p360) AND (1 <= p156))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p360 <= 0) OR (p156 <= 0))
lola: processed formula length: 29
lola: 36 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p360) AND (1 <= p156))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 141 markings, 141 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p51))))
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 <= p51))))
lola: processed formula length: 20
lola: 34 rewrites
lola: closed formula file CTLFireability.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 <= p51))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 69 markings, 68 edges
lola: ========================================
lola: subprocess 4 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p105))))
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 <= p105))))
lola: processed formula length: 21
lola: 34 rewrites
lola: closed formula file CTLFireability.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 <= p105))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-4-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6565 markings, 8095 edges
lola: ========================================
lola: subprocess 5 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p124 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p124 <= 0))))
lola: processed formula length: 21
lola: 35 rewrites
lola: closed formula file CTLFireability.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 <= p124))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-5-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7027 markings, 8650 edges
lola: ========================================
lola: subprocess 6 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p58))))
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 <= p58))))
lola: processed formula length: 20
lola: 34 rewrites
lola: closed formula file CTLFireability.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 <= p58))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 83 markings, 83 edges
lola: ========================================
lola: subprocess 7 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p61 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G (((p61 <= 0))))
lola: processed formula length: 20
lola: 35 rewrites
lola: closed formula file CTLFireability.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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p61))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 76 markings, 76 edges
lola: ========================================
lola: subprocess 8 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p623))))
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 <= p623))))
lola: processed formula length: 21
lola: 34 rewrites
lola: closed formula file CTLFireability.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 <= p623))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-8-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6567 markings, 8097 edges
lola: ========================================
lola: subprocess 9 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((1 <= p165) AND (1 <= p531)) U A (G (((p164 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(((1 <= p165) AND (1 <= p531)) U AG(((p164 <= 0))))
lola: processed formula length: 52
lola: 35 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 303 markings, 305 edges
lola: ========================================
lola: subprocess 10 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p565)) OR E (F (((1 <= p186)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p565))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p565))
lola: processed formula length: 13
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p186))))
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 <= p186))))
lola: processed formula length: 21
lola: 34 rewrites
lola: closed formula file CTLFireability.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 <= p186))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 432 markings, 559 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 11 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((1 <= p158)))) AND ((p428 <= 0) OR ((1 <= p118) AND (1 <= p461))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p428 <= 0) OR ((1 <= p118) AND (1 <= p461)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p428 <= 0) OR ((1 <= p118) AND (1 <= p461)))
lola: processed formula length: 47
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 3564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p158))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p158 <= 0))
lola: processed formula length: 13
lola: 36 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p158))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 141 markings, 141 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 3564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (A (G (((1 <= p349)))))) OR E (F (((1 <= p190)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 3564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p190))))
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 <= p190))))
lola: processed formula length: 21
lola: 34 rewrites
lola: closed formula file CTLFireability.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 <= p190))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 425 markings, 552 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes yes no no yes yes no yes no yes
lola:
preliminary result: no no no yes yes no no yes yes no yes no yes
lola: memory consumption: 33460 KB
lola: time consumption: 6 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.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="BusinessProcesses-PT-17"
export BK_EXAMINATION="CTLFireability"
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 BusinessProcesses-PT-17, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r182-oct2-158987914100580"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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