About the Execution of ITS-LoLa for Dekker-PT-200
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15756.280 | 3600000.00 | 962609.00 | 3051.40 | FFFFFTTFTFFFFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2020-input.r178-tajo-158987882200350.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is Dekker-PT-200, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987882200350
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 25M
-rw-r--r-- 1 mcc users 3.5K Apr 27 14:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 27 14:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Apr 27 14:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 27 14:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 14:36 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Apr 27 14:36 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 27 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 27 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 27 14:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 27 14:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 27 14:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 27 14:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 27 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 27 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 equiv_col
-rw-r--r-- 1 mcc users 4 Apr 27 14:36 instance
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 iscolored
-rw-r--r-- 1 mcc users 25M Apr 27 14:36 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 Dekker-PT-200-ReachabilityCardinality-00
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-01
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-02
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-03
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-04
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-05
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-06
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-07
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-08
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-09
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-10
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-11
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-12
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-13
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-14
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1591218241195
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 21:04:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 21:04:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 21:04:05] [INFO ] Load time of PNML (sax parser for PT used): 1702 ms
[2020-06-03 21:04:05] [INFO ] Transformed 1000 places.
[2020-06-03 21:04:05] [INFO ] Transformed 40400 transitions.
[2020-06-03 21:04:05] [INFO ] Found NUPN structural information;
[2020-06-03 21:04:05] [INFO ] Parsed PT model containing 1000 places and 40400 transitions in 2050 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 436 ms.
Working with output stream class java.io.PrintStream
FORMULA Dekker-PT-200-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 874 ms. (steps per millisecond=11 ) properties seen :[1, 0, 0, 0, 1, 1, 1]
FORMULA Dekker-PT-200-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-200-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-200-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-200-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 88 ms. (steps per millisecond=113 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 92 ms. (steps per millisecond=108 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 142 ms. (steps per millisecond=70 ) properties seen :[0, 0, 0]
[2020-06-03 21:04:07] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 1000 cols
[2020-06-03 21:04:08] [INFO ] Computed 600 place invariants in 58 ms
[2020-06-03 21:04:08] [INFO ] [Real]Absence check using 400 positive place invariants in 453 ms returned sat
[2020-06-03 21:04:09] [INFO ] [Real]Absence check using 400 positive and 200 generalized place invariants in 575 ms returned sat
[2020-06-03 21:04:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:04:13] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 21:04:13] [INFO ] [Real]Absence check using state equation in 3630 ms returned (error "Failed to check-sat")
[2020-06-03 21:04:13] [INFO ] [Real]Absence check using 400 positive place invariants in 348 ms returned sat
[2020-06-03 21:04:14] [INFO ] [Real]Absence check using 400 positive and 200 generalized place invariants in 305 ms returned sat
[2020-06-03 21:04:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:04:16] [INFO ] [Real]Absence check using state equation in 2573 ms returned sat
[2020-06-03 21:04:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:04:17] [INFO ] [Nat]Absence check using 400 positive place invariants in 257 ms returned sat
[2020-06-03 21:04:17] [INFO ] [Nat]Absence check using 400 positive and 200 generalized place invariants in 169 ms returned sat
[2020-06-03 21:04:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:04:19] [INFO ] [Nat]Absence check using state equation in 2025 ms returned sat
[2020-06-03 21:04:19] [INFO ] State equation strengthened by 200 read => feed constraints.
[2020-06-03 21:04:19] [INFO ] [Nat]Added 200 Read/Feed constraints in 127 ms returned sat
[2020-06-03 21:04:20] [INFO ] Deduced a trap composed of 4 places in 825 ms
[2020-06-03 21:04:21] [INFO ] Deduced a trap composed of 4 places in 570 ms
[2020-06-03 21:04:21] [INFO ] Deduced a trap composed of 4 places in 479 ms
[2020-06-03 21:04:21] [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 (> (+ s324 s328 s887 s893) 0)") while checking expression at index 1
[2020-06-03 21:04:22] [INFO ] [Real]Absence check using 400 positive place invariants in 282 ms returned sat
[2020-06-03 21:04:22] [INFO ] [Real]Absence check using 400 positive and 200 generalized place invariants in 177 ms returned sat
[2020-06-03 21:04:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:04:24] [INFO ] [Real]Absence check using state equation in 2184 ms returned sat
[2020-06-03 21:04:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:04:25] [INFO ] [Nat]Absence check using 400 positive place invariants in 193 ms returned sat
[2020-06-03 21:04:25] [INFO ] [Nat]Absence check using 400 positive and 200 generalized place invariants in 132 ms returned sat
[2020-06-03 21:04:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:04:27] [INFO ] [Nat]Absence check using state equation in 2081 ms returned sat
[2020-06-03 21:04:27] [INFO ] [Nat]Added 200 Read/Feed constraints in 149 ms returned sat
[2020-06-03 21:04:28] [INFO ] Deduced a trap composed of 4 places in 722 ms
[2020-06-03 21:04:28] [INFO ] Deduced a trap composed of 4 places in 677 ms
[2020-06-03 21:04:29] [INFO ] Deduced a trap composed of 5 places in 711 ms
[2020-06-03 21:04:30] [INFO ] Deduced a trap composed of 4 places in 644 ms
[2020-06-03 21:04:30] [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 (> (+ s172 s242 s659 s764) 0)") while checking expression at index 2
Support contains 12 out of 1000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1000/1000 places, 40400/40400 transitions.
Applied a total of 0 rules in 1169 ms. Remains 1000 /1000 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1000/1000 places, 40400/40400 transitions.
Interrupted random walk after 589638 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=19 ) properties seen :[0, 0, 0]
Interrupted Best-First random walk after 993230 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=198 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 4940 ms. (steps per millisecond=202 ) properties seen :[0, 0, 0]
Interrupted Best-First random walk after 944206 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=188 ) properties seen :[0, 0, 0]
Interrupted probabilistic random walk after 2555538 steps, run timeout after 30001 ms. (steps per millisecond=85 ) properties seen :[0, 0, 0]
Probabilistic random walk after 2555538 steps, saw 9771 distinct states, run finished after 30002 ms. (steps per millisecond=85 ) properties seen :[0, 0, 0]
[2020-06-03 21:05:46] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 1000 cols
[2020-06-03 21:05:46] [INFO ] Computed 600 place invariants in 18 ms
[2020-06-03 21:05:47] [INFO ] [Real]Absence check using 400 positive place invariants in 252 ms returned sat
[2020-06-03 21:05:47] [INFO ] [Real]Absence check using 400 positive and 200 generalized place invariants in 161 ms returned sat
[2020-06-03 21:05:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:05:49] [INFO ] [Real]Absence check using state equation in 1994 ms returned sat
[2020-06-03 21:05:49] [INFO ] State equation strengthened by 200 read => feed constraints.
[2020-06-03 21:05:49] [INFO ] [Real]Added 200 Read/Feed constraints in 107 ms returned sat
[2020-06-03 21:05:50] [INFO ] Deduced a trap composed of 5 places in 629 ms
[2020-06-03 21:05:51] [INFO ] Deduced a trap composed of 4 places in 675 ms
[2020-06-03 21:05:51] [INFO ] Deduced a trap composed of 6 places in 609 ms
[2020-06-03 21:05:52] [INFO ] Deduced a trap composed of 4 places in 571 ms
[2020-06-03 21:05:53] [INFO ] Deduced a trap composed of 4 places in 487 ms
[2020-06-03 21:05:53] [INFO ] Deduced a trap composed of 4 places in 392 ms
[2020-06-03 21:05:53] [INFO ] Deduced a trap composed of 4 places in 418 ms
[2020-06-03 21:05:54] [INFO ] Deduced a trap composed of 5 places in 393 ms
[2020-06-03 21:05:54] [INFO ] Deduced a trap composed of 5 places in 407 ms
[2020-06-03 21:05:55] [INFO ] Deduced a trap composed of 5 places in 398 ms
[2020-06-03 21:05:55] [INFO ] Deduced a trap composed of 6 places in 387 ms
[2020-06-03 21:05:56] [INFO ] Deduced a trap composed of 6 places in 376 ms
[2020-06-03 21:05:56] [INFO ] Deduced a trap composed of 6 places in 367 ms
[2020-06-03 21:05:57] [INFO ] Deduced a trap composed of 4 places in 477 ms
[2020-06-03 21:05:57] [INFO ] Deduced a trap composed of 5 places in 455 ms
[2020-06-03 21:05:57] [INFO ] Deduced a trap composed of 4 places in 409 ms
[2020-06-03 21:05:58] [INFO ] Deduced a trap composed of 4 places in 359 ms
[2020-06-03 21:05:58] [INFO ] Deduced a trap composed of 4 places in 342 ms
[2020-06-03 21:05:59] [INFO ] Deduced a trap composed of 4 places in 363 ms
[2020-06-03 21:05:59] [INFO ] Deduced a trap composed of 4 places in 373 ms
[2020-06-03 21:06:00] [INFO ] Deduced a trap composed of 4 places in 331 ms
[2020-06-03 21:06:00] [INFO ] Deduced a trap composed of 4 places in 376 ms
[2020-06-03 21:06:00] [INFO ] Deduced a trap composed of 4 places in 381 ms
[2020-06-03 21:06:01] [INFO ] Deduced a trap composed of 4 places in 346 ms
[2020-06-03 21:06:01] [INFO ] Deduced a trap composed of 4 places in 434 ms
[2020-06-03 21:06:02] [INFO ] Deduced a trap composed of 5 places in 445 ms
[2020-06-03 21:06:02] [INFO ] Deduced a trap composed of 4 places in 465 ms
[2020-06-03 21:06:03] [INFO ] Deduced a trap composed of 4 places in 356 ms
[2020-06-03 21:06:03] [INFO ] Deduced a trap composed of 4 places in 404 ms
[2020-06-03 21:06:03] [INFO ] Deduced a trap composed of 4 places in 317 ms
[2020-06-03 21:06:04] [INFO ] Deduced a trap composed of 4 places in 328 ms
[2020-06-03 21:06:04] [INFO ] Deduced a trap composed of 4 places in 370 ms
[2020-06-03 21:06:05] [INFO ] Deduced a trap composed of 4 places in 352 ms
[2020-06-03 21:06:05] [INFO ] Deduced a trap composed of 4 places in 341 ms
[2020-06-03 21:06:05] [INFO ] Deduced a trap composed of 6 places in 337 ms
[2020-06-03 21:06:06] [INFO ] Deduced a trap composed of 4 places in 318 ms
[2020-06-03 21:06:06] [INFO ] Deduced a trap composed of 6 places in 343 ms
[2020-06-03 21:06:06] [INFO ] Deduced a trap composed of 4 places in 320 ms
[2020-06-03 21:06:07] [INFO ] Deduced a trap composed of 4 places in 392 ms
[2020-06-03 21:06:07] [INFO ] Deduced a trap composed of 4 places in 363 ms
[2020-06-03 21:06:08] [INFO ] Deduced a trap composed of 4 places in 373 ms
[2020-06-03 21:06:08] [INFO ] Deduced a trap composed of 4 places in 358 ms
[2020-06-03 21:06:09] [INFO ] Deduced a trap composed of 4 places in 335 ms
[2020-06-03 21:06:09] [INFO ] Deduced a trap composed of 4 places in 382 ms
[2020-06-03 21:06:09] [INFO ] Deduced a trap composed of 4 places in 338 ms
[2020-06-03 21:06:10] [INFO ] Deduced a trap composed of 4 places in 445 ms
[2020-06-03 21:06:10] [INFO ] Deduced a trap composed of 4 places in 386 ms
[2020-06-03 21:06:11] [INFO ] Deduced a trap composed of 4 places in 388 ms
[2020-06-03 21:06:11] [INFO ] Deduced a trap composed of 6 places in 321 ms
[2020-06-03 21:06:11] [INFO ] Deduced a trap composed of 4 places in 307 ms
[2020-06-03 21:06:12] [INFO ] Deduced a trap composed of 4 places in 290 ms
[2020-06-03 21:06:12] [INFO ] Deduced a trap composed of 4 places in 228 ms
[2020-06-03 21:06:12] [INFO ] Deduced a trap composed of 5 places in 262 ms
[2020-06-03 21:06:13] [INFO ] Deduced a trap composed of 5 places in 278 ms
[2020-06-03 21:06:13] [INFO ] Deduced a trap composed of 4 places in 243 ms
[2020-06-03 21:06:13] [INFO ] Deduced a trap composed of 4 places in 337 ms
[2020-06-03 21:06:14] [INFO ] Deduced a trap composed of 4 places in 336 ms
[2020-06-03 21:06:14] [INFO ] Deduced a trap composed of 4 places in 287 ms
[2020-06-03 21:06:15] [INFO ] Deduced a trap composed of 5 places in 297 ms
[2020-06-03 21:06:15] [INFO ] Deduced a trap composed of 5 places in 301 ms
[2020-06-03 21:06:15] [INFO ] Deduced a trap composed of 5 places in 308 ms
[2020-06-03 21:06:16] [INFO ] Deduced a trap composed of 4 places in 278 ms
[2020-06-03 21:06:16] [INFO ] Deduced a trap composed of 5 places in 297 ms
[2020-06-03 21:06:16] [INFO ] Deduced a trap composed of 4 places in 268 ms
[2020-06-03 21:06:17] [INFO ] Deduced a trap composed of 4 places in 295 ms
[2020-06-03 21:06:17] [INFO ] Deduced a trap composed of 6 places in 239 ms
[2020-06-03 21:06:17] [INFO ] Deduced a trap composed of 4 places in 241 ms
[2020-06-03 21:06:18] [INFO ] Deduced a trap composed of 6 places in 323 ms
[2020-06-03 21:06:18] [INFO ] Deduced a trap composed of 6 places in 310 ms
[2020-06-03 21:06:18] [INFO ] Deduced a trap composed of 4 places in 236 ms
[2020-06-03 21:06:19] [INFO ] Deduced a trap composed of 4 places in 227 ms
[2020-06-03 21:06:19] [INFO ] Deduced a trap composed of 4 places in 226 ms
[2020-06-03 21:06:19] [INFO ] Deduced a trap composed of 4 places in 226 ms
[2020-06-03 21:06:19] [INFO ] Deduced a trap composed of 4 places in 239 ms
[2020-06-03 21:06:20] [INFO ] Deduced a trap composed of 4 places in 367 ms
[2020-06-03 21:06:20] [INFO ] Deduced a trap composed of 4 places in 372 ms
[2020-06-03 21:06:21] [INFO ] Deduced a trap composed of 4 places in 311 ms
[2020-06-03 21:06:21] [INFO ] Deduced a trap composed of 4 places in 315 ms
[2020-06-03 21:06:21] [INFO ] Deduced a trap composed of 4 places in 320 ms
[2020-06-03 21:06:22] [INFO ] Deduced a trap composed of 6 places in 392 ms
[2020-06-03 21:06:22] [INFO ] Deduced a trap composed of 4 places in 347 ms
[2020-06-03 21:06:23] [INFO ] Deduced a trap composed of 6 places in 359 ms
[2020-06-03 21:06:23] [INFO ] Deduced a trap composed of 4 places in 316 ms
[2020-06-03 21:06:23] [INFO ] Deduced a trap composed of 4 places in 305 ms
[2020-06-03 21:06:24] [INFO ] Deduced a trap composed of 4 places in 286 ms
[2020-06-03 21:06:24] [INFO ] Deduced a trap composed of 5 places in 271 ms
[2020-06-03 21:06:24] [INFO ] Deduced a trap composed of 4 places in 226 ms
[2020-06-03 21:06:25] [INFO ] Deduced a trap composed of 4 places in 252 ms
[2020-06-03 21:06:25] [INFO ] Deduced a trap composed of 4 places in 247 ms
[2020-06-03 21:06:25] [INFO ] Deduced a trap composed of 5 places in 231 ms
[2020-06-03 21:06:26] [INFO ] Deduced a trap composed of 4 places in 259 ms
[2020-06-03 21:06:26] [INFO ] Deduced a trap composed of 4 places in 308 ms
[2020-06-03 21:06:26] [INFO ] Deduced a trap composed of 5 places in 306 ms
[2020-06-03 21:06:27] [INFO ] Deduced a trap composed of 4 places in 303 ms
[2020-06-03 21:06:27] [INFO ] Deduced a trap composed of 5 places in 259 ms
[2020-06-03 21:06:27] [INFO ] Deduced a trap composed of 4 places in 228 ms
[2020-06-03 21:06:28] [INFO ] Deduced a trap composed of 6 places in 209 ms
[2020-06-03 21:06:28] [INFO ] Deduced a trap composed of 4 places in 190 ms
[2020-06-03 21:06:28] [INFO ] Deduced a trap composed of 4 places in 190 ms
[2020-06-03 21:06:28] [INFO ] Trap strengthening (SAT) tested/added 100/99 trap constraints in 39003 ms
[2020-06-03 21:06:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:06:29] [INFO ] [Nat]Absence check using 400 positive place invariants in 202 ms returned sat
[2020-06-03 21:06:29] [INFO ] [Nat]Absence check using 400 positive and 200 generalized place invariants in 125 ms returned sat
[2020-06-03 21:06:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:06:31] [INFO ] [Nat]Absence check using state equation in 2023 ms returned sat
[2020-06-03 21:06:31] [INFO ] [Nat]Added 200 Read/Feed constraints in 106 ms returned sat
[2020-06-03 21:06:32] [INFO ] Deduced a trap composed of 5 places in 638 ms
[2020-06-03 21:06:32] [INFO ] Deduced a trap composed of 4 places in 559 ms
[2020-06-03 21:06:33] [INFO ] Deduced a trap composed of 6 places in 458 ms
[2020-06-03 21:06:33] [INFO ] Deduced a trap composed of 4 places in 403 ms
[2020-06-03 21:06:34] [INFO ] Deduced a trap composed of 4 places in 444 ms
[2020-06-03 21:06:34] [INFO ] Deduced a trap composed of 4 places in 430 ms
[2020-06-03 21:06:35] [INFO ] Deduced a trap composed of 4 places in 523 ms
[2020-06-03 21:06:35] [INFO ] Deduced a trap composed of 5 places in 476 ms
[2020-06-03 21:06:36] [INFO ] Deduced a trap composed of 5 places in 393 ms
[2020-06-03 21:06:36] [INFO ] Deduced a trap composed of 5 places in 383 ms
[2020-06-03 21:06:36] [INFO ] Deduced a trap composed of 6 places in 384 ms
[2020-06-03 21:06:37] [INFO ] Deduced a trap composed of 6 places in 416 ms
[2020-06-03 21:06:37] [INFO ] Deduced a trap composed of 6 places in 369 ms
[2020-06-03 21:06:38] [INFO ] Deduced a trap composed of 4 places in 374 ms
[2020-06-03 21:06:38] [INFO ] Deduced a trap composed of 5 places in 353 ms
[2020-06-03 21:06:39] [INFO ] Deduced a trap composed of 4 places in 354 ms
[2020-06-03 21:06:39] [INFO ] Deduced a trap composed of 4 places in 329 ms
[2020-06-03 21:06:39] [INFO ] Deduced a trap composed of 4 places in 361 ms
[2020-06-03 21:06:40] [INFO ] Deduced a trap composed of 4 places in 310 ms
[2020-06-03 21:06:40] [INFO ] Deduced a trap composed of 4 places in 302 ms
[2020-06-03 21:06:40] [INFO ] Deduced a trap composed of 4 places in 288 ms
[2020-06-03 21:06:41] [INFO ] Deduced a trap composed of 4 places in 317 ms
[2020-06-03 21:06:41] [INFO ] Deduced a trap composed of 4 places in 296 ms
[2020-06-03 21:06:41] [INFO ] Deduced a trap composed of 4 places in 325 ms
[2020-06-03 21:06:42] [INFO ] Deduced a trap composed of 4 places in 344 ms
[2020-06-03 21:06:42] [INFO ] Deduced a trap composed of 5 places in 337 ms
[2020-06-03 21:06:43] [INFO ] Deduced a trap composed of 4 places in 321 ms
[2020-06-03 21:06:43] [INFO ] Deduced a trap composed of 4 places in 311 ms
[2020-06-03 21:06:43] [INFO ] Deduced a trap composed of 4 places in 304 ms
[2020-06-03 21:06:44] [INFO ] Deduced a trap composed of 4 places in 336 ms
[2020-06-03 21:06:44] [INFO ] Deduced a trap composed of 4 places in 287 ms
[2020-06-03 21:06:44] [INFO ] Deduced a trap composed of 4 places in 277 ms
[2020-06-03 21:06:45] [INFO ] Deduced a trap composed of 4 places in 283 ms
[2020-06-03 21:06:45] [INFO ] Deduced a trap composed of 4 places in 259 ms
[2020-06-03 21:06:45] [INFO ] Deduced a trap composed of 6 places in 255 ms
[2020-06-03 21:06:46] [INFO ] Deduced a trap composed of 4 places in 256 ms
[2020-06-03 21:06:46] [INFO ] Deduced a trap composed of 6 places in 248 ms
[2020-06-03 21:06:46] [INFO ] Deduced a trap composed of 4 places in 228 ms
[2020-06-03 21:06:47] [INFO ] Deduced a trap composed of 4 places in 273 ms
[2020-06-03 21:06:47] [INFO ] Deduced a trap composed of 4 places in 282 ms
[2020-06-03 21:06:47] [INFO ] Deduced a trap composed of 4 places in 278 ms
[2020-06-03 21:06:47] [INFO ] Deduced a trap composed of 4 places in 263 ms
[2020-06-03 21:06:48] [INFO ] Deduced a trap composed of 4 places in 261 ms
[2020-06-03 21:06:48] [INFO ] Deduced a trap composed of 4 places in 273 ms
[2020-06-03 21:06:48] [INFO ] Deduced a trap composed of 4 places in 275 ms
[2020-06-03 21:06:49] [INFO ] Deduced a trap composed of 4 places in 277 ms
[2020-06-03 21:06:49] [INFO ] Deduced a trap composed of 4 places in 295 ms
[2020-06-03 21:06:49] [INFO ] Deduced a trap composed of 4 places in 265 ms
[2020-06-03 21:06:50] [INFO ] Deduced a trap composed of 6 places in 243 ms
[2020-06-03 21:06:50] [INFO ] Deduced a trap composed of 4 places in 260 ms
[2020-06-03 21:06:50] [INFO ] Deduced a trap composed of 4 places in 253 ms
[2020-06-03 21:06:50] [INFO ] Deduced a trap composed of 6 places in 242 ms
[2020-06-03 21:06:51] [INFO ] Deduced a trap composed of 6 places in 266 ms
[2020-06-03 21:06:51] [INFO ] Deduced a trap composed of 4 places in 234 ms
[2020-06-03 21:06:51] [INFO ] Deduced a trap composed of 4 places in 224 ms
[2020-06-03 21:06:52] [INFO ] Deduced a trap composed of 4 places in 219 ms
[2020-06-03 21:06:52] [INFO ] Deduced a trap composed of 5 places in 225 ms
[2020-06-03 21:06:52] [INFO ] Deduced a trap composed of 4 places in 231 ms
[2020-06-03 21:06:52] [INFO ] Deduced a trap composed of 5 places in 217 ms
[2020-06-03 21:06:53] [INFO ] Deduced a trap composed of 5 places in 219 ms
[2020-06-03 21:06:53] [INFO ] Deduced a trap composed of 4 places in 205 ms
[2020-06-03 21:06:53] [INFO ] Deduced a trap composed of 4 places in 271 ms
[2020-06-03 21:06:54] [INFO ] Deduced a trap composed of 5 places in 220 ms
[2020-06-03 21:06:54] [INFO ] Deduced a trap composed of 4 places in 236 ms
[2020-06-03 21:06:54] [INFO ] Deduced a trap composed of 4 places in 238 ms
[2020-06-03 21:06:54] [INFO ] Deduced a trap composed of 4 places in 227 ms
[2020-06-03 21:06:55] [INFO ] Deduced a trap composed of 5 places in 223 ms
[2020-06-03 21:06:55] [INFO ] Deduced a trap composed of 4 places in 204 ms
[2020-06-03 21:06:55] [INFO ] Deduced a trap composed of 4 places in 231 ms
[2020-06-03 21:06:55] [INFO ] Deduced a trap composed of 5 places in 224 ms
[2020-06-03 21:06:56] [INFO ] Deduced a trap composed of 4 places in 208 ms
[2020-06-03 21:06:56] [INFO ] Deduced a trap composed of 5 places in 226 ms
[2020-06-03 21:06:56] [INFO ] Deduced a trap composed of 4 places in 207 ms
[2020-06-03 21:06:56] [INFO ] Deduced a trap composed of 4 places in 207 ms
[2020-06-03 21:06:57] [INFO ] Deduced a trap composed of 6 places in 230 ms
[2020-06-03 21:06:57] [INFO ] Deduced a trap composed of 4 places in 214 ms
[2020-06-03 21:06:57] [INFO ] Deduced a trap composed of 4 places in 351 ms
[2020-06-03 21:06:58] [INFO ] Deduced a trap composed of 4 places in 337 ms
[2020-06-03 21:06:58] [INFO ] Deduced a trap composed of 6 places in 335 ms
[2020-06-03 21:06:59] [INFO ] Deduced a trap composed of 4 places in 301 ms
[2020-06-03 21:06:59] [INFO ] Deduced a trap composed of 6 places in 337 ms
[2020-06-03 21:06:59] [INFO ] Deduced a trap composed of 4 places in 298 ms
[2020-06-03 21:07:00] [INFO ] Deduced a trap composed of 4 places in 415 ms
[2020-06-03 21:07:00] [INFO ] Deduced a trap composed of 4 places in 318 ms
[2020-06-03 21:07:01] [INFO ] Deduced a trap composed of 6 places in 300 ms
[2020-06-03 21:07:01] [INFO ] Deduced a trap composed of 4 places in 315 ms
[2020-06-03 21:07:01] [INFO ] Deduced a trap composed of 6 places in 326 ms
[2020-06-03 21:07:02] [INFO ] Deduced a trap composed of 4 places in 326 ms
[2020-06-03 21:07:02] [INFO ] Deduced a trap composed of 6 places in 315 ms
[2020-06-03 21:07:02] [INFO ] Deduced a trap composed of 4 places in 292 ms
[2020-06-03 21:07:03] [INFO ] Deduced a trap composed of 4 places in 277 ms
[2020-06-03 21:07:03] [INFO ] Deduced a trap composed of 4 places in 277 ms
[2020-06-03 21:07:03] [INFO ] Deduced a trap composed of 4 places in 270 ms
[2020-06-03 21:07:04] [INFO ] Deduced a trap composed of 4 places in 267 ms
[2020-06-03 21:07:04] [INFO ] Deduced a trap composed of 4 places in 277 ms
[2020-06-03 21:07:04] [INFO ] Deduced a trap composed of 5 places in 259 ms
[2020-06-03 21:07:05] [INFO ] Deduced a trap composed of 4 places in 197 ms
[2020-06-03 21:07:05] [INFO ] Deduced a trap composed of 6 places in 186 ms
[2020-06-03 21:07:05] [INFO ] Deduced a trap composed of 4 places in 163 ms
[2020-06-03 21:07:05] [INFO ] Deduced a trap composed of 5 places in 212 ms
[2020-06-03 21:07:06] [INFO ] Deduced a trap composed of 5 places in 320 ms
[2020-06-03 21:07:06] [INFO ] Deduced a trap composed of 6 places in 238 ms
[2020-06-03 21:07:06] [INFO ] Deduced a trap composed of 4 places in 218 ms
[2020-06-03 21:07:07] [INFO ] Deduced a trap composed of 4 places in 212 ms
[2020-06-03 21:07:07] [INFO ] Trap strengthening (SAT) tested/added 105/104 trap constraints in 35845 ms
[2020-06-03 21:07:07] [INFO ] Computed and/alt/rep : 40200/120000/600 causal constraints in 549 ms.
[2020-06-03 21:07:13] [INFO ] Added : 125 causal constraints over 25 iterations in 6629 ms. Result :unknown
[2020-06-03 21:07:14] [INFO ] [Real]Absence check using 400 positive place invariants in 321 ms returned sat
[2020-06-03 21:07:14] [INFO ] [Real]Absence check using 400 positive and 200 generalized place invariants in 171 ms returned sat
[2020-06-03 21:07:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:07:16] [INFO ] [Real]Absence check using state equation in 2281 ms returned sat
[2020-06-03 21:07:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:07:17] [INFO ] [Nat]Absence check using 400 positive place invariants in 201 ms returned sat
[2020-06-03 21:07:17] [INFO ] [Nat]Absence check using 400 positive and 200 generalized place invariants in 123 ms returned sat
[2020-06-03 21:07:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:07:19] [INFO ] [Nat]Absence check using state equation in 1979 ms returned sat
[2020-06-03 21:07:19] [INFO ] [Nat]Added 200 Read/Feed constraints in 111 ms returned sat
[2020-06-03 21:07:20] [INFO ] Deduced a trap composed of 4 places in 704 ms
[2020-06-03 21:07:20] [INFO ] Deduced a trap composed of 4 places in 644 ms
[2020-06-03 21:07:21] [INFO ] Deduced a trap composed of 4 places in 573 ms
[2020-06-03 21:07:22] [INFO ] Deduced a trap composed of 4 places in 539 ms
[2020-06-03 21:07:22] [INFO ] Deduced a trap composed of 4 places in 526 ms
[2020-06-03 21:07:23] [INFO ] Deduced a trap composed of 4 places in 511 ms
[2020-06-03 21:07:23] [INFO ] Deduced a trap composed of 4 places in 507 ms
[2020-06-03 21:07:24] [INFO ] Deduced a trap composed of 4 places in 487 ms
[2020-06-03 21:07:25] [INFO ] Deduced a trap composed of 4 places in 770 ms
[2020-06-03 21:07:25] [INFO ] Deduced a trap composed of 4 places in 483 ms
[2020-06-03 21:07:26] [INFO ] Deduced a trap composed of 4 places in 430 ms
[2020-06-03 21:07:26] [INFO ] Deduced a trap composed of 4 places in 395 ms
[2020-06-03 21:07:26] [INFO ] Deduced a trap composed of 4 places in 383 ms
[2020-06-03 21:07:27] [INFO ] Deduced a trap composed of 4 places in 479 ms
[2020-06-03 21:07:27] [INFO ] Deduced a trap composed of 4 places in 484 ms
[2020-06-03 21:07:28] [INFO ] Deduced a trap composed of 4 places in 478 ms
[2020-06-03 21:07:28] [INFO ] Deduced a trap composed of 4 places in 439 ms
[2020-06-03 21:07:29] [INFO ] Deduced a trap composed of 4 places in 357 ms
[2020-06-03 21:07:29] [INFO ] Deduced a trap composed of 4 places in 366 ms
[2020-06-03 21:07:30] [INFO ] Deduced a trap composed of 4 places in 347 ms
[2020-06-03 21:07:30] [INFO ] Deduced a trap composed of 4 places in 312 ms
[2020-06-03 21:07:30] [INFO ] Deduced a trap composed of 4 places in 294 ms
[2020-06-03 21:07:31] [INFO ] Deduced a trap composed of 4 places in 302 ms
[2020-06-03 21:07:31] [INFO ] Deduced a trap composed of 4 places in 316 ms
[2020-06-03 21:07:32] [INFO ] Deduced a trap composed of 4 places in 414 ms
[2020-06-03 21:07:32] [INFO ] Deduced a trap composed of 4 places in 391 ms
[2020-06-03 21:07:32] [INFO ] Deduced a trap composed of 4 places in 356 ms
[2020-06-03 21:07:33] [INFO ] Deduced a trap composed of 4 places in 391 ms
[2020-06-03 21:07:33] [INFO ] Deduced a trap composed of 4 places in 350 ms
[2020-06-03 21:07:34] [INFO ] Deduced a trap composed of 4 places in 385 ms
[2020-06-03 21:07:34] [INFO ] Deduced a trap composed of 4 places in 326 ms
[2020-06-03 21:07:34] [INFO ] Deduced a trap composed of 4 places in 313 ms
[2020-06-03 21:07:35] [INFO ] Deduced a trap composed of 4 places in 298 ms
[2020-06-03 21:07:35] [INFO ] Deduced a trap composed of 4 places in 286 ms
[2020-06-03 21:07:35] [INFO ] Deduced a trap composed of 4 places in 322 ms
[2020-06-03 21:07:36] [INFO ] Deduced a trap composed of 4 places in 354 ms
[2020-06-03 21:07:36] [INFO ] Deduced a trap composed of 4 places in 304 ms
[2020-06-03 21:07:37] [INFO ] Deduced a trap composed of 4 places in 406 ms
[2020-06-03 21:07:37] [INFO ] Deduced a trap composed of 4 places in 410 ms
[2020-06-03 21:07:38] [INFO ] Deduced a trap composed of 4 places in 368 ms
[2020-06-03 21:07:38] [INFO ] Deduced a trap composed of 4 places in 304 ms
[2020-06-03 21:07:38] [INFO ] Deduced a trap composed of 4 places in 293 ms
[2020-06-03 21:07:39] [INFO ] Deduced a trap composed of 4 places in 280 ms
[2020-06-03 21:07:39] [INFO ] Deduced a trap composed of 4 places in 290 ms
[2020-06-03 21:07:39] [INFO ] Deduced a trap composed of 4 places in 269 ms
[2020-06-03 21:07:40] [INFO ] Deduced a trap composed of 4 places in 273 ms
[2020-06-03 21:07:40] [INFO ] Deduced a trap composed of 4 places in 233 ms
[2020-06-03 21:07:40] [INFO ] Deduced a trap composed of 5 places in 249 ms
[2020-06-03 21:07:41] [INFO ] Deduced a trap composed of 5 places in 204 ms
[2020-06-03 21:07:41] [INFO ] Deduced a trap composed of 4 places in 318 ms
[2020-06-03 21:07:41] [INFO ] Deduced a trap composed of 4 places in 283 ms
[2020-06-03 21:07:42] [INFO ] Deduced a trap composed of 4 places in 322 ms
[2020-06-03 21:07:42] [INFO ] Deduced a trap composed of 4 places in 275 ms
[2020-06-03 21:07:42] [INFO ] Deduced a trap composed of 4 places in 258 ms
[2020-06-03 21:07:43] [INFO ] Deduced a trap composed of 4 places in 262 ms
[2020-06-03 21:07:43] [INFO ] Deduced a trap composed of 4 places in 274 ms
[2020-06-03 21:07:43] [INFO ] Deduced a trap composed of 4 places in 276 ms
[2020-06-03 21:07:44] [INFO ] Deduced a trap composed of 4 places in 231 ms
[2020-06-03 21:07:44] [INFO ] Deduced a trap composed of 5 places in 218 ms
[2020-06-03 21:07:44] [INFO ] Deduced a trap composed of 4 places in 250 ms
[2020-06-03 21:07:44] [INFO ] Deduced a trap composed of 4 places in 230 ms
[2020-06-03 21:07:45] [INFO ] Deduced a trap composed of 5 places in 282 ms
[2020-06-03 21:07:45] [INFO ] Deduced a trap composed of 5 places in 289 ms
[2020-06-03 21:07:45] [INFO ] Deduced a trap composed of 5 places in 244 ms
[2020-06-03 21:07:46] [INFO ] Deduced a trap composed of 4 places in 234 ms
[2020-06-03 21:07:46] [INFO ] Deduced a trap composed of 4 places in 306 ms
[2020-06-03 21:07:46] [INFO ] Deduced a trap composed of 4 places in 277 ms
[2020-06-03 21:07:47] [INFO ] Deduced a trap composed of 5 places in 254 ms
[2020-06-03 21:07:47] [INFO ] Deduced a trap composed of 5 places in 252 ms
[2020-06-03 21:07:47] [INFO ] Deduced a trap composed of 4 places in 228 ms
[2020-06-03 21:07:48] [INFO ] Deduced a trap composed of 5 places in 266 ms
[2020-06-03 21:07:48] [INFO ] Deduced a trap composed of 4 places in 227 ms
[2020-06-03 21:07:48] [INFO ] Deduced a trap composed of 4 places in 238 ms
[2020-06-03 21:07:48] [INFO ] Trap strengthening (SAT) tested/added 74/73 trap constraints in 29474 ms
[2020-06-03 21:07:49] [INFO ] Computed and/alt/rep : 40200/120000/600 causal constraints in 533 ms.
[2020-06-03 21:08:01] [INFO ] Added : 201 causal constraints over 41 iterations in 12999 ms. Result :unknown
[2020-06-03 21:08:02] [INFO ] [Real]Absence check using 400 positive place invariants in 281 ms returned sat
[2020-06-03 21:08:02] [INFO ] [Real]Absence check using 400 positive and 200 generalized place invariants in 186 ms returned sat
[2020-06-03 21:08:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:08:04] [INFO ] [Real]Absence check using state equation in 2008 ms returned sat
[2020-06-03 21:08:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:08:05] [INFO ] [Nat]Absence check using 400 positive place invariants in 263 ms returned sat
[2020-06-03 21:08:05] [INFO ] [Nat]Absence check using 400 positive and 200 generalized place invariants in 181 ms returned sat
[2020-06-03 21:08:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:08:07] [INFO ] [Nat]Absence check using state equation in 2134 ms returned sat
[2020-06-03 21:08:07] [INFO ] [Nat]Added 200 Read/Feed constraints in 114 ms returned sat
[2020-06-03 21:08:08] [INFO ] Deduced a trap composed of 4 places in 637 ms
[2020-06-03 21:08:08] [INFO ] Deduced a trap composed of 4 places in 640 ms
[2020-06-03 21:08:09] [INFO ] Deduced a trap composed of 5 places in 466 ms
[2020-06-03 21:08:09] [INFO ] Deduced a trap composed of 4 places in 458 ms
[2020-06-03 21:08:10] [INFO ] Deduced a trap composed of 4 places in 541 ms
[2020-06-03 21:08:10] [INFO ] Deduced a trap composed of 4 places in 476 ms
[2020-06-03 21:08:11] [INFO ] Deduced a trap composed of 4 places in 446 ms
[2020-06-03 21:08:11] [INFO ] Deduced a trap composed of 5 places in 438 ms
[2020-06-03 21:08:12] [INFO ] Deduced a trap composed of 4 places in 487 ms
[2020-06-03 21:08:13] [INFO ] Deduced a trap composed of 5 places in 601 ms
[2020-06-03 21:08:13] [INFO ] Deduced a trap composed of 4 places in 455 ms
[2020-06-03 21:08:13] [INFO ] Deduced a trap composed of 4 places in 404 ms
[2020-06-03 21:08:14] [INFO ] Deduced a trap composed of 6 places in 386 ms
[2020-06-03 21:08:14] [INFO ] Deduced a trap composed of 4 places in 490 ms
[2020-06-03 21:08:15] [INFO ] Deduced a trap composed of 4 places in 426 ms
[2020-06-03 21:08:15] [INFO ] Deduced a trap composed of 6 places in 474 ms
[2020-06-03 21:08:16] [INFO ] Deduced a trap composed of 4 places in 358 ms
[2020-06-03 21:08:16] [INFO ] Deduced a trap composed of 4 places in 445 ms
[2020-06-03 21:08:17] [INFO ] Deduced a trap composed of 4 places in 445 ms
[2020-06-03 21:08:17] [INFO ] Deduced a trap composed of 6 places in 425 ms
[2020-06-03 21:08:18] [INFO ] Deduced a trap composed of 4 places in 452 ms
[2020-06-03 21:08:18] [INFO ] Deduced a trap composed of 4 places in 379 ms
[2020-06-03 21:08:19] [INFO ] Deduced a trap composed of 4 places in 447 ms
[2020-06-03 21:08:19] [INFO ] Deduced a trap composed of 4 places in 422 ms
[2020-06-03 21:08:19] [INFO ] Deduced a trap composed of 4 places in 367 ms
[2020-06-03 21:08:20] [INFO ] Deduced a trap composed of 4 places in 414 ms
[2020-06-03 21:08:20] [INFO ] Deduced a trap composed of 4 places in 325 ms
[2020-06-03 21:08:21] [INFO ] Deduced a trap composed of 4 places in 409 ms
[2020-06-03 21:08:21] [INFO ] Deduced a trap composed of 4 places in 400 ms
[2020-06-03 21:08:22] [INFO ] Deduced a trap composed of 4 places in 416 ms
[2020-06-03 21:08:22] [INFO ] Deduced a trap composed of 4 places in 400 ms
[2020-06-03 21:08:22] [INFO ] Deduced a trap composed of 4 places in 385 ms
[2020-06-03 21:08:23] [INFO ] Deduced a trap composed of 4 places in 397 ms
[2020-06-03 21:08:23] [INFO ] Deduced a trap composed of 4 places in 415 ms
[2020-06-03 21:08:24] [INFO ] Deduced a trap composed of 4 places in 360 ms
[2020-06-03 21:08:24] [INFO ] Deduced a trap composed of 4 places in 345 ms
[2020-06-03 21:08:25] [INFO ] Deduced a trap composed of 4 places in 336 ms
[2020-06-03 21:08:25] [INFO ] Deduced a trap composed of 4 places in 372 ms
[2020-06-03 21:08:25] [INFO ] Deduced a trap composed of 4 places in 341 ms
[2020-06-03 21:08:26] [INFO ] Deduced a trap composed of 4 places in 408 ms
[2020-06-03 21:08:26] [INFO ] Deduced a trap composed of 5 places in 335 ms
[2020-06-03 21:08:27] [INFO ] Deduced a trap composed of 4 places in 408 ms
[2020-06-03 21:08:27] [INFO ] Deduced a trap composed of 4 places in 421 ms
[2020-06-03 21:08:27] [INFO ] Deduced a trap composed of 4 places in 365 ms
[2020-06-03 21:08:28] [INFO ] Deduced a trap composed of 4 places in 372 ms
[2020-06-03 21:08:28] [INFO ] Deduced a trap composed of 4 places in 277 ms
[2020-06-03 21:08:28] [INFO ] Deduced a trap composed of 5 places in 245 ms
[2020-06-03 21:08:29] [INFO ] Deduced a trap composed of 4 places in 329 ms
[2020-06-03 21:08:29] [INFO ] Deduced a trap composed of 4 places in 305 ms
[2020-06-03 21:08:30] [INFO ] Deduced a trap composed of 4 places in 292 ms
[2020-06-03 21:08:30] [INFO ] Deduced a trap composed of 4 places in 394 ms
[2020-06-03 21:08:30] [INFO ] Deduced a trap composed of 4 places in 375 ms
[2020-06-03 21:08:31] [INFO ] Deduced a trap composed of 4 places in 282 ms
[2020-06-03 21:08:31] [INFO ] Deduced a trap composed of 4 places in 443 ms
[2020-06-03 21:08:32] [INFO ] Deduced a trap composed of 4 places in 432 ms
[2020-06-03 21:08:32] [INFO ] Deduced a trap composed of 4 places in 316 ms
[2020-06-03 21:08:32] [INFO ] Deduced a trap composed of 5 places in 315 ms
[2020-06-03 21:08:33] [INFO ] Deduced a trap composed of 5 places in 358 ms
[2020-06-03 21:08:33] [INFO ] Deduced a trap composed of 4 places in 269 ms
[2020-06-03 21:08:33] [INFO ] Deduced a trap composed of 4 places in 269 ms
[2020-06-03 21:08:34] [INFO ] Deduced a trap composed of 4 places in 255 ms
[2020-06-03 21:08:34] [INFO ] Deduced a trap composed of 5 places in 249 ms
[2020-06-03 21:08:34] [INFO ] Deduced a trap composed of 5 places in 291 ms
[2020-06-03 21:08:35] [INFO ] Deduced a trap composed of 4 places in 313 ms
[2020-06-03 21:08:35] [INFO ] Deduced a trap composed of 4 places in 287 ms
[2020-06-03 21:08:36] [INFO ] Deduced a trap composed of 5 places in 291 ms
[2020-06-03 21:08:36] [INFO ] Deduced a trap composed of 5 places in 265 ms
[2020-06-03 21:08:36] [INFO ] Deduced a trap composed of 5 places in 302 ms
[2020-06-03 21:08:37] [INFO ] Deduced a trap composed of 5 places in 263 ms
[2020-06-03 21:08:37] [INFO ] Deduced a trap composed of 5 places in 281 ms
[2020-06-03 21:08:37] [INFO ] Deduced a trap composed of 4 places in 373 ms
[2020-06-03 21:08:38] [INFO ] Deduced a trap composed of 4 places in 362 ms
[2020-06-03 21:08:38] [INFO ] Deduced a trap composed of 4 places in 358 ms
[2020-06-03 21:08:39] [INFO ] Deduced a trap composed of 4 places in 288 ms
[2020-06-03 21:08:39] [INFO ] Deduced a trap composed of 4 places in 296 ms
[2020-06-03 21:08:39] [INFO ] Deduced a trap composed of 4 places in 351 ms
[2020-06-03 21:08:40] [INFO ] Deduced a trap composed of 5 places in 317 ms
[2020-06-03 21:08:41] [INFO ] Deduced a trap composed of 4 places in 864 ms
[2020-06-03 21:08:41] [INFO ] Deduced a trap composed of 5 places in 478 ms
[2020-06-03 21:08:42] [INFO ] Deduced a trap composed of 4 places in 327 ms
[2020-06-03 21:08:42] [INFO ] Deduced a trap composed of 4 places in 293 ms
[2020-06-03 21:08:42] [INFO ] Deduced a trap composed of 4 places in 286 ms
[2020-06-03 21:08:42] [INFO ] Deduced a trap composed of 5 places in 209 ms
[2020-06-03 21:08:43] [INFO ] Deduced a trap composed of 5 places in 219 ms
[2020-06-03 21:08:43] [INFO ] Deduced a trap composed of 4 places in 253 ms
[2020-06-03 21:08:43] [INFO ] Deduced a trap composed of 4 places in 234 ms
[2020-06-03 21:08:44] [INFO ] Deduced a trap composed of 5 places in 230 ms
[2020-06-03 21:08:44] [INFO ] Deduced a trap composed of 5 places in 209 ms
[2020-06-03 21:08:44] [INFO ] Deduced a trap composed of 5 places in 206 ms
[2020-06-03 21:08:44] [INFO ] Deduced a trap composed of 4 places in 221 ms
[2020-06-03 21:08:45] [INFO ] Deduced a trap composed of 4 places in 304 ms
[2020-06-03 21:08:45] [INFO ] Deduced a trap composed of 5 places in 324 ms
[2020-06-03 21:08:46] [INFO ] Deduced a trap composed of 4 places in 375 ms
[2020-06-03 21:08:46] [INFO ] Deduced a trap composed of 4 places in 336 ms
[2020-06-03 21:08:46] [INFO ] Deduced a trap composed of 5 places in 261 ms
[2020-06-03 21:08:47] [INFO ] Deduced a trap composed of 4 places in 238 ms
[2020-06-03 21:08:47] [INFO ] Deduced a trap composed of 4 places in 221 ms
[2020-06-03 21:08:47] [INFO ] Deduced a trap composed of 5 places in 205 ms
[2020-06-03 21:08:47] [INFO ] Deduced a trap composed of 4 places in 233 ms
[2020-06-03 21:08:48] [INFO ] Deduced a trap composed of 4 places in 246 ms
[2020-06-03 21:08:48] [INFO ] Deduced a trap composed of 5 places in 233 ms
[2020-06-03 21:08:48] [INFO ] Deduced a trap composed of 5 places in 210 ms
[2020-06-03 21:08:48] [INFO ] Deduced a trap composed of 5 places in 225 ms
[2020-06-03 21:08:49] [INFO ] Deduced a trap composed of 5 places in 212 ms
[2020-06-03 21:08:49] [INFO ] Deduced a trap composed of 4 places in 198 ms
[2020-06-03 21:08:49] [INFO ] Deduced a trap composed of 5 places in 227 ms
[2020-06-03 21:08:49] [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 (> (+ s26 s274 s440 s811 s812) 0)") while checking expression at index 2
Incomplete Parikh walk after 45900 steps, including 1000 resets, run finished after 5352 ms. (steps per millisecond=8 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 45400 steps, including 1000 resets, run finished after 4558 ms. (steps per millisecond=9 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 12 out of 1000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1000/1000 places, 40400/40400 transitions.
Applied a total of 0 rules in 505 ms. Remains 1000 /1000 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1000/1000 places, 40400/40400 transitions.
Starting structural reductions, iteration 0 : 1000/1000 places, 40400/40400 transitions.
Applied a total of 0 rules in 472 ms. Remains 1000 /1000 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2020-06-03 21:09:00] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 1000 cols
[2020-06-03 21:09:00] [INFO ] Computed 600 place invariants in 6 ms
[2020-06-03 21:09:31] [INFO ] Performed 342/1000 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2020-06-03 21:09:39] [INFO ] Implicit Places using invariants in 38547 ms returned [400, 403, 406, 409, 412, 415, 418, 421, 424, 427, 430, 433, 436, 439, 442, 445, 448, 451, 454, 457, 460, 463, 466, 469, 472, 475, 478, 481, 484, 487, 490, 493, 496, 499, 502, 505, 508, 511, 514, 517, 520, 523, 526, 529, 532, 535, 538, 541, 547, 550, 553, 556, 559, 562, 565, 568, 571, 574, 577, 580, 583, 586, 589, 592, 595, 598, 601, 604, 607, 610, 613, 616, 619, 622, 625, 628, 631, 634, 637, 640, 643, 646, 649, 652, 655, 658, 661, 664, 667, 670, 673, 676, 679, 682, 685, 688, 691, 694, 697, 700, 703, 706, 709, 712, 715, 718, 721, 724, 727, 730, 733, 736, 739, 742, 745, 748, 751, 757, 760, 763, 766, 769, 772, 775, 778, 781, 784, 787, 790, 793, 796, 802, 805, 808, 811, 814, 817, 820, 823, 826, 829, 832, 835, 841, 844, 847, 850, 853, 856, 859, 862, 865, 868, 871, 874, 877, 880, 883, 886, 889, 892, 895, 898, 901, 904, 907, 910, 913, 916, 919, 922, 925, 928, 931, 934, 937, 940, 943, 946, 949, 952, 955, 958, 961, 964, 967, 970, 973, 976, 979, 982, 985, 988, 991, 994, 997]
Discarding 196 places :
Implicit Place search using SMT only with invariants took 38610 ms to find 196 implicit places.
[2020-06-03 21:09:39] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 804 cols
[2020-06-03 21:09:39] [INFO ] Computed 404 place invariants in 7 ms
[2020-06-03 21:10:09] [INFO ] Performed 17438/40400 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2020-06-03 21:10:39] [INFO ] Dead Transitions with SMT raised an exceptionSMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (and (>= s127 1) (>= s355 1) (>= s758 1))") after 60032 ms
Starting structural reductions, iteration 1 : 804/1000 places, 40400/40400 transitions.
Applied a total of 0 rules in 559 ms. Remains 804 /804 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2020-06-03 21:10:39] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 804 cols
[2020-06-03 21:10:39] [INFO ] Computed 404 place invariants in 9 ms
[2020-06-03 21:11:10] [INFO ] Performed 14363/40400 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2020-06-03 21:11:39] [INFO ] Dead Transitions with SMT raised an exceptionSMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (and (>= s81 1) (>= s311 1) (>= s714 1))") after 60044 ms
Finished structural reductions, in 2 iterations. Remains : 804/1000 places, 40400/40400 transitions.
Interrupted random walk after 677281 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=22 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 4229 ms. (steps per millisecond=236 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 4442 ms. (steps per millisecond=225 ) properties seen :[0, 0, 0]
Interrupted Best-First random walk after 928001 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=185 ) properties seen :[0, 0, 0]
Interrupted probabilistic random walk after 3331966 steps, run timeout after 30003 ms. (steps per millisecond=111 ) properties seen :[0, 0, 0]
Probabilistic random walk after 3331966 steps, saw 12457 distinct states, run finished after 30003 ms. (steps per millisecond=111 ) properties seen :[0, 0, 0]
[2020-06-03 21:12:53] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 804 cols
[2020-06-03 21:12:53] [INFO ] Computed 404 place invariants in 2 ms
[2020-06-03 21:12:54] [INFO ] [Real]Absence check using 400 positive place invariants in 216 ms returned sat
[2020-06-03 21:12:54] [INFO ] [Real]Absence check using 400 positive and 4 generalized place invariants in 4 ms returned sat
[2020-06-03 21:12:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:12:55] [INFO ] [Real]Absence check using state equation in 1269 ms returned sat
[2020-06-03 21:12:55] [INFO ] State equation strengthened by 200 read => feed constraints.
[2020-06-03 21:12:55] [INFO ] [Real]Added 200 Read/Feed constraints in 169 ms returned sat
[2020-06-03 21:12:56] [INFO ] Deduced a trap composed of 4 places in 659 ms
[2020-06-03 21:12:57] [INFO ] Deduced a trap composed of 4 places in 699 ms
[2020-06-03 21:12:57] [INFO ] Deduced a trap composed of 4 places in 586 ms
[2020-06-03 21:12:58] [INFO ] Deduced a trap composed of 4 places in 582 ms
[2020-06-03 21:12:59] [INFO ] Deduced a trap composed of 4 places in 764 ms
[2020-06-03 21:12:59] [INFO ] Deduced a trap composed of 4 places in 599 ms
[2020-06-03 21:13:00] [INFO ] Deduced a trap composed of 4 places in 566 ms
[2020-06-03 21:13:01] [INFO ] Deduced a trap composed of 4 places in 669 ms
[2020-06-03 21:13:01] [INFO ] Deduced a trap composed of 4 places in 539 ms
[2020-06-03 21:13:02] [INFO ] Deduced a trap composed of 4 places in 527 ms
[2020-06-03 21:13:02] [INFO ] Deduced a trap composed of 4 places in 518 ms
[2020-06-03 21:13:03] [INFO ] Deduced a trap composed of 4 places in 489 ms
[2020-06-03 21:13:03] [INFO ] Deduced a trap composed of 4 places in 495 ms
[2020-06-03 21:13:04] [INFO ] Deduced a trap composed of 4 places in 474 ms
[2020-06-03 21:13:05] [INFO ] Deduced a trap composed of 4 places in 473 ms
[2020-06-03 21:13:05] [INFO ] Deduced a trap composed of 4 places in 468 ms
[2020-06-03 21:13:06] [INFO ] Deduced a trap composed of 4 places in 454 ms
[2020-06-03 21:13:06] [INFO ] Deduced a trap composed of 4 places in 457 ms
[2020-06-03 21:13:07] [INFO ] Deduced a trap composed of 4 places in 427 ms
[2020-06-03 21:13:07] [INFO ] Deduced a trap composed of 4 places in 411 ms
[2020-06-03 21:13:07] [INFO ] Deduced a trap composed of 4 places in 438 ms
[2020-06-03 21:13:08] [INFO ] Deduced a trap composed of 4 places in 383 ms
[2020-06-03 21:13:08] [INFO ] Deduced a trap composed of 4 places in 387 ms
[2020-06-03 21:13:09] [INFO ] Deduced a trap composed of 4 places in 377 ms
[2020-06-03 21:13:09] [INFO ] Deduced a trap composed of 4 places in 360 ms
[2020-06-03 21:13:10] [INFO ] Deduced a trap composed of 4 places in 348 ms
[2020-06-03 21:13:10] [INFO ] Deduced a trap composed of 4 places in 365 ms
[2020-06-03 21:13:10] [INFO ] Deduced a trap composed of 4 places in 388 ms
[2020-06-03 21:13:11] [INFO ] Deduced a trap composed of 4 places in 364 ms
[2020-06-03 21:13:11] [INFO ] Deduced a trap composed of 4 places in 362 ms
[2020-06-03 21:13:12] [INFO ] Deduced a trap composed of 4 places in 371 ms
[2020-06-03 21:13:12] [INFO ] Deduced a trap composed of 4 places in 429 ms
[2020-06-03 21:13:13] [INFO ] Deduced a trap composed of 4 places in 397 ms
[2020-06-03 21:13:13] [INFO ] Deduced a trap composed of 4 places in 385 ms
[2020-06-03 21:13:13] [INFO ] Deduced a trap composed of 4 places in 385 ms
[2020-06-03 21:13:14] [INFO ] Deduced a trap composed of 4 places in 387 ms
[2020-06-03 21:13:14] [INFO ] Deduced a trap composed of 4 places in 375 ms
[2020-06-03 21:13:15] [INFO ] Deduced a trap composed of 4 places in 367 ms
[2020-06-03 21:13:15] [INFO ] Deduced a trap composed of 4 places in 362 ms
[2020-06-03 21:13:16] [INFO ] Deduced a trap composed of 4 places in 345 ms
[2020-06-03 21:13:16] [INFO ] Deduced a trap composed of 4 places in 345 ms
[2020-06-03 21:13:16] [INFO ] Deduced a trap composed of 4 places in 432 ms
[2020-06-03 21:13:17] [INFO ] Deduced a trap composed of 4 places in 459 ms
[2020-06-03 21:13:17] [INFO ] Deduced a trap composed of 4 places in 450 ms
[2020-06-03 21:13:18] [INFO ] Deduced a trap composed of 4 places in 537 ms
[2020-06-03 21:13:19] [INFO ] Deduced a trap composed of 4 places in 563 ms
[2020-06-03 21:13:19] [INFO ] Deduced a trap composed of 4 places in 502 ms
[2020-06-03 21:13:20] [INFO ] Deduced a trap composed of 4 places in 473 ms
[2020-06-03 21:13:20] [INFO ] Deduced a trap composed of 4 places in 370 ms
[2020-06-03 21:13:21] [INFO ] Deduced a trap composed of 4 places in 343 ms
[2020-06-03 21:13:21] [INFO ] Deduced a trap composed of 4 places in 340 ms
[2020-06-03 21:13:21] [INFO ] Deduced a trap composed of 4 places in 333 ms
[2020-06-03 21:13:22] [INFO ] Deduced a trap composed of 4 places in 337 ms
[2020-06-03 21:13:22] [INFO ] Deduced a trap composed of 4 places in 320 ms
[2020-06-03 21:13:22] [INFO ] Deduced a trap composed of 4 places in 309 ms
[2020-06-03 21:13:23] [INFO ] Deduced a trap composed of 4 places in 317 ms
[2020-06-03 21:13:23] [INFO ] Deduced a trap composed of 4 places in 309 ms
[2020-06-03 21:13:23] [INFO ] Deduced a trap composed of 4 places in 297 ms
[2020-06-03 21:13:24] [INFO ] Deduced a trap composed of 4 places in 305 ms
[2020-06-03 21:13:24] [INFO ] Deduced a trap composed of 4 places in 274 ms
[2020-06-03 21:13:24] [INFO ] Deduced a trap composed of 4 places in 255 ms
[2020-06-03 21:13:25] [INFO ] Deduced a trap composed of 4 places in 257 ms
[2020-06-03 21:13:25] [INFO ] Deduced a trap composed of 4 places in 382 ms
[2020-06-03 21:13:26] [INFO ] Deduced a trap composed of 4 places in 384 ms
[2020-06-03 21:13:26] [INFO ] Deduced a trap composed of 4 places in 398 ms
[2020-06-03 21:13:27] [INFO ] Deduced a trap composed of 4 places in 509 ms
[2020-06-03 21:13:27] [INFO ] Deduced a trap composed of 4 places in 481 ms
[2020-06-03 21:13:28] [INFO ] Deduced a trap composed of 4 places in 468 ms
[2020-06-03 21:13:28] [INFO ] Deduced a trap composed of 4 places in 444 ms
[2020-06-03 21:13:29] [INFO ] Deduced a trap composed of 4 places in 359 ms
[2020-06-03 21:13:29] [INFO ] Deduced a trap composed of 4 places in 335 ms
[2020-06-03 21:13:29] [INFO ] Deduced a trap composed of 4 places in 325 ms
[2020-06-03 21:13:30] [INFO ] Deduced a trap composed of 4 places in 312 ms
[2020-06-03 21:13:30] [INFO ] Deduced a trap composed of 4 places in 404 ms
[2020-06-03 21:13:31] [INFO ] Deduced a trap composed of 4 places in 359 ms
[2020-06-03 21:13:31] [INFO ] Deduced a trap composed of 4 places in 277 ms
[2020-06-03 21:13:31] [INFO ] Deduced a trap composed of 4 places in 259 ms
[2020-06-03 21:13:31] [INFO ] Deduced a trap composed of 4 places in 242 ms
[2020-06-03 21:13:32] [INFO ] Deduced a trap composed of 4 places in 316 ms
[2020-06-03 21:13:32] [INFO ] Deduced a trap composed of 4 places in 351 ms
[2020-06-03 21:13:33] [INFO ] Deduced a trap composed of 4 places in 334 ms
[2020-06-03 21:13:33] [INFO ] Deduced a trap composed of 4 places in 314 ms
[2020-06-03 21:13:33] [INFO ] Deduced a trap composed of 4 places in 242 ms
[2020-06-03 21:13:34] [INFO ] Deduced a trap composed of 4 places in 226 ms
[2020-06-03 21:13:34] [INFO ] Deduced a trap composed of 4 places in 215 ms
[2020-06-03 21:13:34] [INFO ] Deduced a trap composed of 4 places in 296 ms
[2020-06-03 21:13:34] [INFO ] Deduced a trap composed of 4 places in 274 ms
[2020-06-03 21:13:35] [INFO ] Deduced a trap composed of 4 places in 356 ms
[2020-06-03 21:13:35] [INFO ] Deduced a trap composed of 4 places in 310 ms
[2020-06-03 21:13:36] [INFO ] Deduced a trap composed of 4 places in 288 ms
[2020-06-03 21:13:36] [INFO ] Deduced a trap composed of 4 places in 264 ms
[2020-06-03 21:13:36] [INFO ] Deduced a trap composed of 4 places in 327 ms
[2020-06-03 21:13:37] [INFO ] Deduced a trap composed of 4 places in 227 ms
[2020-06-03 21:13:37] [INFO ] Deduced a trap composed of 4 places in 334 ms
[2020-06-03 21:13:37] [INFO ] Deduced a trap composed of 4 places in 296 ms
[2020-06-03 21:13:38] [INFO ] Deduced a trap composed of 4 places in 261 ms
[2020-06-03 21:13:38] [INFO ] Deduced a trap composed of 4 places in 256 ms
[2020-06-03 21:13:38] [INFO ] Deduced a trap composed of 4 places in 242 ms
[2020-06-03 21:13:38] [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 (> (+ s48 s190 s448 s591) 0)") while checking expression at index 0
[2020-06-03 21:13:39] [INFO ] [Real]Absence check using 400 positive place invariants in 227 ms returned sat
[2020-06-03 21:13:39] [INFO ] [Real]Absence check using 400 positive and 4 generalized place invariants in 6 ms returned sat
[2020-06-03 21:13:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:13:40] [INFO ] [Real]Absence check using state equation in 1402 ms returned sat
[2020-06-03 21:13:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:13:40] [INFO ] [Nat]Absence check using 400 positive place invariants in 215 ms returned sat
[2020-06-03 21:13:40] [INFO ] [Nat]Absence check using 400 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-03 21:13:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:13:42] [INFO ] [Nat]Absence check using state equation in 1601 ms returned sat
[2020-06-03 21:13:42] [INFO ] [Nat]Added 200 Read/Feed constraints in 111 ms returned sat
[2020-06-03 21:13:43] [INFO ] Deduced a trap composed of 4 places in 747 ms
[2020-06-03 21:13:44] [INFO ] Deduced a trap composed of 4 places in 612 ms
[2020-06-03 21:13:44] [INFO ] Deduced a trap composed of 4 places in 544 ms
[2020-06-03 21:13:45] [INFO ] Deduced a trap composed of 4 places in 611 ms
[2020-06-03 21:13:45] [INFO ] Deduced a trap composed of 4 places in 571 ms
[2020-06-03 21:13:46] [INFO ] Deduced a trap composed of 4 places in 532 ms
[2020-06-03 21:13:47] [INFO ] Deduced a trap composed of 4 places in 569 ms
[2020-06-03 21:13:47] [INFO ] Deduced a trap composed of 4 places in 567 ms
[2020-06-03 21:13:48] [INFO ] Deduced a trap composed of 4 places in 657 ms
[2020-06-03 21:13:48] [INFO ] Deduced a trap composed of 4 places in 569 ms
[2020-06-03 21:13:49] [INFO ] Deduced a trap composed of 4 places in 523 ms
[2020-06-03 21:13:50] [INFO ] Deduced a trap composed of 4 places in 512 ms
[2020-06-03 21:13:50] [INFO ] Deduced a trap composed of 4 places in 480 ms
[2020-06-03 21:13:51] [INFO ] Deduced a trap composed of 4 places in 476 ms
[2020-06-03 21:13:51] [INFO ] Deduced a trap composed of 4 places in 553 ms
[2020-06-03 21:13:52] [INFO ] Deduced a trap composed of 4 places in 475 ms
[2020-06-03 21:13:52] [INFO ] Deduced a trap composed of 4 places in 480 ms
[2020-06-03 21:13:53] [INFO ] Deduced a trap composed of 4 places in 466 ms
[2020-06-03 21:13:53] [INFO ] Deduced a trap composed of 4 places in 438 ms
[2020-06-03 21:13:54] [INFO ] Deduced a trap composed of 4 places in 445 ms
[2020-06-03 21:13:54] [INFO ] Deduced a trap composed of 4 places in 438 ms
[2020-06-03 21:13:55] [INFO ] Deduced a trap composed of 4 places in 422 ms
[2020-06-03 21:13:55] [INFO ] Deduced a trap composed of 4 places in 400 ms
[2020-06-03 21:13:56] [INFO ] Deduced a trap composed of 4 places in 436 ms
[2020-06-03 21:13:56] [INFO ] Deduced a trap composed of 4 places in 483 ms
[2020-06-03 21:13:57] [INFO ] Deduced a trap composed of 4 places in 507 ms
[2020-06-03 21:13:57] [INFO ] Deduced a trap composed of 4 places in 443 ms
[2020-06-03 21:13:58] [INFO ] Deduced a trap composed of 4 places in 431 ms
[2020-06-03 21:13:58] [INFO ] Deduced a trap composed of 4 places in 382 ms
[2020-06-03 21:13:59] [INFO ] Deduced a trap composed of 4 places in 484 ms
[2020-06-03 21:13:59] [INFO ] Deduced a trap composed of 4 places in 443 ms
[2020-06-03 21:13:59] [INFO ] Deduced a trap composed of 4 places in 423 ms
[2020-06-03 21:14:00] [INFO ] Deduced a trap composed of 4 places in 393 ms
[2020-06-03 21:14:00] [INFO ] Deduced a trap composed of 4 places in 394 ms
[2020-06-03 21:14:01] [INFO ] Deduced a trap composed of 4 places in 448 ms
[2020-06-03 21:14:01] [INFO ] Deduced a trap composed of 4 places in 406 ms
[2020-06-03 21:14:02] [INFO ] Deduced a trap composed of 4 places in 415 ms
[2020-06-03 21:14:02] [INFO ] Deduced a trap composed of 4 places in 422 ms
[2020-06-03 21:14:03] [INFO ] Deduced a trap composed of 4 places in 420 ms
[2020-06-03 21:14:03] [INFO ] Deduced a trap composed of 4 places in 420 ms
[2020-06-03 21:14:04] [INFO ] Deduced a trap composed of 4 places in 402 ms
[2020-06-03 21:14:04] [INFO ] Deduced a trap composed of 4 places in 380 ms
[2020-06-03 21:14:04] [INFO ] Deduced a trap composed of 4 places in 489 ms
[2020-06-03 21:14:05] [INFO ] Deduced a trap composed of 4 places in 509 ms
[2020-06-03 21:14:06] [INFO ] Deduced a trap composed of 4 places in 484 ms
[2020-06-03 21:14:06] [INFO ] Deduced a trap composed of 4 places in 463 ms
[2020-06-03 21:14:06] [INFO ] Deduced a trap composed of 4 places in 381 ms
[2020-06-03 21:14:07] [INFO ] Deduced a trap composed of 4 places in 366 ms
[2020-06-03 21:14:07] [INFO ] Deduced a trap composed of 4 places in 346 ms
[2020-06-03 21:14:08] [INFO ] Deduced a trap composed of 4 places in 322 ms
[2020-06-03 21:14:08] [INFO ] Deduced a trap composed of 4 places in 362 ms
[2020-06-03 21:14:08] [INFO ] Deduced a trap composed of 4 places in 344 ms
[2020-06-03 21:14:09] [INFO ] Deduced a trap composed of 4 places in 342 ms
[2020-06-03 21:14:09] [INFO ] Deduced a trap composed of 4 places in 335 ms
[2020-06-03 21:14:10] [INFO ] Deduced a trap composed of 4 places in 348 ms
[2020-06-03 21:14:10] [INFO ] Deduced a trap composed of 4 places in 346 ms
[2020-06-03 21:14:10] [INFO ] Deduced a trap composed of 4 places in 363 ms
[2020-06-03 21:14:11] [INFO ] Deduced a trap composed of 4 places in 357 ms
[2020-06-03 21:14:11] [INFO ] Deduced a trap composed of 4 places in 363 ms
[2020-06-03 21:14:12] [INFO ] Deduced a trap composed of 4 places in 366 ms
[2020-06-03 21:14:12] [INFO ] Deduced a trap composed of 4 places in 481 ms
[2020-06-03 21:14:13] [INFO ] Deduced a trap composed of 4 places in 431 ms
[2020-06-03 21:14:13] [INFO ] Deduced a trap composed of 4 places in 331 ms
[2020-06-03 21:14:13] [INFO ] Deduced a trap composed of 4 places in 336 ms
[2020-06-03 21:14:14] [INFO ] Deduced a trap composed of 4 places in 328 ms
[2020-06-03 21:14:14] [INFO ] Deduced a trap composed of 4 places in 299 ms
[2020-06-03 21:14:14] [INFO ] Deduced a trap composed of 4 places in 299 ms
[2020-06-03 21:14:15] [INFO ] Deduced a trap composed of 4 places in 284 ms
[2020-06-03 21:14:15] [INFO ] Deduced a trap composed of 4 places in 268 ms
[2020-06-03 21:14:15] [INFO ] Deduced a trap composed of 4 places in 271 ms
[2020-06-03 21:14:16] [INFO ] Deduced a trap composed of 4 places in 270 ms
[2020-06-03 21:14:16] [INFO ] Deduced a trap composed of 4 places in 404 ms
[2020-06-03 21:14:17] [INFO ] Deduced a trap composed of 4 places in 408 ms
[2020-06-03 21:14:17] [INFO ] Deduced a trap composed of 4 places in 357 ms
[2020-06-03 21:14:17] [INFO ] Deduced a trap composed of 4 places in 361 ms
[2020-06-03 21:14:18] [INFO ] Deduced a trap composed of 4 places in 297 ms
[2020-06-03 21:14:18] [INFO ] Deduced a trap composed of 4 places in 439 ms
[2020-06-03 21:14:19] [INFO ] Deduced a trap composed of 4 places in 421 ms
[2020-06-03 21:14:19] [INFO ] Deduced a trap composed of 4 places in 391 ms
[2020-06-03 21:14:20] [INFO ] Deduced a trap composed of 4 places in 646 ms
[2020-06-03 21:14:20] [INFO ] Deduced a trap composed of 4 places in 531 ms
[2020-06-03 21:14:21] [INFO ] Deduced a trap composed of 4 places in 451 ms
[2020-06-03 21:14:21] [INFO ] Deduced a trap composed of 4 places in 424 ms
[2020-06-03 21:14:22] [INFO ] Deduced a trap composed of 4 places in 325 ms
[2020-06-03 21:14:22] [INFO ] Deduced a trap composed of 4 places in 313 ms
[2020-06-03 21:14:23] [INFO ] Deduced a trap composed of 4 places in 311 ms
[2020-06-03 21:14:23] [INFO ] Deduced a trap composed of 4 places in 296 ms
[2020-06-03 21:14:23] [INFO ] Deduced a trap composed of 4 places in 271 ms
[2020-06-03 21:14:23] [INFO ] Deduced a trap composed of 4 places in 265 ms
[2020-06-03 21:14:24] [INFO ] Deduced a trap composed of 4 places in 301 ms
[2020-06-03 21:14:24] [INFO ] Deduced a trap composed of 4 places in 300 ms
[2020-06-03 21:14:24] [INFO ] Deduced a trap composed of 4 places in 288 ms
[2020-06-03 21:14:25] [INFO ] Deduced a trap composed of 4 places in 293 ms
[2020-06-03 21:14:25] [INFO ] Deduced a trap composed of 4 places in 267 ms
[2020-06-03 21:14:25] [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 (> (+ s166 s258 s567 s660) 0)") while checking expression at index 1
[2020-06-03 21:14:25] [INFO ] [Real]Absence check using 400 positive place invariants in 239 ms returned sat
[2020-06-03 21:14:25] [INFO ] [Real]Absence check using 400 positive and 4 generalized place invariants in 7 ms returned sat
[2020-06-03 21:14:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:14:27] [INFO ] [Real]Absence check using state equation in 1557 ms returned sat
[2020-06-03 21:14:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:14:27] [INFO ] [Nat]Absence check using 400 positive place invariants in 227 ms returned sat
[2020-06-03 21:14:27] [INFO ] [Nat]Absence check using 400 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-03 21:14:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:14:29] [INFO ] [Nat]Absence check using state equation in 1382 ms returned sat
[2020-06-03 21:14:29] [INFO ] [Nat]Added 200 Read/Feed constraints in 111 ms returned sat
[2020-06-03 21:14:30] [INFO ] Deduced a trap composed of 4 places in 830 ms
[2020-06-03 21:14:31] [INFO ] Deduced a trap composed of 4 places in 766 ms
[2020-06-03 21:14:31] [INFO ] Deduced a trap composed of 4 places in 637 ms
[2020-06-03 21:14:32] [INFO ] Deduced a trap composed of 4 places in 641 ms
[2020-06-03 21:14:33] [INFO ] Deduced a trap composed of 4 places in 590 ms
[2020-06-03 21:14:33] [INFO ] Deduced a trap composed of 4 places in 599 ms
[2020-06-03 21:14:34] [INFO ] Deduced a trap composed of 4 places in 631 ms
[2020-06-03 21:14:35] [INFO ] Deduced a trap composed of 4 places in 583 ms
[2020-06-03 21:14:35] [INFO ] Deduced a trap composed of 4 places in 566 ms
[2020-06-03 21:14:36] [INFO ] Deduced a trap composed of 4 places in 561 ms
[2020-06-03 21:14:36] [INFO ] Deduced a trap composed of 4 places in 551 ms
[2020-06-03 21:14:37] [INFO ] Deduced a trap composed of 4 places in 651 ms
[2020-06-03 21:14:38] [INFO ] Deduced a trap composed of 4 places in 631 ms
[2020-06-03 21:14:38] [INFO ] Deduced a trap composed of 4 places in 545 ms
[2020-06-03 21:14:39] [INFO ] Deduced a trap composed of 4 places in 544 ms
[2020-06-03 21:14:39] [INFO ] Deduced a trap composed of 4 places in 526 ms
[2020-06-03 21:14:40] [INFO ] Deduced a trap composed of 4 places in 514 ms
[2020-06-03 21:14:41] [INFO ] Deduced a trap composed of 4 places in 514 ms
[2020-06-03 21:14:41] [INFO ] Deduced a trap composed of 4 places in 506 ms
[2020-06-03 21:14:42] [INFO ] Deduced a trap composed of 4 places in 500 ms
[2020-06-03 21:14:42] [INFO ] Deduced a trap composed of 4 places in 483 ms
[2020-06-03 21:14:43] [INFO ] Deduced a trap composed of 4 places in 531 ms
[2020-06-03 21:14:43] [INFO ] Deduced a trap composed of 4 places in 610 ms
[2020-06-03 21:14:44] [INFO ] Deduced a trap composed of 4 places in 511 ms
[2020-06-03 21:14:45] [INFO ] Deduced a trap composed of 4 places in 464 ms
[2020-06-03 21:14:45] [INFO ] Deduced a trap composed of 4 places in 619 ms
[2020-06-03 21:14:46] [INFO ] Deduced a trap composed of 4 places in 531 ms
[2020-06-03 21:14:46] [INFO ] Deduced a trap composed of 4 places in 422 ms
[2020-06-03 21:14:47] [INFO ] Deduced a trap composed of 4 places in 525 ms
[2020-06-03 21:14:47] [INFO ] Deduced a trap composed of 4 places in 480 ms
[2020-06-03 21:14:48] [INFO ] Deduced a trap composed of 4 places in 602 ms
[2020-06-03 21:14:49] [INFO ] Deduced a trap composed of 4 places in 548 ms
[2020-06-03 21:14:49] [INFO ] Deduced a trap composed of 4 places in 428 ms
[2020-06-03 21:14:50] [INFO ] Deduced a trap composed of 4 places in 508 ms
[2020-06-03 21:14:50] [INFO ] Deduced a trap composed of 4 places in 536 ms
[2020-06-03 21:14:51] [INFO ] Deduced a trap composed of 6 places in 480 ms
[2020-06-03 21:14:51] [INFO ] Deduced a trap composed of 4 places in 382 ms
[2020-06-03 21:14:52] [INFO ] Deduced a trap composed of 4 places in 408 ms
[2020-06-03 21:14:52] [INFO ] Deduced a trap composed of 4 places in 423 ms
[2020-06-03 21:14:52] [INFO ] Deduced a trap composed of 4 places in 436 ms
[2020-06-03 21:14:53] [INFO ] Deduced a trap composed of 4 places in 524 ms
[2020-06-03 21:14:54] [INFO ] Deduced a trap composed of 4 places in 517 ms
[2020-06-03 21:14:54] [INFO ] Deduced a trap composed of 4 places in 504 ms
[2020-06-03 21:14:55] [INFO ] Deduced a trap composed of 4 places in 516 ms
[2020-06-03 21:14:55] [INFO ] Deduced a trap composed of 4 places in 479 ms
[2020-06-03 21:14:56] [INFO ] Deduced a trap composed of 4 places in 482 ms
[2020-06-03 21:14:56] [INFO ] Deduced a trap composed of 4 places in 379 ms
[2020-06-03 21:14:57] [INFO ] Deduced a trap composed of 4 places in 369 ms
[2020-06-03 21:14:57] [INFO ] Deduced a trap composed of 4 places in 404 ms
[2020-06-03 21:14:57] [INFO ] Deduced a trap composed of 4 places in 342 ms
[2020-06-03 21:14:58] [INFO ] Deduced a trap composed of 4 places in 989 ms
[2020-06-03 21:14:59] [INFO ] Deduced a trap composed of 4 places in 615 ms
[2020-06-03 21:15:00] [INFO ] Deduced a trap composed of 4 places in 527 ms
[2020-06-03 21:15:00] [INFO ] Deduced a trap composed of 4 places in 482 ms
[2020-06-03 21:15:01] [INFO ] Deduced a trap composed of 4 places in 435 ms
[2020-06-03 21:15:01] [INFO ] Deduced a trap composed of 4 places in 399 ms
[2020-06-03 21:15:02] [INFO ] Deduced a trap composed of 4 places in 391 ms
[2020-06-03 21:15:02] [INFO ] Deduced a trap composed of 4 places in 390 ms
[2020-06-03 21:15:02] [INFO ] Deduced a trap composed of 4 places in 395 ms
[2020-06-03 21:15:03] [INFO ] Deduced a trap composed of 4 places in 505 ms
[2020-06-03 21:15:04] [INFO ] Deduced a trap composed of 4 places in 462 ms
[2020-06-03 21:15:04] [INFO ] Deduced a trap composed of 4 places in 494 ms
[2020-06-03 21:15:05] [INFO ] Deduced a trap composed of 4 places in 420 ms
[2020-06-03 21:15:05] [INFO ] Deduced a trap composed of 4 places in 375 ms
[2020-06-03 21:15:05] [INFO ] Deduced a trap composed of 4 places in 345 ms
[2020-06-03 21:15:06] [INFO ] Deduced a trap composed of 4 places in 473 ms
[2020-06-03 21:15:06] [INFO ] Deduced a trap composed of 4 places in 432 ms
[2020-06-03 21:15:07] [INFO ] Deduced a trap composed of 4 places in 373 ms
[2020-06-03 21:15:07] [INFO ] Deduced a trap composed of 4 places in 358 ms
[2020-06-03 21:15:08] [INFO ] Deduced a trap composed of 4 places in 399 ms
[2020-06-03 21:15:08] [INFO ] Deduced a trap composed of 4 places in 402 ms
[2020-06-03 21:15:08] [INFO ] Deduced a trap composed of 4 places in 376 ms
[2020-06-03 21:15:09] [INFO ] Deduced a trap composed of 4 places in 389 ms
[2020-06-03 21:15:09] [INFO ] Deduced a trap composed of 4 places in 360 ms
[2020-06-03 21:15:10] [INFO ] Deduced a trap composed of 4 places in 358 ms
[2020-06-03 21:15:10] [INFO ] Deduced a trap composed of 4 places in 343 ms
[2020-06-03 21:15:10] [INFO ] Deduced a trap composed of 4 places in 364 ms
[2020-06-03 21:15:11] [INFO ] Deduced a trap composed of 4 places in 372 ms
[2020-06-03 21:15:11] [INFO ] Deduced a trap composed of 4 places in 348 ms
[2020-06-03 21:15:12] [INFO ] Deduced a trap composed of 4 places in 395 ms
[2020-06-03 21:15:12] [INFO ] Deduced a trap composed of 4 places in 445 ms
[2020-06-03 21:15:12] [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 (> (+ s198 s342 s599 s746) 0)") while checking expression at index 2
Support contains 12 out of 804 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 804/804 places, 40400/40400 transitions.
Applied a total of 0 rules in 552 ms. Remains 804 /804 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 804/804 places, 40400/40400 transitions.
Starting structural reductions, iteration 0 : 804/804 places, 40400/40400 transitions.
Applied a total of 0 rules in 501 ms. Remains 804 /804 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2020-06-03 21:15:13] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 804 cols
[2020-06-03 21:15:13] [INFO ] Computed 404 place invariants in 3 ms
[2020-06-03 21:15:20] [INFO ] Implicit Places using invariants in 6880 ms returned []
Implicit Place search using SMT only with invariants took 6883 ms to find 0 implicit places.
[2020-06-03 21:15:20] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 804 cols
[2020-06-03 21:15:20] [INFO ] Computed 404 place invariants in 4 ms
[2020-06-03 21:15:51] [INFO ] Performed 17233/40400 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2020-06-03 21:16:20] [INFO ] Dead Transitions with SMT raised an exceptionSMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (and (>= s213 1) (>= s333 1) (>= s736 1))") after 60043 ms
Finished structural reductions, in 1 iterations. Remains : 804/804 places, 40400/40400 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 4976 ms. (steps per millisecond=20 ) properties seen :[0, 0, 0]
[2020-06-03 21:16:25] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 804 cols
[2020-06-03 21:16:25] [INFO ] Computed 404 place invariants in 2 ms
[2020-06-03 21:16:26] [INFO ] [Real]Absence check using 400 positive place invariants in 215 ms returned sat
[2020-06-03 21:16:26] [INFO ] [Real]Absence check using 400 positive and 4 generalized place invariants in 2 ms returned sat
[2020-06-03 21:16:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:16:27] [INFO ] [Real]Absence check using state equation in 1224 ms returned sat
[2020-06-03 21:16:27] [INFO ] State equation strengthened by 200 read => feed constraints.
[2020-06-03 21:16:27] [INFO ] [Real]Added 200 Read/Feed constraints in 175 ms returned sat
[2020-06-03 21:16:28] [INFO ] Deduced a trap composed of 4 places in 742 ms
[2020-06-03 21:16:29] [INFO ] Deduced a trap composed of 4 places in 697 ms
[2020-06-03 21:16:30] [INFO ] Deduced a trap composed of 4 places in 798 ms
[2020-06-03 21:16:30] [INFO ] Deduced a trap composed of 4 places in 736 ms
[2020-06-03 21:16:31] [INFO ] Deduced a trap composed of 4 places in 739 ms
[2020-06-03 21:16:32] [INFO ] Deduced a trap composed of 4 places in 842 ms
[2020-06-03 21:16:33] [INFO ] Deduced a trap composed of 4 places in 970 ms
[2020-06-03 21:16:34] [INFO ] Deduced a trap composed of 4 places in 978 ms
[2020-06-03 21:16:35] [INFO ] Deduced a trap composed of 4 places in 865 ms
[2020-06-03 21:16:37] [INFO ] Deduced a trap composed of 4 places in 2288 ms
[2020-06-03 21:16:38] [INFO ] Deduced a trap composed of 4 places in 901 ms
[2020-06-03 21:16:39] [INFO ] Deduced a trap composed of 4 places in 682 ms
[2020-06-03 21:16:40] [INFO ] Deduced a trap composed of 4 places in 517 ms
[2020-06-03 21:16:40] [INFO ] Deduced a trap composed of 4 places in 591 ms
[2020-06-03 21:16:41] [INFO ] Deduced a trap composed of 4 places in 871 ms
[2020-06-03 21:16:42] [INFO ] Deduced a trap composed of 4 places in 558 ms
[2020-06-03 21:16:44] [INFO ] Deduced a trap composed of 4 places in 1607 ms
[2020-06-03 21:16:44] [INFO ] Deduced a trap composed of 4 places in 637 ms
[2020-06-03 21:16:45] [INFO ] Deduced a trap composed of 4 places in 581 ms
[2020-06-03 21:16:46] [INFO ] Deduced a trap composed of 4 places in 579 ms
[2020-06-03 21:16:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s230 s304 s631 s708) 0)") while checking expression at index 0
[2020-06-03 21:16:46] [INFO ] [Real]Absence check using 400 positive place invariants in 221 ms returned sat
[2020-06-03 21:16:46] [INFO ] [Real]Absence check using 400 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-03 21:16:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:16:47] [INFO ] [Real]Absence check using state equation in 1583 ms returned sat
[2020-06-03 21:16:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:16:48] [INFO ] [Nat]Absence check using 400 positive place invariants in 236 ms returned sat
[2020-06-03 21:16:48] [INFO ] [Nat]Absence check using 400 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-03 21:16:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:16:49] [INFO ] [Nat]Absence check using state equation in 1411 ms returned sat
[2020-06-03 21:16:49] [INFO ] [Nat]Added 200 Read/Feed constraints in 118 ms returned sat
[2020-06-03 21:16:50] [INFO ] Deduced a trap composed of 4 places in 794 ms
[2020-06-03 21:16:51] [INFO ] Deduced a trap composed of 4 places in 698 ms
[2020-06-03 21:16:52] [INFO ] Deduced a trap composed of 4 places in 669 ms
[2020-06-03 21:16:52] [INFO ] Deduced a trap composed of 4 places in 687 ms
[2020-06-03 21:16:53] [INFO ] Deduced a trap composed of 4 places in 639 ms
[2020-06-03 21:16:54] [INFO ] Deduced a trap composed of 4 places in 742 ms
[2020-06-03 21:16:55] [INFO ] Deduced a trap composed of 4 places in 723 ms
[2020-06-03 21:16:55] [INFO ] Deduced a trap composed of 4 places in 673 ms
[2020-06-03 21:16:56] [INFO ] Deduced a trap composed of 4 places in 644 ms
[2020-06-03 21:16:57] [INFO ] Deduced a trap composed of 4 places in 513 ms
[2020-06-03 21:16:57] [INFO ] Deduced a trap composed of 4 places in 530 ms
[2020-06-03 21:16:58] [INFO ] Deduced a trap composed of 4 places in 518 ms
[2020-06-03 21:16:58] [INFO ] Deduced a trap composed of 4 places in 514 ms
[2020-06-03 21:16:59] [INFO ] Deduced a trap composed of 4 places in 506 ms
[2020-06-03 21:16:59] [INFO ] Deduced a trap composed of 4 places in 496 ms
[2020-06-03 21:17:00] [INFO ] Deduced a trap composed of 4 places in 475 ms
[2020-06-03 21:17:00] [INFO ] Deduced a trap composed of 4 places in 433 ms
[2020-06-03 21:17:01] [INFO ] Deduced a trap composed of 4 places in 474 ms
[2020-06-03 21:17:01] [INFO ] Deduced a trap composed of 4 places in 511 ms
[2020-06-03 21:17:02] [INFO ] Deduced a trap composed of 4 places in 519 ms
[2020-06-03 21:17:02] [INFO ] Deduced a trap composed of 4 places in 404 ms
[2020-06-03 21:17:03] [INFO ] Deduced a trap composed of 4 places in 491 ms
[2020-06-03 21:17:03] [INFO ] Deduced a trap composed of 4 places in 399 ms
[2020-06-03 21:17:04] [INFO ] Deduced a trap composed of 4 places in 441 ms
[2020-06-03 21:17:04] [INFO ] Deduced a trap composed of 4 places in 459 ms
[2020-06-03 21:17:05] [INFO ] Deduced a trap composed of 4 places in 415 ms
[2020-06-03 21:17:05] [INFO ] Deduced a trap composed of 4 places in 370 ms
[2020-06-03 21:17:06] [INFO ] Deduced a trap composed of 4 places in 359 ms
[2020-06-03 21:17:06] [INFO ] Deduced a trap composed of 4 places in 354 ms
[2020-06-03 21:17:06] [INFO ] Deduced a trap composed of 4 places in 391 ms
[2020-06-03 21:17:07] [INFO ] Deduced a trap composed of 4 places in 413 ms
[2020-06-03 21:17:07] [INFO ] Deduced a trap composed of 4 places in 400 ms
[2020-06-03 21:17:08] [INFO ] Deduced a trap composed of 4 places in 383 ms
[2020-06-03 21:17:08] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s176 s366 s577 s770) 0)") while checking expression at index 1
[2020-06-03 21:17:08] [INFO ] [Real]Absence check using 400 positive place invariants in 231 ms returned sat
[2020-06-03 21:17:08] [INFO ] [Real]Absence check using 400 positive and 4 generalized place invariants in 5 ms returned sat
[2020-06-03 21:17:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:17:09] [INFO ] [Real]Absence check using state equation in 1268 ms returned sat
[2020-06-03 21:17:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:17:10] [INFO ] [Nat]Absence check using 400 positive place invariants in 178 ms returned sat
[2020-06-03 21:17:10] [INFO ] [Nat]Absence check using 400 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-03 21:17:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:17:11] [INFO ] [Nat]Absence check using state equation in 1383 ms returned sat
[2020-06-03 21:17:11] [INFO ] [Nat]Added 200 Read/Feed constraints in 111 ms returned sat
[2020-06-03 21:17:12] [INFO ] Deduced a trap composed of 4 places in 829 ms
[2020-06-03 21:17:13] [INFO ] Deduced a trap composed of 4 places in 657 ms
[2020-06-03 21:17:13] [INFO ] Deduced a trap composed of 4 places in 604 ms
[2020-06-03 21:17:14] [INFO ] Deduced a trap composed of 4 places in 624 ms
[2020-06-03 21:17:15] [INFO ] Deduced a trap composed of 4 places in 624 ms
[2020-06-03 21:17:15] [INFO ] Deduced a trap composed of 4 places in 674 ms
[2020-06-03 21:17:16] [INFO ] Deduced a trap composed of 4 places in 722 ms
[2020-06-03 21:17:17] [INFO ] Deduced a trap composed of 4 places in 606 ms
[2020-06-03 21:17:17] [INFO ] Deduced a trap composed of 4 places in 597 ms
[2020-06-03 21:17:18] [INFO ] Deduced a trap composed of 4 places in 572 ms
[2020-06-03 21:17:19] [INFO ] Deduced a trap composed of 4 places in 546 ms
[2020-06-03 21:17:19] [INFO ] Deduced a trap composed of 4 places in 557 ms
[2020-06-03 21:17:20] [INFO ] Deduced a trap composed of 4 places in 661 ms
[2020-06-03 21:17:20] [INFO ] Deduced a trap composed of 4 places in 545 ms
[2020-06-03 21:17:21] [INFO ] Deduced a trap composed of 4 places in 602 ms
[2020-06-03 21:17:21] [INFO ] Deduced a trap composed of 4 places in 438 ms
[2020-06-03 21:17:22] [INFO ] Deduced a trap composed of 4 places in 537 ms
[2020-06-03 21:17:23] [INFO ] Deduced a trap composed of 4 places in 471 ms
[2020-06-03 21:17:23] [INFO ] Deduced a trap composed of 4 places in 585 ms
[2020-06-03 21:17:24] [INFO ] Deduced a trap composed of 4 places in 547 ms
[2020-06-03 21:17:24] [INFO ] Deduced a trap composed of 4 places in 518 ms
[2020-06-03 21:17:25] [INFO ] Deduced a trap composed of 4 places in 514 ms
[2020-06-03 21:17:25] [INFO ] Deduced a trap composed of 4 places in 535 ms
[2020-06-03 21:17:26] [INFO ] Deduced a trap composed of 4 places in 468 ms
[2020-06-03 21:17:26] [INFO ] Deduced a trap composed of 4 places in 456 ms
[2020-06-03 21:17:27] [INFO ] Deduced a trap composed of 4 places in 461 ms
[2020-06-03 21:17:27] [INFO ] Deduced a trap composed of 4 places in 484 ms
[2020-06-03 21:17:28] [INFO ] Deduced a trap composed of 4 places in 450 ms
[2020-06-03 21:17:28] [INFO ] Deduced a trap composed of 4 places in 448 ms
[2020-06-03 21:17:29] [INFO ] Deduced a trap composed of 4 places in 457 ms
[2020-06-03 21:17:29] [INFO ] Deduced a trap composed of 4 places in 463 ms
[2020-06-03 21:17: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 (> (+ s246 s316 s648 s720) 0)") while checking expression at index 2
Discarding 752 places :
Also discarding 37976 output transitions
Drop transitions removed 37976 transitions
Graph (complete) has 1220 edges and 804 vertex of which 52 are kept as prefixes of interest. Removing 752 places using SCC suffix rule.60 ms
Ensure Unique test removed 4 places
Ensure Unique test removed 2376 transitions
Reduce isomorphic transitions removed 2376 transitions.
Iterating post reduction 0 with 2380 rules applied. Total rules applied 2381 place count 48 transition count 48
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 2399 place count 36 transition count 42
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 2405 place count 36 transition count 36
Free-agglomeration rule applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 2410 place count 36 transition count 31
Ensure Unique test removed 5 places
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 2425 place count 26 transition count 26
Applied a total of 2425 rules in 112 ms. Remains 26 /804 variables (removed 778) and now considering 26/40400 (removed 40374) transitions.
// Phase 1: matrix 26 rows 26 cols
[2020-06-03 21:17:30] [INFO ] Computed 13 place invariants in 0 ms
[2020-06-03 21:17:30] [INFO ] [Real]Absence check using 13 positive place invariants in 17 ms returned sat
[2020-06-03 21:17:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:17:30] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2020-06-03 21:17:30] [INFO ] Computed and/alt/rep : 14/16/14 causal constraints in 2 ms.
[2020-06-03 21:17:30] [INFO ] Added : 1 causal constraints over 1 iterations in 15 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
[2020-06-03 21:17:30] [INFO ] [Real]Absence check using 13 positive place invariants in 18 ms returned sat
[2020-06-03 21:17:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:17:30] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2020-06-03 21:17:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:17:30] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2020-06-03 21:17:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:17:30] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2020-06-03 21:17:30] [INFO ] Computed and/alt/rep : 14/16/14 causal constraints in 1 ms.
[2020-06-03 21:17:30] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
[2020-06-03 21:17:30] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2020-06-03 21:17:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:17:30] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2020-06-03 21:17:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:17:30] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2020-06-03 21:17:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:17:30] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2020-06-03 21:17:30] [INFO ] Computed and/alt/rep : 14/16/14 causal constraints in 2 ms.
[2020-06-03 21:17:30] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
[2020-06-03 21:17:30] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 2 ms.
[2020-06-03 21:17:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 195 ms.
[2020-06-03 21:17:33] [INFO ] Flatten gal took : 2049 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ Dekker-PT-200 @ 3570 seconds
FORMULA Dekker-PT-200-ReachabilityCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Dekker-PT-200-ReachabilityCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Dekker-PT-200-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3524
rslt: Output for ReachabilityCardinality @ Dekker-PT-200
{
"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=ReachabilityCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 21:17:33 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1175
},
"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 <= p449))))",
"processed_size": 21,
"rewrites": 1
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1762
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"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": "A (G ((((p626 <= 0)) OR ((1 <= p604)))))",
"processed_size": 41,
"rewrites": 2
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3525
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 10,
"adisj": 5,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "A (G ((((1 <= p232) AND (((p637 <= 0)) OR ((1 <= p667))) AND (((p695 <= 0)) OR ((1 <= p472)))) OR ((((p781 <= 0)) OR ((1 <= p496))) AND (((p657 <= 0)) OR ((1 <= p668)))))))",
"processed_size": 177,
"rewrites": 2
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 22,
"problems": 6
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 2158588,
"runtime": 46.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : A(G(**)) : A(G(**))"
},
"net":
{
"arcs": 281004,
"conflict_clusters": 1,
"places": 804,
"places_significant": 400,
"singleton_clusters": 0,
"transitions": 40400
},
"result":
{
"preliminary_value": "yes no no ",
"value": "yes no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 41204/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 804
lola: finding significant places
lola: 804 places, 40400 transitions, 400 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 ReachabilityCardinality.xml
lola: LP says that atomic proposition is always true: (p449 <= 1)
lola: LP says that atomic proposition is always true: (p604 <= 1)
lola: LP says that atomic proposition is always true: (p232 <= 1)
lola: LP says that atomic proposition is always true: (p667 <= 1)
lola: LP says that atomic proposition is always true: (p472 <= 1)
lola: LP says that atomic proposition is always true: (p496 <= 1)
lola: LP says that atomic proposition is always true: (p668 <= 1)
lola: E (F (((1 <= p449)))) : A (G ((((p626 <= 0)) OR ((1 <= p604))))) : A (G ((((1 <= p232) AND (((p637 <= 0)) OR ((1 <= p667))) AND (((p695 <= 0)) OR ((1 <= p472)))) OR ((((p781 <= 0)) OR ((1 <= p496))) AND (((p657 <= 0)) OR ((1 <= p668)))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 1175 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p449))))
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 <= p449))))
lola: processed formula length: 21
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.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 <= p449))
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: 3 markings, 2 edges
lola: ========================================
lola: subprocess 1 will run for 1762 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p626 <= 0)) OR ((1 <= p604)))))
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 ((((p626 <= 0)) OR ((1 <= p604)))))
lola: processed formula length: 41
lola: 2 rewrites
lola: closed formula file ReachabilityCardinality.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 <= p626)) AND ((p604 <= 0)))
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
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 2 will run for 3525 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= p232) AND (((p637 <= 0)) OR ((1 <= p667))) AND (((p695 <= 0)) OR ((1 <= p472)))) OR ((((p781 <= 0)) OR ((1 <= p496))) AND (((p657 <= 0)) OR ((1 <= p668)))))))
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 ((((1 <= p232) AND (((p637 <= 0)) OR ((1 <= p667))) AND (((p695 <= 0)) OR ((1 <= p472)))) OR ((((p781 <= 0)) OR ((1 <= p496))) AND (((p657 <= 0)) OR ((1 <= p668)))))))
lola: processed formula length: 177
lola: 2 rewrites
lola: closed formula file ReachabilityCardinality.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: (((p232 <= 0) OR (((1 <= p637)) AND ((p667 <= 0))) OR (((1 <= p695)) AND ((p472 <= 0)))) AND ((((1 <= p781)) AND ((p496 <= 0))) OR (((1 <= p657)) AND ((p668 <= 0)))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 22 literals and 6 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no
lola:
preliminary result: yes no no
lola: memory consumption: 2158588 KB
lola: time consumption: 46 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.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="Dekker-PT-200"
export BK_EXAMINATION="ReachabilityCardinality"
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 Dekker-PT-200, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r178-tajo-158987882200350"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Dekker-PT-200.tgz
mv Dekker-PT-200 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;