Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r111-csrt-158961258100743.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Peterson-PT-6, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-csrt-158961258100743
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.3M
-rw-r--r-- 1 mcc users 66K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 184K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 54K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 187K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 84K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 254K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 72K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 243K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 96K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 250K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 65K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 211K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 23K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 45K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 2 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 1.5M Apr 27 15:14 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 Peterson-PT-6-ReachabilityFireability-00
FORMULA_NAME Peterson-PT-6-ReachabilityFireability-01
FORMULA_NAME Peterson-PT-6-ReachabilityFireability-02
FORMULA_NAME Peterson-PT-6-ReachabilityFireability-03
FORMULA_NAME Peterson-PT-6-ReachabilityFireability-04
FORMULA_NAME Peterson-PT-6-ReachabilityFireability-05
FORMULA_NAME Peterson-PT-6-ReachabilityFireability-06
FORMULA_NAME Peterson-PT-6-ReachabilityFireability-07
FORMULA_NAME Peterson-PT-6-ReachabilityFireability-08
FORMULA_NAME Peterson-PT-6-ReachabilityFireability-09
FORMULA_NAME Peterson-PT-6-ReachabilityFireability-10
FORMULA_NAME Peterson-PT-6-ReachabilityFireability-11
FORMULA_NAME Peterson-PT-6-ReachabilityFireability-12
FORMULA_NAME Peterson-PT-6-ReachabilityFireability-13
FORMULA_NAME Peterson-PT-6-ReachabilityFireability-14
FORMULA_NAME Peterson-PT-6-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1590026924517

[2020-05-21 02:08:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-21 02:08:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-21 02:08:46] [INFO ] Load time of PNML (sax parser for PT used): 175 ms
[2020-05-21 02:08:46] [INFO ] Transformed 1330 places.
[2020-05-21 02:08:46] [INFO ] Transformed 2030 transitions.
[2020-05-21 02:08:46] [INFO ] Parsed PT model containing 1330 places and 2030 transitions in 251 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 81 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-PT-6-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 91 ms. (steps per millisecond=109 ) properties seen :[1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0]
FORMULA Peterson-PT-6-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-6-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-6-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-6-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-6-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-6-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-6-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-6-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
[2020-05-21 02:08:47] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2020-05-21 02:08:47] [INFO ] Computed 27 place invariants in 79 ms
[2020-05-21 02:08:47] [INFO ] [Real]Absence check using 20 positive place invariants in 95 ms returned sat
[2020-05-21 02:08:47] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 11 ms returned sat
[2020-05-21 02:08:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:08:52] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-21 02:08:52] [INFO ] [Real]Absence check using state equation in 4628 ms returned (error "Failed to check-sat")
[2020-05-21 02:08:52] [INFO ] [Real]Absence check using 20 positive place invariants in 46 ms returned sat
[2020-05-21 02:08:52] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 7 ms returned sat
[2020-05-21 02:08:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:08:57] [INFO ] [Real]Absence check using state equation in 4605 ms returned sat
[2020-05-21 02:08:57] [INFO ] State equation strengthened by 366 read => feed constraints.
[2020-05-21 02:08:57] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-21 02:08:57] [INFO ] [Real]Added 366 Read/Feed constraints in 54 ms returned unknown
[2020-05-21 02:08:57] [INFO ] [Real]Absence check using 20 positive place invariants in 46 ms returned sat
[2020-05-21 02:08:57] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 8 ms returned sat
[2020-05-21 02:08:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:09:01] [INFO ] [Real]Absence check using state equation in 4023 ms returned sat
[2020-05-21 02:09:01] [INFO ] [Real]Added 366 Read/Feed constraints in 89 ms returned sat
[2020-05-21 02:09:01] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:09:02] [INFO ] [Nat]Absence check using 20 positive place invariants in 53 ms returned sat
[2020-05-21 02:09:02] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 7 ms returned sat
[2020-05-21 02:09:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:09:06] [INFO ] [Nat]Absence check using state equation in 4215 ms returned sat
[2020-05-21 02:09:06] [INFO ] [Nat]Added 366 Read/Feed constraints in 161 ms returned sat
[2020-05-21 02:09:07] [INFO ] Deduced a trap composed of 46 places in 1325 ms
[2020-05-21 02:09:07] [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 (> (+ s1 s11 s41 s90 s136 s164 s215 s271 s311 s320 s326 s360 s400 s430 s457 s477 s509 s622 s663 s679 s681 s697 s731 s757 s774 s812 s845 s897 s912 s942 s952 s984 s991 s1048 s1095 s1123 s1165 s1179 s1182 s1188 s1201 s1211 s1214 s1254 s1299 s1308) 0)") while checking expression at index 2
[2020-05-21 02:09:08] [INFO ] [Real]Absence check using 20 positive place invariants in 49 ms returned sat
[2020-05-21 02:09:08] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 7 ms returned sat
[2020-05-21 02:09:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:09:12] [INFO ] [Real]Absence check using state equation in 4134 ms returned sat
[2020-05-21 02:09:12] [INFO ] [Real]Added 366 Read/Feed constraints in 81 ms returned sat
[2020-05-21 02:09:12] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:09:12] [INFO ] [Nat]Absence check using 20 positive place invariants in 46 ms returned sat
[2020-05-21 02:09:12] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 8 ms returned sat
[2020-05-21 02:09:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:09:16] [INFO ] [Nat]Absence check using state equation in 4132 ms returned sat
[2020-05-21 02:09:16] [INFO ] [Nat]Added 366 Read/Feed constraints in 159 ms returned sat
[2020-05-21 02:09:18] [INFO ] Deduced a trap composed of 59 places in 1146 ms
[2020-05-21 02:09:18] [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 (> (+ s1 s3 s10 s40 s41 s90 s311 s313 s318 s320 s327 s360 s361 s408 s409 s430 s439 s457 s639 s645 s666 s671 s673 s679 s681 s683 s731 s735 s757 s904 s905 s912 s913 s943 s950 s952 s962 s981 s989 s991 s998 s1095 s1123 s1165 s1175 s1177 s1179 s1184 s1188 s1192 s1197 s1201 s1203 s1207 s1211 s1297 s1299 s1306 s1308) 0)") while checking expression at index 3
[2020-05-21 02:09:18] [INFO ] [Real]Absence check using 20 positive place invariants in 42 ms returned sat
[2020-05-21 02:09:18] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 7 ms returned sat
[2020-05-21 02:09:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:09:22] [INFO ] [Real]Absence check using state equation in 3973 ms returned sat
[2020-05-21 02:09:22] [INFO ] [Real]Added 366 Read/Feed constraints in 76 ms returned sat
[2020-05-21 02:09:22] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:09:22] [INFO ] [Nat]Absence check using 20 positive place invariants in 50 ms returned sat
[2020-05-21 02:09:22] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 8 ms returned sat
[2020-05-21 02:09:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:09:26] [INFO ] [Nat]Absence check using state equation in 4252 ms returned sat
[2020-05-21 02:09:27] [INFO ] [Nat]Added 366 Read/Feed constraints in 204 ms returned sat
[2020-05-21 02:09:28] [INFO ] Deduced a trap composed of 22 places in 1267 ms
[2020-05-21 02:09:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s331 s379 s670 s682 s691 s908 s929 s947 s1020 s1167 s1172 s1173 s1176 s1178 s1183 s1190 s1193 s1196 s1199 s1204 s1209 s1307) 0)") while checking expression at index 4
[2020-05-21 02:09:28] [INFO ] [Real]Absence check using 20 positive place invariants in 45 ms returned sat
[2020-05-21 02:09:28] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 8 ms returned sat
[2020-05-21 02:09:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:09:33] [INFO ] [Real]Absence check using state equation in 4533 ms returned sat
[2020-05-21 02:09:33] [INFO ] [Real]Added 366 Read/Feed constraints in 102 ms returned sat
[2020-05-21 02:09:33] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:09:33] [INFO ] [Nat]Absence check using 20 positive place invariants in 49 ms returned sat
[2020-05-21 02:09:33] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 8 ms returned sat
[2020-05-21 02:09:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:09:38] [INFO ] [Nat]Absence check using state equation in 4587 ms returned sat
[2020-05-21 02:09:38] [INFO ] [Nat]Added 366 Read/Feed constraints in 127 ms returned sat
[2020-05-21 02:09:39] [INFO ] Deduced a trap composed of 60 places in 955 ms
[2020-05-21 02:09:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s7 s44 s52 s79 s88 s286 s287 s310 s313 s318 s321 s327 s330 s357 s366 s412 s436 s443 s451 s460 s641 s668 s671 s673 s682 s683 s695 s720 s726 s739 s762 s896 s901 s904 s905 s909 s936 s943 s946 s950 s953 s993 s1002 s1085 s1094 s1118 s1142 s1166 s1180 s1181 s1187 s1202 s1212 s1286 s1291 s1294 s1297 s1306 s1307) 0)") while checking expression at index 5
[2020-05-21 02:09:39] [INFO ] [Real]Absence check using 20 positive place invariants in 43 ms returned sat
[2020-05-21 02:09:39] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 7 ms returned sat
[2020-05-21 02:09:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:09:43] [INFO ] [Real]Absence check using state equation in 4548 ms returned sat
[2020-05-21 02:09:44] [INFO ] [Real]Added 366 Read/Feed constraints in 145 ms returned sat
[2020-05-21 02:09:44] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:09:44] [INFO ] [Nat]Absence check using 20 positive place invariants in 171 ms returned sat
[2020-05-21 02:09:44] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 26 ms returned sat
[2020-05-21 02:09:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:09:49] [INFO ] [Nat]Absence check using state equation in 4684 ms returned (error "Solver has unexpectedly terminated")
Incomplete Parikh walk after 31100 steps, including 991 resets, run finished after 319 ms. (steps per millisecond=97 ) properties seen :[1, 0, 0, 0, 0, 0, 0] could not realise parikh vector
FORMULA Peterson-PT-6-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 47 out of 1330 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Performed 565 Post agglomeration using F-continuation condition.Transition count delta: 565
Iterating post reduction 0 with 565 rules applied. Total rules applied 565 place count 1330 transition count 1465
Reduce places removed 565 places and 0 transitions.
Iterating post reduction 1 with 565 rules applied. Total rules applied 1130 place count 765 transition count 1465
Performed 281 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 281 Pre rules applied. Total rules applied 1130 place count 765 transition count 1184
Deduced a syphon composed of 281 places in 2 ms
Reduce places removed 281 places and 0 transitions.
Iterating global reduction 2 with 562 rules applied. Total rules applied 1692 place count 484 transition count 1184
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 3 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 1774 place count 443 transition count 1143
Applied a total of 1774 rules in 340 ms. Remains 443 /1330 variables (removed 887) and now considering 1143/2030 (removed 887) transitions.
Finished structural reductions, in 1 iterations. Remains : 443/1330 places, 1143/2030 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2695 ms. (steps per millisecond=371 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 607 ms. (steps per millisecond=1647 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 752 ms. (steps per millisecond=1329 ) properties seen :[0, 0, 1, 0, 0, 0]
FORMULA Peterson-PT-6-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 754 ms. (steps per millisecond=1326 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 825 ms. (steps per millisecond=1212 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 1040 ms. (steps per millisecond=961 ) properties seen :[0, 0, 0, 0, 0]
[2020-05-21 02:09:56] [INFO ] Flow matrix only has 933 transitions (discarded 210 similar events)
// Phase 1: matrix 933 rows 443 cols
[2020-05-21 02:09:56] [INFO ] Computed 27 place invariants in 7 ms
[2020-05-21 02:09:56] [INFO ] [Real]Absence check using 20 positive place invariants in 20 ms returned sat
[2020-05-21 02:09:56] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 5 ms returned sat
[2020-05-21 02:09:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:09:57] [INFO ] [Real]Absence check using state equation in 733 ms returned sat
[2020-05-21 02:09:57] [INFO ] State equation strengthened by 366 read => feed constraints.
[2020-05-21 02:09:57] [INFO ] [Real]Added 366 Read/Feed constraints in 53 ms returned sat
[2020-05-21 02:09:57] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:09:57] [INFO ] [Nat]Absence check using 20 positive place invariants in 23 ms returned sat
[2020-05-21 02:09:57] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 6 ms returned sat
[2020-05-21 02:09:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:09:58] [INFO ] [Nat]Absence check using state equation in 696 ms returned sat
[2020-05-21 02:09:58] [INFO ] [Nat]Added 366 Read/Feed constraints in 79 ms returned sat
[2020-05-21 02:09:58] [INFO ] Deduced a trap composed of 13 places in 308 ms
[2020-05-21 02:09:59] [INFO ] Deduced a trap composed of 54 places in 233 ms
[2020-05-21 02:09:59] [INFO ] Deduced a trap composed of 89 places in 313 ms
[2020-05-21 02:09:59] [INFO ] Deduced a trap composed of 36 places in 233 ms
[2020-05-21 02:10:00] [INFO ] Deduced a trap composed of 21 places in 392 ms
[2020-05-21 02:10:00] [INFO ] Deduced a trap composed of 31 places in 735 ms
[2020-05-21 02:10:01] [INFO ] Deduced a trap composed of 90 places in 233 ms
[2020-05-21 02:10:01] [INFO ] Deduced a trap composed of 40 places in 198 ms
[2020-05-21 02:10:01] [INFO ] Deduced a trap composed of 38 places in 217 ms
[2020-05-21 02:10:01] [INFO ] Deduced a trap composed of 58 places in 218 ms
[2020-05-21 02:10:02] [INFO ] Deduced a trap composed of 58 places in 225 ms
[2020-05-21 02:10:02] [INFO ] Deduced a trap composed of 57 places in 223 ms
[2020-05-21 02:10:02] [INFO ] Deduced a trap composed of 60 places in 252 ms
[2020-05-21 02:10:02] [INFO ] Deduced a trap composed of 31 places in 238 ms
[2020-05-21 02:10:03] [INFO ] Deduced a trap composed of 50 places in 243 ms
[2020-05-21 02:10:03] [INFO ] Deduced a trap composed of 31 places in 243 ms
[2020-05-21 02:10:03] [INFO ] Deduced a trap composed of 56 places in 252 ms
[2020-05-21 02:10:04] [INFO ] Deduced a trap composed of 60 places in 245 ms
[2020-05-21 02:10:04] [INFO ] Deduced a trap composed of 39 places in 237 ms
[2020-05-21 02:10:04] [INFO ] Deduced a trap composed of 51 places in 261 ms
[2020-05-21 02:10:04] [INFO ] Deduced a trap composed of 28 places in 246 ms
[2020-05-21 02:10:05] [INFO ] Deduced a trap composed of 32 places in 213 ms
[2020-05-21 02:10:05] [INFO ] Deduced a trap composed of 41 places in 201 ms
[2020-05-21 02:10:05] [INFO ] Deduced a trap composed of 39 places in 209 ms
[2020-05-21 02:10:05] [INFO ] Deduced a trap composed of 40 places in 251 ms
[2020-05-21 02:10:06] [INFO ] Deduced a trap composed of 59 places in 201 ms
[2020-05-21 02:10:06] [INFO ] Deduced a trap composed of 52 places in 163 ms
[2020-05-21 02:10:06] [INFO ] Deduced a trap composed of 52 places in 151 ms
[2020-05-21 02:10:06] [INFO ] Deduced a trap composed of 49 places in 165 ms
[2020-05-21 02:10:06] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 8364 ms
[2020-05-21 02:10:06] [INFO ] Computed and/alt/rep : 1136/8175/926 causal constraints in 61 ms.
[2020-05-21 02:10:27] [INFO ] Added : 760 causal constraints over 152 iterations in 20241 ms.(timeout) Result :sat
[2020-05-21 02:10:27] [INFO ] Deduced a trap composed of 19 places in 276 ms
[2020-05-21 02:10:27] [INFO ] Deduced a trap composed of 20 places in 269 ms
[2020-05-21 02:10:28] [INFO ] Deduced a trap composed of 30 places in 269 ms
[2020-05-21 02:10:28] [INFO ] Deduced a trap composed of 22 places in 229 ms
[2020-05-21 02:10:29] [INFO ] Deduced a trap composed of 10 places in 310 ms
[2020-05-21 02:10:29] [INFO ] Deduced a trap composed of 10 places in 289 ms
[2020-05-21 02:10:29] [INFO ] Deduced a trap composed of 10 places in 316 ms
[2020-05-21 02:10:30] [INFO ] Deduced a trap composed of 11 places in 296 ms
[2020-05-21 02:10:30] [INFO ] Deduced a trap composed of 64 places in 300 ms
[2020-05-21 02:10:31] [INFO ] Deduced a trap composed of 14 places in 257 ms
[2020-05-21 02:10:31] [INFO ] Deduced a trap composed of 19 places in 321 ms
[2020-05-21 02:10:32] [INFO ] Deduced a trap composed of 33 places in 272 ms
[2020-05-21 02:10:32] [INFO ] Deduced a trap composed of 43 places in 267 ms
[2020-05-21 02:10:32] [INFO ] Deduced a trap composed of 27 places in 280 ms
[2020-05-21 02:10:33] [INFO ] Deduced a trap composed of 29 places in 256 ms
[2020-05-21 02:10:33] [INFO ] Deduced a trap composed of 36 places in 291 ms
[2020-05-21 02:10:34] [INFO ] Deduced a trap composed of 48 places in 304 ms
[2020-05-21 02:10:34] [INFO ] Deduced a trap composed of 29 places in 302 ms
[2020-05-21 02:10:35] [INFO ] Deduced a trap composed of 47 places in 314 ms
[2020-05-21 02:10:35] [INFO ] Deduced a trap composed of 19 places in 313 ms
[2020-05-21 02:10:36] [INFO ] Deduced a trap composed of 19 places in 305 ms
[2020-05-21 02:10:36] [INFO ] Deduced a trap composed of 21 places in 279 ms
[2020-05-21 02:10:36] [INFO ] Deduced a trap composed of 25 places in 319 ms
[2020-05-21 02:10:37] [INFO ] Deduced a trap composed of 19 places in 331 ms
[2020-05-21 02:10:38] [INFO ] Deduced a trap composed of 47 places in 321 ms
[2020-05-21 02:10:38] [INFO ] Deduced a trap composed of 13 places in 335 ms
[2020-05-21 02:10:38] [INFO ] Deduced a trap composed of 46 places in 240 ms
[2020-05-21 02:10:39] [INFO ] Deduced a trap composed of 59 places in 245 ms
[2020-05-21 02:10:39] [INFO ] Deduced a trap composed of 58 places in 258 ms
[2020-05-21 02:10:40] [INFO ] Deduced a trap composed of 59 places in 243 ms
[2020-05-21 02:10:40] [INFO ] Deduced a trap composed of 64 places in 203 ms
[2020-05-21 02:10:40] [INFO ] Deduced a trap composed of 56 places in 201 ms
[2020-05-21 02:10:41] [INFO ] Deduced a trap composed of 74 places in 250 ms
[2020-05-21 02:10:41] [INFO ] Deduced a trap composed of 20 places in 227 ms
[2020-05-21 02:10:42] [INFO ] Deduced a trap composed of 56 places in 245 ms
[2020-05-21 02:10:42] [INFO ] Deduced a trap composed of 38 places in 226 ms
[2020-05-21 02:10:42] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-21 02:10:42] [INFO ] Deduced a trap composed of 2 places in 320 ms
[2020-05-21 02:10:42] [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 (> (+ s302 s435) 0)") while checking expression at index 0
[2020-05-21 02:10:43] [INFO ] [Real]Absence check using 20 positive place invariants in 18 ms returned sat
[2020-05-21 02:10:43] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2020-05-21 02:10:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:10:43] [INFO ] [Real]Absence check using state equation in 703 ms returned sat
[2020-05-21 02:10:43] [INFO ] [Real]Added 366 Read/Feed constraints in 55 ms returned sat
[2020-05-21 02:10:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:10:43] [INFO ] [Nat]Absence check using 20 positive place invariants in 20 ms returned sat
[2020-05-21 02:10:43] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2020-05-21 02:10:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:10:44] [INFO ] [Nat]Absence check using state equation in 813 ms returned sat
[2020-05-21 02:10:44] [INFO ] [Nat]Added 366 Read/Feed constraints in 60 ms returned sat
[2020-05-21 02:10:45] [INFO ] Deduced a trap composed of 13 places in 281 ms
[2020-05-21 02:10:45] [INFO ] Deduced a trap composed of 66 places in 254 ms
[2020-05-21 02:10:45] [INFO ] Deduced a trap composed of 74 places in 300 ms
[2020-05-21 02:10:45] [INFO ] Deduced a trap composed of 40 places in 251 ms
[2020-05-21 02:10:46] [INFO ] Deduced a trap composed of 17 places in 245 ms
[2020-05-21 02:10:46] [INFO ] Deduced a trap composed of 14 places in 259 ms
[2020-05-21 02:10:46] [INFO ] Deduced a trap composed of 13 places in 256 ms
[2020-05-21 02:10:47] [INFO ] Deduced a trap composed of 84 places in 279 ms
[2020-05-21 02:10:47] [INFO ] Deduced a trap composed of 31 places in 235 ms
[2020-05-21 02:10:47] [INFO ] Deduced a trap composed of 33 places in 257 ms
[2020-05-21 02:10:48] [INFO ] Deduced a trap composed of 31 places in 300 ms
[2020-05-21 02:10:48] [INFO ] Deduced a trap composed of 32 places in 283 ms
[2020-05-21 02:10:48] [INFO ] Deduced a trap composed of 32 places in 267 ms
[2020-05-21 02:10:49] [INFO ] Deduced a trap composed of 15 places in 276 ms
[2020-05-21 02:10:49] [INFO ] Deduced a trap composed of 80 places in 203 ms
[2020-05-21 02:10:49] [INFO ] Deduced a trap composed of 43 places in 251 ms
[2020-05-21 02:10:49] [INFO ] Deduced a trap composed of 41 places in 216 ms
[2020-05-21 02:10:50] [INFO ] Deduced a trap composed of 80 places in 181 ms
[2020-05-21 02:10:50] [INFO ] Deduced a trap composed of 79 places in 178 ms
[2020-05-21 02:10:50] [INFO ] Deduced a trap composed of 81 places in 187 ms
[2020-05-21 02:10:50] [INFO ] Deduced a trap composed of 19 places in 240 ms
[2020-05-21 02:10:51] [INFO ] Deduced a trap composed of 20 places in 211 ms
[2020-05-21 02:10:51] [INFO ] Deduced a trap composed of 55 places in 214 ms
[2020-05-21 02:10:51] [INFO ] Deduced a trap composed of 67 places in 203 ms
[2020-05-21 02:10:51] [INFO ] Deduced a trap composed of 65 places in 218 ms
[2020-05-21 02:10:52] [INFO ] Deduced a trap composed of 66 places in 216 ms
[2020-05-21 02:10:52] [INFO ] Deduced a trap composed of 50 places in 172 ms
[2020-05-21 02:10:52] [INFO ] Deduced a trap composed of 51 places in 175 ms
[2020-05-21 02:10:52] [INFO ] Deduced a trap composed of 50 places in 186 ms
[2020-05-21 02:10:52] [INFO ] Deduced a trap composed of 39 places in 129 ms
[2020-05-21 02:10:53] [INFO ] Deduced a trap composed of 38 places in 217 ms
[2020-05-21 02:10:53] [INFO ] Deduced a trap composed of 40 places in 192 ms
[2020-05-21 02:10:53] [INFO ] Deduced a trap composed of 68 places in 207 ms
[2020-05-21 02:10:53] [INFO ] Deduced a trap composed of 67 places in 203 ms
[2020-05-21 02:10:54] [INFO ] Deduced a trap composed of 79 places in 215 ms
[2020-05-21 02:10:54] [INFO ] Deduced a trap composed of 39 places in 128 ms
[2020-05-21 02:10:54] [INFO ] Deduced a trap composed of 18 places in 266 ms
[2020-05-21 02:10:54] [INFO ] Deduced a trap composed of 30 places in 221 ms
[2020-05-21 02:10:55] [INFO ] Deduced a trap composed of 54 places in 168 ms
[2020-05-21 02:10:55] [INFO ] Deduced a trap composed of 23 places in 234 ms
[2020-05-21 02:10:55] [INFO ] Deduced a trap composed of 20 places in 215 ms
[2020-05-21 02:10:55] [INFO ] Deduced a trap composed of 20 places in 193 ms
[2020-05-21 02:10:56] [INFO ] Deduced a trap composed of 57 places in 158 ms
[2020-05-21 02:10:56] [INFO ] Deduced a trap composed of 56 places in 160 ms
[2020-05-21 02:10:56] [INFO ] Trap strengthening (SAT) tested/added 45/44 trap constraints in 11585 ms
[2020-05-21 02:10:56] [INFO ] Computed and/alt/rep : 1136/8175/926 causal constraints in 75 ms.
[2020-05-21 02:11:16] [INFO ] Added : 725 causal constraints over 145 iterations in 20316 ms.(timeout) Result :sat
[2020-05-21 02:11:16] [INFO ] Deduced a trap composed of 20 places in 254 ms
[2020-05-21 02:11:17] [INFO ] Deduced a trap composed of 39 places in 243 ms
[2020-05-21 02:11:17] [INFO ] Deduced a trap composed of 19 places in 249 ms
[2020-05-21 02:11:18] [INFO ] Deduced a trap composed of 19 places in 282 ms
[2020-05-21 02:11:18] [INFO ] Deduced a trap composed of 21 places in 284 ms
[2020-05-21 02:11:19] [INFO ] Deduced a trap composed of 25 places in 223 ms
[2020-05-21 02:11:19] [INFO ] Deduced a trap composed of 41 places in 218 ms
[2020-05-21 02:11:19] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3167 ms
Attempting to minimize the solution found.
Minimization took 148 ms.
[2020-05-21 02:11:20] [INFO ] [Real]Absence check using 20 positive place invariants in 21 ms returned sat
[2020-05-21 02:11:20] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2020-05-21 02:11:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:11:20] [INFO ] [Real]Absence check using state equation in 797 ms returned sat
[2020-05-21 02:11:21] [INFO ] [Real]Added 366 Read/Feed constraints in 48 ms returned sat
[2020-05-21 02:11:21] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:11:21] [INFO ] [Nat]Absence check using 20 positive place invariants in 27 ms returned sat
[2020-05-21 02:11:21] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2020-05-21 02:11:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:11:21] [INFO ] [Nat]Absence check using state equation in 712 ms returned sat
[2020-05-21 02:11:21] [INFO ] [Nat]Added 366 Read/Feed constraints in 80 ms returned sat
[2020-05-21 02:11:22] [INFO ] Deduced a trap composed of 21 places in 325 ms
[2020-05-21 02:11:22] [INFO ] Deduced a trap composed of 23 places in 345 ms
[2020-05-21 02:11:23] [INFO ] Deduced a trap composed of 38 places in 312 ms
[2020-05-21 02:11:23] [INFO ] Deduced a trap composed of 37 places in 309 ms
[2020-05-21 02:11:23] [INFO ] Deduced a trap composed of 20 places in 279 ms
[2020-05-21 02:11:24] [INFO ] Deduced a trap composed of 15 places in 273 ms
[2020-05-21 02:11:24] [INFO ] Deduced a trap composed of 15 places in 304 ms
[2020-05-21 02:11:24] [INFO ] Deduced a trap composed of 38 places in 317 ms
[2020-05-21 02:11:25] [INFO ] Deduced a trap composed of 68 places in 263 ms
[2020-05-21 02:11:25] [INFO ] Deduced a trap composed of 65 places in 272 ms
[2020-05-21 02:11:25] [INFO ] Deduced a trap composed of 20 places in 278 ms
[2020-05-21 02:11:25] [INFO ] Deduced a trap composed of 47 places in 240 ms
[2020-05-21 02:11:26] [INFO ] Deduced a trap composed of 68 places in 259 ms
[2020-05-21 02:11:26] [INFO ] Deduced a trap composed of 20 places in 268 ms
[2020-05-21 02:11:26] [INFO ] Deduced a trap composed of 18 places in 329 ms
[2020-05-21 02:11:27] [INFO ] Deduced a trap composed of 20 places in 289 ms
[2020-05-21 02:11:27] [INFO ] Deduced a trap composed of 20 places in 274 ms
[2020-05-21 02:11:27] [INFO ] Deduced a trap composed of 31 places in 220 ms
[2020-05-21 02:11:28] [INFO ] Deduced a trap composed of 30 places in 267 ms
[2020-05-21 02:11:28] [INFO ] Deduced a trap composed of 43 places in 278 ms
[2020-05-21 02:11:28] [INFO ] Deduced a trap composed of 28 places in 253 ms
[2020-05-21 02:11:29] [INFO ] Deduced a trap composed of 13 places in 300 ms
[2020-05-21 02:11:29] [INFO ] Deduced a trap composed of 24 places in 283 ms
[2020-05-21 02:11:29] [INFO ] Deduced a trap composed of 30 places in 245 ms
[2020-05-21 02:11:29] [INFO ] Deduced a trap composed of 27 places in 263 ms
[2020-05-21 02:11:30] [INFO ] Deduced a trap composed of 69 places in 218 ms
[2020-05-21 02:11:30] [INFO ] Deduced a trap composed of 50 places in 190 ms
[2020-05-21 02:11:30] [INFO ] Deduced a trap composed of 28 places in 174 ms
[2020-05-21 02:11:30] [INFO ] Deduced a trap composed of 41 places in 262 ms
[2020-05-21 02:11:31] [INFO ] Deduced a trap composed of 31 places in 274 ms
[2020-05-21 02:11:31] [INFO ] Deduced a trap composed of 28 places in 225 ms
[2020-05-21 02:11:31] [INFO ] Deduced a trap composed of 40 places in 241 ms
[2020-05-21 02:11:32] [INFO ] Deduced a trap composed of 14 places in 201 ms
[2020-05-21 02:11:32] [INFO ] Deduced a trap composed of 15 places in 229 ms
[2020-05-21 02:11:32] [INFO ] Deduced a trap composed of 12 places in 230 ms
[2020-05-21 02:11:32] [INFO ] Deduced a trap composed of 40 places in 200 ms
[2020-05-21 02:11:33] [INFO ] Deduced a trap composed of 72 places in 193 ms
[2020-05-21 02:11:33] [INFO ] Deduced a trap composed of 39 places in 216 ms
[2020-05-21 02:11:33] [INFO ] Deduced a trap composed of 59 places in 152 ms
[2020-05-21 02:11:33] [INFO ] Deduced a trap composed of 50 places in 123 ms
[2020-05-21 02:11:33] [INFO ] Deduced a trap composed of 59 places in 160 ms
[2020-05-21 02:11:33] [INFO ] Deduced a trap composed of 51 places in 120 ms
[2020-05-21 02:11:34] [INFO ] Deduced a trap composed of 50 places in 151 ms
[2020-05-21 02:11:34] [INFO ] Deduced a trap composed of 53 places in 125 ms
[2020-05-21 02:11:34] [INFO ] Deduced a trap composed of 12 places in 209 ms
[2020-05-21 02:11:34] [INFO ] Deduced a trap composed of 24 places in 180 ms
[2020-05-21 02:11:35] [INFO ] Deduced a trap composed of 40 places in 196 ms
[2020-05-21 02:11:35] [INFO ] Deduced a trap composed of 44 places in 212 ms
[2020-05-21 02:11:35] [INFO ] Deduced a trap composed of 11 places in 244 ms
[2020-05-21 02:11:35] [INFO ] Deduced a trap composed of 34 places in 192 ms
[2020-05-21 02:11:36] [INFO ] Deduced a trap composed of 47 places in 185 ms
[2020-05-21 02:11:36] [INFO ] Deduced a trap composed of 10 places in 229 ms
[2020-05-21 02:11:36] [INFO ] Deduced a trap composed of 21 places in 181 ms
[2020-05-21 02:11:36] [INFO ] Deduced a trap composed of 58 places in 229 ms
[2020-05-21 02:11:37] [INFO ] Deduced a trap composed of 49 places in 155 ms
[2020-05-21 02:11:37] [INFO ] Deduced a trap composed of 34 places in 246 ms
[2020-05-21 02:11:37] [INFO ] Deduced a trap composed of 12 places in 238 ms
[2020-05-21 02:11:37] [INFO ] Deduced a trap composed of 13 places in 223 ms
[2020-05-21 02:11:38] [INFO ] Deduced a trap composed of 19 places in 230 ms
[2020-05-21 02:11:38] [INFO ] Deduced a trap composed of 11 places in 203 ms
[2020-05-21 02:11:38] [INFO ] Trap strengthening (SAT) tested/added 61/60 trap constraints in 16476 ms
[2020-05-21 02:11:38] [INFO ] Computed and/alt/rep : 1136/8175/926 causal constraints in 62 ms.
[2020-05-21 02:11:58] [INFO ] Added : 830 causal constraints over 166 iterations in 20182 ms.(timeout) Result :sat
[2020-05-21 02:11:58] [INFO ] Deduced a trap composed of 31 places in 281 ms
[2020-05-21 02:11:59] [INFO ] Deduced a trap composed of 43 places in 239 ms
[2020-05-21 02:11:59] [INFO ] Deduced a trap composed of 48 places in 254 ms
[2020-05-21 02:12:00] [INFO ] Deduced a trap composed of 19 places in 284 ms
[2020-05-21 02:12:00] [INFO ] Deduced a trap composed of 28 places in 238 ms
[2020-05-21 02:12:00] [INFO ] Deduced a trap composed of 91 places in 254 ms
[2020-05-21 02:12:01] [INFO ] Deduced a trap composed of 39 places in 211 ms
[2020-05-21 02:12:01] [INFO ] Deduced a trap composed of 29 places in 237 ms
[2020-05-21 02:12:02] [INFO ] Deduced a trap composed of 38 places in 241 ms
[2020-05-21 02:12:02] [INFO ] Deduced a trap composed of 31 places in 261 ms
[2020-05-21 02:12:02] [INFO ] Deduced a trap composed of 11 places in 257 ms
[2020-05-21 02:12:02] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 4364 ms
Attempting to minimize the solution found.
Minimization took 117 ms.
[2020-05-21 02:12:03] [INFO ] [Real]Absence check using 20 positive place invariants in 24 ms returned sat
[2020-05-21 02:12:03] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2020-05-21 02:12:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:12:03] [INFO ] [Real]Absence check using state equation in 691 ms returned sat
[2020-05-21 02:12:04] [INFO ] [Real]Added 366 Read/Feed constraints in 71 ms returned sat
[2020-05-21 02:12:04] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:12:04] [INFO ] [Nat]Absence check using 20 positive place invariants in 26 ms returned sat
[2020-05-21 02:12:04] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2020-05-21 02:12:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:12:04] [INFO ] [Nat]Absence check using state equation in 745 ms returned sat
[2020-05-21 02:12:04] [INFO ] [Nat]Added 366 Read/Feed constraints in 52 ms returned sat
[2020-05-21 02:12:05] [INFO ] Deduced a trap composed of 12 places in 279 ms
[2020-05-21 02:12:05] [INFO ] Deduced a trap composed of 50 places in 272 ms
[2020-05-21 02:12:05] [INFO ] Deduced a trap composed of 49 places in 264 ms
[2020-05-21 02:12:06] [INFO ] Deduced a trap composed of 59 places in 279 ms
[2020-05-21 02:12:06] [INFO ] Deduced a trap composed of 21 places in 267 ms
[2020-05-21 02:12:06] [INFO ] Deduced a trap composed of 22 places in 263 ms
[2020-05-21 02:12:07] [INFO ] Deduced a trap composed of 24 places in 247 ms
[2020-05-21 02:12:07] [INFO ] Deduced a trap composed of 39 places in 281 ms
[2020-05-21 02:12:07] [INFO ] Deduced a trap composed of 59 places in 250 ms
[2020-05-21 02:12:08] [INFO ] Deduced a trap composed of 61 places in 263 ms
[2020-05-21 02:12:08] [INFO ] Deduced a trap composed of 41 places in 263 ms
[2020-05-21 02:12:08] [INFO ] Deduced a trap composed of 47 places in 277 ms
[2020-05-21 02:12:08] [INFO ] Deduced a trap composed of 33 places in 294 ms
[2020-05-21 02:12:09] [INFO ] Deduced a trap composed of 76 places in 308 ms
[2020-05-21 02:12:09] [INFO ] Deduced a trap composed of 21 places in 243 ms
[2020-05-21 02:12:09] [INFO ] Deduced a trap composed of 23 places in 281 ms
[2020-05-21 02:12:10] [INFO ] Deduced a trap composed of 30 places in 307 ms
[2020-05-21 02:12:10] [INFO ] Deduced a trap composed of 28 places in 288 ms
[2020-05-21 02:12:10] [INFO ] Deduced a trap composed of 50 places in 223 ms
[2020-05-21 02:12:11] [INFO ] Deduced a trap composed of 61 places in 239 ms
[2020-05-21 02:12:11] [INFO ] Deduced a trap composed of 31 places in 229 ms
[2020-05-21 02:12:11] [INFO ] Deduced a trap composed of 31 places in 204 ms
[2020-05-21 02:12:11] [INFO ] Deduced a trap composed of 39 places in 186 ms
[2020-05-21 02:12:12] [INFO ] Deduced a trap composed of 40 places in 238 ms
[2020-05-21 02:12:12] [INFO ] Deduced a trap composed of 30 places in 261 ms
[2020-05-21 02:12:12] [INFO ] Deduced a trap composed of 31 places in 252 ms
[2020-05-21 02:12:13] [INFO ] Deduced a trap composed of 30 places in 275 ms
[2020-05-21 02:12:13] [INFO ] Deduced a trap composed of 48 places in 280 ms
[2020-05-21 02:12:13] [INFO ] Deduced a trap composed of 57 places in 261 ms
[2020-05-21 02:12:13] [INFO ] Deduced a trap composed of 87 places in 241 ms
[2020-05-21 02:12:14] [INFO ] Deduced a trap composed of 68 places in 254 ms
[2020-05-21 02:12:14] [INFO ] Deduced a trap composed of 42 places in 239 ms
[2020-05-21 02:12:14] [INFO ] Deduced a trap composed of 39 places in 241 ms
[2020-05-21 02:12:15] [INFO ] Deduced a trap composed of 31 places in 335 ms
[2020-05-21 02:12:15] [INFO ] Deduced a trap composed of 11 places in 298 ms
[2020-05-21 02:12:15] [INFO ] Deduced a trap composed of 19 places in 253 ms
[2020-05-21 02:12:16] [INFO ] Deduced a trap composed of 27 places in 276 ms
[2020-05-21 02:12:16] [INFO ] Deduced a trap composed of 77 places in 269 ms
[2020-05-21 02:12:16] [INFO ] Deduced a trap composed of 41 places in 224 ms
[2020-05-21 02:12:17] [INFO ] Deduced a trap composed of 31 places in 237 ms
[2020-05-21 02:12:17] [INFO ] Deduced a trap composed of 38 places in 291 ms
[2020-05-21 02:12:17] [INFO ] Deduced a trap composed of 33 places in 281 ms
[2020-05-21 02:12:18] [INFO ] Deduced a trap composed of 19 places in 273 ms
[2020-05-21 02:12:18] [INFO ] Deduced a trap composed of 56 places in 229 ms
[2020-05-21 02:12:18] [INFO ] Deduced a trap composed of 39 places in 258 ms
[2020-05-21 02:12:19] [INFO ] Deduced a trap composed of 13 places in 316 ms
[2020-05-21 02:12:19] [INFO ] Deduced a trap composed of 46 places in 269 ms
[2020-05-21 02:12:19] [INFO ] Deduced a trap composed of 43 places in 255 ms
[2020-05-21 02:12:19] [INFO ] Deduced a trap composed of 31 places in 250 ms
[2020-05-21 02:12:20] [INFO ] Deduced a trap composed of 59 places in 240 ms
[2020-05-21 02:12:20] [INFO ] Deduced a trap composed of 48 places in 241 ms
[2020-05-21 02:12:20] [INFO ] Deduced a trap composed of 51 places in 237 ms
[2020-05-21 02:12:21] [INFO ] Deduced a trap composed of 48 places in 314 ms
[2020-05-21 02:12:21] [INFO ] Deduced a trap composed of 48 places in 242 ms
[2020-05-21 02:12:21] [INFO ] Deduced a trap composed of 48 places in 222 ms
[2020-05-21 02:12:22] [INFO ] Deduced a trap composed of 48 places in 239 ms
[2020-05-21 02:12:22] [INFO ] Deduced a trap composed of 61 places in 238 ms
[2020-05-21 02:12:22] [INFO ] Deduced a trap composed of 62 places in 201 ms
[2020-05-21 02:12:22] [INFO ] Deduced a trap composed of 48 places in 248 ms
[2020-05-21 02:12:23] [INFO ] Deduced a trap composed of 47 places in 251 ms
[2020-05-21 02:12:23] [INFO ] Deduced a trap composed of 36 places in 255 ms
[2020-05-21 02:12:23] [INFO ] Deduced a trap composed of 20 places in 240 ms
[2020-05-21 02:12:24] [INFO ] Deduced a trap composed of 30 places in 270 ms
[2020-05-21 02:12:24] [INFO ] Deduced a trap composed of 48 places in 268 ms
[2020-05-21 02:12:24] [INFO ] Deduced a trap composed of 29 places in 225 ms
[2020-05-21 02:12:24] [INFO ] Deduced a trap composed of 32 places in 241 ms
[2020-05-21 02:12:25] [INFO ] Deduced a trap composed of 42 places in 272 ms
[2020-05-21 02:12:25] [INFO ] Deduced a trap composed of 40 places in 248 ms
[2020-05-21 02:12:25] [INFO ] Deduced a trap composed of 39 places in 238 ms
[2020-05-21 02:12:26] [INFO ] Deduced a trap composed of 26 places in 217 ms
[2020-05-21 02:12:26] [INFO ] Deduced a trap composed of 10 places in 262 ms
[2020-05-21 02:12:26] [INFO ] Deduced a trap composed of 13 places in 282 ms
[2020-05-21 02:12:27] [INFO ] Deduced a trap composed of 10 places in 255 ms
[2020-05-21 02:12:27] [INFO ] Deduced a trap composed of 10 places in 265 ms
[2020-05-21 02:12:27] [INFO ] Deduced a trap composed of 19 places in 232 ms
[2020-05-21 02:12:28] [INFO ] Deduced a trap composed of 13 places in 287 ms
[2020-05-21 02:12:28] [INFO ] Deduced a trap composed of 29 places in 274 ms
[2020-05-21 02:12:28] [INFO ] Deduced a trap composed of 20 places in 260 ms
[2020-05-21 02:12:29] [INFO ] Deduced a trap composed of 20 places in 285 ms
[2020-05-21 02:12:29] [INFO ] Deduced a trap composed of 56 places in 160 ms
[2020-05-21 02:12:29] [INFO ] Deduced a trap composed of 58 places in 168 ms
[2020-05-21 02:12:29] [INFO ] Deduced a trap composed of 55 places in 173 ms
[2020-05-21 02:12:30] [INFO ] Deduced a trap composed of 28 places in 241 ms
[2020-05-21 02:12:30] [INFO ] Deduced a trap composed of 55 places in 169 ms
[2020-05-21 02:12:30] [INFO ] Deduced a trap composed of 25 places in 191 ms
[2020-05-21 02:12:30] [INFO ] Deduced a trap composed of 93 places in 175 ms
[2020-05-21 02:12:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 86 trap constraints in 25888 ms
[2020-05-21 02:12:30] [INFO ] [Real]Absence check using 20 positive place invariants in 25 ms returned sat
[2020-05-21 02:12:30] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 5 ms returned sat
[2020-05-21 02:12:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:12:31] [INFO ] [Real]Absence check using state equation in 712 ms returned sat
[2020-05-21 02:12:31] [INFO ] [Real]Added 366 Read/Feed constraints in 50 ms returned sat
[2020-05-21 02:12:31] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:12:31] [INFO ] [Nat]Absence check using 20 positive place invariants in 21 ms returned sat
[2020-05-21 02:12:31] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2020-05-21 02:12:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:12:32] [INFO ] [Nat]Absence check using state equation in 752 ms returned sat
[2020-05-21 02:12:32] [INFO ] [Nat]Added 366 Read/Feed constraints in 69 ms returned sat
[2020-05-21 02:12:32] [INFO ] Deduced a trap composed of 38 places in 308 ms
[2020-05-21 02:12:33] [INFO ] Deduced a trap composed of 92 places in 289 ms
[2020-05-21 02:12:33] [INFO ] Deduced a trap composed of 98 places in 271 ms
[2020-05-21 02:12:33] [INFO ] Deduced a trap composed of 111 places in 285 ms
[2020-05-21 02:12:34] [INFO ] Deduced a trap composed of 19 places in 295 ms
[2020-05-21 02:12:34] [INFO ] Deduced a trap composed of 22 places in 299 ms
[2020-05-21 02:12:34] [INFO ] Deduced a trap composed of 10 places in 274 ms
[2020-05-21 02:12:35] [INFO ] Deduced a trap composed of 12 places in 281 ms
[2020-05-21 02:12:35] [INFO ] Deduced a trap composed of 12 places in 292 ms
[2020-05-21 02:12:35] [INFO ] Deduced a trap composed of 21 places in 289 ms
[2020-05-21 02:12:36] [INFO ] Deduced a trap composed of 19 places in 290 ms
[2020-05-21 02:12:36] [INFO ] Deduced a trap composed of 13 places in 326 ms
[2020-05-21 02:12:36] [INFO ] Deduced a trap composed of 25 places in 248 ms
[2020-05-21 02:12:37] [INFO ] Deduced a trap composed of 20 places in 265 ms
[2020-05-21 02:12:37] [INFO ] Deduced a trap composed of 64 places in 283 ms
[2020-05-21 02:12:37] [INFO ] Deduced a trap composed of 22 places in 261 ms
[2020-05-21 02:12:38] [INFO ] Deduced a trap composed of 20 places in 284 ms
[2020-05-21 02:12:38] [INFO ] Deduced a trap composed of 106 places in 241 ms
[2020-05-21 02:12:38] [INFO ] Deduced a trap composed of 37 places in 237 ms
[2020-05-21 02:12:38] [INFO ] Deduced a trap composed of 19 places in 267 ms
[2020-05-21 02:12:39] [INFO ] Deduced a trap composed of 10 places in 264 ms
[2020-05-21 02:12:39] [INFO ] Deduced a trap composed of 10 places in 238 ms
[2020-05-21 02:12:39] [INFO ] Deduced a trap composed of 48 places in 230 ms
[2020-05-21 02:12:40] [INFO ] Deduced a trap composed of 12 places in 266 ms
[2020-05-21 02:12:40] [INFO ] Deduced a trap composed of 29 places in 189 ms
[2020-05-21 02:12:40] [INFO ] Deduced a trap composed of 12 places in 280 ms
[2020-05-21 02:12:40] [INFO ] Deduced a trap composed of 12 places in 251 ms
[2020-05-21 02:12:41] [INFO ] Deduced a trap composed of 13 places in 231 ms
[2020-05-21 02:12:41] [INFO ] Deduced a trap composed of 13 places in 241 ms
[2020-05-21 02:12:41] [INFO ] Deduced a trap composed of 13 places in 254 ms
[2020-05-21 02:12:42] [INFO ] Deduced a trap composed of 23 places in 275 ms
[2020-05-21 02:12:42] [INFO ] Deduced a trap composed of 24 places in 233 ms
[2020-05-21 02:12:42] [INFO ] Deduced a trap composed of 37 places in 271 ms
[2020-05-21 02:12:43] [INFO ] Deduced a trap composed of 20 places in 266 ms
[2020-05-21 02:12:43] [INFO ] Deduced a trap composed of 44 places in 228 ms
[2020-05-21 02:12:43] [INFO ] Deduced a trap composed of 16 places in 222 ms
[2020-05-21 02:12:43] [INFO ] Deduced a trap composed of 35 places in 207 ms
[2020-05-21 02:12:44] [INFO ] Deduced a trap composed of 20 places in 221 ms
[2020-05-21 02:12:44] [INFO ] Deduced a trap composed of 34 places in 245 ms
[2020-05-21 02:12:44] [INFO ] Deduced a trap composed of 42 places in 254 ms
[2020-05-21 02:12:44] [INFO ] Deduced a trap composed of 26 places in 264 ms
[2020-05-21 02:12:45] [INFO ] Deduced a trap composed of 20 places in 269 ms
[2020-05-21 02:12:45] [INFO ] Deduced a trap composed of 55 places in 238 ms
[2020-05-21 02:12:45] [INFO ] Deduced a trap composed of 51 places in 129 ms
[2020-05-21 02:12:45] [INFO ] Deduced a trap composed of 42 places in 147 ms
[2020-05-21 02:12:46] [INFO ] Deduced a trap composed of 21 places in 289 ms
[2020-05-21 02:12:46] [INFO ] Deduced a trap composed of 52 places in 93 ms
[2020-05-21 02:12:46] [INFO ] Deduced a trap composed of 52 places in 124 ms
[2020-05-21 02:12:46] [INFO ] Deduced a trap composed of 40 places in 96 ms
[2020-05-21 02:12:46] [INFO ] Trap strengthening (SAT) tested/added 50/49 trap constraints in 13995 ms
[2020-05-21 02:12:46] [INFO ] Computed and/alt/rep : 1136/8175/926 causal constraints in 78 ms.
[2020-05-21 02:13:06] [INFO ] Added : 780 causal constraints over 156 iterations in 20199 ms.(timeout) Result :sat
[2020-05-21 02:13:07] [INFO ] Deduced a trap composed of 35 places in 312 ms
[2020-05-21 02:13:07] [INFO ] Deduced a trap composed of 20 places in 325 ms
[2020-05-21 02:13:08] [INFO ] Deduced a trap composed of 11 places in 303 ms
[2020-05-21 02:13:08] [INFO ] Deduced a trap composed of 77 places in 340 ms
[2020-05-21 02:13:09] [INFO ] Deduced a trap composed of 22 places in 296 ms
[2020-05-21 02:13:09] [INFO ] Deduced a trap composed of 19 places in 286 ms
[2020-05-21 02:13:09] [INFO ] Deduced a trap composed of 42 places in 244 ms
[2020-05-21 02:13:10] [INFO ] Deduced a trap composed of 27 places in 262 ms
[2020-05-21 02:13:10] [INFO ] Deduced a trap composed of 38 places in 223 ms
[2020-05-21 02:13:11] [INFO ] Deduced a trap composed of 36 places in 209 ms
[2020-05-21 02:13:11] [INFO ] Deduced a trap composed of 36 places in 209 ms
[2020-05-21 02:13:11] [INFO ] Deduced a trap composed of 36 places in 236 ms
[2020-05-21 02:13:12] [INFO ] Deduced a trap composed of 44 places in 212 ms
[2020-05-21 02:13:12] [INFO ] Deduced a trap composed of 10 places in 250 ms
[2020-05-21 02:13:12] [INFO ] Deduced a trap composed of 37 places in 192 ms
[2020-05-21 02:13:13] [INFO ] Deduced a trap composed of 36 places in 215 ms
[2020-05-21 02:13:13] [INFO ] Deduced a trap composed of 60 places in 169 ms
[2020-05-21 02:13:14] [INFO ] Deduced a trap composed of 25 places in 273 ms
[2020-05-21 02:13:14] [INFO ] Deduced a trap composed of 11 places in 307 ms
[2020-05-21 02:13:14] [INFO ] Deduced a trap composed of 108 places in 237 ms
[2020-05-21 02:13:15] [INFO ] Deduced a trap composed of 30 places in 242 ms
[2020-05-21 02:13:15] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 8601 ms
Attempting to minimize the solution found.
Minimization took 102 ms.
FORMULA Peterson-PT-6-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 267400 steps, including 1000 resets, run finished after 601 ms. (steps per millisecond=444 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 209800 steps, including 1000 resets, run finished after 501 ms. (steps per millisecond=418 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 173300 steps, including 1000 resets, run finished after 403 ms. (steps per millisecond=430 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 34 out of 443 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 443/443 places, 1143/1143 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 443 transition count 1142
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 442 transition count 1142
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2 place count 442 transition count 1136
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 436 transition count 1136
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 435 transition count 1135
Applied a total of 16 rules in 102 ms. Remains 435 /443 variables (removed 8) and now considering 1135/1143 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 435/443 places, 1135/1143 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2221 ms. (steps per millisecond=450 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 547 ms. (steps per millisecond=1828 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 725 ms. (steps per millisecond=1379 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 750 ms. (steps per millisecond=1333 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 994 ms. (steps per millisecond=1006 ) properties seen :[0, 0, 0, 0]
Interrupted probabilistic random walk after 10472192 steps, run timeout after 30001 ms. (steps per millisecond=349 ) properties seen :[0, 0, 0, 0]
Probabilistic random walk after 10472192 steps, saw 1309025 distinct states, run finished after 30001 ms. (steps per millisecond=349 ) properties seen :[0, 0, 0, 0]
[2020-05-21 02:13:52] [INFO ] Flow matrix only has 925 transitions (discarded 210 similar events)
// Phase 1: matrix 925 rows 435 cols
[2020-05-21 02:13:52] [INFO ] Computed 27 place invariants in 7 ms
[2020-05-21 02:13:52] [INFO ] [Real]Absence check using 20 positive place invariants in 22 ms returned sat
[2020-05-21 02:13:52] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2020-05-21 02:13:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:13:53] [INFO ] [Real]Absence check using state equation in 673 ms returned sat
[2020-05-21 02:13:53] [INFO ] State equation strengthened by 366 read => feed constraints.
[2020-05-21 02:13:53] [INFO ] [Real]Added 366 Read/Feed constraints in 49 ms returned sat
[2020-05-21 02:13:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:13:53] [INFO ] [Nat]Absence check using 20 positive place invariants in 21 ms returned sat
[2020-05-21 02:13:53] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 13 ms returned sat
[2020-05-21 02:13:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:13:54] [INFO ] [Nat]Absence check using state equation in 674 ms returned sat
[2020-05-21 02:13:54] [INFO ] [Nat]Added 366 Read/Feed constraints in 59 ms returned sat
[2020-05-21 02:13:54] [INFO ] Deduced a trap composed of 18 places in 291 ms
[2020-05-21 02:13:54] [INFO ] Deduced a trap composed of 14 places in 293 ms
[2020-05-21 02:13:55] [INFO ] Deduced a trap composed of 35 places in 342 ms
[2020-05-21 02:13:55] [INFO ] Deduced a trap composed of 26 places in 259 ms
[2020-05-21 02:13:55] [INFO ] Deduced a trap composed of 35 places in 236 ms
[2020-05-21 02:13:56] [INFO ] Deduced a trap composed of 35 places in 281 ms
[2020-05-21 02:13:56] [INFO ] Deduced a trap composed of 37 places in 268 ms
[2020-05-21 02:13:56] [INFO ] Deduced a trap composed of 86 places in 245 ms
[2020-05-21 02:13:56] [INFO ] Deduced a trap composed of 20 places in 262 ms
[2020-05-21 02:13:57] [INFO ] Deduced a trap composed of 19 places in 272 ms
[2020-05-21 02:13:57] [INFO ] Deduced a trap composed of 19 places in 291 ms
[2020-05-21 02:13:57] [INFO ] Deduced a trap composed of 19 places in 260 ms
[2020-05-21 02:13:58] [INFO ] Deduced a trap composed of 47 places in 212 ms
[2020-05-21 02:13:58] [INFO ] Deduced a trap composed of 42 places in 276 ms
[2020-05-21 02:13:58] [INFO ] Deduced a trap composed of 51 places in 243 ms
[2020-05-21 02:13:59] [INFO ] Deduced a trap composed of 46 places in 243 ms
[2020-05-21 02:13:59] [INFO ] Deduced a trap composed of 29 places in 193 ms
[2020-05-21 02:13:59] [INFO ] Deduced a trap composed of 28 places in 190 ms
[2020-05-21 02:13:59] [INFO ] Deduced a trap composed of 28 places in 213 ms
[2020-05-21 02:14:00] [INFO ] Deduced a trap composed of 43 places in 217 ms
[2020-05-21 02:14:00] [INFO ] Deduced a trap composed of 26 places in 247 ms
[2020-05-21 02:14:00] [INFO ] Deduced a trap composed of 48 places in 218 ms
[2020-05-21 02:14:00] [INFO ] Deduced a trap composed of 35 places in 232 ms
[2020-05-21 02:14:01] [INFO ] Deduced a trap composed of 35 places in 227 ms
[2020-05-21 02:14:01] [INFO ] Deduced a trap composed of 30 places in 251 ms
[2020-05-21 02:14:01] [INFO ] Deduced a trap composed of 13 places in 252 ms
[2020-05-21 02:14:01] [INFO ] Deduced a trap composed of 12 places in 231 ms
[2020-05-21 02:14:02] [INFO ] Deduced a trap composed of 20 places in 230 ms
[2020-05-21 02:14:02] [INFO ] Deduced a trap composed of 42 places in 180 ms
[2020-05-21 02:14:02] [INFO ] Deduced a trap composed of 28 places in 237 ms
[2020-05-21 02:14:02] [INFO ] Deduced a trap composed of 13 places in 239 ms
[2020-05-21 02:14:03] [INFO ] Deduced a trap composed of 14 places in 206 ms
[2020-05-21 02:14:03] [INFO ] Deduced a trap composed of 47 places in 155 ms
[2020-05-21 02:14:03] [INFO ] Deduced a trap composed of 47 places in 151 ms
[2020-05-21 02:14:03] [INFO ] Deduced a trap composed of 47 places in 133 ms
[2020-05-21 02:14:03] [INFO ] Deduced a trap composed of 47 places in 150 ms
[2020-05-21 02:14:04] [INFO ] Deduced a trap composed of 51 places in 196 ms
[2020-05-21 02:14:04] [INFO ] Deduced a trap composed of 56 places in 165 ms
[2020-05-21 02:14:04] [INFO ] Deduced a trap composed of 14 places in 172 ms
[2020-05-21 02:14:04] [INFO ] Deduced a trap composed of 43 places in 159 ms
[2020-05-21 02:14:05] [INFO ] Deduced a trap composed of 29 places in 177 ms
[2020-05-21 02:14:05] [INFO ] Deduced a trap composed of 18 places in 106 ms
[2020-05-21 02:14:05] [INFO ] Deduced a trap composed of 14 places in 197 ms
[2020-05-21 02:14:06] [INFO ] Deduced a trap composed of 28 places in 188 ms
[2020-05-21 02:14:06] [INFO ] Deduced a trap composed of 12 places in 128 ms
[2020-05-21 02:14:06] [INFO ] Deduced a trap composed of 22 places in 123 ms
[2020-05-21 02:14:06] [INFO ] Deduced a trap composed of 32 places in 148 ms
[2020-05-21 02:14:06] [INFO ] Deduced a trap composed of 34 places in 190 ms
[2020-05-21 02:14:07] [INFO ] Deduced a trap composed of 48 places in 211 ms
[2020-05-21 02:14:07] [INFO ] Deduced a trap composed of 52 places in 191 ms
[2020-05-21 02:14:07] [INFO ] Deduced a trap composed of 46 places in 112 ms
[2020-05-21 02:14:07] [INFO ] Deduced a trap composed of 10 places in 99 ms
[2020-05-21 02:14:07] [INFO ] Deduced a trap composed of 12 places in 96 ms
[2020-05-21 02:14:08] [INFO ] Deduced a trap composed of 10 places in 131 ms
[2020-05-21 02:14:08] [INFO ] Trap strengthening (SAT) tested/added 55/54 trap constraints in 14012 ms
[2020-05-21 02:14:08] [INFO ] Computed and/alt/rep : 1128/8179/918 causal constraints in 65 ms.
[2020-05-21 02:14:30] [INFO ] Added : 745 causal constraints over 149 iterations in 21862 ms.(timeout) Result :sat
[2020-05-21 02:14:30] [INFO ] Deduced a trap composed of 30 places in 212 ms
[2020-05-21 02:14:30] [INFO ] Deduced a trap composed of 41 places in 235 ms
[2020-05-21 02:14:31] [INFO ] Deduced a trap composed of 39 places in 246 ms
[2020-05-21 02:14:31] [INFO ] Deduced a trap composed of 55 places in 237 ms
[2020-05-21 02:14:31] [INFO ] Deduced a trap composed of 74 places in 237 ms
[2020-05-21 02:14:32] [INFO ] Deduced a trap composed of 20 places in 241 ms
[2020-05-21 02:14:32] [INFO ] Deduced a trap composed of 21 places in 254 ms
[2020-05-21 02:14:33] [INFO ] Deduced a trap composed of 19 places in 273 ms
[2020-05-21 02:14:33] [INFO ] Deduced a trap composed of 28 places in 264 ms
[2020-05-21 02:14:34] [INFO ] Deduced a trap composed of 67 places in 252 ms
[2020-05-21 02:14:34] [INFO ] Deduced a trap composed of 30 places in 264 ms
[2020-05-21 02:14:34] [INFO ] Deduced a trap composed of 57 places in 271 ms
[2020-05-21 02:14:35] [INFO ] Deduced a trap composed of 19 places in 268 ms
[2020-05-21 02:14:35] [INFO ] Deduced a trap composed of 57 places in 282 ms
[2020-05-21 02:14:36] [INFO ] Deduced a trap composed of 20 places in 257 ms
[2020-05-21 02:14:36] [INFO ] Deduced a trap composed of 39 places in 258 ms
[2020-05-21 02:14:37] [INFO ] Deduced a trap composed of 34 places in 246 ms
[2020-05-21 02:14:37] [INFO ] Deduced a trap composed of 21 places in 238 ms
[2020-05-21 02:14:37] [INFO ] Deduced a trap composed of 24 places in 228 ms
[2020-05-21 02:14:38] [INFO ] Deduced a trap composed of 48 places in 192 ms
[2020-05-21 02:14:38] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-21 02:14:38] [INFO ] Deduced a trap composed of 2 places in 336 ms
[2020-05-21 02:14: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 (> (+ s297 s417) 0)") while checking expression at index 0
[2020-05-21 02:14:38] [INFO ] [Real]Absence check using 20 positive place invariants in 18 ms returned sat
[2020-05-21 02:14:38] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2020-05-21 02:14:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:14:39] [INFO ] [Real]Absence check using state equation in 659 ms returned sat
[2020-05-21 02:14:39] [INFO ] [Real]Added 366 Read/Feed constraints in 39 ms returned sat
[2020-05-21 02:14:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:14:39] [INFO ] [Nat]Absence check using 20 positive place invariants in 28 ms returned sat
[2020-05-21 02:14:39] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2020-05-21 02:14:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:14:40] [INFO ] [Nat]Absence check using state equation in 669 ms returned sat
[2020-05-21 02:14:40] [INFO ] [Nat]Added 366 Read/Feed constraints in 71 ms returned sat
[2020-05-21 02:14:40] [INFO ] Deduced a trap composed of 19 places in 241 ms
[2020-05-21 02:14:40] [INFO ] Deduced a trap composed of 39 places in 239 ms
[2020-05-21 02:14:41] [INFO ] Deduced a trap composed of 31 places in 232 ms
[2020-05-21 02:14:41] [INFO ] Deduced a trap composed of 58 places in 242 ms
[2020-05-21 02:14:41] [INFO ] Deduced a trap composed of 41 places in 276 ms
[2020-05-21 02:14:41] [INFO ] Deduced a trap composed of 29 places in 195 ms
[2020-05-21 02:14:42] [INFO ] Deduced a trap composed of 21 places in 285 ms
[2020-05-21 02:14:42] [INFO ] Deduced a trap composed of 62 places in 224 ms
[2020-05-21 02:14:42] [INFO ] Deduced a trap composed of 28 places in 183 ms
[2020-05-21 02:14:42] [INFO ] Deduced a trap composed of 68 places in 168 ms
[2020-05-21 02:14:43] [INFO ] Deduced a trap composed of 28 places in 193 ms
[2020-05-21 02:14:43] [INFO ] Deduced a trap composed of 53 places in 230 ms
[2020-05-21 02:14:43] [INFO ] Deduced a trap composed of 41 places in 186 ms
[2020-05-21 02:14:43] [INFO ] Deduced a trap composed of 22 places in 223 ms
[2020-05-21 02:14:44] [INFO ] Deduced a trap composed of 28 places in 218 ms
[2020-05-21 02:14:44] [INFO ] Deduced a trap composed of 28 places in 248 ms
[2020-05-21 02:14:44] [INFO ] Deduced a trap composed of 20 places in 191 ms
[2020-05-21 02:14:44] [INFO ] Deduced a trap composed of 12 places in 193 ms
[2020-05-21 02:14:45] [INFO ] Deduced a trap composed of 12 places in 179 ms
[2020-05-21 02:14:45] [INFO ] Deduced a trap composed of 50 places in 193 ms
[2020-05-21 02:14:45] [INFO ] Deduced a trap composed of 61 places in 190 ms
[2020-05-21 02:14:45] [INFO ] Deduced a trap composed of 13 places in 230 ms
[2020-05-21 02:14:46] [INFO ] Deduced a trap composed of 13 places in 226 ms
[2020-05-21 02:14:46] [INFO ] Deduced a trap composed of 39 places in 244 ms
[2020-05-21 02:14:46] [INFO ] Deduced a trap composed of 73 places in 243 ms
[2020-05-21 02:14:46] [INFO ] Deduced a trap composed of 50 places in 179 ms
[2020-05-21 02:14:47] [INFO ] Deduced a trap composed of 37 places in 194 ms
[2020-05-21 02:14:47] [INFO ] Deduced a trap composed of 38 places in 240 ms
[2020-05-21 02:14:47] [INFO ] Deduced a trap composed of 13 places in 242 ms
[2020-05-21 02:14:47] [INFO ] Deduced a trap composed of 12 places in 202 ms
[2020-05-21 02:14:48] [INFO ] Deduced a trap composed of 11 places in 193 ms
[2020-05-21 02:14:48] [INFO ] Deduced a trap composed of 27 places in 171 ms
[2020-05-21 02:14:48] [INFO ] Deduced a trap composed of 27 places in 177 ms
[2020-05-21 02:14:48] [INFO ] Deduced a trap composed of 47 places in 194 ms
[2020-05-21 02:14:48] [INFO ] Deduced a trap composed of 50 places in 155 ms
[2020-05-21 02:14:49] [INFO ] Deduced a trap composed of 39 places in 172 ms
[2020-05-21 02:14:49] [INFO ] Deduced a trap composed of 38 places in 176 ms
[2020-05-21 02:14:49] [INFO ] Deduced a trap composed of 39 places in 136 ms
[2020-05-21 02:14:49] [INFO ] Deduced a trap composed of 50 places in 163 ms
[2020-05-21 02:14:49] [INFO ] Deduced a trap composed of 33 places in 131 ms
[2020-05-21 02:14:50] [INFO ] Deduced a trap composed of 30 places in 117 ms
[2020-05-21 02:14:50] [INFO ] Deduced a trap composed of 32 places in 87 ms
[2020-05-21 02:14:50] [INFO ] Deduced a trap composed of 32 places in 113 ms
[2020-05-21 02:14:50] [INFO ] Deduced a trap composed of 29 places in 207 ms
[2020-05-21 02:14:50] [INFO ] Deduced a trap composed of 28 places in 192 ms
[2020-05-21 02:14:51] [INFO ] Deduced a trap composed of 56 places in 112 ms
[2020-05-21 02:14:51] [INFO ] Deduced a trap composed of 55 places in 108 ms
[2020-05-21 02:14:51] [INFO ] Deduced a trap composed of 55 places in 101 ms
[2020-05-21 02:14:51] [INFO ] Deduced a trap composed of 56 places in 151 ms
[2020-05-21 02:14:51] [INFO ] Deduced a trap composed of 57 places in 96 ms
[2020-05-21 02:14:51] [INFO ] Trap strengthening (SAT) tested/added 51/50 trap constraints in 11368 ms
[2020-05-21 02:14:51] [INFO ] Computed and/alt/rep : 1128/8179/918 causal constraints in 51 ms.
[2020-05-21 02:15:10] [INFO ] Added : 786 causal constraints over 158 iterations in 18888 ms. Result :sat
[2020-05-21 02:15:10] [INFO ] Deduced a trap composed of 92 places in 276 ms
[2020-05-21 02:15:11] [INFO ] Deduced a trap composed of 40 places in 250 ms
[2020-05-21 02:15:11] [INFO ] Deduced a trap composed of 34 places in 256 ms
[2020-05-21 02:15:12] [INFO ] Deduced a trap composed of 55 places in 265 ms
[2020-05-21 02:15:12] [INFO ] Deduced a trap composed of 29 places in 257 ms
[2020-05-21 02:15:12] [INFO ] Deduced a trap composed of 68 places in 258 ms
[2020-05-21 02:15:13] [INFO ] Deduced a trap composed of 29 places in 204 ms
[2020-05-21 02:15:13] [INFO ] Deduced a trap composed of 65 places in 250 ms
[2020-05-21 02:15:13] [INFO ] Deduced a trap composed of 41 places in 249 ms
[2020-05-21 02:15:14] [INFO ] Deduced a trap composed of 61 places in 223 ms
[2020-05-21 02:15:14] [INFO ] Deduced a trap composed of 35 places in 201 ms
[2020-05-21 02:15:14] [INFO ] Deduced a trap composed of 50 places in 188 ms
[2020-05-21 02:15:15] [INFO ] Deduced a trap composed of 24 places in 210 ms
[2020-05-21 02:15:15] [INFO ] Deduced a trap composed of 70 places in 225 ms
[2020-05-21 02:15:16] [INFO ] Deduced a trap composed of 29 places in 174 ms
[2020-05-21 02:15:16] [INFO ] Deduced a trap composed of 22 places in 217 ms
[2020-05-21 02:15:16] [INFO ] Deduced a trap composed of 73 places in 197 ms
[2020-05-21 02:15:17] [INFO ] Deduced a trap composed of 20 places in 193 ms
[2020-05-21 02:15:17] [INFO ] Deduced a trap composed of 20 places in 158 ms
[2020-05-21 02:15:17] [INFO ] Deduced a trap composed of 55 places in 168 ms
[2020-05-21 02:15:17] [INFO ] Deduced a trap composed of 47 places in 110 ms
[2020-05-21 02:15:18] [INFO ] Deduced a trap composed of 48 places in 111 ms
[2020-05-21 02:15:18] [INFO ] Deduced a trap composed of 47 places in 81 ms
[2020-05-21 02:15:18] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 8080 ms
Attempting to minimize the solution found.
Minimization took 120 ms.
[2020-05-21 02:15:18] [INFO ] [Real]Absence check using 20 positive place invariants in 24 ms returned sat
[2020-05-21 02:15:18] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2020-05-21 02:15:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:15:19] [INFO ] [Real]Absence check using state equation in 629 ms returned sat
[2020-05-21 02:15:19] [INFO ] [Real]Added 366 Read/Feed constraints in 44 ms returned sat
[2020-05-21 02:15:19] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:15:19] [INFO ] [Nat]Absence check using 20 positive place invariants in 26 ms returned sat
[2020-05-21 02:15:19] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2020-05-21 02:15:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:15:20] [INFO ] [Nat]Absence check using state equation in 709 ms returned sat
[2020-05-21 02:15:20] [INFO ] [Nat]Added 366 Read/Feed constraints in 80 ms returned sat
[2020-05-21 02:15:20] [INFO ] Deduced a trap composed of 26 places in 288 ms
[2020-05-21 02:15:21] [INFO ] Deduced a trap composed of 19 places in 282 ms
[2020-05-21 02:15:21] [INFO ] Deduced a trap composed of 19 places in 278 ms
[2020-05-21 02:15:21] [INFO ] Deduced a trap composed of 20 places in 277 ms
[2020-05-21 02:15:21] [INFO ] Deduced a trap composed of 26 places in 194 ms
[2020-05-21 02:15:22] [INFO ] Deduced a trap composed of 26 places in 234 ms
[2020-05-21 02:15:22] [INFO ] Deduced a trap composed of 28 places in 240 ms
[2020-05-21 02:15:22] [INFO ] Deduced a trap composed of 44 places in 236 ms
[2020-05-21 02:15:23] [INFO ] Deduced a trap composed of 35 places in 196 ms
[2020-05-21 02:15:23] [INFO ] Deduced a trap composed of 76 places in 192 ms
[2020-05-21 02:15:23] [INFO ] Deduced a trap composed of 77 places in 198 ms
[2020-05-21 02:15:23] [INFO ] Deduced a trap composed of 74 places in 187 ms
[2020-05-21 02:15:23] [INFO ] Deduced a trap composed of 28 places in 217 ms
[2020-05-21 02:15:24] [INFO ] Deduced a trap composed of 35 places in 245 ms
[2020-05-21 02:15:24] [INFO ] Deduced a trap composed of 35 places in 263 ms
[2020-05-21 02:15:24] [INFO ] Deduced a trap composed of 20 places in 248 ms
[2020-05-21 02:15:25] [INFO ] Deduced a trap composed of 28 places in 211 ms
[2020-05-21 02:15:25] [INFO ] Deduced a trap composed of 51 places in 153 ms
[2020-05-21 02:15:25] [INFO ] Deduced a trap composed of 40 places in 167 ms
[2020-05-21 02:15:25] [INFO ] Deduced a trap composed of 47 places in 176 ms
[2020-05-21 02:15:25] [INFO ] Deduced a trap composed of 35 places in 205 ms
[2020-05-21 02:15:26] [INFO ] Deduced a trap composed of 51 places in 205 ms
[2020-05-21 02:15:26] [INFO ] Deduced a trap composed of 51 places in 213 ms
[2020-05-21 02:15:26] [INFO ] Deduced a trap composed of 47 places in 183 ms
[2020-05-21 02:15:26] [INFO ] Deduced a trap composed of 40 places in 190 ms
[2020-05-21 02:15:27] [INFO ] Deduced a trap composed of 51 places in 208 ms
[2020-05-21 02:15:27] [INFO ] Deduced a trap composed of 12 places in 246 ms
[2020-05-21 02:15:27] [INFO ] Deduced a trap composed of 12 places in 233 ms
[2020-05-21 02:15:27] [INFO ] Deduced a trap composed of 39 places in 221 ms
[2020-05-21 02:15:28] [INFO ] Deduced a trap composed of 32 places in 232 ms
[2020-05-21 02:15:28] [INFO ] Deduced a trap composed of 59 places in 173 ms
[2020-05-21 02:15:28] [INFO ] Deduced a trap composed of 43 places in 171 ms
[2020-05-21 02:15:28] [INFO ] Deduced a trap composed of 46 places in 175 ms
[2020-05-21 02:15:28] [INFO ] Deduced a trap composed of 51 places in 175 ms
[2020-05-21 02:15:29] [INFO ] Deduced a trap composed of 22 places in 145 ms
[2020-05-21 02:15:29] [INFO ] Deduced a trap composed of 24 places in 145 ms
[2020-05-21 02:15:29] [INFO ] Deduced a trap composed of 21 places in 147 ms
[2020-05-21 02:15:29] [INFO ] Deduced a trap composed of 24 places in 116 ms
[2020-05-21 02:15:29] [INFO ] Deduced a trap composed of 57 places in 223 ms
[2020-05-21 02:15:30] [INFO ] Deduced a trap composed of 33 places in 140 ms
[2020-05-21 02:15:30] [INFO ] Deduced a trap composed of 35 places in 128 ms
[2020-05-21 02:15:30] [INFO ] Deduced a trap composed of 18 places in 92 ms
[2020-05-21 02:15:30] [INFO ] Deduced a trap composed of 14 places in 128 ms
[2020-05-21 02:15:30] [INFO ] Deduced a trap composed of 11 places in 132 ms
[2020-05-21 02:15:30] [INFO ] Deduced a trap composed of 10 places in 105 ms
[2020-05-21 02:15:31] [INFO ] Deduced a trap composed of 13 places in 138 ms
[2020-05-21 02:15:31] [INFO ] Deduced a trap composed of 44 places in 120 ms
[2020-05-21 02:15:31] [INFO ] Deduced a trap composed of 18 places in 145 ms
[2020-05-21 02:15:31] [INFO ] Deduced a trap composed of 43 places in 116 ms
[2020-05-21 02:15:31] [INFO ] Deduced a trap composed of 18 places in 150 ms
[2020-05-21 02:15:32] [INFO ] Deduced a trap composed of 10 places in 280 ms
[2020-05-21 02:15:32] [INFO ] Deduced a trap composed of 31 places in 250 ms
[2020-05-21 02:15:32] [INFO ] Deduced a trap composed of 46 places in 202 ms
[2020-05-21 02:15:33] [INFO ] Deduced a trap composed of 10 places in 217 ms
[2020-05-21 02:15:33] [INFO ] Deduced a trap composed of 11 places in 205 ms
[2020-05-21 02:15:33] [INFO ] Deduced a trap composed of 39 places in 114 ms
[2020-05-21 02:15:33] [INFO ] Trap strengthening (SAT) tested/added 57/56 trap constraints in 13213 ms
[2020-05-21 02:15:33] [INFO ] Computed and/alt/rep : 1128/8179/918 causal constraints in 73 ms.
[2020-05-21 02:15:53] [INFO ] Added : 795 causal constraints over 159 iterations in 20232 ms.(timeout) Result :sat
[2020-05-21 02:15:54] [INFO ] Deduced a trap composed of 89 places in 290 ms
[2020-05-21 02:15:54] [INFO ] Deduced a trap composed of 55 places in 250 ms
[2020-05-21 02:15:55] [INFO ] Deduced a trap composed of 52 places in 248 ms
[2020-05-21 02:15:55] [INFO ] Deduced a trap composed of 72 places in 263 ms
[2020-05-21 02:15:55] [INFO ] Deduced a trap composed of 20 places in 256 ms
[2020-05-21 02:15:56] [INFO ] Deduced a trap composed of 11 places in 246 ms
[2020-05-21 02:15:56] [INFO ] Deduced a trap composed of 20 places in 293 ms
[2020-05-21 02:15:57] [INFO ] Deduced a trap composed of 31 places in 240 ms
[2020-05-21 02:15:57] [INFO ] Deduced a trap composed of 21 places in 250 ms
[2020-05-21 02:15:58] [INFO ] Deduced a trap composed of 29 places in 260 ms
[2020-05-21 02:15:58] [INFO ] Deduced a trap composed of 63 places in 220 ms
[2020-05-21 02:15:59] [INFO ] Deduced a trap composed of 83 places in 217 ms
[2020-05-21 02:15:59] [INFO ] Deduced a trap composed of 41 places in 223 ms
[2020-05-21 02:16:00] [INFO ] Deduced a trap composed of 71 places in 203 ms
[2020-05-21 02:16:00] [INFO ] Deduced a trap composed of 39 places in 223 ms
[2020-05-21 02:16:00] [INFO ] Deduced a trap composed of 80 places in 219 ms
[2020-05-21 02:16:01] [INFO ] Deduced a trap composed of 51 places in 241 ms
[2020-05-21 02:16:01] [INFO ] Deduced a trap composed of 63 places in 180 ms
[2020-05-21 02:16:02] [INFO ] Deduced a trap composed of 65 places in 166 ms
[2020-05-21 02:16:02] [INFO ] Deduced a trap composed of 80 places in 118 ms
[2020-05-21 02:16:02] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 8682 ms
Attempting to minimize the solution found.
Minimization took 107 ms.
[2020-05-21 02:16:02] [INFO ] [Real]Absence check using 20 positive place invariants in 18 ms returned sat
[2020-05-21 02:16:02] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2020-05-21 02:16:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:16:03] [INFO ] [Real]Absence check using state equation in 715 ms returned sat
[2020-05-21 02:16:03] [INFO ] [Real]Added 366 Read/Feed constraints in 73 ms returned sat
[2020-05-21 02:16:03] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:16:03] [INFO ] [Nat]Absence check using 20 positive place invariants in 38 ms returned sat
[2020-05-21 02:16:03] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2020-05-21 02:16:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:16:04] [INFO ] [Nat]Absence check using state equation in 712 ms returned sat
[2020-05-21 02:16:04] [INFO ] [Nat]Added 366 Read/Feed constraints in 62 ms returned sat
[2020-05-21 02:16:04] [INFO ] Deduced a trap composed of 39 places in 320 ms
[2020-05-21 02:16:05] [INFO ] Deduced a trap composed of 30 places in 315 ms
[2020-05-21 02:16:05] [INFO ] Deduced a trap composed of 28 places in 279 ms
[2020-05-21 02:16:05] [INFO ] Deduced a trap composed of 26 places in 285 ms
[2020-05-21 02:16:06] [INFO ] Deduced a trap composed of 12 places in 281 ms
[2020-05-21 02:16:06] [INFO ] Deduced a trap composed of 12 places in 247 ms
[2020-05-21 02:16:06] [INFO ] Deduced a trap composed of 68 places in 282 ms
[2020-05-21 02:16:07] [INFO ] Deduced a trap composed of 13 places in 294 ms
[2020-05-21 02:16:07] [INFO ] Deduced a trap composed of 13 places in 297 ms
[2020-05-21 02:16:07] [INFO ] Deduced a trap composed of 67 places in 256 ms
[2020-05-21 02:16:08] [INFO ] Deduced a trap composed of 13 places in 317 ms
[2020-05-21 02:16:08] [INFO ] Deduced a trap composed of 21 places in 278 ms
[2020-05-21 02:16:08] [INFO ] Deduced a trap composed of 26 places in 265 ms
[2020-05-21 02:16:09] [INFO ] Deduced a trap composed of 19 places in 230 ms
[2020-05-21 02:16:09] [INFO ] Deduced a trap composed of 54 places in 268 ms
[2020-05-21 02:16:09] [INFO ] Deduced a trap composed of 43 places in 219 ms
[2020-05-21 02:16:09] [INFO ] Deduced a trap composed of 39 places in 284 ms
[2020-05-21 02:16:10] [INFO ] Deduced a trap composed of 39 places in 261 ms
[2020-05-21 02:16:10] [INFO ] Deduced a trap composed of 61 places in 225 ms
[2020-05-21 02:16:10] [INFO ] Deduced a trap composed of 50 places in 237 ms
[2020-05-21 02:16:11] [INFO ] Deduced a trap composed of 27 places in 255 ms
[2020-05-21 02:16:11] [INFO ] Deduced a trap composed of 20 places in 231 ms
[2020-05-21 02:16:11] [INFO ] Deduced a trap composed of 61 places in 188 ms
[2020-05-21 02:16:11] [INFO ] Deduced a trap composed of 35 places in 205 ms
[2020-05-21 02:16:11] [INFO ] Deduced a trap composed of 39 places in 181 ms
[2020-05-21 02:16:12] [INFO ] Deduced a trap composed of 49 places in 181 ms
[2020-05-21 02:16:12] [INFO ] Deduced a trap composed of 65 places in 186 ms
[2020-05-21 02:16:12] [INFO ] Deduced a trap composed of 21 places in 282 ms
[2020-05-21 02:16:13] [INFO ] Deduced a trap composed of 37 places in 242 ms
[2020-05-21 02:16:13] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 8599 ms
[2020-05-21 02:16:13] [INFO ] Computed and/alt/rep : 1128/8179/918 causal constraints in 90 ms.
[2020-05-21 02:16:33] [INFO ] Added : 860 causal constraints over 172 iterations in 20144 ms.(timeout) Result :sat
[2020-05-21 02:16:33] [INFO ] Deduced a trap composed of 21 places in 273 ms
[2020-05-21 02:16:34] [INFO ] Deduced a trap composed of 74 places in 308 ms
[2020-05-21 02:16:34] [INFO ] Deduced a trap composed of 30 places in 229 ms
[2020-05-21 02:16:34] [INFO ] Deduced a trap composed of 10 places in 301 ms
[2020-05-21 02:16:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1730 ms
Attempting to minimize the solution found.
Minimization took 118 ms.
Incomplete Parikh walk after 210100 steps, including 1000 resets, run finished after 536 ms. (steps per millisecond=391 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 104400 steps, including 1000 resets, run finished after 263 ms. (steps per millisecond=396 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 253000 steps, including 1000 resets, run finished after 575 ms. (steps per millisecond=440 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 34 out of 435 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 435/435 places, 1135/1135 transitions.
Applied a total of 0 rules in 63 ms. Remains 435 /435 variables (removed 0) and now considering 1135/1135 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 435/435 places, 1135/1135 transitions.
Starting structural reductions, iteration 0 : 435/435 places, 1135/1135 transitions.
Applied a total of 0 rules in 20 ms. Remains 435 /435 variables (removed 0) and now considering 1135/1135 (removed 0) transitions.
[2020-05-21 02:16:36] [INFO ] Flow matrix only has 925 transitions (discarded 210 similar events)
// Phase 1: matrix 925 rows 435 cols
[2020-05-21 02:16:36] [INFO ] Computed 27 place invariants in 4 ms
[2020-05-21 02:16:37] [INFO ] Implicit Places using invariants in 857 ms returned [414, 415, 417, 427, 428, 429, 430]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 861 ms to find 7 implicit places.
[2020-05-21 02:16:37] [INFO ] Redundant transitions in 81 ms returned []
[2020-05-21 02:16:37] [INFO ] Flow matrix only has 925 transitions (discarded 210 similar events)
// Phase 1: matrix 925 rows 428 cols
[2020-05-21 02:16:37] [INFO ] Computed 20 place invariants in 6 ms
[2020-05-21 02:16:39] [INFO ] Dead Transitions using invariants and state equation in 1499 ms returned []
Starting structural reductions, iteration 1 : 428/435 places, 1135/1135 transitions.
Applied a total of 0 rules in 21 ms. Remains 428 /428 variables (removed 0) and now considering 1135/1135 (removed 0) transitions.
[2020-05-21 02:16:39] [INFO ] Redundant transitions in 18 ms returned []
[2020-05-21 02:16:39] [INFO ] Flow matrix only has 925 transitions (discarded 210 similar events)
// Phase 1: matrix 925 rows 428 cols
[2020-05-21 02:16:39] [INFO ] Computed 20 place invariants in 3 ms
[2020-05-21 02:16:40] [INFO ] Dead Transitions using invariants and state equation in 1361 ms returned []
Finished structural reductions, in 2 iterations. Remains : 428/435 places, 1135/1135 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2282 ms. (steps per millisecond=438 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 564 ms. (steps per millisecond=1773 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 740 ms. (steps per millisecond=1351 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 739 ms. (steps per millisecond=1353 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 1042 ms. (steps per millisecond=959 ) properties seen :[0, 0, 0, 0]
Interrupted probabilistic random walk after 10260896 steps, run timeout after 30001 ms. (steps per millisecond=342 ) properties seen :[0, 0, 0, 0]
Probabilistic random walk after 10260896 steps, saw 1282613 distinct states, run finished after 30001 ms. (steps per millisecond=342 ) properties seen :[0, 0, 0, 0]
[2020-05-21 02:17:15] [INFO ] Flow matrix only has 925 transitions (discarded 210 similar events)
// Phase 1: matrix 925 rows 428 cols
[2020-05-21 02:17:15] [INFO ] Computed 20 place invariants in 3 ms
[2020-05-21 02:17:15] [INFO ] [Real]Absence check using 20 positive place invariants in 23 ms returned sat
[2020-05-21 02:17:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:17:16] [INFO ] [Real]Absence check using state equation in 669 ms returned sat
[2020-05-21 02:17:16] [INFO ] State equation strengthened by 366 read => feed constraints.
[2020-05-21 02:17:16] [INFO ] [Real]Added 366 Read/Feed constraints in 71 ms returned sat
[2020-05-21 02:17:16] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:17:16] [INFO ] [Nat]Absence check using 20 positive place invariants in 24 ms returned sat
[2020-05-21 02:17:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:17:17] [INFO ] [Nat]Absence check using state equation in 741 ms returned sat
[2020-05-21 02:17:17] [INFO ] [Nat]Added 366 Read/Feed constraints in 67 ms returned sat
[2020-05-21 02:17:17] [INFO ] Deduced a trap composed of 11 places in 287 ms
[2020-05-21 02:17:18] [INFO ] Deduced a trap composed of 11 places in 287 ms
[2020-05-21 02:17:18] [INFO ] Deduced a trap composed of 43 places in 240 ms
[2020-05-21 02:17:18] [INFO ] Deduced a trap composed of 26 places in 269 ms
[2020-05-21 02:17:19] [INFO ] Deduced a trap composed of 43 places in 276 ms
[2020-05-21 02:17:19] [INFO ] Deduced a trap composed of 18 places in 311 ms
[2020-05-21 02:17:19] [INFO ] Deduced a trap composed of 18 places in 280 ms
[2020-05-21 02:17:20] [INFO ] Deduced a trap composed of 20 places in 289 ms
[2020-05-21 02:17:20] [INFO ] Deduced a trap composed of 26 places in 302 ms
[2020-05-21 02:17:20] [INFO ] Deduced a trap composed of 35 places in 265 ms
[2020-05-21 02:17:21] [INFO ] Deduced a trap composed of 20 places in 275 ms
[2020-05-21 02:17:21] [INFO ] Deduced a trap composed of 40 places in 213 ms
[2020-05-21 02:17:21] [INFO ] Deduced a trap composed of 35 places in 209 ms
[2020-05-21 02:17:21] [INFO ] Deduced a trap composed of 40 places in 250 ms
[2020-05-21 02:17:22] [INFO ] Deduced a trap composed of 41 places in 197 ms
[2020-05-21 02:17:22] [INFO ] Deduced a trap composed of 39 places in 248 ms
[2020-05-21 02:17:22] [INFO ] Deduced a trap composed of 43 places in 237 ms
[2020-05-21 02:17:23] [INFO ] Deduced a trap composed of 26 places in 222 ms
[2020-05-21 02:17:23] [INFO ] Deduced a trap composed of 47 places in 233 ms
[2020-05-21 02:17:23] [INFO ] Deduced a trap composed of 47 places in 201 ms
[2020-05-21 02:17:23] [INFO ] Deduced a trap composed of 26 places in 217 ms
[2020-05-21 02:17:24] [INFO ] Deduced a trap composed of 56 places in 217 ms
[2020-05-21 02:17:24] [INFO ] Deduced a trap composed of 26 places in 245 ms
[2020-05-21 02:17:24] [INFO ] Deduced a trap composed of 28 places in 263 ms
[2020-05-21 02:17:24] [INFO ] Deduced a trap composed of 47 places in 249 ms
[2020-05-21 02:17:25] [INFO ] Deduced a trap composed of 45 places in 229 ms
[2020-05-21 02:17:25] [INFO ] Deduced a trap composed of 48 places in 252 ms
[2020-05-21 02:17:25] [INFO ] Deduced a trap composed of 18 places in 255 ms
[2020-05-21 02:17:26] [INFO ] Deduced a trap composed of 43 places in 245 ms
[2020-05-21 02:17:26] [INFO ] Deduced a trap composed of 55 places in 222 ms
[2020-05-21 02:17:26] [INFO ] Deduced a trap composed of 21 places in 197 ms
[2020-05-21 02:17:26] [INFO ] Deduced a trap composed of 14 places in 210 ms
[2020-05-21 02:17:27] [INFO ] Deduced a trap composed of 51 places in 210 ms
[2020-05-21 02:17:27] [INFO ] Deduced a trap composed of 13 places in 133 ms
[2020-05-21 02:17:27] [INFO ] Deduced a trap composed of 13 places in 155 ms
[2020-05-21 02:17:27] [INFO ] Deduced a trap composed of 14 places in 141 ms
[2020-05-21 02:17:27] [INFO ] Deduced a trap composed of 23 places in 134 ms
[2020-05-21 02:17:28] [INFO ] Deduced a trap composed of 37 places in 261 ms
[2020-05-21 02:17:28] [INFO ] Deduced a trap composed of 11 places in 227 ms
[2020-05-21 02:17:28] [INFO ] Deduced a trap composed of 10 places in 239 ms
[2020-05-21 02:17:29] [INFO ] Deduced a trap composed of 40 places in 208 ms
[2020-05-21 02:17:29] [INFO ] Deduced a trap composed of 26 places in 194 ms
[2020-05-21 02:17:29] [INFO ] Deduced a trap composed of 32 places in 181 ms
[2020-05-21 02:17:29] [INFO ] Deduced a trap composed of 11 places in 176 ms
[2020-05-21 02:17:29] [INFO ] Deduced a trap composed of 56 places in 123 ms
[2020-05-21 02:17:30] [INFO ] Deduced a trap composed of 56 places in 96 ms
[2020-05-21 02:17:30] [INFO ] Deduced a trap composed of 56 places in 130 ms
[2020-05-21 02:17:30] [INFO ] Trap strengthening (SAT) tested/added 48/47 trap constraints in 12673 ms
[2020-05-21 02:17:30] [INFO ] Computed and/alt/rep : 1128/8179/918 causal constraints in 73 ms.
[2020-05-21 02:17:49] [INFO ] Added : 761 causal constraints over 153 iterations in 18735 ms. Result :sat
[2020-05-21 02:17:49] [INFO ] Deduced a trap composed of 35 places in 301 ms
[2020-05-21 02:17:49] [INFO ] Deduced a trap composed of 61 places in 312 ms
[2020-05-21 02:17:50] [INFO ] Deduced a trap composed of 10 places in 279 ms
[2020-05-21 02:17:50] [INFO ] Deduced a trap composed of 32 places in 304 ms
[2020-05-21 02:17:51] [INFO ] Deduced a trap composed of 20 places in 325 ms
[2020-05-21 02:17:51] [INFO ] Deduced a trap composed of 42 places in 309 ms
[2020-05-21 02:17:52] [INFO ] Deduced a trap composed of 19 places in 292 ms
[2020-05-21 02:17:52] [INFO ] Deduced a trap composed of 32 places in 313 ms
[2020-05-21 02:17:53] [INFO ] Deduced a trap composed of 27 places in 260 ms
[2020-05-21 02:17:53] [INFO ] Deduced a trap composed of 44 places in 258 ms
[2020-05-21 02:17:53] [INFO ] Deduced a trap composed of 30 places in 245 ms
[2020-05-21 02:17:54] [INFO ] Deduced a trap composed of 47 places in 284 ms
[2020-05-21 02:17:54] [INFO ] Deduced a trap composed of 50 places in 278 ms
[2020-05-21 02:17:55] [INFO ] Deduced a trap composed of 19 places in 271 ms
[2020-05-21 02:17:55] [INFO ] Deduced a trap composed of 47 places in 273 ms
[2020-05-21 02:17:55] [INFO ] Deduced a trap composed of 31 places in 282 ms
[2020-05-21 02:17:56] [INFO ] Deduced a trap composed of 39 places in 259 ms
[2020-05-21 02:17:56] [INFO ] Deduced a trap composed of 28 places in 274 ms
[2020-05-21 02:17:57] [INFO ] Deduced a trap composed of 24 places in 273 ms
[2020-05-21 02:17:57] [INFO ] Deduced a trap composed of 14 places in 280 ms
[2020-05-21 02:17:58] [INFO ] Deduced a trap composed of 67 places in 252 ms
[2020-05-21 02:17:58] [INFO ] Deduced a trap composed of 39 places in 286 ms
[2020-05-21 02:17:58] [INFO ] Deduced a trap composed of 28 places in 245 ms
[2020-05-21 02:17:59] [INFO ] Deduced a trap composed of 58 places in 251 ms
[2020-05-21 02:17:59] [INFO ] Deduced a trap composed of 12 places in 267 ms
[2020-05-21 02:18:00] [INFO ] Deduced a trap composed of 13 places in 268 ms
[2020-05-21 02:18:00] [INFO ] Deduced a trap composed of 29 places in 263 ms
[2020-05-21 02:18:00] [INFO ] Deduced a trap composed of 39 places in 245 ms
[2020-05-21 02:18:01] [INFO ] Deduced a trap composed of 31 places in 247 ms
[2020-05-21 02:18:01] [INFO ] Deduced a trap composed of 33 places in 248 ms
[2020-05-21 02:18:01] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-21 02:18:02] [INFO ] Deduced a trap composed of 2 places in 300 ms
[2020-05-21 02:18:02] [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 (> (+ s301 s312) 0)") while checking expression at index 0
[2020-05-21 02:18:02] [INFO ] [Real]Absence check using 20 positive place invariants in 19 ms returned sat
[2020-05-21 02:18:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:18:02] [INFO ] [Real]Absence check using state equation in 713 ms returned sat
[2020-05-21 02:18:02] [INFO ] [Real]Added 366 Read/Feed constraints in 48 ms returned sat
[2020-05-21 02:18:02] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:18:02] [INFO ] [Nat]Absence check using 20 positive place invariants in 22 ms returned sat
[2020-05-21 02:18:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:18:03] [INFO ] [Nat]Absence check using state equation in 726 ms returned sat
[2020-05-21 02:18:03] [INFO ] [Nat]Added 366 Read/Feed constraints in 58 ms returned sat
[2020-05-21 02:18:04] [INFO ] Deduced a trap composed of 30 places in 314 ms
[2020-05-21 02:18:04] [INFO ] Deduced a trap composed of 24 places in 295 ms
[2020-05-21 02:18:04] [INFO ] Deduced a trap composed of 11 places in 305 ms
[2020-05-21 02:18:05] [INFO ] Deduced a trap composed of 62 places in 274 ms
[2020-05-21 02:18:05] [INFO ] Deduced a trap composed of 32 places in 284 ms
[2020-05-21 02:18:05] [INFO ] Deduced a trap composed of 21 places in 264 ms
[2020-05-21 02:18:06] [INFO ] Deduced a trap composed of 21 places in 251 ms
[2020-05-21 02:18:06] [INFO ] Deduced a trap composed of 22 places in 275 ms
[2020-05-21 02:18:06] [INFO ] Deduced a trap composed of 30 places in 277 ms
[2020-05-21 02:18:06] [INFO ] Deduced a trap composed of 31 places in 273 ms
[2020-05-21 02:18:07] [INFO ] Deduced a trap composed of 21 places in 291 ms
[2020-05-21 02:18:07] [INFO ] Deduced a trap composed of 60 places in 259 ms
[2020-05-21 02:18:07] [INFO ] Deduced a trap composed of 22 places in 251 ms
[2020-05-21 02:18:08] [INFO ] Deduced a trap composed of 15 places in 270 ms
[2020-05-21 02:18:08] [INFO ] Deduced a trap composed of 38 places in 273 ms
[2020-05-21 02:18:08] [INFO ] Deduced a trap composed of 37 places in 252 ms
[2020-05-21 02:18:09] [INFO ] Deduced a trap composed of 33 places in 259 ms
[2020-05-21 02:18:09] [INFO ] Deduced a trap composed of 43 places in 217 ms
[2020-05-21 02:18:09] [INFO ] Deduced a trap composed of 31 places in 254 ms
[2020-05-21 02:18:09] [INFO ] Deduced a trap composed of 13 places in 216 ms
[2020-05-21 02:18:10] [INFO ] Deduced a trap composed of 50 places in 256 ms
[2020-05-21 02:18:10] [INFO ] Deduced a trap composed of 11 places in 263 ms
[2020-05-21 02:18:10] [INFO ] Deduced a trap composed of 13 places in 255 ms
[2020-05-21 02:18:11] [INFO ] Deduced a trap composed of 12 places in 262 ms
[2020-05-21 02:18:11] [INFO ] Deduced a trap composed of 48 places in 202 ms
[2020-05-21 02:18:11] [INFO ] Deduced a trap composed of 57 places in 221 ms
[2020-05-21 02:18:11] [INFO ] Deduced a trap composed of 55 places in 232 ms
[2020-05-21 02:18:12] [INFO ] Deduced a trap composed of 48 places in 228 ms
[2020-05-21 02:18:12] [INFO ] Deduced a trap composed of 38 places in 287 ms
[2020-05-21 02:18:12] [INFO ] Deduced a trap composed of 56 places in 214 ms
[2020-05-21 02:18:12] [INFO ] Deduced a trap composed of 55 places in 208 ms
[2020-05-21 02:18:13] [INFO ] Deduced a trap composed of 56 places in 218 ms
[2020-05-21 02:18:13] [INFO ] Deduced a trap composed of 38 places in 135 ms
[2020-05-21 02:18:13] [INFO ] Deduced a trap composed of 55 places in 139 ms
[2020-05-21 02:18:13] [INFO ] Deduced a trap composed of 43 places in 133 ms
[2020-05-21 02:18:13] [INFO ] Deduced a trap composed of 41 places in 129 ms
[2020-05-21 02:18:14] [INFO ] Deduced a trap composed of 39 places in 123 ms
[2020-05-21 02:18:14] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 10355 ms
[2020-05-21 02:18:14] [INFO ] Computed and/alt/rep : 1128/8179/918 causal constraints in 51 ms.
[2020-05-21 02:18:31] [INFO ] Added : 735 causal constraints over 147 iterations in 17424 ms. Result :sat
[2020-05-21 02:18:31] [INFO ] Deduced a trap composed of 34 places in 299 ms
[2020-05-21 02:18:32] [INFO ] Deduced a trap composed of 29 places in 310 ms
[2020-05-21 02:18:32] [INFO ] Deduced a trap composed of 15 places in 298 ms
[2020-05-21 02:18:33] [INFO ] Deduced a trap composed of 19 places in 280 ms
[2020-05-21 02:18:33] [INFO ] Deduced a trap composed of 39 places in 281 ms
[2020-05-21 02:18:34] [INFO ] Deduced a trap composed of 19 places in 266 ms
[2020-05-21 02:18:34] [INFO ] Deduced a trap composed of 28 places in 284 ms
[2020-05-21 02:18:35] [INFO ] Deduced a trap composed of 39 places in 245 ms
[2020-05-21 02:18:35] [INFO ] Deduced a trap composed of 13 places in 253 ms
[2020-05-21 02:18:36] [INFO ] Deduced a trap composed of 12 places in 290 ms
[2020-05-21 02:18:36] [INFO ] Deduced a trap composed of 53 places in 281 ms
[2020-05-21 02:18:36] [INFO ] Deduced a trap composed of 50 places in 201 ms
[2020-05-21 02:18:37] [INFO ] Deduced a trap composed of 48 places in 217 ms
[2020-05-21 02:18:37] [INFO ] Deduced a trap composed of 54 places in 228 ms
[2020-05-21 02:18:37] [INFO ] Deduced a trap composed of 39 places in 201 ms
[2020-05-21 02:18:38] [INFO ] Deduced a trap composed of 55 places in 200 ms
[2020-05-21 02:18:38] [INFO ] Deduced a trap composed of 11 places in 272 ms
[2020-05-21 02:18:38] [INFO ] Deduced a trap composed of 68 places in 152 ms
[2020-05-21 02:18:39] [INFO ] Deduced a trap composed of 67 places in 158 ms
[2020-05-21 02:18:39] [INFO ] Deduced a trap composed of 47 places in 158 ms
[2020-05-21 02:18:39] [INFO ] Deduced a trap composed of 47 places in 148 ms
[2020-05-21 02:18:40] [INFO ] Deduced a trap composed of 27 places in 203 ms
[2020-05-21 02:18:40] [INFO ] Deduced a trap composed of 39 places in 219 ms
[2020-05-21 02:18:40] [INFO ] Deduced a trap composed of 28 places in 209 ms
[2020-05-21 02:18:41] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 9531 ms
Attempting to minimize the solution found.
Minimization took 109 ms.
[2020-05-21 02:18:41] [INFO ] [Real]Absence check using 20 positive place invariants in 25 ms returned sat
[2020-05-21 02:18:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:18:42] [INFO ] [Real]Absence check using state equation in 680 ms returned sat
[2020-05-21 02:18:42] [INFO ] [Real]Added 366 Read/Feed constraints in 69 ms returned sat
[2020-05-21 02:18:42] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:18:42] [INFO ] [Nat]Absence check using 20 positive place invariants in 23 ms returned sat
[2020-05-21 02:18:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:18:42] [INFO ] [Nat]Absence check using state equation in 719 ms returned sat
[2020-05-21 02:18:42] [INFO ] [Nat]Added 366 Read/Feed constraints in 63 ms returned sat
[2020-05-21 02:18:43] [INFO ] Deduced a trap composed of 89 places in 266 ms
[2020-05-21 02:18:43] [INFO ] Deduced a trap composed of 12 places in 253 ms
[2020-05-21 02:18:43] [INFO ] Deduced a trap composed of 13 places in 237 ms
[2020-05-21 02:18:44] [INFO ] Deduced a trap composed of 41 places in 250 ms
[2020-05-21 02:18:44] [INFO ] Deduced a trap composed of 31 places in 186 ms
[2020-05-21 02:18:44] [INFO ] Deduced a trap composed of 22 places in 219 ms
[2020-05-21 02:18:44] [INFO ] Deduced a trap composed of 20 places in 224 ms
[2020-05-21 02:18:45] [INFO ] Deduced a trap composed of 46 places in 229 ms
[2020-05-21 02:18:45] [INFO ] Deduced a trap composed of 15 places in 256 ms
[2020-05-21 02:18:45] [INFO ] Deduced a trap composed of 15 places in 240 ms
[2020-05-21 02:18:45] [INFO ] Deduced a trap composed of 20 places in 230 ms
[2020-05-21 02:18:46] [INFO ] Deduced a trap composed of 20 places in 266 ms
[2020-05-21 02:18:46] [INFO ] Deduced a trap composed of 20 places in 241 ms
[2020-05-21 02:18:46] [INFO ] Deduced a trap composed of 41 places in 234 ms
[2020-05-21 02:18:47] [INFO ] Deduced a trap composed of 71 places in 226 ms
[2020-05-21 02:18:47] [INFO ] Deduced a trap composed of 53 places in 232 ms
[2020-05-21 02:18:47] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 4405 ms
[2020-05-21 02:18:47] [INFO ] Computed and/alt/rep : 1128/8179/918 causal constraints in 67 ms.
[2020-05-21 02:19:07] [INFO ] Added : 804 causal constraints over 161 iterations in 20178 ms.(timeout) Result :sat
[2020-05-21 02:19:07] [INFO ] Deduced a trap composed of 11 places in 262 ms
[2020-05-21 02:19:08] [INFO ] Deduced a trap composed of 10 places in 275 ms
[2020-05-21 02:19:08] [INFO ] Deduced a trap composed of 21 places in 282 ms
[2020-05-21 02:19:09] [INFO ] Deduced a trap composed of 25 places in 294 ms
[2020-05-21 02:19:09] [INFO ] Deduced a trap composed of 42 places in 272 ms
[2020-05-21 02:19:10] [INFO ] Deduced a trap composed of 21 places in 270 ms
[2020-05-21 02:19:10] [INFO ] Deduced a trap composed of 11 places in 257 ms
[2020-05-21 02:19:10] [INFO ] Deduced a trap composed of 53 places in 253 ms
[2020-05-21 02:19:11] [INFO ] Deduced a trap composed of 12 places in 267 ms
[2020-05-21 02:19:11] [INFO ] Deduced a trap composed of 35 places in 238 ms
[2020-05-21 02:19:12] [INFO ] Deduced a trap composed of 28 places in 269 ms
[2020-05-21 02:19:12] [INFO ] Deduced a trap composed of 27 places in 242 ms
[2020-05-21 02:19:12] [INFO ] Deduced a trap composed of 35 places in 249 ms
[2020-05-21 02:19:13] [INFO ] Deduced a trap composed of 35 places in 247 ms
[2020-05-21 02:19:13] [INFO ] Deduced a trap composed of 40 places in 228 ms
[2020-05-21 02:19:14] [INFO ] Deduced a trap composed of 58 places in 224 ms
[2020-05-21 02:19:14] [INFO ] Deduced a trap composed of 26 places in 260 ms
[2020-05-21 02:19:14] [INFO ] Deduced a trap composed of 31 places in 246 ms
[2020-05-21 02:19:15] [INFO ] Deduced a trap composed of 31 places in 251 ms
[2020-05-21 02:19:15] [INFO ] Deduced a trap composed of 10 places in 259 ms
[2020-05-21 02:19:16] [INFO ] Deduced a trap composed of 43 places in 244 ms
[2020-05-21 02:19:16] [INFO ] Deduced a trap composed of 26 places in 235 ms
[2020-05-21 02:19:16] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 9200 ms
Attempting to minimize the solution found.
Minimization took 119 ms.
[2020-05-21 02:19:17] [INFO ] [Real]Absence check using 20 positive place invariants in 25 ms returned sat
[2020-05-21 02:19:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:19:17] [INFO ] [Real]Absence check using state equation in 700 ms returned sat
[2020-05-21 02:19:17] [INFO ] [Real]Added 366 Read/Feed constraints in 67 ms returned sat
[2020-05-21 02:19:17] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:19:17] [INFO ] [Nat]Absence check using 20 positive place invariants in 28 ms returned sat
[2020-05-21 02:19:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:19:18] [INFO ] [Nat]Absence check using state equation in 726 ms returned sat
[2020-05-21 02:19:18] [INFO ] [Nat]Added 366 Read/Feed constraints in 86 ms returned sat
[2020-05-21 02:19:19] [INFO ] Deduced a trap composed of 19 places in 282 ms
[2020-05-21 02:19:19] [INFO ] Deduced a trap composed of 20 places in 285 ms
[2020-05-21 02:19:19] [INFO ] Deduced a trap composed of 18 places in 283 ms
[2020-05-21 02:19:20] [INFO ] Deduced a trap composed of 20 places in 284 ms
[2020-05-21 02:19:20] [INFO ] Deduced a trap composed of 23 places in 252 ms
[2020-05-21 02:19:20] [INFO ] Deduced a trap composed of 42 places in 295 ms
[2020-05-21 02:19:20] [INFO ] Deduced a trap composed of 32 places in 290 ms
[2020-05-21 02:19:21] [INFO ] Deduced a trap composed of 37 places in 287 ms
[2020-05-21 02:19:21] [INFO ] Deduced a trap composed of 39 places in 276 ms
[2020-05-21 02:19:21] [INFO ] Deduced a trap composed of 35 places in 219 ms
[2020-05-21 02:19:22] [INFO ] Deduced a trap composed of 26 places in 256 ms
[2020-05-21 02:19:22] [INFO ] Deduced a trap composed of 24 places in 234 ms
[2020-05-21 02:19:22] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3726 ms
[2020-05-21 02:19:22] [INFO ] Computed and/alt/rep : 1128/8179/918 causal constraints in 60 ms.
[2020-05-21 02:19:42] [INFO ] Added : 775 causal constraints over 155 iterations in 20201 ms.(timeout) Result :sat
[2020-05-21 02:19:43] [INFO ] Deduced a trap composed of 20 places in 308 ms
[2020-05-21 02:19:43] [INFO ] Deduced a trap composed of 60 places in 281 ms
[2020-05-21 02:19:43] [INFO ] Deduced a trap composed of 31 places in 291 ms
[2020-05-21 02:19:44] [INFO ] Deduced a trap composed of 11 places in 270 ms
[2020-05-21 02:19:44] [INFO ] Deduced a trap composed of 11 places in 285 ms
[2020-05-21 02:19:45] [INFO ] Deduced a trap composed of 11 places in 276 ms
[2020-05-21 02:19:45] [INFO ] Deduced a trap composed of 11 places in 274 ms
[2020-05-21 02:19:46] [INFO ] Deduced a trap composed of 10 places in 311 ms
[2020-05-21 02:19:46] [INFO ] Deduced a trap composed of 35 places in 274 ms
[2020-05-21 02:19:46] [INFO ] Deduced a trap composed of 34 places in 262 ms
[2020-05-21 02:19:47] [INFO ] Deduced a trap composed of 45 places in 238 ms
[2020-05-21 02:19:47] [INFO ] Deduced a trap composed of 58 places in 220 ms
[2020-05-21 02:19:47] [INFO ] Deduced a trap composed of 43 places in 232 ms
[2020-05-21 02:19:48] [INFO ] Deduced a trap composed of 43 places in 228 ms
[2020-05-21 02:19:48] [INFO ] Deduced a trap composed of 35 places in 225 ms
[2020-05-21 02:19:49] [INFO ] Deduced a trap composed of 35 places in 226 ms
[2020-05-21 02:19:49] [INFO ] Deduced a trap composed of 26 places in 221 ms
[2020-05-21 02:19:49] [INFO ] Deduced a trap composed of 10 places in 241 ms
[2020-05-21 02:19:50] [INFO ] Deduced a trap composed of 43 places in 195 ms
[2020-05-21 02:19:50] [INFO ] Deduced a trap composed of 52 places in 198 ms
[2020-05-21 02:19:50] [INFO ] Deduced a trap composed of 35 places in 187 ms
[2020-05-21 02:19:51] [INFO ] Deduced a trap composed of 51 places in 213 ms
[2020-05-21 02:19:51] [INFO ] Deduced a trap composed of 51 places in 196 ms
[2020-05-21 02:19:51] [INFO ] Deduced a trap composed of 38 places in 210 ms
[2020-05-21 02:19:52] [INFO ] Deduced a trap composed of 38 places in 226 ms
[2020-05-21 02:19:52] [INFO ] Deduced a trap composed of 13 places in 257 ms
[2020-05-21 02:19:53] [INFO ] Deduced a trap composed of 38 places in 253 ms
[2020-05-21 02:19:53] [INFO ] Deduced a trap composed of 21 places in 253 ms
[2020-05-21 02:19:53] [INFO ] Deduced a trap composed of 51 places in 243 ms
[2020-05-21 02:19:54] [INFO ] Deduced a trap composed of 42 places in 261 ms
[2020-05-21 02:19:54] [INFO ] Deduced a trap composed of 40 places in 239 ms
[2020-05-21 02:19:55] [INFO ] Deduced a trap composed of 20 places in 211 ms
[2020-05-21 02:19:55] [INFO ] Deduced a trap composed of 19 places in 257 ms
[2020-05-21 02:19:55] [INFO ] Deduced a trap composed of 32 places in 197 ms
[2020-05-21 02:19:56] [INFO ] Deduced a trap composed of 20 places in 223 ms
[2020-05-21 02:19:56] [INFO ] Deduced a trap composed of 42 places in 244 ms
[2020-05-21 02:19:56] [INFO ] Deduced a trap composed of 43 places in 133 ms
[2020-05-21 02:19:57] [INFO ] Deduced a trap composed of 52 places in 130 ms
[2020-05-21 02:19:57] [INFO ] Deduced a trap composed of 43 places in 119 ms
[2020-05-21 02:19:58] [INFO ] Deduced a trap composed of 23 places in 225 ms
[2020-05-21 02:19:58] [INFO ] Deduced a trap composed of 13 places in 232 ms
[2020-05-21 02:19:58] [INFO ] Deduced a trap composed of 10 places in 220 ms
[2020-05-21 02:19:59] [INFO ] Deduced a trap composed of 12 places in 245 ms
[2020-05-21 02:19:59] [INFO ] Deduced a trap composed of 37 places in 141 ms
[2020-05-21 02:20:00] [INFO ] Deduced a trap composed of 43 places in 269 ms
[2020-05-21 02:20:00] [INFO ] Deduced a trap composed of 25 places in 227 ms
[2020-05-21 02:20:00] [INFO ] Deduced a trap composed of 43 places in 110 ms
[2020-05-21 02:20:01] [INFO ] Deduced a trap composed of 50 places in 162 ms
[2020-05-21 02:20:01] [INFO ] Trap strengthening (SAT) tested/added 49/48 trap constraints in 18799 ms
Attempting to minimize the solution found.
Minimization took 124 ms.
Incomplete Parikh walk after 207400 steps, including 1000 resets, run finished after 458 ms. (steps per millisecond=452 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 188500 steps, including 1000 resets, run finished after 398 ms. (steps per millisecond=473 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 185600 steps, including 1000 resets, run finished after 433 ms. (steps per millisecond=428 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 34 out of 428 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 428/428 places, 1135/1135 transitions.
Applied a total of 0 rules in 16 ms. Remains 428 /428 variables (removed 0) and now considering 1135/1135 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 428/428 places, 1135/1135 transitions.
Starting structural reductions, iteration 0 : 428/428 places, 1135/1135 transitions.
Applied a total of 0 rules in 14 ms. Remains 428 /428 variables (removed 0) and now considering 1135/1135 (removed 0) transitions.
[2020-05-21 02:20:02] [INFO ] Flow matrix only has 925 transitions (discarded 210 similar events)
// Phase 1: matrix 925 rows 428 cols
[2020-05-21 02:20:02] [INFO ] Computed 20 place invariants in 3 ms
[2020-05-21 02:20:03] [INFO ] Implicit Places using invariants in 591 ms returned []
[2020-05-21 02:20:03] [INFO ] Flow matrix only has 925 transitions (discarded 210 similar events)
// Phase 1: matrix 925 rows 428 cols
[2020-05-21 02:20:03] [INFO ] Computed 20 place invariants in 5 ms
[2020-05-21 02:20:04] [INFO ] State equation strengthened by 366 read => feed constraints.
[2020-05-21 02:20:08] [INFO ] Implicit Places using invariants and state equation in 4676 ms returned []
Implicit Place search using SMT with State Equation took 5269 ms to find 0 implicit places.
[2020-05-21 02:20:08] [INFO ] Redundant transitions in 20 ms returned []
[2020-05-21 02:20:08] [INFO ] Flow matrix only has 925 transitions (discarded 210 similar events)
// Phase 1: matrix 925 rows 428 cols
[2020-05-21 02:20:08] [INFO ] Computed 20 place invariants in 5 ms
[2020-05-21 02:20:09] [INFO ] Dead Transitions using invariants and state equation in 1589 ms returned []
Finished structural reductions, in 1 iterations. Remains : 428/428 places, 1135/1135 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 250 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0]
[2020-05-21 02:20:10] [INFO ] Flow matrix only has 925 transitions (discarded 210 similar events)
// Phase 1: matrix 925 rows 428 cols
[2020-05-21 02:20:10] [INFO ] Computed 20 place invariants in 3 ms
[2020-05-21 02:20:10] [INFO ] [Real]Absence check using 20 positive place invariants in 22 ms returned sat
[2020-05-21 02:20:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:20:10] [INFO ] [Real]Absence check using state equation in 683 ms returned sat
[2020-05-21 02:20:10] [INFO ] State equation strengthened by 366 read => feed constraints.
[2020-05-21 02:20:10] [INFO ] [Real]Added 366 Read/Feed constraints in 68 ms returned sat
[2020-05-21 02:20:11] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:20:11] [INFO ] [Nat]Absence check using 20 positive place invariants in 19 ms returned sat
[2020-05-21 02:20:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:20:11] [INFO ] [Nat]Absence check using state equation in 702 ms returned sat
[2020-05-21 02:20:11] [INFO ] [Nat]Added 366 Read/Feed constraints in 60 ms returned sat
[2020-05-21 02:20:12] [INFO ] Deduced a trap composed of 11 places in 286 ms
[2020-05-21 02:20:12] [INFO ] Deduced a trap composed of 11 places in 283 ms
[2020-05-21 02:20:12] [INFO ] Deduced a trap composed of 43 places in 209 ms
[2020-05-21 02:20:12] [INFO ] Deduced a trap composed of 26 places in 233 ms
[2020-05-21 02:20:13] [INFO ] Deduced a trap composed of 43 places in 249 ms
[2020-05-21 02:20:13] [INFO ] Deduced a trap composed of 18 places in 261 ms
[2020-05-21 02:20:13] [INFO ] Deduced a trap composed of 18 places in 241 ms
[2020-05-21 02:20:14] [INFO ] Deduced a trap composed of 20 places in 270 ms
[2020-05-21 02:20:14] [INFO ] Deduced a trap composed of 26 places in 273 ms
[2020-05-21 02:20:14] [INFO ] Deduced a trap composed of 35 places in 240 ms
[2020-05-21 02:20:15] [INFO ] Deduced a trap composed of 20 places in 276 ms
[2020-05-21 02:20:15] [INFO ] Deduced a trap composed of 40 places in 217 ms
[2020-05-21 02:20:15] [INFO ] Deduced a trap composed of 35 places in 251 ms
[2020-05-21 02:20:15] [INFO ] Deduced a trap composed of 40 places in 277 ms
[2020-05-21 02:20:16] [INFO ] Deduced a trap composed of 41 places in 246 ms
[2020-05-21 02:20:16] [INFO ] Deduced a trap composed of 39 places in 220 ms
[2020-05-21 02:20:16] [INFO ] Deduced a trap composed of 43 places in 269 ms
[2020-05-21 02:20:16] [INFO ] Deduced a trap composed of 26 places in 239 ms
[2020-05-21 02:20:17] [INFO ] Deduced a trap composed of 47 places in 224 ms
[2020-05-21 02:20:17] [INFO ] Deduced a trap composed of 47 places in 216 ms
[2020-05-21 02:20:17] [INFO ] Deduced a trap composed of 26 places in 213 ms
[2020-05-21 02:20:18] [INFO ] Deduced a trap composed of 56 places in 226 ms
[2020-05-21 02:20:18] [INFO ] Deduced a trap composed of 26 places in 237 ms
[2020-05-21 02:20:18] [INFO ] Deduced a trap composed of 28 places in 262 ms
[2020-05-21 02:20:18] [INFO ] Deduced a trap composed of 47 places in 236 ms
[2020-05-21 02:20:19] [INFO ] Deduced a trap composed of 45 places in 249 ms
[2020-05-21 02:20:19] [INFO ] Deduced a trap composed of 48 places in 234 ms
[2020-05-21 02:20:19] [INFO ] Deduced a trap composed of 18 places in 254 ms
[2020-05-21 02:20:19] [INFO ] Deduced a trap composed of 43 places in 225 ms
[2020-05-21 02:20:20] [INFO ] Deduced a trap composed of 55 places in 183 ms
[2020-05-21 02:20:20] [INFO ] Deduced a trap composed of 21 places in 202 ms
[2020-05-21 02:20:20] [INFO ] Deduced a trap composed of 14 places in 181 ms
[2020-05-21 02:20:20] [INFO ] Deduced a trap composed of 51 places in 236 ms
[2020-05-21 02:20:21] [INFO ] Deduced a trap composed of 13 places in 142 ms
[2020-05-21 02:20:21] [INFO ] Deduced a trap composed of 13 places in 144 ms
[2020-05-21 02:20:21] [INFO ] Deduced a trap composed of 14 places in 129 ms
[2020-05-21 02:20:21] [INFO ] Deduced a trap composed of 23 places in 122 ms
[2020-05-21 02:20:22] [INFO ] Deduced a trap composed of 37 places in 259 ms
[2020-05-21 02:20:22] [INFO ] Deduced a trap composed of 11 places in 263 ms
[2020-05-21 02:20:22] [INFO ] Deduced a trap composed of 10 places in 255 ms
[2020-05-21 02:20:22] [INFO ] Deduced a trap composed of 40 places in 203 ms
[2020-05-21 02:20:23] [INFO ] Deduced a trap composed of 26 places in 195 ms
[2020-05-21 02:20:23] [INFO ] Deduced a trap composed of 32 places in 192 ms
[2020-05-21 02:20:23] [INFO ] Deduced a trap composed of 11 places in 183 ms
[2020-05-21 02:20:23] [INFO ] Deduced a trap composed of 56 places in 135 ms
[2020-05-21 02:20:23] [INFO ] Deduced a trap composed of 56 places in 130 ms
[2020-05-21 02:20:24] [INFO ] Deduced a trap composed of 56 places in 115 ms
[2020-05-21 02:20:24] [INFO ] Trap strengthening (SAT) tested/added 48/47 trap constraints in 12325 ms
[2020-05-21 02:20:24] [INFO ] Computed and/alt/rep : 1128/8179/918 causal constraints in 71 ms.
[2020-05-21 02:20:31] [INFO ] Added : 330 causal constraints over 66 iterations in 6843 ms. Result :(error "Solver has unexpectedly terminated")
[2020-05-21 02:20:31] [INFO ] [Real]Absence check using 20 positive place invariants in 22 ms returned sat
[2020-05-21 02:20:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:20:31] [INFO ] [Real]Absence check using state equation in 671 ms returned sat
[2020-05-21 02:20:31] [INFO ] [Real]Added 366 Read/Feed constraints in 45 ms returned sat
[2020-05-21 02:20:31] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:20:31] [INFO ] [Nat]Absence check using 20 positive place invariants in 19 ms returned sat
[2020-05-21 02:20:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:20:32] [INFO ] [Nat]Absence check using state equation in 666 ms returned sat
[2020-05-21 02:20:32] [INFO ] [Nat]Added 366 Read/Feed constraints in 60 ms returned sat
[2020-05-21 02:20:32] [INFO ] Deduced a trap composed of 30 places in 284 ms
[2020-05-21 02:20:33] [INFO ] Deduced a trap composed of 24 places in 308 ms
[2020-05-21 02:20:33] [INFO ] Deduced a trap composed of 11 places in 317 ms
[2020-05-21 02:20:33] [INFO ] Deduced a trap composed of 62 places in 255 ms
[2020-05-21 02:20:34] [INFO ] Deduced a trap composed of 32 places in 282 ms
[2020-05-21 02:20:34] [INFO ] Deduced a trap composed of 21 places in 313 ms
[2020-05-21 02:20:34] [INFO ] Deduced a trap composed of 21 places in 245 ms
[2020-05-21 02:20:35] [INFO ] Deduced a trap composed of 22 places in 279 ms
[2020-05-21 02:20:35] [INFO ] Deduced a trap composed of 30 places in 273 ms
[2020-05-21 02:20:35] [INFO ] Deduced a trap composed of 31 places in 258 ms
[2020-05-21 02:20:36] [INFO ] Deduced a trap composed of 21 places in 283 ms
[2020-05-21 02:20:36] [INFO ] Deduced a trap composed of 60 places in 279 ms
[2020-05-21 02:20:36] [INFO ] Deduced a trap composed of 22 places in 214 ms
[2020-05-21 02:20:36] [INFO ] Deduced a trap composed of 15 places in 259 ms
[2020-05-21 02:20:37] [INFO ] Deduced a trap composed of 38 places in 250 ms
[2020-05-21 02:20:37] [INFO ] Deduced a trap composed of 37 places in 261 ms
[2020-05-21 02:20:37] [INFO ] Deduced a trap composed of 33 places in 236 ms
[2020-05-21 02:20:38] [INFO ] Deduced a trap composed of 43 places in 258 ms
[2020-05-21 02:20:38] [INFO ] Deduced a trap composed of 31 places in 219 ms
[2020-05-21 02:20:38] [INFO ] Deduced a trap composed of 13 places in 207 ms
[2020-05-21 02:20:38] [INFO ] Deduced a trap composed of 50 places in 263 ms
[2020-05-21 02:20:39] [INFO ] Deduced a trap composed of 11 places in 262 ms
[2020-05-21 02:20:39] [INFO ] Deduced a trap composed of 13 places in 214 ms
[2020-05-21 02:20:39] [INFO ] Deduced a trap composed of 12 places in 253 ms
[2020-05-21 02:20:40] [INFO ] Deduced a trap composed of 48 places in 228 ms
[2020-05-21 02:20:40] [INFO ] Deduced a trap composed of 57 places in 224 ms
[2020-05-21 02:20:40] [INFO ] Deduced a trap composed of 55 places in 221 ms
[2020-05-21 02:20:40] [INFO ] Deduced a trap composed of 48 places in 235 ms
[2020-05-21 02:20:41] [INFO ] Deduced a trap composed of 38 places in 203 ms
[2020-05-21 02:20:41] [INFO ] Deduced a trap composed of 56 places in 202 ms
[2020-05-21 02:20:41] [INFO ] Deduced a trap composed of 55 places in 195 ms
[2020-05-21 02:20:41] [INFO ] Deduced a trap composed of 56 places in 181 ms
[2020-05-21 02:20:41] [INFO ] Deduced a trap composed of 38 places in 124 ms
[2020-05-21 02:20:41] [INFO ] Deduced a trap composed of 55 places in 98 ms
[2020-05-21 02:20:42] [INFO ] Deduced a trap composed of 43 places in 128 ms
[2020-05-21 02:20:42] [INFO ] Deduced a trap composed of 41 places in 128 ms
[2020-05-21 02:20:42] [INFO ] Deduced a trap composed of 39 places in 93 ms
[2020-05-21 02:20:42] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 9813 ms
[2020-05-21 02:20:42] [INFO ] Computed and/alt/rep : 1128/8179/918 causal constraints in 74 ms.
[2020-05-21 02:20:51] [INFO ] Added : 460 causal constraints over 92 iterations in 9398 ms. Result :unknown
[2020-05-21 02:20:51] [INFO ] [Real]Absence check using 20 positive place invariants in 22 ms returned sat
[2020-05-21 02:20:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:20:52] [INFO ] [Real]Absence check using state equation in 678 ms returned sat
[2020-05-21 02:20:52] [INFO ] [Real]Added 366 Read/Feed constraints in 46 ms returned sat
[2020-05-21 02:20:52] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:20:52] [INFO ] [Nat]Absence check using 20 positive place invariants in 24 ms returned sat
[2020-05-21 02:20:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:20:53] [INFO ] [Nat]Absence check using state equation in 662 ms returned sat
[2020-05-21 02:20:53] [INFO ] [Nat]Added 366 Read/Feed constraints in 58 ms returned sat
[2020-05-21 02:20:53] [INFO ] Deduced a trap composed of 89 places in 269 ms
[2020-05-21 02:20:54] [INFO ] Deduced a trap composed of 12 places in 276 ms
[2020-05-21 02:20:54] [INFO ] Deduced a trap composed of 13 places in 218 ms
[2020-05-21 02:20:54] [INFO ] Deduced a trap composed of 41 places in 253 ms
[2020-05-21 02:20:54] [INFO ] Deduced a trap composed of 31 places in 240 ms
[2020-05-21 02:20:55] [INFO ] Deduced a trap composed of 22 places in 223 ms
[2020-05-21 02:20:55] [INFO ] Deduced a trap composed of 20 places in 239 ms
[2020-05-21 02:20:55] [INFO ] Deduced a trap composed of 46 places in 243 ms
[2020-05-21 02:20:56] [INFO ] Deduced a trap composed of 15 places in 269 ms
[2020-05-21 02:20:56] [INFO ] Deduced a trap composed of 15 places in 269 ms
[2020-05-21 02:20:56] [INFO ] Deduced a trap composed of 20 places in 218 ms
[2020-05-21 02:20:56] [INFO ] Deduced a trap composed of 20 places in 241 ms
[2020-05-21 02:20:57] [INFO ] Deduced a trap composed of 20 places in 234 ms
[2020-05-21 02:20:57] [INFO ] Deduced a trap composed of 41 places in 265 ms
[2020-05-21 02:20:57] [INFO ] Deduced a trap composed of 71 places in 237 ms
[2020-05-21 02:20:58] [INFO ] Deduced a trap composed of 53 places in 230 ms
[2020-05-21 02:20:58] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 4533 ms
[2020-05-21 02:20:58] [INFO ] Computed and/alt/rep : 1128/8179/918 causal constraints in 74 ms.
[2020-05-21 02:21:12] [INFO ] Added : 640 causal constraints over 128 iterations in 14674 ms. Result :unknown
[2020-05-21 02:21:12] [INFO ] [Real]Absence check using 20 positive place invariants in 24 ms returned sat
[2020-05-21 02:21:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:21:13] [INFO ] [Real]Absence check using state equation in 692 ms returned sat
[2020-05-21 02:21:13] [INFO ] [Real]Added 366 Read/Feed constraints in 71 ms returned sat
[2020-05-21 02:21:13] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:21:13] [INFO ] [Nat]Absence check using 20 positive place invariants in 21 ms returned sat
[2020-05-21 02:21:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:21:14] [INFO ] [Nat]Absence check using state equation in 699 ms returned sat
[2020-05-21 02:21:14] [INFO ] [Nat]Added 366 Read/Feed constraints in 80 ms returned sat
[2020-05-21 02:21:14] [INFO ] Deduced a trap composed of 19 places in 238 ms
[2020-05-21 02:21:15] [INFO ] Deduced a trap composed of 20 places in 283 ms
[2020-05-21 02:21:15] [INFO ] Deduced a trap composed of 18 places in 248 ms
[2020-05-21 02:21:15] [INFO ] Deduced a trap composed of 20 places in 286 ms
[2020-05-21 02:21:15] [INFO ] Deduced a trap composed of 23 places in 247 ms
[2020-05-21 02:21:16] [INFO ] Deduced a trap composed of 42 places in 263 ms
[2020-05-21 02:21:16] [INFO ] Deduced a trap composed of 32 places in 294 ms
[2020-05-21 02:21:16] [INFO ] Deduced a trap composed of 37 places in 290 ms
[2020-05-21 02:21:17] [INFO ] Deduced a trap composed of 39 places in 283 ms
[2020-05-21 02:21:17] [INFO ] Deduced a trap composed of 35 places in 542 ms
[2020-05-21 02:21:18] [INFO ] Deduced a trap composed of 26 places in 890 ms
[2020-05-21 02:21:19] [INFO ] Deduced a trap composed of 24 places in 275 ms
[2020-05-21 02:21:19] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 4647 ms
[2020-05-21 02:21:19] [INFO ] Computed and/alt/rep : 1128/8179/918 causal constraints in 67 ms.
[2020-05-21 02:21:33] [INFO ] Added : 610 causal constraints over 122 iterations in 14509 ms. Result :unknown
Graph (trivial) has 781 edges and 428 vertex of which 212 / 428 are part of one of the 36 SCC in 10 ms
Free SCC test removed 176 places
Drop transitions removed 352 transitions
Ensure Unique test removed 234 transitions
Reduce isomorphic transitions removed 586 transitions.
Iterating post reduction 0 with 586 rules applied. Total rules applied 587 place count 252 transition count 549
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 24 Pre rules applied. Total rules applied 587 place count 252 transition count 525
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 1 with 48 rules applied. Total rules applied 635 place count 228 transition count 525
Performed 52 Post agglomeration using F-continuation condition with reduction of 30 identical transitions.
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 1 with 104 rules applied. Total rules applied 739 place count 176 transition count 443
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 751 place count 176 transition count 431
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -78
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 29 rules applied. Total rules applied 780 place count 161 transition count 509
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (trivial) has 68 edges and 161 vertex of which 7 / 161 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Iterating post reduction 2 with 14 rules applied. Total rules applied 794 place count 155 transition count 496
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 801 place count 155 transition count 489
Free-agglomeration rule applied 14 times.
Iterating global reduction 4 with 14 rules applied. Total rules applied 815 place count 155 transition count 475
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 4 with 27 rules applied. Total rules applied 842 place count 141 transition count 462
Partial Free-agglomeration rule applied 19 times.
Drop transitions removed 19 transitions
Iterating global reduction 5 with 19 rules applied. Total rules applied 861 place count 141 transition count 462
Partial Post-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 869 place count 141 transition count 462
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 870 place count 141 transition count 461
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 879 place count 141 transition count 452
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 880 place count 141 transition count 452
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 882 place count 141 transition count 452
Applied a total of 882 rules in 123 ms. Remains 141 /428 variables (removed 287) and now considering 452/1135 (removed 683) transitions.
// Phase 1: matrix 452 rows 141 cols
[2020-05-21 02:21:33] [INFO ] Computed 19 place invariants in 1 ms
[2020-05-21 02:21:33] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2020-05-21 02:21:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:21:33] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2020-05-21 02:21:33] [INFO ] Computed and/alt/rep : 430/4272/430 causal constraints in 20 ms.
[2020-05-21 02:21:34] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:21:34] [INFO ] [Nat]Absence check using 19 positive place invariants in 17 ms returned sat
[2020-05-21 02:21:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:21:34] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2020-05-21 02:21:34] [INFO ] Computed and/alt/rep : 430/4272/430 causal constraints in 44 ms.
[2020-05-21 02:21:46] [INFO ] Added : 427 causal constraints over 86 iterations in 12495 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 91 ms.
[2020-05-21 02:21:46] [INFO ] [Real]Absence check using 19 positive place invariants in 12 ms returned sat
[2020-05-21 02:21:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:21:47] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2020-05-21 02:21:47] [INFO ] Computed and/alt/rep : 430/4272/430 causal constraints in 33 ms.
[2020-05-21 02:21:47] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:21:47] [INFO ] [Nat]Absence check using 19 positive place invariants in 16 ms returned sat
[2020-05-21 02:21:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:21:47] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2020-05-21 02:21:47] [INFO ] Computed and/alt/rep : 430/4272/430 causal constraints in 31 ms.
[2020-05-21 02:21:55] [INFO ] Added : 413 causal constraints over 83 iterations in 8450 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 100 ms.
[2020-05-21 02:21:56] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned sat
[2020-05-21 02:21:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:21:56] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2020-05-21 02:21:56] [INFO ] Computed and/alt/rep : 430/4272/430 causal constraints in 28 ms.
[2020-05-21 02:21:56] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:21:56] [INFO ] [Nat]Absence check using 19 positive place invariants in 16 ms returned sat
[2020-05-21 02:21:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:21:56] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2020-05-21 02:21:56] [INFO ] Computed and/alt/rep : 430/4272/430 causal constraints in 30 ms.
[2020-05-21 02:22:00] [INFO ] Added : 364 causal constraints over 73 iterations in 4297 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 81 ms.
[2020-05-21 02:22:01] [INFO ] [Real]Absence check using 19 positive place invariants in 15 ms returned sat
[2020-05-21 02:22:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:22:01] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2020-05-21 02:22:01] [INFO ] Computed and/alt/rep : 430/4272/430 causal constraints in 31 ms.
[2020-05-21 02:22:01] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:22:01] [INFO ] [Nat]Absence check using 19 positive place invariants in 17 ms returned sat
[2020-05-21 02:22:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:22:01] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2020-05-21 02:22:01] [INFO ] Computed and/alt/rep : 430/4272/430 causal constraints in 28 ms.
[2020-05-21 02:22:05] [INFO ] Added : 327 causal constraints over 66 iterations in 3927 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 79 ms.
[2020-05-21 02:22:06] [INFO ] Flatten gal took : 125 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-21 02:22:06] [INFO ] Applying decomposition
[2020-05-21 02:22:06] [INFO ] Flatten gal took : 109 ms
[2020-05-21 02:22:06] [INFO ] Flatten gal took : 110 ms
[2020-05-21 02:22:06] [INFO ] Input system was already deterministic with 1135 transitions.
[2020-05-21 02:22:06] [INFO ] Input system was already deterministic with 1135 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph15675563344006284695.txt, -o, /tmp/graph15675563344006284695.bin, -w, /tmp/graph15675563344006284695.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph15675563344006284695.bin, -l, -1, -v, -w, /tmp/graph15675563344006284695.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-21 02:22:06] [INFO ] Decomposing Gal with order
[2020-05-21 02:22:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-21 02:22:06] [INFO ] Removed a total of 1594 redundant transitions.
[2020-05-21 02:22:06] [INFO ] Ran tautology test, simplified 0 / 4 in 731 ms.
[2020-05-21 02:22:07] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-08(UNSAT) depth K=0 took 9 ms
[2020-05-21 02:22:07] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-09(UNSAT) depth K=0 took 3 ms
[2020-05-21 02:22:07] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-13(UNSAT) depth K=0 took 1 ms
[2020-05-21 02:22:07] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-15(UNSAT) depth K=0 took 0 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 925 out of 1135 initially.
// Phase 1: matrix 925 rows 428 cols
[2020-05-21 02:22:07] [INFO ] Computed 20 place invariants in 6 ms
inv : IsEndLoop_4_0_0 + IsEndLoop_4_1_0 + IsEndLoop_4_2_0 + IsEndLoop_4_3_0 + IsEndLoop_4_4_0 + IsEndLoop_4_5_0 + IsEndLoop_4_0_1 + IsEndLoop_4_1_1 + IsEndLoop_4_2_1 + IsEndLoop_4_3_1 + IsEndLoop_4_4_1 + IsEndLoop_4_5_1 + IsEndLoop_4_0_2 + IsEndLoop_4_1_2 + IsEndLoop_4_2_2 + IsEndLoop_4_4_2 + IsEndLoop_4_3_2 + IsEndLoop_4_5_2 + IsEndLoop_4_1_3 + IsEndLoop_4_0_3 + IsEndLoop_4_3_3 + IsEndLoop_4_2_3 + IsEndLoop_4_5_3 + IsEndLoop_4_4_3 + IsEndLoop_4_0_5 + IsEndLoop_4_3_5 + IsEndLoop_4_2_5 + IsEndLoop_4_1_5 + IsEndLoop_4_5_5 + IsEndLoop_4_4_5 + EndTurn_4_1 + EndTurn_4_2 + EndTurn_4_0 + BeginLoop_4_0_0 + EndTurn_4_5 + BeginLoop_4_1_0 + EndTurn_4_3 + EndTurn_4_4 + BeginLoop_4_4_0 + BeginLoop_4_5_0 + BeginLoop_4_2_0 + BeginLoop_4_3_0 + WantSection_4_F + TestAlone_4_1_3 + TestAlone_4_5_3 + TestTurn_4_5 + TestTurn_4_4 + TestTurn_4_3 + TestTurn_4_2 + TestTurn_4_1 + TestTurn_4_0 + TestIdentity_4_1_3 + AskForSection_4_0 = 1
inv : Turn_0_0 + Turn_0_2 + Turn_0_1 + Turn_0_3 + Turn_0_4 + Turn_0_6 + Turn_0_5 = 1
inv : WantSection_2_T + WantSection_2_F = 1
inv : IsEndLoop_6_0_0 + IsEndLoop_6_1_0 + IsEndLoop_6_2_0 + IsEndLoop_6_3_0 + IsEndLoop_6_4_0 + IsEndLoop_6_5_0 + IsEndLoop_6_0_1 + IsEndLoop_6_1_1 + IsEndLoop_6_2_1 + IsEndLoop_6_4_1 + IsEndLoop_6_3_1 + IsEndLoop_6_5_1 + IsEndLoop_6_0_2 + IsEndLoop_6_1_2 + IsEndLoop_6_2_2 + IsEndLoop_6_3_2 + IsEndLoop_6_4_2 + IsEndLoop_6_1_3 + IsEndLoop_6_5_2 + IsEndLoop_6_0_3 + IsEndLoop_6_3_3 + IsEndLoop_6_2_3 + IsEndLoop_6_5_3 + IsEndLoop_6_4_3 + IsEndLoop_6_1_4 + IsEndLoop_6_2_4 + IsEndLoop_6_0_4 + IsEndLoop_6_4_4 + IsEndLoop_6_3_4 + IsEndLoop_6_5_4 + EndTurn_6_1 + EndTurn_6_2 + EndTurn_6_0 + EndTurn_6_5 + BeginLoop_6_0_0 + EndTurn_6_3 + EndTurn_6_4 + BeginLoop_6_4_0 + BeginLoop_6_5_0 + BeginLoop_6_2_0 + BeginLoop_6_1_0 + BeginLoop_6_3_0 + BeginLoop_6_5_5 + TestAlone_6_4_0 + WantSection_6_F + TestAlone_6_3_2 + TestAlone_6_3_4 + TestAlone_6_5_5 + TestTurn_6_5 + TestTurn_6_4 + TestTurn_6_3 + TestTurn_6_2 + TestTurn_6_1 + TestTurn_6_0 + TestIdentity_6_4_0 + TestIdentity_6_3_4 + AskForSection_6_0 = 1
inv : Turn_3_0 + Turn_3_1 + Turn_3_2 + Turn_3_4 + Turn_3_3 + Turn_3_5 + Turn_3_6 = 1
inv : WantSection_3_T + WantSection_3_F = 1
inv : Turn_2_0 + Turn_2_1 + Turn_2_3 + Turn_2_2 + Turn_2_4 + Turn_2_5 + Turn_2_6 = 1
inv : IsEndLoop_5_0_0 + IsEndLoop_5_1_0 + IsEndLoop_5_2_0 + IsEndLoop_5_3_0 + IsEndLoop_5_4_0 + IsEndLoop_5_5_0 + IsEndLoop_5_0_1 + IsEndLoop_5_1_1 + IsEndLoop_5_3_1 + IsEndLoop_5_2_1 + IsEndLoop_5_4_1 + IsEndLoop_5_5_1 + IsEndLoop_5_0_2 + IsEndLoop_5_1_2 + IsEndLoop_5_2_2 + IsEndLoop_5_3_2 + IsEndLoop_5_5_2 + IsEndLoop_5_4_2 + IsEndLoop_5_1_3 + IsEndLoop_5_0_3 + IsEndLoop_5_3_3 + IsEndLoop_5_2_3 + IsEndLoop_5_5_3 + IsEndLoop_5_4_3 + IsEndLoop_5_2_4 + IsEndLoop_5_0_4 + IsEndLoop_5_1_4 + IsEndLoop_5_4_4 + IsEndLoop_5_3_4 + IsEndLoop_5_5_4 + EndTurn_5_1 + EndTurn_5_2 + EndTurn_5_0 + EndTurn_5_5 + BeginLoop_5_1_0 + BeginLoop_5_0_0 + EndTurn_5_3 + EndTurn_5_4 + BeginLoop_5_4_0 + BeginLoop_5_5_0 + BeginLoop_5_2_0 + BeginLoop_5_3_0 + WantSection_5_F + TestAlone_5_2_6 + TestTurn_5_5 + TestTurn_5_4 + TestTurn_5_3 + TestTurn_5_2 + TestTurn_5_1 + TestTurn_5_0 + AskForSection_5_2 + AskForSection_5_0 = 1
inv : IsEndLoop_1_0_0 + IsEndLoop_1_1_0 + IsEndLoop_1_2_0 + IsEndLoop_1_3_0 + IsEndLoop_1_4_0 + IsEndLoop_1_5_0 + IsEndLoop_1_1_2 + IsEndLoop_1_0_2 + IsEndLoop_1_2_2 + IsEndLoop_1_3_2 + IsEndLoop_1_4_2 + IsEndLoop_1_5_2 + IsEndLoop_1_1_3 + IsEndLoop_1_0_3 + IsEndLoop_1_4_3 + IsEndLoop_1_2_3 + IsEndLoop_1_3_3 + IsEndLoop_1_0_4 + IsEndLoop_1_5_3 + IsEndLoop_1_2_4 + IsEndLoop_1_1_4 + IsEndLoop_1_5_4 + IsEndLoop_1_4_4 + IsEndLoop_1_3_4 + IsEndLoop_1_1_5 + IsEndLoop_1_0_5 + IsEndLoop_1_3_5 + IsEndLoop_1_2_5 + IsEndLoop_1_5_5 + IsEndLoop_1_4_5 + EndTurn_1_1 + EndTurn_1_2 + EndTurn_1_3 + EndTurn_1_0 + BeginLoop_1_0_0 + BeginLoop_1_1_0 + EndTurn_1_4 + EndTurn_1_5 + BeginLoop_1_5_0 + BeginLoop_1_4_0 + BeginLoop_1_2_0 + BeginLoop_1_3_0 + BeginLoop_1_3_1 + TestAlone_1_0_0 + WantSection_1_F + TestAlone_1_3_2 + TestAlone_1_2_2 + TestTurn_1_5 + TestTurn_1_4 + TestTurn_1_3 + TestTurn_1_2 + TestTurn_1_1 + TestTurn_1_0 + TestIdentity_1_2_1 + AskForSection_1_2 + AskForSection_1_0 = 1
inv : Turn_5_1 + Turn_5_0 + Turn_5_2 + Turn_5_3 + Turn_5_5 + Turn_5_4 + Turn_5_6 = 1
inv : Turn_4_0 + Turn_4_1 + Turn_4_2 + Turn_4_4 + Turn_4_3 + Turn_4_5 + Turn_4_6 = 1
inv : WantSection_4_T + WantSection_4_F = 1
inv : WantSection_6_T + WantSection_6_F = 1
inv : IsEndLoop_2_0_0 + IsEndLoop_2_1_0 + IsEndLoop_2_2_0 + IsEndLoop_2_3_0 + IsEndLoop_2_4_0 + IsEndLoop_2_5_0 + IsEndLoop_2_0_1 + IsEndLoop_2_1_1 + IsEndLoop_2_2_1 + IsEndLoop_2_3_1 + IsEndLoop_2_4_1 + IsEndLoop_2_5_1 + IsEndLoop_2_1_3 + IsEndLoop_2_0_3 + IsEndLoop_2_3_3 + IsEndLoop_2_4_3 + IsEndLoop_2_2_3 + IsEndLoop_2_0_4 + IsEndLoop_2_5_3 + IsEndLoop_2_2_4 + IsEndLoop_2_1_4 + IsEndLoop_2_4_4 + IsEndLoop_2_3_4 + IsEndLoop_2_1_5 + IsEndLoop_2_0_5 + IsEndLoop_2_5_4 + IsEndLoop_2_3_5 + IsEndLoop_2_2_5 + IsEndLoop_2_5_5 + IsEndLoop_2_4_5 + EndTurn_2_1 + EndTurn_2_2 + EndTurn_2_0 + BeginLoop_2_0_0 + BeginLoop_2_1_0 + EndTurn_2_4 + EndTurn_2_3 + EndTurn_2_5 + BeginLoop_2_4_0 + BeginLoop_2_5_0 + BeginLoop_2_2_0 + BeginLoop_2_3_0 + BeginLoop_2_2_6 + WantSection_2_F + TestAlone_2_5_3 + TestAlone_2_4_6 + TestAlone_2_2_6 + TestAlone_2_2_5 + TestTurn_2_5 + TestTurn_2_4 + TestTurn_2_3 + TestTurn_2_2 + TestTurn_2_1 + TestTurn_2_0 + TestIdentity_2_5_3 + AskForSection_2_0 = 1
inv : WantSection_5_T + WantSection_5_F = 1
inv : WantSection_0_T + WantSection_0_F = 1
inv : Turn_1_0 + Turn_1_1 + Turn_1_3 + Turn_1_2 + Turn_1_4 + Turn_1_5 + Turn_1_6 = 1
inv : IsEndLoop_3_0_0 + IsEndLoop_3_1_0 + IsEndLoop_3_2_0 + IsEndLoop_3_3_0 + IsEndLoop_3_4_0 + IsEndLoop_3_5_0 + IsEndLoop_3_0_1 + IsEndLoop_3_1_1 + IsEndLoop_3_2_1 + IsEndLoop_3_3_1 + IsEndLoop_3_4_1 + IsEndLoop_3_5_1 + IsEndLoop_3_0_2 + IsEndLoop_3_1_2 + IsEndLoop_3_3_2 + IsEndLoop_3_2_2 + IsEndLoop_3_4_2 + IsEndLoop_3_5_2 + IsEndLoop_3_0_4 + IsEndLoop_3_2_4 + IsEndLoop_3_1_4 + IsEndLoop_3_4_4 + IsEndLoop_3_3_4 + IsEndLoop_3_1_5 + IsEndLoop_3_0_5 + IsEndLoop_3_5_4 + IsEndLoop_3_3_5 + IsEndLoop_3_2_5 + IsEndLoop_3_5_5 + IsEndLoop_3_4_5 + EndTurn_3_1 + EndTurn_3_2 + EndTurn_3_0 + BeginLoop_3_0_0 + BeginLoop_3_1_0 + EndTurn_3_3 + EndTurn_3_5 + EndTurn_3_4 + BeginLoop_3_4_0 + BeginLoop_3_5_0 + BeginLoop_3_2_0 + BeginLoop_3_3_0 + TestAlone_3_0_1 + WantSection_3_F + TestAlone_3_3_0 + TestAlone_3_4_1 + TestTurn_3_5 + TestTurn_3_4 + TestTurn_3_3 + TestTurn_3_2 + TestTurn_3_1 + TestTurn_3_0 + TestIdentity_3_3_0 + AskForSection_3_0 = 1
inv : WantSection_1_T + WantSection_1_F = 1
inv : IsEndLoop_0_0_1 + IsEndLoop_0_1_1 + IsEndLoop_0_2_1 + IsEndLoop_0_3_1 + IsEndLoop_0_4_1 + IsEndLoop_0_0_2 + IsEndLoop_0_5_1 + IsEndLoop_0_1_2 + IsEndLoop_0_2_2 + IsEndLoop_0_3_2 + IsEndLoop_0_4_2 + IsEndLoop_0_5_2 + IsEndLoop_0_1_3 + IsEndLoop_0_2_3 + IsEndLoop_0_0_3 + IsEndLoop_0_4_3 + IsEndLoop_0_3_3 + IsEndLoop_0_0_4 + IsEndLoop_0_5_3 + IsEndLoop_0_2_4 + IsEndLoop_0_1_4 + IsEndLoop_0_5_4 + IsEndLoop_0_4_4 + IsEndLoop_0_3_4 + IsEndLoop_0_1_5 + IsEndLoop_0_0_5 + IsEndLoop_0_3_5 + IsEndLoop_0_2_5 + IsEndLoop_0_5_5 + IsEndLoop_0_4_5 + EndTurn_0_1 + EndTurn_0_2 + EndTurn_0_3 + EndTurn_0_0 + BeginLoop_0_0_0 + BeginLoop_0_1_0 + EndTurn_0_4 + EndTurn_0_5 + BeginLoop_0_5_0 + BeginLoop_0_2_0 + BeginLoop_0_4_0 + BeginLoop_0_3_0 + WantSection_0_F + TestAlone_0_2_4 + TestTurn_0_5 + TestTurn_0_4 + TestTurn_0_3 + TestTurn_0_2 + TestTurn_0_1 + TestTurn_0_0 + AskForSection_0_0 = 1
Total of 20 invariants.
[2020-05-21 02:22:07] [INFO ] Computed 20 place invariants in 10 ms
[2020-05-21 02:22:07] [INFO ] Flatten gal took : 274 ms
[2020-05-21 02:22:07] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-08(UNSAT) depth K=1 took 32 ms
[2020-05-21 02:22:07] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-09(UNSAT) depth K=1 took 33 ms
[2020-05-21 02:22:07] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-13(UNSAT) depth K=1 took 12 ms
[2020-05-21 02:22:07] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-15(UNSAT) depth K=1 took 6 ms
[2020-05-21 02:22:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 426 labels/synchronizations in 82 ms.
[2020-05-21 02:22:07] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityFireability.pnml.gal : 31 ms
[2020-05-21 02:22:07] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityFireability.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/ReachabilityFireability.pnml.gal, -t, CGAL, -reachable-file, ReachabilityFireability.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/ReachabilityFireability.pnml.gal -t CGAL -reachable-file ReachabilityFireability.prop --nowitness
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 925 out of 1135 initially.
// Phase 1: matrix 925 rows 428 cols
[2020-05-21 02:22:07] [INFO ] Computed 20 place invariants in 3 ms
inv : IsEndLoop_4_0_0 + IsEndLoop_4_1_0 + IsEndLoop_4_2_0 + IsEndLoop_4_3_0 + IsEndLoop_4_4_0 + IsEndLoop_4_5_0 + IsEndLoop_4_0_1 + IsEndLoop_4_1_1 + IsEndLoop_4_2_1 + IsEndLoop_4_3_1 + IsEndLoop_4_4_1 + IsEndLoop_4_5_1 + IsEndLoop_4_0_2 + IsEndLoop_4_1_2 + IsEndLoop_4_2_2 + IsEndLoop_4_4_2 + IsEndLoop_4_3_2 + IsEndLoop_4_5_2 + IsEndLoop_4_1_3 + IsEndLoop_4_0_3 + IsEndLoop_4_3_3 + IsEndLoop_4_2_3 + IsEndLoop_4_5_3 + IsEndLoop_4_4_3 + IsEndLoop_4_0_5 + IsEndLoop_4_3_5 + IsEndLoop_4_2_5 + IsEndLoop_4_1_5 + IsEndLoop_4_5_5 + IsEndLoop_4_4_5 + EndTurn_4_1 + EndTurn_4_2 + EndTurn_4_0 + BeginLoop_4_0_0 + EndTurn_4_5 + BeginLoop_4_1_0 + EndTurn_4_3 + EndTurn_4_4 + BeginLoop_4_4_0 + BeginLoop_4_5_0 + BeginLoop_4_2_0 + BeginLoop_4_3_0 + WantSection_4_F + TestAlone_4_1_3 + TestAlone_4_5_3 + TestTurn_4_5 + TestTurn_4_4 + TestTurn_4_3 + TestTurn_4_2 + TestTurn_4_1 + TestTurn_4_0 + TestIdentity_4_1_3 + AskForSection_4_0 = 1
inv : Turn_0_0 + Turn_0_2 + Turn_0_1 + Turn_0_3 + Turn_0_4 + Turn_0_6 + Turn_0_5 = 1
inv : WantSection_2_T + WantSection_2_F = 1
inv : IsEndLoop_6_0_0 + IsEndLoop_6_1_0 + IsEndLoop_6_2_0 + IsEndLoop_6_3_0 + IsEndLoop_6_4_0 + IsEndLoop_6_5_0 + IsEndLoop_6_0_1 + IsEndLoop_6_1_1 + IsEndLoop_6_2_1 + IsEndLoop_6_4_1 + IsEndLoop_6_3_1 + IsEndLoop_6_5_1 + IsEndLoop_6_0_2 + IsEndLoop_6_1_2 + IsEndLoop_6_2_2 + IsEndLoop_6_3_2 + IsEndLoop_6_4_2 + IsEndLoop_6_1_3 + IsEndLoop_6_5_2 + IsEndLoop_6_0_3 + IsEndLoop_6_3_3 + IsEndLoop_6_2_3 + IsEndLoop_6_5_3 + IsEndLoop_6_4_3 + IsEndLoop_6_1_4 + IsEndLoop_6_2_4 + IsEndLoop_6_0_4 + IsEndLoop_6_4_4 + IsEndLoop_6_3_4 + IsEndLoop_6_5_4 + EndTurn_6_1 + EndTurn_6_2 + EndTurn_6_0 + EndTurn_6_5 + BeginLoop_6_0_0 + EndTurn_6_3 + EndTurn_6_4 + BeginLoop_6_4_0 + BeginLoop_6_5_0 + BeginLoop_6_2_0 + BeginLoop_6_1_0 + BeginLoop_6_3_0 + BeginLoop_6_5_5 + TestAlone_6_4_0 + WantSection_6_F + TestAlone_6_3_2 + TestAlone_6_3_4 + TestAlone_6_5_5 + TestTurn_6_5 + TestTurn_6_4 + TestTurn_6_3 + TestTurn_6_2 + TestTurn_6_1 + TestTurn_6_0 + TestIdentity_6_4_0 + TestIdentity_6_3_4 + AskForSection_6_0 = 1
inv : Turn_3_0 + Turn_3_1 + Turn_3_2 + Turn_3_4 + Turn_3_3 + Turn_3_5 + Turn_3_6 = 1
inv : WantSection_3_T + WantSection_3_F = 1
inv : Turn_2_0 + Turn_2_1 + Turn_2_3 + Turn_2_2 + Turn_2_4 + Turn_2_5 + Turn_2_6 = 1
inv : IsEndLoop_5_0_0 + IsEndLoop_5_1_0 + IsEndLoop_5_2_0 + IsEndLoop_5_3_0 + IsEndLoop_5_4_0 + IsEndLoop_5_5_0 + IsEndLoop_5_0_1 + IsEndLoop_5_1_1 + IsEndLoop_5_3_1 + IsEndLoop_5_2_1 + IsEndLoop_5_4_1 + IsEndLoop_5_5_1 + IsEndLoop_5_0_2 + IsEndLoop_5_1_2 + IsEndLoop_5_2_2 + IsEndLoop_5_3_2 + IsEndLoop_5_5_2 + IsEndLoop_5_4_2 + IsEndLoop_5_1_3 + IsEndLoop_5_0_3 + IsEndLoop_5_3_3 + IsEndLoop_5_2_3 + IsEndLoop_5_5_3 + IsEndLoop_5_4_3 + IsEndLoop_5_2_4 + IsEndLoop_5_0_4 + IsEndLoop_5_1_4 + IsEndLoop_5_4_4 + IsEndLoop_5_3_4 + IsEndLoop_5_5_4 + EndTurn_5_1 + EndTurn_5_2 + EndTurn_5_0 + EndTurn_5_5 + BeginLoop_5_1_0 + BeginLoop_5_0_0 + EndTurn_5_3 + EndTurn_5_4 + BeginLoop_5_4_0 + BeginLoop_5_5_0 + BeginLoop_5_2_0 + BeginLoop_5_3_0 + WantSection_5_F + TestAlone_5_2_6 + TestTurn_5_5 + TestTurn_5_4 + TestTurn_5_3 + TestTurn_5_2 + TestTurn_5_1 + TestTurn_5_0 + AskForSection_5_2 + AskForSection_5_0 = 1
inv : IsEndLoop_1_0_0 + IsEndLoop_1_1_0 + IsEndLoop_1_2_0 + IsEndLoop_1_3_0 + IsEndLoop_1_4_0 + IsEndLoop_1_5_0 + IsEndLoop_1_1_2 + IsEndLoop_1_0_2 + IsEndLoop_1_2_2 + IsEndLoop_1_3_2 + IsEndLoop_1_4_2 + IsEndLoop_1_5_2 + IsEndLoop_1_1_3 + IsEndLoop_1_0_3 + IsEndLoop_1_4_3 + IsEndLoop_1_2_3 + IsEndLoop_1_3_3 + IsEndLoop_1_0_4 + IsEndLoop_1_5_3 + IsEndLoop_1_2_4 + IsEndLoop_1_1_4 + IsEndLoop_1_5_4 + IsEndLoop_1_4_4 + IsEndLoop_1_3_4 + IsEndLoop_1_1_5 + IsEndLoop_1_0_5 + IsEndLoop_1_3_5 + IsEndLoop_1_2_5 + IsEndLoop_1_5_5 + IsEndLoop_1_4_5 + EndTurn_1_1 + EndTurn_1_2 + EndTurn_1_3 + EndTurn_1_0 + BeginLoop_1_0_0 + BeginLoop_1_1_0 + EndTurn_1_4 + EndTurn_1_5 + BeginLoop_1_5_0 + BeginLoop_1_4_0 + BeginLoop_1_2_0 + BeginLoop_1_3_0 + BeginLoop_1_3_1 + TestAlone_1_0_0 + WantSection_1_F + TestAlone_1_3_2 + TestAlone_1_2_2 + TestTurn_1_5 + TestTurn_1_4 + TestTurn_1_3 + TestTurn_1_2 + TestTurn_1_1 + TestTurn_1_0 + TestIdentity_1_2_1 + AskForSection_1_2 + AskForSection_1_0 = 1
inv : Turn_5_1 + Turn_5_0 + Turn_5_2 + Turn_5_3 + Turn_5_5 + Turn_5_4 + Turn_5_6 = 1
inv : Turn_4_0 + Turn_4_1 + Turn_4_2 + Turn_4_4 + Turn_4_3 + Turn_4_5 + Turn_4_6 = 1
inv : WantSection_4_T + WantSection_4_F = 1
inv : WantSection_6_T + WantSection_6_F = 1
inv : IsEndLoop_2_0_0 + IsEndLoop_2_1_0 + IsEndLoop_2_2_0 + IsEndLoop_2_3_0 + IsEndLoop_2_4_0 + IsEndLoop_2_5_0 + IsEndLoop_2_0_1 + IsEndLoop_2_1_1 + IsEndLoop_2_2_1 + IsEndLoop_2_3_1 + IsEndLoop_2_4_1 + IsEndLoop_2_5_1 + IsEndLoop_2_1_3 + IsEndLoop_2_0_3 + IsEndLoop_2_3_3 + IsEndLoop_2_4_3 + IsEndLoop_2_2_3 + IsEndLoop_2_0_4 + IsEndLoop_2_5_3 + IsEndLoop_2_2_4 + IsEndLoop_2_1_4 + IsEndLoop_2_4_4 + IsEndLoop_2_3_4 + IsEndLoop_2_1_5 + IsEndLoop_2_0_5 + IsEndLoop_2_5_4 + IsEndLoop_2_3_5 + IsEndLoop_2_2_5 + IsEndLoop_2_5_5 + IsEndLoop_2_4_5 + EndTurn_2_1 + EndTurn_2_2 + EndTurn_2_0 + BeginLoop_2_0_0 + BeginLoop_2_1_0 + EndTurn_2_4 + EndTurn_2_3 + EndTurn_2_5 + BeginLoop_2_4_0 + BeginLoop_2_5_0 + BeginLoop_2_2_0 + BeginLoop_2_3_0 + BeginLoop_2_2_6 + WantSection_2_F + TestAlone_2_5_3 + TestAlone_2_4_6 + TestAlone_2_2_6 + TestAlone_2_2_5 + TestTurn_2_5 + TestTurn_2_4 + TestTurn_2_3 + TestTurn_2_2 + TestTurn_2_1 + TestTurn_2_0 + TestIdentity_2_5_3 + AskForSection_2_0 = 1
inv : WantSection_5_T + WantSection_5_F = 1
inv : WantSection_0_T + WantSection_0_F = 1
inv : Turn_1_0 + Turn_1_1 + Turn_1_3 + Turn_1_2 + Turn_1_4 + Turn_1_5 + Turn_1_6 = 1
inv : IsEndLoop_3_0_0 + IsEndLoop_3_1_0 + IsEndLoop_3_2_0 + IsEndLoop_3_3_0 + IsEndLoop_3_4_0 + IsEndLoop_3_5_0 + IsEndLoop_3_0_1 + IsEndLoop_3_1_1 + IsEndLoop_3_2_1 + IsEndLoop_3_3_1 + IsEndLoop_3_4_1 + IsEndLoop_3_5_1 + IsEndLoop_3_0_2 + IsEndLoop_3_1_2 + IsEndLoop_3_3_2 + IsEndLoop_3_2_2 + IsEndLoop_3_4_2 + IsEndLoop_3_5_2 + IsEndLoop_3_0_4 + IsEndLoop_3_2_4 + IsEndLoop_3_1_4 + IsEndLoop_3_4_4 + IsEndLoop_3_3_4 + IsEndLoop_3_1_5 + IsEndLoop_3_0_5 + IsEndLoop_3_5_4 + IsEndLoop_3_3_5 + IsEndLoop_3_2_5 + IsEndLoop_3_5_5 + IsEndLoop_3_4_5 + EndTurn_3_1 + EndTurn_3_2 + EndTurn_3_0 + BeginLoop_3_0_0 + BeginLoop_3_1_0 + EndTurn_3_3 + EndTurn_3_5 + EndTurn_3_4 + BeginLoop_3_4_0 + BeginLoop_3_5_0 + BeginLoop_3_2_0 + BeginLoop_3_3_0 + TestAlone_3_0_1 + WantSection_3_F + TestAlone_3_3_0 + TestAlone_3_4_1 + TestTurn_3_5 + TestTurn_3_4 + TestTurn_3_3 + TestTurn_3_2 + TestTurn_3_1 + TestTurn_3_0 + TestIdentity_3_3_0 + AskForSection_3_0 = 1
inv : WantSection_1_T + WantSection_1_F = 1
inv : IsEndLoop_0_0_1 + IsEndLoop_0_1_1 + IsEndLoop_0_2_1 + IsEndLoop_0_3_1 + IsEndLoop_0_4_1 + IsEndLoop_0_0_2 + IsEndLoop_0_5_1 + IsEndLoop_0_1_2 + IsEndLoop_0_2_2 + IsEndLoop_0_3_2 + IsEndLoop_0_4_2 + IsEndLoop_0_5_2 + IsEndLoop_0_1_3 + IsEndLoop_0_2_3 + IsEndLoop_0_0_3 + IsEndLoop_0_4_3 + IsEndLoop_0_3_3 + IsEndLoop_0_0_4 + IsEndLoop_0_5_3 + IsEndLoop_0_2_4 + IsEndLoop_0_1_4 + IsEndLoop_0_5_4 + IsEndLoop_0_4_4 + IsEndLoop_0_3_4 + IsEndLoop_0_1_5 + IsEndLoop_0_0_5 + IsEndLoop_0_3_5 + IsEndLoop_0_2_5 + IsEndLoop_0_5_5 + IsEndLoop_0_4_5 + EndTurn_0_1 + EndTurn_0_2 + EndTurn_0_3 + EndTurn_0_0 + BeginLoop_0_0_0 + BeginLoop_0_1_0 + EndTurn_0_4 + EndTurn_0_5 + BeginLoop_0_5_0 + BeginLoop_0_2_0 + BeginLoop_0_4_0 + BeginLoop_0_3_0 + WantSection_0_F + TestAlone_0_2_4 + TestTurn_0_5 + TestTurn_0_4 + TestTurn_0_3 + TestTurn_0_2 + TestTurn_0_1 + TestTurn_0_0 + AskForSection_0_0 = 1
Total of 20 invariants.
[2020-05-21 02:22:07] [INFO ] Computed 20 place invariants in 4 ms
[2020-05-21 02:22:07] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-08(UNSAT) depth K=2 took 430 ms
Loading property file ReachabilityFireability.prop.
Read [reachable] property : Peterson-PT-6-ReachabilityFireability-08 with value :((i8.i1.u63.TestIdentity_1_2_1<1)&&(i7.u43.TestIdentity_2_5_3>=1))
Read [reachable] property : Peterson-PT-6-ReachabilityFireability-09 with value :((((i7.u39.WantSection_3_T>=1)&&(i2.u42.TestAlone_4_5_3>=1))&&((i6.u30.BeginLoop_1_3_1<1)||((i12.u31.WantSection_1_T>=1)&&(i12.u0.TestAlone_3_4_1>=1))))&&(((i4.u37.IsEndLoop_3_0_0<1)||(i11.u32.WantSection_0_T<1))||(i4.u16.TestAlone_1_0_0<1)))
Read [reachable] property : Peterson-PT-6-ReachabilityFireability-13 with value :((i13.u36.BeginLoop_2_2_6>=1)&&(((((i13.u57.TestTurn_2_2<1)||(i8.i1.u56.Turn_2_1<1))||(i0.u41.IsEndLoop_0_2_3>=1))||(i3.i1.u29.TestIdentity_6_4_0>=1))||((i10.u33.WantSection_5_T>=1)&&(i13.u2.TestAlone_2_2_5>=1))))
Read [reachable] property : Peterson-PT-6-ReachabilityFireability-15 with value :((((((i13.u61.Turn_2_2>=1)&&(i8.i0.u55.AskForSection_5_2>=1))&&(i1.i0.u66.TestIdentity_4_1_3>=1))&&((i3.i1.u40.WantSection_2_T<1)||(i3.i0.u1.TestAlone_6_3_2<1)))&&((i2.u38.WantSection_6_T<1)||(i7.u45.TestAlone_2_4_6<1)))||((((((i12.u64.TestIdentity_3_3_0<1)&&(i11.u47.TestTurn_5_5>=1))&&(i7.u20.Turn_5_2>=1))&&(i3.i1.u35.BeginLoop_6_5_5>=1))&&(((i5.u58.Turn_2_6>=1)&&(i8.i1.u56.AskForSection_1_2>=1))||((i2.u38.WantSection_6_T>=1)&&(i8.i0.u44.TestAlone_5_2_6>=1))))&&((i3.i0.u65.TestIdentity_6_3_4>=1)||((i10.u51.TestTurn_0_4>=1)&&(i8.i0.u23.Turn_4_5>=1)))))
built 126 ordering constraints for composite.
built 57 ordering constraints for composite.
built 23 ordering constraints for composite.
built 55 ordering constraints for composite.
built 37 ordering constraints for composite.
built 54 ordering constraints for composite.
built 55 ordering constraints for composite.
built 192 ordering constraints for composite.
built 36 ordering constraints for composite.
built 38 ordering constraints for composite.
built 38 ordering constraints for composite.
built 46 ordering constraints for composite.
built 38 ordering constraints for composite.
built 53 ordering constraints for composite.
built 41 ordering constraints for composite.
built 43 ordering constraints for composite.
built 20 ordering constraints for composite.
built 20 ordering constraints for composite.
built 37 ordering constraints for composite.
built 37 ordering constraints for composite.
built 37 ordering constraints for composite.
SDD proceeding with computation, new max is 4
SDD proceeding with computation, new max is 8
SDD proceeding with computation, new max is 16
SDD proceeding with computation, new max is 32
SDD proceeding with computation, new max is 64
SDD proceeding with computation, new max is 128
SDD proceeding with computation, new max is 256
SDD proceeding with computation, new max is 512
SDD proceeding with computation, new max is 1024
[2020-05-21 02:22:08] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-09(UNSAT) depth K=2 took 454 ms
SDD proceeding with computation, new max is 2048
[2020-05-21 02:22:08] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-13(UNSAT) depth K=2 took 255 ms
SDD proceeding with computation, new max is 4096
[2020-05-21 02:22:08] [INFO ] Proved 428 variables to be positive in 1044 ms
[2020-05-21 02:22:08] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityFireability-08
[2020-05-21 02:22:08] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityFireability-08(SAT) depth K=0 took 27 ms
[2020-05-21 02:22:08] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityFireability-09
[2020-05-21 02:22:08] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityFireability-09(SAT) depth K=0 took 21 ms
[2020-05-21 02:22:08] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityFireability-13
[2020-05-21 02:22:08] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityFireability-13(SAT) depth K=0 took 20 ms
[2020-05-21 02:22:08] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityFireability-15
[2020-05-21 02:22:08] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityFireability-15(SAT) depth K=0 took 21 ms
[2020-05-21 02:22:08] [INFO ] Proved 428 variables to be positive in 1669 ms
[2020-05-21 02:22:08] [INFO ] Computing symmetric may disable matrix : 1135 transitions.
[2020-05-21 02:22:08] [INFO ] Computation of disable matrix completed :0/1135 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 02:22:08] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-15(UNSAT) depth K=2 took 428 ms
[2020-05-21 02:22:08] [INFO ] Computation of Complete disable matrix. took 161 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 02:22:08] [INFO ] Computing symmetric may enable matrix : 1135 transitions.
[2020-05-21 02:22:08] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityFireability-08
[2020-05-21 02:22:08] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityFireability-08(SAT) depth K=1 took 201 ms
[2020-05-21 02:22:08] [INFO ] Computation of Complete enable matrix. took 81 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 02:22:09] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityFireability-09
[2020-05-21 02:22:09] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityFireability-09(SAT) depth K=1 took 200 ms
[2020-05-21 02:22:09] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityFireability-13
[2020-05-21 02:22:09] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityFireability-13(SAT) depth K=1 took 160 ms
[2020-05-21 02:22:09] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityFireability-15
[2020-05-21 02:22:09] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityFireability-15(SAT) depth K=1 took 153 ms
[2020-05-21 02:22:09] [INFO ] Computing symmetric co enabling matrix : 1135 transitions.
SDD proceeding with computation, new max is 8192
SDD proceeding with computation, new max is 16384
[2020-05-21 02:22:14] [INFO ] Computation of co-enabling matrix(7/1135) took 5026 ms. Total solver calls (SAT/UNSAT): 2663(154/2509)
SDD proceeding with computation, new max is 32768
[2020-05-21 02:22:19] [INFO ] Computation of co-enabling matrix(10/1135) took 9965 ms. Total solver calls (SAT/UNSAT): 3887(245/3642)
[2020-05-21 02:22:20] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-08(UNSAT) depth K=3 took 11390 ms
[2020-05-21 02:22:20] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityFireability-08
[2020-05-21 02:22:20] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityFireability-08(SAT) depth K=2 took 11393 ms
[2020-05-21 02:22:22] [INFO ] Computation of co-enabling matrix(12/1135) took 13207 ms. Total solver calls (SAT/UNSAT): 4705(306/4399)
SDD proceeding with computation, new max is 65536
[2020-05-21 02:22:27] [INFO ] Computation of co-enabling matrix(15/1135) took 17965 ms. Total solver calls (SAT/UNSAT): 5622(399/5223)
[2020-05-21 02:22:27] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-09(UNSAT) depth K=3 took 7758 ms
[2020-05-21 02:22:31] [INFO ] Computation of co-enabling matrix(18/1135) took 21578 ms. Total solver calls (SAT/UNSAT): 6837(488/6349)
[2020-05-21 02:22:34] [INFO ] Computation of co-enabling matrix(21/1135) took 25369 ms. Total solver calls (SAT/UNSAT): 7601(580/7021)
[2020-05-21 02:22:38] [INFO ] Computation of co-enabling matrix(24/1135) took 28799 ms. Total solver calls (SAT/UNSAT): 8360(671/7689)
[2020-05-21 02:22:38] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityFireability-09
[2020-05-21 02:22:38] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityFireability-09(SAT) depth K=2 took 17687 ms
[2020-05-21 02:22:41] [INFO ] Computation of co-enabling matrix(26/1135) took 32244 ms. Total solver calls (SAT/UNSAT): 8864(732/8132)
[2020-05-21 02:22:43] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-13(UNSAT) depth K=3 took 15551 ms
[2020-05-21 02:22:45] [INFO ] Computation of co-enabling matrix(30/1135) took 36078 ms. Total solver calls (SAT/UNSAT): 9809(822/8987)
SDD proceeding with computation, new max is 131072
[2020-05-21 02:22:47] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityFireability-13
[2020-05-21 02:22:47] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityFireability-13(SAT) depth K=2 took 8629 ms
[2020-05-21 02:22:49] [INFO ] Computation of co-enabling matrix(32/1135) took 39502 ms. Total solver calls (SAT/UNSAT): 10311(884/9427)
[2020-05-21 02:22:52] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityFireability-15
[2020-05-21 02:22:52] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityFireability-15(SAT) depth K=2 took 4995 ms
[2020-05-21 02:22:52] [INFO ] Computation of co-enabling matrix(39/1135) took 43166 ms. Total solver calls (SAT/UNSAT): 12158(1018/11140)
[2020-05-21 02:22:55] [INFO ] Computation of co-enabling matrix(50/1135) took 46209 ms. Total solver calls (SAT/UNSAT): 15070(1122/13948)
[2020-05-21 02:22:58] [INFO ] Computation of co-enabling matrix(65/1135) took 49384 ms. Total solver calls (SAT/UNSAT): 18849(1269/17580)
[2020-05-21 02:23:02] [INFO ] Computation of co-enabling matrix(72/1135) took 52655 ms. Total solver calls (SAT/UNSAT): 20673(1338/19335)
[2020-05-21 02:23:04] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-15(UNSAT) depth K=3 took 21102 ms
[2020-05-21 02:23:05] [INFO ] Computation of co-enabling matrix(80/1135) took 55708 ms. Total solver calls (SAT/UNSAT): 22702(1410/21292)
[2020-05-21 02:23:08] [INFO ] Computation of co-enabling matrix(84/1135) took 58886 ms. Total solver calls (SAT/UNSAT): 23734(1446/22288)
[2020-05-21 02:23:11] [INFO ] Computation of co-enabling matrix(91/1135) took 62232 ms. Total solver calls (SAT/UNSAT): 25501(1517/23984)
[2020-05-21 02:23:15] [INFO ] Computation of co-enabling matrix(98/1135) took 65415 ms. Total solver calls (SAT/UNSAT): 27217(1579/25638)
[2020-05-21 02:23:19] [INFO ] Computation of co-enabling matrix(106/1135) took 69583 ms. Total solver calls (SAT/UNSAT): 29196(1661/27535)
[2020-05-21 02:23:22] [INFO ] Computation of co-enabling matrix(114/1135) took 72668 ms. Total solver calls (SAT/UNSAT): 31048(1733/29315)
[2020-05-21 02:23:25] [INFO ] Computation of co-enabling matrix(121/1135) took 75777 ms. Total solver calls (SAT/UNSAT): 32824(1802/31022)
[2020-05-21 02:23:28] [INFO ] Computation of co-enabling matrix(128/1135) took 79202 ms. Total solver calls (SAT/UNSAT): 34583(1868/32715)
[2020-05-21 02:23:31] [INFO ] Computation of co-enabling matrix(138/1135) took 82283 ms. Total solver calls (SAT/UNSAT): 37005(1963/35042)
[2020-05-21 02:23:34] [INFO ] Computation of co-enabling matrix(147/1135) took 85390 ms. Total solver calls (SAT/UNSAT): 39106(2042/37064)
SDD proceeding with computation, new max is 262144
[2020-05-21 02:23:38] [INFO ] Computation of co-enabling matrix(156/1135) took 88614 ms. Total solver calls (SAT/UNSAT): 41361(2137/39224)
[2020-05-21 02:23:41] [INFO ] Computation of co-enabling matrix(166/1135) took 92268 ms. Total solver calls (SAT/UNSAT): 43582(2219/41363)
[2020-05-21 02:23:44] [INFO ] Computation of co-enabling matrix(176/1135) took 95274 ms. Total solver calls (SAT/UNSAT): 45766(2288/43478)
[2020-05-21 02:23:48] [INFO ] Computation of co-enabling matrix(186/1135) took 98463 ms. Total solver calls (SAT/UNSAT): 47856(2329/45527)
[2020-05-21 02:23:51] [INFO ] Computation of co-enabling matrix(199/1135) took 101882 ms. Total solver calls (SAT/UNSAT): 50446(2436/48010)
[2020-05-21 02:23:54] [INFO ] Computation of co-enabling matrix(205/1135) took 105007 ms. Total solver calls (SAT/UNSAT): 51745(2594/49151)
[2020-05-21 02:23:57] [INFO ] Computation of co-enabling matrix(212/1135) took 108026 ms. Total solver calls (SAT/UNSAT): 53414(2699/50715)
[2020-05-21 02:24:01] [INFO ] Computation of co-enabling matrix(216/1135) took 111619 ms. Total solver calls (SAT/UNSAT): 54403(2747/51656)
[2020-05-21 02:24:04] [INFO ] Computation of co-enabling matrix(227/1135) took 114672 ms. Total solver calls (SAT/UNSAT): 56977(2858/54119)
[2020-05-21 02:24:07] [INFO ] Computation of co-enabling matrix(238/1135) took 117741 ms. Total solver calls (SAT/UNSAT): 59196(2924/56272)
[2020-05-21 02:24:10] [INFO ] Computation of co-enabling matrix(251/1135) took 120947 ms. Total solver calls (SAT/UNSAT): 61514(2969/58545)
[2020-05-21 02:24:13] [INFO ] Computation of co-enabling matrix(261/1135) took 123993 ms. Total solver calls (SAT/UNSAT): 63400(3020/60380)
[2020-05-21 02:24:17] [INFO ] Computation of co-enabling matrix(268/1135) took 127653 ms. Total solver calls (SAT/UNSAT): 65016(3087/61929)
[2020-05-21 02:24:20] [INFO ] Computation of co-enabling matrix(276/1135) took 130761 ms. Total solver calls (SAT/UNSAT): 66798(3155/63643)
[2020-05-21 02:24:23] [INFO ] Computation of co-enabling matrix(285/1135) took 133984 ms. Total solver calls (SAT/UNSAT): 68740(3231/65509)
[2020-05-21 02:24:26] [INFO ] Computation of co-enabling matrix(294/1135) took 137033 ms. Total solver calls (SAT/UNSAT): 70664(3308/67356)
[2020-05-21 02:24:29] [INFO ] Computation of co-enabling matrix(306/1135) took 140092 ms. Total solver calls (SAT/UNSAT): 73223(3403/69820)
[2020-05-21 02:24:33] [INFO ] Computation of co-enabling matrix(315/1135) took 143507 ms. Total solver calls (SAT/UNSAT): 75052(3480/71572)
[2020-05-21 02:24:36] [INFO ] Computation of co-enabling matrix(324/1135) took 146518 ms. Total solver calls (SAT/UNSAT): 76869(3553/73316)
[2020-05-21 02:24:39] [INFO ] Computation of co-enabling matrix(339/1135) took 149713 ms. Total solver calls (SAT/UNSAT): 79585(3612/75973)
[2020-05-21 02:24:42] [INFO ] Computation of co-enabling matrix(349/1135) took 153181 ms. Total solver calls (SAT/UNSAT): 81737(3703/78034)
[2020-05-21 02:24:46] [INFO ] Computation of co-enabling matrix(357/1135) took 156440 ms. Total solver calls (SAT/UNSAT): 83377(3771/79606)
[2020-05-21 02:24:49] [INFO ] Computation of co-enabling matrix(366/1135) took 159856 ms. Total solver calls (SAT/UNSAT): 85157(3846/81311)
[2020-05-21 02:24:52] [INFO ] Computation of co-enabling matrix(379/1135) took 162895 ms. Total solver calls (SAT/UNSAT): 87620(3951/83669)
[2020-05-21 02:24:55] [INFO ] Computation of co-enabling matrix(392/1135) took 165974 ms. Total solver calls (SAT/UNSAT): 90005(4038/85967)
[2020-05-21 02:25:00] [INFO ] Computation of co-enabling matrix(422/1135) took 170541 ms. Total solver calls (SAT/UNSAT): 94854(4220/90634)
[2020-05-21 02:25:02] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-08(UNSAT) depth K=4 took 118273 ms
[2020-05-21 02:25:03] [INFO ] Computation of co-enabling matrix(426/1135) took 174393 ms. Total solver calls (SAT/UNSAT): 95794(4326/91468)
[2020-05-21 02:25:07] [INFO ] Computation of co-enabling matrix(427/1135) took 177467 ms. Total solver calls (SAT/UNSAT): 96084(4354/91730)
[2020-05-21 02:25:10] [INFO ] Computation of co-enabling matrix(429/1135) took 181124 ms. Total solver calls (SAT/UNSAT): 96552(4407/92145)
[2020-05-21 02:25:14] [INFO ] Computation of co-enabling matrix(431/1135) took 184736 ms. Total solver calls (SAT/UNSAT): 97023(4458/92565)
[2020-05-21 02:25:18] [INFO ] Computation of co-enabling matrix(433/1135) took 188599 ms. Total solver calls (SAT/UNSAT): 97491(4509/92982)
[2020-05-21 02:25:21] [INFO ] Computation of co-enabling matrix(435/1135) took 192314 ms. Total solver calls (SAT/UNSAT): 97949(4556/93393)
[2020-05-21 02:25:25] [INFO ] Computation of co-enabling matrix(439/1135) took 195621 ms. Total solver calls (SAT/UNSAT): 98838(4648/94190)
SDD proceeding with computation, new max is 524288
[2020-05-21 02:25:28] [INFO ] Computation of co-enabling matrix(441/1135) took 198689 ms. Total solver calls (SAT/UNSAT): 99289(4691/94598)
[2020-05-21 02:25:31] [INFO ] Computation of co-enabling matrix(443/1135) took 202018 ms. Total solver calls (SAT/UNSAT): 99737(4734/95003)
[2020-05-21 02:25:34] [INFO ] Computation of co-enabling matrix(445/1135) took 205128 ms. Total solver calls (SAT/UNSAT): 100175(4773/95402)
[2020-05-21 02:25:37] [INFO ] Computation of co-enabling matrix(448/1135) took 208330 ms. Total solver calls (SAT/UNSAT): 100807(4850/95957)
[2020-05-21 02:25:40] [INFO ] Computation of co-enabling matrix(452/1135) took 211372 ms. Total solver calls (SAT/UNSAT): 101692(4943/96749)
[2020-05-21 02:25:45] [INFO ] Computation of co-enabling matrix(458/1135) took 215517 ms. Total solver calls (SAT/UNSAT): 102982(5070/97912)
[2020-05-21 02:25:48] [INFO ] Computation of co-enabling matrix(464/1135) took 219131 ms. Total solver calls (SAT/UNSAT): 104240(5186/99054)
[2020-05-21 02:25:52] [INFO ] Computation of co-enabling matrix(470/1135) took 222543 ms. Total solver calls (SAT/UNSAT): 105463(5286/100177)
[2020-05-21 02:25:53] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityFireability-08
[2020-05-21 02:25:53] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityFireability-08(SAT) depth K=3 took 181492 ms
[2020-05-21 02:25:56] [INFO ] Computation of co-enabling matrix(479/1135) took 227273 ms. Total solver calls (SAT/UNSAT): 107311(5430/101881)
[2020-05-21 02:26:00] [INFO ] Computation of co-enabling matrix(482/1135) took 231248 ms. Total solver calls (SAT/UNSAT): 107882(5484/102398)
[2020-05-21 02:26:04] [INFO ] Computation of co-enabling matrix(484/1135) took 234514 ms. Total solver calls (SAT/UNSAT): 108378(5517/102861)
[2020-05-21 02:26:07] [INFO ] Computation of co-enabling matrix(487/1135) took 238116 ms. Total solver calls (SAT/UNSAT): 108931(5566/103365)
[2020-05-21 02:26:11] [INFO ] Computation of co-enabling matrix(491/1135) took 241833 ms. Total solver calls (SAT/UNSAT): 109722(5618/104104)
[2020-05-21 02:26:14] [INFO ] Computation of co-enabling matrix(495/1135) took 245291 ms. Total solver calls (SAT/UNSAT): 110497(5666/104831)
[2020-05-21 02:26:18] [INFO ] Computation of co-enabling matrix(501/1135) took 249066 ms. Total solver calls (SAT/UNSAT): 111613(5725/105888)
[2020-05-21 02:26:22] [INFO ] Computation of co-enabling matrix(508/1135) took 252450 ms. Total solver calls (SAT/UNSAT): 112890(5778/107112)
[2020-05-21 02:26:25] [INFO ] Computation of co-enabling matrix(518/1135) took 255537 ms. Total solver calls (SAT/UNSAT): 114632(5814/108818)
[2020-05-21 02:26:29] [INFO ] Computation of co-enabling matrix(525/1135) took 260128 ms. Total solver calls (SAT/UNSAT): 115902(5925/109977)
[2020-05-21 02:26:33] [INFO ] Computation of co-enabling matrix(530/1135) took 263579 ms. Total solver calls (SAT/UNSAT): 116871(6054/110817)
[2020-05-21 02:26:36] [INFO ] Computation of co-enabling matrix(536/1135) took 266822 ms. Total solver calls (SAT/UNSAT): 118020(6194/111826)
[2020-05-21 02:26:40] [INFO ] Computation of co-enabling matrix(542/1135) took 270922 ms. Total solver calls (SAT/UNSAT): 119165(6317/112848)
[2020-05-21 02:26:43] [INFO ] Computation of co-enabling matrix(548/1135) took 273990 ms. Total solver calls (SAT/UNSAT): 120265(6422/113843)
[2020-05-21 02:26:47] [INFO ] Computation of co-enabling matrix(554/1135) took 277490 ms. Total solver calls (SAT/UNSAT): 121430(6573/114857)
[2020-05-21 02:26:50] [INFO ] Computation of co-enabling matrix(556/1135) took 280819 ms. Total solver calls (SAT/UNSAT): 121893(6622/115271)
[2020-05-21 02:26:52] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-09(UNSAT) depth K=4 took 110154 ms
[2020-05-21 02:26:54] [INFO ] Computation of co-enabling matrix(558/1135) took 284727 ms. Total solver calls (SAT/UNSAT): 122272(6671/115601)
[2020-05-21 02:26:57] [INFO ] Computation of co-enabling matrix(561/1135) took 288205 ms. Total solver calls (SAT/UNSAT): 122788(6743/116045)
[2020-05-21 02:27:00] [INFO ] Computation of co-enabling matrix(563/1135) took 291297 ms. Total solver calls (SAT/UNSAT): 123173(6786/116387)
[2020-05-21 02:27:04] [INFO ] Computation of co-enabling matrix(568/1135) took 294680 ms. Total solver calls (SAT/UNSAT): 124031(6879/117152)
[2020-05-21 02:27:07] [INFO ] Computation of co-enabling matrix(572/1135) took 298018 ms. Total solver calls (SAT/UNSAT): 124832(6941/117891)
[2020-05-21 02:27:11] [INFO ] Computation of co-enabling matrix(575/1135) took 301981 ms. Total solver calls (SAT/UNSAT): 125357(7002/118355)
[2020-05-21 02:27:14] [INFO ] Computation of co-enabling matrix(585/1135) took 305066 ms. Total solver calls (SAT/UNSAT): 127003(7149/119854)
[2020-05-21 02:27:18] [INFO ] Computation of co-enabling matrix(595/1135) took 308467 ms. Total solver calls (SAT/UNSAT): 128565(7242/121323)
[2020-05-21 02:27:21] [INFO ] Computation of co-enabling matrix(610/1135) took 311810 ms. Total solver calls (SAT/UNSAT): 130795(7311/123484)
[2020-05-21 02:27:24] [INFO ] Computation of co-enabling matrix(618/1135) took 314984 ms. Total solver calls (SAT/UNSAT): 131960(7400/124560)
[2020-05-21 02:27:27] [INFO ] Computation of co-enabling matrix(632/1135) took 318243 ms. Total solver calls (SAT/UNSAT): 133984(7488/126496)
[2020-05-21 02:27:30] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityFireability-09
[2020-05-21 02:27:30] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityFireability-09(SAT) depth K=3 took 96897 ms
[2020-05-21 02:27:31] [INFO ] Computation of co-enabling matrix(641/1135) took 321739 ms. Total solver calls (SAT/UNSAT): 135230(7559/127671)
[2020-05-21 02:27:34] [INFO ] Computation of co-enabling matrix(642/1135) took 325205 ms. Total solver calls (SAT/UNSAT): 135450(7587/127863)
[2020-05-21 02:27:37] [INFO ] Computation of co-enabling matrix(647/1135) took 328261 ms. Total solver calls (SAT/UNSAT): 136245(7720/128525)
[2020-05-21 02:27:41] [INFO ] Computation of co-enabling matrix(652/1135) took 331797 ms. Total solver calls (SAT/UNSAT): 137005(7843/129162)
[2020-05-21 02:27:46] [INFO ] Computation of co-enabling matrix(655/1135) took 336584 ms. Total solver calls (SAT/UNSAT): 137538(7908/129630)
[2020-05-21 02:27:51] [INFO ] Computation of co-enabling matrix(660/1135) took 342139 ms. Total solver calls (SAT/UNSAT): 138365(8051/130314)
[2020-05-21 02:27:55] [INFO ] Computation of co-enabling matrix(663/1135) took 345826 ms. Total solver calls (SAT/UNSAT): 138849(8130/130719)
[2020-05-21 02:27:59] [INFO ] Computation of co-enabling matrix(666/1135) took 350389 ms. Total solver calls (SAT/UNSAT): 139362(8193/131169)
[2020-05-21 02:28:04] [INFO ] Computation of co-enabling matrix(669/1135) took 354740 ms. Total solver calls (SAT/UNSAT): 139792(8264/131528)
[2020-05-21 02:28:08] [INFO ] Computation of co-enabling matrix(671/1135) took 358979 ms. Total solver calls (SAT/UNSAT): 140133(8305/131828)
[2020-05-21 02:28:13] [INFO ] Computation of co-enabling matrix(677/1135) took 363439 ms. Total solver calls (SAT/UNSAT): 140989(8416/132573)
[2020-05-21 02:28:17] [INFO ] Computation of co-enabling matrix(680/1135) took 367644 ms. Total solver calls (SAT/UNSAT): 141461(8465/132996)
[2020-05-21 02:28:21] [INFO ] Computation of co-enabling matrix(682/1135) took 371411 ms. Total solver calls (SAT/UNSAT): 141765(8497/133268)
[2020-05-21 02:28:25] [INFO ] Computation of co-enabling matrix(685/1135) took 375997 ms. Total solver calls (SAT/UNSAT): 142182(8542/133640)
[2020-05-21 02:28:29] [INFO ] Computation of co-enabling matrix(688/1135) took 380021 ms. Total solver calls (SAT/UNSAT): 142556(8583/133973)
[2020-05-21 02:28:33] [INFO ] Computation of co-enabling matrix(690/1135) took 383601 ms. Total solver calls (SAT/UNSAT): 142893(8606/134287)
[2020-05-21 02:28:36] [INFO ] Computation of co-enabling matrix(693/1135) took 387249 ms. Total solver calls (SAT/UNSAT): 143257(8640/134617)
SDD proceeding with computation, new max is 1048576
[2020-05-21 02:28:41] [INFO ] Computation of co-enabling matrix(698/1135) took 391473 ms. Total solver calls (SAT/UNSAT): 143851(8694/135157)
[2020-05-21 02:28:45] [INFO ] Computation of co-enabling matrix(700/1135) took 395748 ms. Total solver calls (SAT/UNSAT): 144206(8727/135479)
[2020-05-21 02:28:48] [INFO ] Computation of co-enabling matrix(704/1135) took 398833 ms. Total solver calls (SAT/UNSAT): 144729(8790/135939)
[2020-05-21 02:28:52] [INFO ] Computation of co-enabling matrix(707/1135) took 403393 ms. Total solver calls (SAT/UNSAT): 145125(8835/136290)
[2020-05-21 02:28:56] [INFO ] Computation of co-enabling matrix(712/1135) took 406744 ms. Total solver calls (SAT/UNSAT): 145647(8874/136773)
[2020-05-21 02:28:59] [INFO ] Computation of co-enabling matrix(715/1135) took 410065 ms. Total solver calls (SAT/UNSAT): 146053(8893/137160)
[2020-05-21 02:29:02] [INFO ] Computation of co-enabling matrix(719/1135) took 413223 ms. Total solver calls (SAT/UNSAT): 146519(8911/137608)
[2020-05-21 02:29:06] [INFO ] Computation of co-enabling matrix(726/1135) took 416722 ms. Total solver calls (SAT/UNSAT): 147290(8962/138328)
[2020-05-21 02:29:09] [INFO ] Computation of co-enabling matrix(729/1135) took 420208 ms. Total solver calls (SAT/UNSAT): 147656(9000/138656)
[2020-05-21 02:29:13] [INFO ] Computation of co-enabling matrix(733/1135) took 424005 ms. Total solver calls (SAT/UNSAT): 148115(9042/139073)
[2020-05-21 02:29:16] [INFO ] Computation of co-enabling matrix(739/1135) took 427333 ms. Total solver calls (SAT/UNSAT): 148767(9091/139676)
[2020-05-21 02:29:20] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityFireability-13
[2020-05-21 02:29:20] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityFireability-13(SAT) depth K=3 took 109599 ms
[2020-05-21 02:29:20] [INFO ] Computation of co-enabling matrix(743/1135) took 430881 ms. Total solver calls (SAT/UNSAT): 149203(9115/140088)
[2020-05-21 02:29:24] [INFO ] Computation of co-enabling matrix(756/1135) took 434561 ms. Total solver calls (SAT/UNSAT): 150520(9179/141341)
[2020-05-21 02:29:28] [INFO ] Computation of co-enabling matrix(761/1135) took 438693 ms. Total solver calls (SAT/UNSAT): 151083(9307/141776)
[2020-05-21 02:29:31] [INFO ] Computation of co-enabling matrix(765/1135) took 442242 ms. Total solver calls (SAT/UNSAT): 151528(9393/142135)
[2020-05-21 02:29:34] [INFO ] Computation of co-enabling matrix(772/1135) took 445350 ms. Total solver calls (SAT/UNSAT): 152251(9516/142735)
[2020-05-21 02:29:38] [INFO ] Computation of co-enabling matrix(779/1135) took 448472 ms. Total solver calls (SAT/UNSAT): 152936(9595/143341)
[2020-05-21 02:29:42] [INFO ] Computation of co-enabling matrix(786/1135) took 452792 ms. Total solver calls (SAT/UNSAT): 153641(9676/143965)
[2020-05-21 02:29:46] [INFO ] Computation of co-enabling matrix(788/1135) took 456672 ms. Total solver calls (SAT/UNSAT): 153911(9724/144187)
[2020-05-21 02:29:50] [INFO ] Computation of co-enabling matrix(791/1135) took 460677 ms. Total solver calls (SAT/UNSAT): 154247(9792/144455)
[2020-05-21 02:29:53] [INFO ] Computation of co-enabling matrix(793/1135) took 464090 ms. Total solver calls (SAT/UNSAT): 154478(9837/144641)
[2020-05-21 02:29:57] [INFO ] Computation of co-enabling matrix(796/1135) took 467929 ms. Total solver calls (SAT/UNSAT): 154797(9900/144897)
[2020-05-21 02:30:01] [INFO ] Computation of co-enabling matrix(801/1135) took 471844 ms. Total solver calls (SAT/UNSAT): 155336(9997/145339)
[2020-05-21 02:30:04] [INFO ] Computation of co-enabling matrix(807/1135) took 475042 ms. Total solver calls (SAT/UNSAT): 155931(10084/145847)
[2020-05-21 02:30:08] [INFO ] Computation of co-enabling matrix(810/1135) took 478499 ms. Total solver calls (SAT/UNSAT): 156213(10130/146083)
[2020-05-21 02:30:11] [INFO ] Computation of co-enabling matrix(816/1135) took 481931 ms. Total solver calls (SAT/UNSAT): 156793(10213/146580)
[2020-05-21 02:30:15] [INFO ] Computation of co-enabling matrix(822/1135) took 485495 ms. Total solver calls (SAT/UNSAT): 157351(10280/147071)
[2020-05-21 02:30:18] [INFO ] Computation of co-enabling matrix(826/1135) took 488501 ms. Total solver calls (SAT/UNSAT): 157689(10317/147372)
[2020-05-21 02:30:21] [INFO ] Computation of co-enabling matrix(837/1135) took 491532 ms. Total solver calls (SAT/UNSAT): 158469(10377/148092)
[2020-05-21 02:30:24] [INFO ] Computation of co-enabling matrix(866/1135) took 494612 ms. Total solver calls (SAT/UNSAT): 160416(10485/149931)
[2020-05-21 02:30:27] [INFO ] Computation of co-enabling matrix(876/1135) took 497668 ms. Total solver calls (SAT/UNSAT): 161368(10524/150844)
[2020-05-21 02:30:30] [INFO ] Computation of co-enabling matrix(894/1135) took 500689 ms. Total solver calls (SAT/UNSAT): 162509(10561/151948)
[2020-05-21 02:30:33] [INFO ] Computation of co-enabling matrix(914/1135) took 504161 ms. Total solver calls (SAT/UNSAT): 163678(10608/153070)
[2020-05-21 02:30:36] [INFO ] Computation of co-enabling matrix(922/1135) took 507212 ms. Total solver calls (SAT/UNSAT): 164319(10651/153668)
[2020-05-21 02:30:39] [INFO ] Computation of co-enabling matrix(948/1135) took 510335 ms. Total solver calls (SAT/UNSAT): 165440(10694/154746)
[2020-05-21 02:30:42] [INFO ] Computation of co-enabling matrix(969/1135) took 513343 ms. Total solver calls (SAT/UNSAT): 166361(10748/155613)
[2020-05-21 02:30:46] [INFO ] Computation of co-enabling matrix(1009/1135) took 516487 ms. Total solver calls (SAT/UNSAT): 168025(10869/157156)
[2020-05-21 02:30:49] [INFO ] Computation of co-enabling matrix(1026/1135) took 519596 ms. Total solver calls (SAT/UNSAT): 168934(10920/158014)
[2020-05-21 02:30:52] [INFO ] Computation of co-enabling matrix(1052/1135) took 522623 ms. Total solver calls (SAT/UNSAT): 169985(11026/158959)
[2020-05-21 02:30:57] [INFO ] Computation of co-enabling matrix(1076/1135) took 527756 ms. Total solver calls (SAT/UNSAT): 170909(11080/159829)
[2020-05-21 02:31:04] [INFO ] Computation of co-enabling matrix(1079/1135) took 534452 ms. Total solver calls (SAT/UNSAT): 171044(11109/159935)
[2020-05-21 02:31:07] [INFO ] Computation of co-enabling matrix(1080/1135) took 537836 ms. Total solver calls (SAT/UNSAT): 171082(11137/159945)
[2020-05-21 02:31:12] [INFO ] Computation of co-enabling matrix(1082/1135) took 543228 ms. Total solver calls (SAT/UNSAT): 171169(11191/159978)
[2020-05-21 02:31:17] [INFO ] Computation of co-enabling matrix(1085/1135) took 548025 ms. Total solver calls (SAT/UNSAT): 171267(11264/160003)
[2020-05-21 02:31:25] [INFO ] Computation of co-enabling matrix(1087/1135) took 556028 ms. Total solver calls (SAT/UNSAT): 171335(11310/160025)
[2020-05-21 02:31:31] [INFO ] Computation of co-enabling matrix(1089/1135) took 561474 ms. Total solver calls (SAT/UNSAT): 171394(11352/160042)
[2020-05-21 02:31:34] [INFO ] Computation of co-enabling matrix(1091/1135) took 565135 ms. Total solver calls (SAT/UNSAT): 171454(11390/160064)
[2020-05-21 02:31:38] [INFO ] Computation of co-enabling matrix(1094/1135) took 569302 ms. Total solver calls (SAT/UNSAT): 171534(11442/160092)
[2020-05-21 02:31:44] [INFO ] Computation of co-enabling matrix(1099/1135) took 574911 ms. Total solver calls (SAT/UNSAT): 171638(11509/160129)
[2020-05-21 02:31:46] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-13(UNSAT) depth K=4 took 293988 ms
[2020-05-21 02:31:48] [INFO ] Computation of co-enabling matrix(1101/1135) took 579048 ms. Total solver calls (SAT/UNSAT): 171678(11531/160147)
[2020-05-21 02:31:52] [INFO ] Computation of co-enabling matrix(1107/1135) took 583129 ms. Total solver calls (SAT/UNSAT): 171765(11575/160190)
[2020-05-21 02:31:54] [INFO ] Computation of Finished co-enabling matrix. took 584739 ms. Total solver calls (SAT/UNSAT): 171888(11592/160296)
[2020-05-21 02:31:54] [INFO ] Computing Do-Not-Accords matrix : 1135 transitions.
[2020-05-21 02:31:54] [INFO ] Computation of Completed DNA matrix. took 238 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 02:31:54] [INFO ] Built C files in 588799ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
Compilation finished in 13177 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 78 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, PetersonPT6ReachabilityFireability08==true], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, PetersonPT6ReachabilityFireability08==true], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, PetersonPT6ReachabilityFireability08==true], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-21 02:33:19] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-15(UNSAT) depth K=4 took 92187 ms
[2020-05-21 02:35:52] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityFireability-15
[2020-05-21 02:35:52] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityFireability-15(SAT) depth K=3 took 392127 ms
[2020-05-21 02:36:33] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-08(UNSAT) depth K=5 took 193906 ms
SDD proceeding with computation, new max is 2097152
[2020-05-21 02:41:45] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-09(UNSAT) depth K=5 took 312759 ms
[2020-05-21 02:43:54] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-13(UNSAT) depth K=5 took 128220 ms
[2020-05-21 02:44:08] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityFireability-08
[2020-05-21 02:44:08] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityFireability-08(SAT) depth K=4 took 496372 ms
Detected timeout of ITS tools.
[2020-05-21 02:46:33] [INFO ] Flatten gal took : 121 ms
[2020-05-21 02:46:33] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityFireability.pnml.gal : 18 ms
[2020-05-21 02:46:33] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityFireability.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/ReachabilityFireability.pnml.gal, -t, CGAL, -reachable-file, ReachabilityFireability.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/ReachabilityFireability.pnml.gal -t CGAL -reachable-file ReachabilityFireability.prop --nowitness --gen-order FOLLOW
Loading property file ReachabilityFireability.prop.
Read [reachable] property : Peterson-PT-6-ReachabilityFireability-08 with value :((TestIdentity_1_2_1<1)&&(TestIdentity_2_5_3>=1))
Read [reachable] property : Peterson-PT-6-ReachabilityFireability-09 with value :((((WantSection_3_T>=1)&&(TestAlone_4_5_3>=1))&&((BeginLoop_1_3_1<1)||((WantSection_1_T>=1)&&(TestAlone_3_4_1>=1))))&&(((IsEndLoop_3_0_0<1)||(WantSection_0_T<1))||(TestAlone_1_0_0<1)))
Read [reachable] property : Peterson-PT-6-ReachabilityFireability-13 with value :((BeginLoop_2_2_6>=1)&&(((((TestTurn_2_2<1)||(Turn_2_1<1))||(IsEndLoop_0_2_3>=1))||(TestIdentity_6_4_0>=1))||((WantSection_5_T>=1)&&(TestAlone_2_2_5>=1))))
Read [reachable] property : Peterson-PT-6-ReachabilityFireability-15 with value :((((((Turn_2_2>=1)&&(AskForSection_5_2>=1))&&(TestIdentity_4_1_3>=1))&&((WantSection_2_T<1)||(TestAlone_6_3_2<1)))&&((WantSection_6_T<1)||(TestAlone_2_4_6<1)))||((((((TestIdentity_3_3_0<1)&&(TestTurn_5_5>=1))&&(Turn_5_2>=1))&&(BeginLoop_6_5_5>=1))&&(((Turn_2_6>=1)&&(AskForSection_1_2>=1))||((WantSection_6_T>=1)&&(TestAlone_5_2_6>=1))))&&((TestIdentity_6_3_4>=1)||((TestTurn_0_4>=1)&&(Turn_4_5>=1)))))
SDD proceeding with computation, new max is 4
SDD proceeding with computation, new max is 8
SDD proceeding with computation, new max is 16
SDD proceeding with computation, new max is 32
SDD proceeding with computation, new max is 64
SDD proceeding with computation, new max is 128
SDD proceeding with computation, new max is 256
SDD proceeding with computation, new max is 512
SDD proceeding with computation, new max is 1024
SDD proceeding with computation, new max is 2048
SDD proceeding with computation, new max is 4096
SDD proceeding with computation, new max is 8192
SDD proceeding with computation, new max is 16384
SDD proceeding with computation, new max is 32768
SDD proceeding with computation, new max is 65536
[2020-05-21 02:47:45] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-15(UNSAT) depth K=5 took 231961 ms
[2020-05-21 02:48:39] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityFireability-09
[2020-05-21 02:48:39] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityFireability-09(SAT) depth K=4 took 271149 ms
SDD proceeding with computation, new max is 131072
[2020-05-21 02:50:39] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityFireability-13
[2020-05-21 02:50:39] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityFireability-13(SAT) depth K=4 took 120116 ms
SDD proceeding with computation, new max is 262144
[2020-05-21 02:51:25] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityFireability-15
[2020-05-21 02:51:25] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityFireability-15(SAT) depth K=4 took 45426 ms
[2020-05-21 02:55:20] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityFireability-08
[2020-05-21 02:55:20] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityFireability-08(SAT) depth K=5 took 234825 ms
SDD proceeding with computation, new max is 524288
[2020-05-21 03:04:28] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-08(UNSAT) depth K=6 took 1002886 ms
SDD proceeding with computation, new max is 1048576

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="Peterson-PT-6"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is Peterson-PT-6, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r111-csrt-158961258100743"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-6.tgz
mv Peterson-PT-6 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;