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-158961258100735.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-5, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-csrt-158961258100735
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 63K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 170K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 72K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 245K 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 54K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 165K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 30K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 99K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 49K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 50K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 169K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 22K 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 911K 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-5-ReachabilityFireability-00
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-01
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-02
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-03
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-04
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-05
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-06
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-07
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-08
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-09
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-10
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-11
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-12
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-13
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-14
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1590026290621

[2020-05-21 01:58:12] [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 01:58:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-21 01:58:13] [INFO ] Load time of PNML (sax parser for PT used): 222 ms
[2020-05-21 01:58:13] [INFO ] Transformed 834 places.
[2020-05-21 01:58:13] [INFO ] Transformed 1242 transitions.
[2020-05-21 01:58:13] [INFO ] Parsed PT model containing 834 places and 1242 transitions in 278 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 106 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-PT-5-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 195 ms. (steps per millisecond=51 ) properties seen :[0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0]
FORMULA Peterson-PT-5-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-5-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-5-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-5-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-5-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-5-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 152 ms. (steps per millisecond=65 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 367 ms. (steps per millisecond=27 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 87 ms. (steps per millisecond=114 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 1, 0]
FORMULA Peterson-PT-5-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 61 ms. (steps per millisecond=163 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
[2020-05-21 01:58:14] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2020-05-21 01:58:14] [INFO ] Computed 23 place invariants in 54 ms
[2020-05-21 01:58:14] [INFO ] [Real]Absence check using 17 positive place invariants in 52 ms returned sat
[2020-05-21 01:58:14] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 8 ms returned sat
[2020-05-21 01:58:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:58:17] [INFO ] [Real]Absence check using state equation in 2487 ms returned sat
[2020-05-21 01:58:17] [INFO ] State equation strengthened by 230 read => feed constraints.
[2020-05-21 01:58:17] [INFO ] [Real]Added 230 Read/Feed constraints in 81 ms returned sat
[2020-05-21 01:58:17] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:58:18] [INFO ] [Nat]Absence check using 17 positive place invariants in 157 ms returned sat
[2020-05-21 01:58:18] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 48 ms returned sat
[2020-05-21 01:58:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:58:20] [INFO ] [Nat]Absence check using state equation in 2380 ms returned sat
[2020-05-21 01:58:20] [INFO ] [Nat]Added 230 Read/Feed constraints in 187 ms returned sat
[2020-05-21 01:58:21] [INFO ] Deduced a trap composed of 141 places in 1013 ms
[2020-05-21 01:58:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1213 ms
[2020-05-21 01:58:22] [INFO ] Computed and/alt/rep : 1236/4722/1116 causal constraints in 172 ms.
[2020-05-21 01:58:22] [INFO ] Added : 30 causal constraints over 6 iterations in 648 ms. Result :(error "Solver has unexpectedly terminated")
[2020-05-21 01:58:22] [INFO ] [Real]Absence check using 17 positive place invariants in 58 ms returned sat
[2020-05-21 01:58:22] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 18 ms returned sat
[2020-05-21 01:58:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:58:26] [INFO ] [Real]Absence check using state equation in 3398 ms returned sat
[2020-05-21 01:58:26] [INFO ] [Real]Added 230 Read/Feed constraints in 90 ms returned sat
[2020-05-21 01:58:26] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:58:26] [INFO ] [Nat]Absence check using 17 positive place invariants in 80 ms returned sat
[2020-05-21 01:58:26] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 18 ms returned sat
[2020-05-21 01:58:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:58:30] [INFO ] [Nat]Absence check using state equation in 4021 ms returned sat
[2020-05-21 01:58:30] [INFO ] [Nat]Added 230 Read/Feed constraints in 86 ms returned sat
[2020-05-21 01:58:31] [INFO ] Deduced a trap composed of 15 places in 845 ms
[2020-05-21 01:58:31] [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 (> (+ s4 s210 s246 s383 s391 s422 s518 s582 s618 s724 s787 s798 s814 s817 s823) 0)") while checking expression at index 1
[2020-05-21 01:58:31] [INFO ] [Real]Absence check using 17 positive place invariants in 34 ms returned sat
[2020-05-21 01:58:31] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2020-05-21 01:58:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:58:33] [INFO ] [Real]Absence check using state equation in 1743 ms returned sat
[2020-05-21 01:58:33] [INFO ] [Real]Added 230 Read/Feed constraints in 69 ms returned sat
[2020-05-21 01:58:33] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:58:33] [INFO ] [Nat]Absence check using 17 positive place invariants in 35 ms returned sat
[2020-05-21 01:58:33] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2020-05-21 01:58:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:58:35] [INFO ] [Nat]Absence check using state equation in 1735 ms returned sat
[2020-05-21 01:58:35] [INFO ] [Nat]Added 230 Read/Feed constraints in 63 ms returned sat
[2020-05-21 01:58:36] [INFO ] Deduced a trap composed of 60 places in 616 ms
[2020-05-21 01:58:37] [INFO ] Deduced a trap composed of 39 places in 938 ms
[2020-05-21 01:58:38] [INFO ] Deduced a trap composed of 11 places in 1242 ms
[2020-05-21 01:58:40] [INFO ] Deduced a trap composed of 11 places in 1350 ms
[2020-05-21 01:58:40] [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 (> (+ s211 s384 s401 s532 s619 s724 s786 s803 s814 s817 s823) 0)") while checking expression at index 2
[2020-05-21 01:58:40] [INFO ] [Real]Absence check using 17 positive place invariants in 31 ms returned sat
[2020-05-21 01:58:40] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2020-05-21 01:58:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:58:42] [INFO ] [Real]Absence check using state equation in 1845 ms returned sat
[2020-05-21 01:58:42] [INFO ] [Real]Added 230 Read/Feed constraints in 56 ms returned sat
[2020-05-21 01:58:42] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:58:42] [INFO ] [Nat]Absence check using 17 positive place invariants in 31 ms returned sat
[2020-05-21 01:58:42] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2020-05-21 01:58:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:58:44] [INFO ] [Nat]Absence check using state equation in 1746 ms returned sat
[2020-05-21 01:58:44] [INFO ] [Nat]Added 230 Read/Feed constraints in 92 ms returned sat
[2020-05-21 01:58:44] [INFO ] Deduced a trap composed of 54 places in 410 ms
[2020-05-21 01:58:45] [INFO ] Deduced a trap composed of 11 places in 520 ms
[2020-05-21 01:58:45] [INFO ] Deduced a trap composed of 11 places in 409 ms
[2020-05-21 01:58:46] [INFO ] Deduced a trap composed of 11 places in 398 ms
[2020-05-21 01:58:46] [INFO ] Deduced a trap composed of 94 places in 430 ms
[2020-05-21 01:58:47] [INFO ] Deduced a trap composed of 46 places in 475 ms
[2020-05-21 01:58:47] [INFO ] Deduced a trap composed of 45 places in 373 ms
[2020-05-21 01:58:47] [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 (> (+ s2 s10 s30 s38 s66 s87 s119 s144 s176 s208 s216 s240 s248 s253 s261 s285 s342 s374 s388 s392 s393 s427 s435 s461 s484 s508 s520 s527 s558 s584 s591 s616 s623 s647 s671 s679 s711 s721 s743 s788 s794 s797 s818 s824 s827) 0)") while checking expression at index 3
[2020-05-21 01:58:47] [INFO ] [Real]Absence check using 17 positive place invariants in 27 ms returned sat
[2020-05-21 01:58:47] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2020-05-21 01:58:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:58:49] [INFO ] [Real]Absence check using state equation in 1689 ms returned sat
[2020-05-21 01:58:49] [INFO ] [Real]Added 230 Read/Feed constraints in 51 ms returned sat
[2020-05-21 01:58:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:58:49] [INFO ] [Nat]Absence check using 17 positive place invariants in 38 ms returned sat
[2020-05-21 01:58:49] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2020-05-21 01:58:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:58:51] [INFO ] [Nat]Absence check using state equation in 1855 ms returned sat
[2020-05-21 01:58:51] [INFO ] [Nat]Added 230 Read/Feed constraints in 78 ms returned sat
[2020-05-21 01:58:51] [INFO ] Deduced a trap composed of 41 places in 450 ms
[2020-05-21 01:58:52] [INFO ] Deduced a trap composed of 79 places in 425 ms
[2020-05-21 01:58:52] [INFO ] Deduced a trap composed of 75 places in 483 ms
[2020-05-21 01:58:53] [INFO ] Deduced a trap composed of 34 places in 491 ms
[2020-05-21 01:58:54] [INFO ] Deduced a trap composed of 53 places in 516 ms
[2020-05-21 01:58:54] [INFO ] Deduced a trap composed of 34 places in 468 ms
[2020-05-21 01:58:54] [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 (> (+ s174 s175 s176 s208 s210 s215 s216 s383 s388 s393 s396 s401 s518 s519 s520 s527 s615 s616 s618 s623 s721 s724 s781 s786 s793 s794 s796 s797 s798 s806 s818 s823 s824 s827) 0)") while checking expression at index 4
[2020-05-21 01:58:54] [INFO ] [Real]Absence check using 17 positive place invariants in 29 ms returned sat
[2020-05-21 01:58:54] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2020-05-21 01:58:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:58:56] [INFO ] [Real]Absence check using state equation in 2060 ms returned sat
[2020-05-21 01:58:56] [INFO ] [Real]Added 230 Read/Feed constraints in 40 ms returned sat
[2020-05-21 01:58:56] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:58:57] [INFO ] [Nat]Absence check using 17 positive place invariants in 40 ms returned sat
[2020-05-21 01:58:57] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2020-05-21 01:58:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:58:58] [INFO ] [Nat]Absence check using state equation in 1859 ms returned sat
[2020-05-21 01:58:59] [INFO ] [Nat]Added 230 Read/Feed constraints in 71 ms returned sat
[2020-05-21 01:58:59] [INFO ] Deduced a trap composed of 139 places in 810 ms
[2020-05-21 01:59:00] [INFO ] Deduced a trap composed of 93 places in 682 ms
[2020-05-21 01:59:01] [INFO ] Deduced a trap composed of 14 places in 572 ms
[2020-05-21 01:59:01] [INFO ] Deduced a trap composed of 11 places in 543 ms
[2020-05-21 01:59:02] [INFO ] Deduced a trap composed of 15 places in 676 ms
[2020-05-21 01:59: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 (> (+ s3 s209 s245 s391 s394 s421 s517 s581 s617 s724 s787 s798 s803 s814 s817) 0)") while checking expression at index 5
[2020-05-21 01:59:02] [INFO ] [Real]Absence check using 17 positive place invariants in 28 ms returned unsat
[2020-05-21 01:59:02] [INFO ] [Real]Absence check using 17 positive place invariants in 28 ms returned unsat
FORMULA Peterson-PT-5-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-5-ReachabilityFireability-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 486 out of 834 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 834/834 places, 1242/1242 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 834 transition count 1217
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 809 transition count 1217
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 50 place count 809 transition count 1211
Deduced a syphon composed of 6 places in 8 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 62 place count 803 transition count 1211
Applied a total of 62 rules in 243 ms. Remains 803 /834 variables (removed 31) and now considering 1211/1242 (removed 31) transitions.
Finished structural reductions, in 1 iterations. Remains : 803/834 places, 1211/1242 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 12467 ms. (steps per millisecond=80 ) properties seen :[0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 410900 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=82 ) properties seen :[0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 144809 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=28 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 2566 ms. (steps per millisecond=389 ) properties seen :[0, 0, 0, 0, 1, 0]
FORMULA Peterson-PT-5-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 2089 ms. (steps per millisecond=478 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1939 ms. (steps per millisecond=515 ) properties seen :[0, 0, 0, 0, 0]
[2020-05-21 01:59:32] [INFO ] Flow matrix only has 1091 transitions (discarded 120 similar events)
// Phase 1: matrix 1091 rows 803 cols
[2020-05-21 01:59:32] [INFO ] Computed 23 place invariants in 28 ms
[2020-05-21 01:59:32] [INFO ] [Real]Absence check using 17 positive place invariants in 33 ms returned sat
[2020-05-21 01:59:32] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2020-05-21 01:59:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:59:34] [INFO ] [Real]Absence check using state equation in 1982 ms returned sat
[2020-05-21 01:59:34] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:59:34] [INFO ] [Nat]Absence check using 17 positive place invariants in 38 ms returned sat
[2020-05-21 01:59:34] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2020-05-21 01:59:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:59:36] [INFO ] [Nat]Absence check using state equation in 1966 ms returned sat
[2020-05-21 01:59:36] [INFO ] State equation strengthened by 230 read => feed constraints.
[2020-05-21 01:59:36] [INFO ] [Nat]Added 230 Read/Feed constraints in 108 ms returned sat
[2020-05-21 01:59:36] [INFO ] Deduced a trap composed of 38 places in 225 ms
[2020-05-21 01:59:37] [INFO ] Deduced a trap composed of 55 places in 375 ms
[2020-05-21 01:59:37] [INFO ] Deduced a trap composed of 45 places in 543 ms
[2020-05-21 01:59:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1321 ms
[2020-05-21 01:59:38] [INFO ] Computed and/alt/rep : 1205/4691/1085 causal constraints in 72 ms.
[2020-05-21 01:59:58] [INFO ] Added : 920 causal constraints over 184 iterations in 20261 ms.(timeout) Result :sat
[2020-05-21 01:59:58] [INFO ] Deduced a trap composed of 42 places in 560 ms
[2020-05-21 01:59:59] [INFO ] Deduced a trap composed of 50 places in 460 ms
[2020-05-21 01:59:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1326 ms
Attempting to minimize the solution found.
Minimization took 70 ms.
[2020-05-21 01:59:59] [INFO ] [Real]Absence check using 17 positive place invariants in 55 ms returned sat
[2020-05-21 01:59:59] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 14 ms returned sat
[2020-05-21 01:59:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:00:02] [INFO ] [Real]Absence check using state equation in 3073 ms returned sat
[2020-05-21 02:00:02] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:00:03] [INFO ] [Nat]Absence check using 17 positive place invariants in 128 ms returned sat
[2020-05-21 02:00:03] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 11 ms returned sat
[2020-05-21 02:00:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:00:06] [INFO ] [Nat]Absence check using state equation in 2828 ms returned sat
[2020-05-21 02:00:06] [INFO ] [Nat]Added 230 Read/Feed constraints in 106 ms returned sat
[2020-05-21 02:00:06] [INFO ] Deduced a trap composed of 31 places in 551 ms
[2020-05-21 02:00:07] [INFO ] Deduced a trap composed of 11 places in 545 ms
[2020-05-21 02:00:07] [INFO ] Deduced a trap composed of 29 places in 577 ms
[2020-05-21 02:00:08] [INFO ] Deduced a trap composed of 69 places in 419 ms
[2020-05-21 02:00:08] [INFO ] Deduced a trap composed of 75 places in 448 ms
[2020-05-21 02:00:09] [INFO ] Deduced a trap composed of 55 places in 397 ms
[2020-05-21 02:00:09] [INFO ] Deduced a trap composed of 31 places in 439 ms
[2020-05-21 02:00:10] [INFO ] Deduced a trap composed of 55 places in 426 ms
[2020-05-21 02:00:10] [INFO ] Deduced a trap composed of 55 places in 429 ms
[2020-05-21 02:00:11] [INFO ] Deduced a trap composed of 31 places in 442 ms
[2020-05-21 02:00:11] [INFO ] Deduced a trap composed of 11 places in 470 ms
[2020-05-21 02:00:12] [INFO ] Deduced a trap composed of 75 places in 379 ms
[2020-05-21 02:00:12] [INFO ] Deduced a trap composed of 65 places in 384 ms
[2020-05-21 02:00:13] [INFO ] Deduced a trap composed of 91 places in 371 ms
[2020-05-21 02:00:13] [INFO ] Deduced a trap composed of 91 places in 356 ms
[2020-05-21 02:00:14] [INFO ] Deduced a trap composed of 65 places in 361 ms
[2020-05-21 02:00:14] [INFO ] Deduced a trap composed of 81 places in 365 ms
[2020-05-21 02:00:15] [INFO ] Deduced a trap composed of 11 places in 434 ms
[2020-05-21 02:00:15] [INFO ] Deduced a trap composed of 13 places in 433 ms
[2020-05-21 02:00:16] [INFO ] Deduced a trap composed of 11 places in 489 ms
[2020-05-21 02:00:16] [INFO ] Deduced a trap composed of 11 places in 456 ms
[2020-05-21 02:00:17] [INFO ] Deduced a trap composed of 211 places in 368 ms
[2020-05-21 02:00:17] [INFO ] Deduced a trap composed of 81 places in 369 ms
[2020-05-21 02:00:18] [INFO ] Deduced a trap composed of 81 places in 418 ms
[2020-05-21 02:00:18] [INFO ] Deduced a trap composed of 55 places in 380 ms
[2020-05-21 02:00:19] [INFO ] Deduced a trap composed of 50 places in 378 ms
[2020-05-21 02:00:19] [INFO ] Deduced a trap composed of 44 places in 386 ms
[2020-05-21 02:00:20] [INFO ] Deduced a trap composed of 67 places in 400 ms
[2020-05-21 02:00:21] [INFO ] Deduced a trap composed of 61 places in 382 ms
[2020-05-21 02:00:21] [INFO ] Deduced a trap composed of 81 places in 312 ms
[2020-05-21 02:00:21] [INFO ] Deduced a trap composed of 61 places in 481 ms
[2020-05-21 02:00:22] [INFO ] Deduced a trap composed of 44 places in 421 ms
[2020-05-21 02:00:23] [INFO ] Deduced a trap composed of 19 places in 496 ms
[2020-05-21 02:00:23] [INFO ] Deduced a trap composed of 40 places in 384 ms
[2020-05-21 02:00:24] [INFO ] Deduced a trap composed of 15 places in 482 ms
[2020-05-21 02:00:24] [INFO ] Deduced a trap composed of 15 places in 551 ms
[2020-05-21 02:00:25] [INFO ] Deduced a trap composed of 29 places in 486 ms
[2020-05-21 02:00:25] [INFO ] Deduced a trap composed of 52 places in 445 ms
[2020-05-21 02:00:26] [INFO ] Deduced a trap composed of 15 places in 456 ms
[2020-05-21 02:00:26] [INFO ] Deduced a trap composed of 40 places in 497 ms
[2020-05-21 02:00:27] [INFO ] Deduced a trap composed of 36 places in 397 ms
[2020-05-21 02:00:27] [INFO ] Deduced a trap composed of 55 places in 416 ms
[2020-05-21 02:00:28] [INFO ] Deduced a trap composed of 40 places in 392 ms
[2020-05-21 02:00:28] [INFO ] Deduced a trap composed of 23 places in 444 ms
[2020-05-21 02:00:29] [INFO ] Deduced a trap composed of 73 places in 459 ms
[2020-05-21 02:00:29] [INFO ] Deduced a trap composed of 57 places in 331 ms
[2020-05-21 02:00:30] [INFO ] Deduced a trap composed of 25 places in 554 ms
[2020-05-21 02:00:30] [INFO ] Deduced a trap composed of 130 places in 484 ms
[2020-05-21 02:00:31] [INFO ] Deduced a trap composed of 58 places in 430 ms
[2020-05-21 02:00:31] [INFO ] Deduced a trap composed of 17 places in 456 ms
[2020-05-21 02:00:32] [INFO ] Deduced a trap composed of 36 places in 407 ms
[2020-05-21 02:00:32] [INFO ] Deduced a trap composed of 123 places in 336 ms
[2020-05-21 02:00:33] [INFO ] Deduced a trap composed of 123 places in 368 ms
[2020-05-21 02:00:33] [INFO ] Deduced a trap composed of 121 places in 339 ms
[2020-05-21 02:00:33] [INFO ] Deduced a trap composed of 121 places in 295 ms
[2020-05-21 02:00:33] [INFO ] Trap strengthening (SAT) tested/added 56/55 trap constraints in 27856 ms
[2020-05-21 02:00:34] [INFO ] Computed and/alt/rep : 1205/4691/1085 causal constraints in 72 ms.
[2020-05-21 02:00:47] [INFO ] Added : 725 causal constraints over 145 iterations in 13985 ms. Result :(error "Failed to check-sat")
[2020-05-21 02:00:48] [INFO ] [Real]Absence check using 17 positive place invariants in 27 ms returned sat
[2020-05-21 02:00:48] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2020-05-21 02:00:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:00:49] [INFO ] [Real]Absence check using state equation in 1820 ms returned sat
[2020-05-21 02:00:50] [INFO ] [Real]Added 230 Read/Feed constraints in 57 ms returned sat
[2020-05-21 02:00:50] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:00:50] [INFO ] [Nat]Absence check using 17 positive place invariants in 28 ms returned sat
[2020-05-21 02:00:50] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2020-05-21 02:00:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:00:52] [INFO ] [Nat]Absence check using state equation in 1781 ms returned sat
[2020-05-21 02:00:52] [INFO ] [Nat]Added 230 Read/Feed constraints in 67 ms returned sat
[2020-05-21 02:00:52] [INFO ] Deduced a trap composed of 41 places in 505 ms
[2020-05-21 02:00:53] [INFO ] Deduced a trap composed of 40 places in 502 ms
[2020-05-21 02:00:53] [INFO ] Deduced a trap composed of 40 places in 475 ms
[2020-05-21 02:00:54] [INFO ] Deduced a trap composed of 55 places in 490 ms
[2020-05-21 02:00:54] [INFO ] Deduced a trap composed of 40 places in 548 ms
[2020-05-21 02:00:55] [INFO ] Deduced a trap composed of 36 places in 472 ms
[2020-05-21 02:00:55] [INFO ] Deduced a trap composed of 74 places in 521 ms
[2020-05-21 02:00:56] [INFO ] Deduced a trap composed of 50 places in 587 ms
[2020-05-21 02:00:57] [INFO ] Deduced a trap composed of 237 places in 447 ms
[2020-05-21 02:00:57] [INFO ] Deduced a trap composed of 158 places in 460 ms
[2020-05-21 02:00:58] [INFO ] Deduced a trap composed of 87 places in 419 ms
[2020-05-21 02:00:58] [INFO ] Deduced a trap composed of 25 places in 582 ms
[2020-05-21 02:00:59] [INFO ] Deduced a trap composed of 62 places in 486 ms
[2020-05-21 02:00:59] [INFO ] Deduced a trap composed of 50 places in 510 ms
[2020-05-21 02:01:00] [INFO ] Deduced a trap composed of 13 places in 434 ms
[2020-05-21 02:01:00] [INFO ] Deduced a trap composed of 15 places in 467 ms
[2020-05-21 02:01:01] [INFO ] Deduced a trap composed of 233 places in 461 ms
[2020-05-21 02:01:01] [INFO ] Deduced a trap composed of 231 places in 522 ms
[2020-05-21 02:01:02] [INFO ] Deduced a trap composed of 231 places in 540 ms
[2020-05-21 02:01:03] [INFO ] Deduced a trap composed of 25 places in 549 ms
[2020-05-21 02:01:03] [INFO ] Deduced a trap composed of 65 places in 433 ms
[2020-05-21 02:01:04] [INFO ] Deduced a trap composed of 65 places in 404 ms
[2020-05-21 02:01:04] [INFO ] Deduced a trap composed of 90 places in 432 ms
[2020-05-21 02:01:04] [INFO ] Deduced a trap composed of 233 places in 413 ms
[2020-05-21 02:01:05] [INFO ] Deduced a trap composed of 90 places in 427 ms
[2020-05-21 02:01:05] [INFO ] Deduced a trap composed of 107 places in 456 ms
[2020-05-21 02:01:06] [INFO ] Deduced a trap composed of 11 places in 425 ms
[2020-05-21 02:01:06] [INFO ] Deduced a trap composed of 27 places in 438 ms
[2020-05-21 02:01:07] [INFO ] Deduced a trap composed of 75 places in 365 ms
[2020-05-21 02:01:07] [INFO ] Deduced a trap composed of 88 places in 314 ms
[2020-05-21 02:01:08] [INFO ] Deduced a trap composed of 101 places in 334 ms
[2020-05-21 02:01:08] [INFO ] Deduced a trap composed of 110 places in 327 ms
[2020-05-21 02:01:08] [INFO ] Deduced a trap composed of 119 places in 362 ms
[2020-05-21 02:01:09] [INFO ] Deduced a trap composed of 86 places in 416 ms
[2020-05-21 02:01:09] [INFO ] Deduced a trap composed of 86 places in 396 ms
[2020-05-21 02:01:10] [INFO ] Deduced a trap composed of 29 places in 355 ms
[2020-05-21 02:01:10] [INFO ] Deduced a trap composed of 38 places in 543 ms
[2020-05-21 02:01:11] [INFO ] Deduced a trap composed of 63 places in 427 ms
[2020-05-21 02:01:11] [INFO ] Deduced a trap composed of 31 places in 428 ms
[2020-05-21 02:01:12] [INFO ] Deduced a trap composed of 136 places in 362 ms
[2020-05-21 02:01:12] [INFO ] Deduced a trap composed of 66 places in 372 ms
[2020-05-21 02:01:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 41 trap constraints in 20661 ms
[2020-05-21 02:01:12] [INFO ] [Real]Absence check using 17 positive place invariants in 25 ms returned sat
[2020-05-21 02:01:12] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2020-05-21 02:01:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:01:14] [INFO ] [Real]Absence check using state equation in 1636 ms returned sat
[2020-05-21 02:01:14] [INFO ] [Real]Added 230 Read/Feed constraints in 44 ms returned sat
[2020-05-21 02:01:14] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:01:14] [INFO ] [Nat]Absence check using 17 positive place invariants in 28 ms returned sat
[2020-05-21 02:01:14] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 8 ms returned sat
[2020-05-21 02:01:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:01:16] [INFO ] [Nat]Absence check using state equation in 1753 ms returned sat
[2020-05-21 02:01:16] [INFO ] [Nat]Added 230 Read/Feed constraints in 88 ms returned sat
[2020-05-21 02:01:17] [INFO ] Deduced a trap composed of 11 places in 414 ms
[2020-05-21 02:01:17] [INFO ] Deduced a trap composed of 11 places in 419 ms
[2020-05-21 02:01:18] [INFO ] Deduced a trap composed of 11 places in 478 ms
[2020-05-21 02:01:18] [INFO ] Deduced a trap composed of 55 places in 409 ms
[2020-05-21 02:01:18] [INFO ] Deduced a trap composed of 55 places in 423 ms
[2020-05-21 02:01:19] [INFO ] Deduced a trap composed of 36 places in 387 ms
[2020-05-21 02:01:19] [INFO ] Deduced a trap composed of 43 places in 382 ms
[2020-05-21 02:01:20] [INFO ] Deduced a trap composed of 29 places in 414 ms
[2020-05-21 02:01:20] [INFO ] Deduced a trap composed of 55 places in 522 ms
[2020-05-21 02:01:21] [INFO ] Deduced a trap composed of 15 places in 434 ms
[2020-05-21 02:01:21] [INFO ] Deduced a trap composed of 13 places in 432 ms
[2020-05-21 02:01:22] [INFO ] Deduced a trap composed of 48 places in 414 ms
[2020-05-21 02:01:22] [INFO ] Deduced a trap composed of 40 places in 406 ms
[2020-05-21 02:01:23] [INFO ] Deduced a trap composed of 31 places in 378 ms
[2020-05-21 02:01:23] [INFO ] Deduced a trap composed of 17 places in 480 ms
[2020-05-21 02:01:24] [INFO ] Deduced a trap composed of 113 places in 464 ms
[2020-05-21 02:01:24] [INFO ] Deduced a trap composed of 65 places in 461 ms
[2020-05-21 02:01:25] [INFO ] Deduced a trap composed of 49 places in 417 ms
[2020-05-21 02:01:25] [INFO ] Deduced a trap composed of 69 places in 426 ms
[2020-05-21 02:01:26] [INFO ] Deduced a trap composed of 55 places in 412 ms
[2020-05-21 02:01:26] [INFO ] Deduced a trap composed of 55 places in 364 ms
[2020-05-21 02:01:26] [INFO ] Deduced a trap composed of 55 places in 413 ms
[2020-05-21 02:01:27] [INFO ] Deduced a trap composed of 41 places in 415 ms
[2020-05-21 02:01:27] [INFO ] Deduced a trap composed of 41 places in 407 ms
[2020-05-21 02:01:28] [INFO ] Deduced a trap composed of 55 places in 436 ms
[2020-05-21 02:01:28] [INFO ] Deduced a trap composed of 55 places in 431 ms
[2020-05-21 02:01:29] [INFO ] Deduced a trap composed of 87 places in 427 ms
[2020-05-21 02:01:29] [INFO ] Deduced a trap composed of 52 places in 452 ms
[2020-05-21 02:01:30] [INFO ] Deduced a trap composed of 75 places in 430 ms
[2020-05-21 02:01:30] [INFO ] Deduced a trap composed of 55 places in 439 ms
[2020-05-21 02:01:31] [INFO ] Deduced a trap composed of 27 places in 491 ms
[2020-05-21 02:01:31] [INFO ] Deduced a trap composed of 27 places in 452 ms
[2020-05-21 02:01:32] [INFO ] Deduced a trap composed of 39 places in 451 ms
[2020-05-21 02:01:32] [INFO ] Deduced a trap composed of 50 places in 487 ms
[2020-05-21 02:01:33] [INFO ] Deduced a trap composed of 77 places in 472 ms
[2020-05-21 02:01:33] [INFO ] Deduced a trap composed of 117 places in 374 ms
[2020-05-21 02:01:34] [INFO ] Deduced a trap composed of 55 places in 254 ms
[2020-05-21 02:01:34] [INFO ] Deduced a trap composed of 61 places in 408 ms
[2020-05-21 02:01:34] [INFO ] Deduced a trap composed of 57 places in 327 ms
[2020-05-21 02:01:35] [INFO ] Deduced a trap composed of 78 places in 450 ms
[2020-05-21 02:01:35] [INFO ] Deduced a trap composed of 69 places in 253 ms
[2020-05-21 02:01:36] [INFO ] Deduced a trap composed of 69 places in 225 ms
[2020-05-21 02:01:36] [INFO ] Deduced a trap composed of 69 places in 235 ms
[2020-05-21 02:01:36] [INFO ] Deduced a trap composed of 69 places in 251 ms
[2020-05-21 02:01:37] [INFO ] Deduced a trap composed of 113 places in 247 ms
[2020-05-21 02:01:37] [INFO ] Trap strengthening (SAT) tested/added 46/45 trap constraints in 20493 ms
[2020-05-21 02:01:37] [INFO ] Computed and/alt/rep : 1205/4691/1085 causal constraints in 62 ms.
[2020-05-21 02:01:58] [INFO ] Added : 965 causal constraints over 193 iterations in 21037 ms.(timeout) Result :sat
[2020-05-21 02:01:58] [INFO ] Deduced a trap composed of 61 places in 347 ms
[2020-05-21 02:01:59] [INFO ] Deduced a trap composed of 63 places in 276 ms
[2020-05-21 02:01:59] [INFO ] Deduced a trap composed of 65 places in 323 ms
[2020-05-21 02:02:00] [INFO ] Deduced a trap composed of 2 places in 634 ms
[2020-05-21 02:02:00] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s403 s779) 0)") while checking expression at index 3
[2020-05-21 02:02:00] [INFO ] [Real]Absence check using 17 positive place invariants in 25 ms returned sat
[2020-05-21 02:02:00] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2020-05-21 02:02:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:02:02] [INFO ] [Real]Absence check using state equation in 1661 ms returned sat
[2020-05-21 02:02:02] [INFO ] [Real]Added 230 Read/Feed constraints in 46 ms returned sat
[2020-05-21 02:02:02] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:02:02] [INFO ] [Nat]Absence check using 17 positive place invariants in 36 ms returned sat
[2020-05-21 02:02:02] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2020-05-21 02:02:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:02:04] [INFO ] [Nat]Absence check using state equation in 1695 ms returned sat
[2020-05-21 02:02:04] [INFO ] [Nat]Added 230 Read/Feed constraints in 61 ms returned sat
[2020-05-21 02:02:04] [INFO ] Deduced a trap composed of 119 places in 501 ms
[2020-05-21 02:02:05] [INFO ] Deduced a trap composed of 32 places in 502 ms
[2020-05-21 02:02:05] [INFO ] Deduced a trap composed of 32 places in 514 ms
[2020-05-21 02:02:06] [INFO ] Deduced a trap composed of 53 places in 466 ms
[2020-05-21 02:02:06] [INFO ] Deduced a trap composed of 11 places in 487 ms
[2020-05-21 02:02:07] [INFO ] Deduced a trap composed of 53 places in 469 ms
[2020-05-21 02:02:07] [INFO ] Deduced a trap composed of 53 places in 466 ms
[2020-05-21 02:02:08] [INFO ] Deduced a trap composed of 53 places in 504 ms
[2020-05-21 02:02:08] [INFO ] Deduced a trap composed of 53 places in 493 ms
[2020-05-21 02:02:09] [INFO ] Deduced a trap composed of 32 places in 482 ms
[2020-05-21 02:02:09] [INFO ] Deduced a trap composed of 32 places in 463 ms
[2020-05-21 02:02:10] [INFO ] Deduced a trap composed of 32 places in 467 ms
[2020-05-21 02:02:11] [INFO ] Deduced a trap composed of 32 places in 519 ms
[2020-05-21 02:02:11] [INFO ] Deduced a trap composed of 55 places in 518 ms
[2020-05-21 02:02:12] [INFO ] Deduced a trap composed of 55 places in 504 ms
[2020-05-21 02:02:12] [INFO ] Deduced a trap composed of 55 places in 527 ms
[2020-05-21 02:02:13] [INFO ] Deduced a trap composed of 55 places in 631 ms
[2020-05-21 02:02:13] [INFO ] Deduced a trap composed of 55 places in 488 ms
[2020-05-21 02:02:14] [INFO ] Deduced a trap composed of 47 places in 450 ms
[2020-05-21 02:02:15] [INFO ] Deduced a trap composed of 47 places in 456 ms
[2020-05-21 02:02:15] [INFO ] Deduced a trap composed of 47 places in 489 ms
[2020-05-21 02:02:16] [INFO ] Deduced a trap composed of 47 places in 448 ms
[2020-05-21 02:02:16] [INFO ] Deduced a trap composed of 47 places in 454 ms
[2020-05-21 02:02:17] [INFO ] Deduced a trap composed of 39 places in 410 ms
[2020-05-21 02:02:17] [INFO ] Deduced a trap composed of 55 places in 412 ms
[2020-05-21 02:02:18] [INFO ] Deduced a trap composed of 41 places in 447 ms
[2020-05-21 02:02:18] [INFO ] Deduced a trap composed of 27 places in 456 ms
[2020-05-21 02:02:19] [INFO ] Deduced a trap composed of 55 places in 429 ms
[2020-05-21 02:02:19] [INFO ] Deduced a trap composed of 41 places in 438 ms
[2020-05-21 02:02:19] [INFO ] Deduced a trap composed of 65 places in 438 ms
[2020-05-21 02:02:20] [INFO ] Deduced a trap composed of 31 places in 412 ms
[2020-05-21 02:02:20] [INFO ] Deduced a trap composed of 40 places in 410 ms
[2020-05-21 02:02:21] [INFO ] Deduced a trap composed of 29 places in 470 ms
[2020-05-21 02:02:21] [INFO ] Deduced a trap composed of 65 places in 464 ms
[2020-05-21 02:02:22] [INFO ] Deduced a trap composed of 41 places in 425 ms
[2020-05-21 02:02:22] [INFO ] Deduced a trap composed of 101 places in 375 ms
[2020-05-21 02:02:23] [INFO ] Deduced a trap composed of 27 places in 421 ms
[2020-05-21 02:02:23] [INFO ] Deduced a trap composed of 27 places in 425 ms
[2020-05-21 02:02:24] [INFO ] Deduced a trap composed of 27 places in 358 ms
[2020-05-21 02:02:24] [INFO ] Deduced a trap composed of 115 places in 265 ms
[2020-05-21 02:02:24] [INFO ] Deduced a trap composed of 115 places in 260 ms
[2020-05-21 02:02:25] [INFO ] Deduced a trap composed of 115 places in 309 ms
[2020-05-21 02:02:25] [INFO ] Deduced a trap composed of 115 places in 239 ms
[2020-05-21 02:02:25] [INFO ] Trap strengthening (SAT) tested/added 44/43 trap constraints in 21445 ms
[2020-05-21 02:02:25] [INFO ] Computed and/alt/rep : 1205/4691/1085 causal constraints in 55 ms.
[2020-05-21 02:02:45] [INFO ] Added : 990 causal constraints over 198 iterations in 20209 ms.(timeout) Result :sat
[2020-05-21 02:02:46] [INFO ] Deduced a trap composed of 29 places in 511 ms
[2020-05-21 02:02:46] [INFO ] Deduced a trap composed of 13 places in 486 ms
[2020-05-21 02:02:47] [INFO ] Deduced a trap composed of 11 places in 417 ms
[2020-05-21 02:02:47] [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 (> (+ s211 s384 s401 s532 s613 s704 s760 s777 s788 s791 s797) 0)") while checking expression at index 4
FORMULA Peterson-PT-5-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 339700 steps, including 1000 resets, run finished after 4245 ms. (steps per millisecond=80 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 482 out of 803 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 803/803 places, 1211/1211 transitions.
Applied a total of 0 rules in 36 ms. Remains 803 /803 variables (removed 0) and now considering 1211/1211 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 803/803 places, 1211/1211 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 11651 ms. (steps per millisecond=85 ) properties seen :[0, 0, 0, 0]
Interrupted Best-First random walk after 388423 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=77 ) properties seen :[0, 0, 0, 0]
Interrupted Best-First random walk after 137809 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=27 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1911 ms. (steps per millisecond=523 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1970 ms. (steps per millisecond=507 ) properties seen :[0, 0, 0, 0]
Interrupted probabilistic random walk after 4921308 steps, run timeout after 30001 ms. (steps per millisecond=164 ) properties seen :[0, 0, 0, 0]
Probabilistic random walk after 4921308 steps, saw 703045 distinct states, run finished after 30001 ms. (steps per millisecond=164 ) properties seen :[0, 0, 0, 0]
[2020-05-21 02:03:47] [INFO ] Flow matrix only has 1091 transitions (discarded 120 similar events)
// Phase 1: matrix 1091 rows 803 cols
[2020-05-21 02:03:47] [INFO ] Computed 23 place invariants in 6 ms
[2020-05-21 02:03:47] [INFO ] [Real]Absence check using 17 positive place invariants in 33 ms returned sat
[2020-05-21 02:03:47] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2020-05-21 02:03:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:03:49] [INFO ] [Real]Absence check using state equation in 2016 ms returned sat
[2020-05-21 02:03:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:03:49] [INFO ] [Nat]Absence check using 17 positive place invariants in 38 ms returned sat
[2020-05-21 02:03:49] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2020-05-21 02:03:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:03:51] [INFO ] [Nat]Absence check using state equation in 1927 ms returned sat
[2020-05-21 02:03:51] [INFO ] State equation strengthened by 230 read => feed constraints.
[2020-05-21 02:03:51] [INFO ] [Nat]Added 230 Read/Feed constraints in 109 ms returned sat
[2020-05-21 02:03:51] [INFO ] Deduced a trap composed of 38 places in 202 ms
[2020-05-21 02:03:52] [INFO ] Deduced a trap composed of 55 places in 379 ms
[2020-05-21 02:03:52] [INFO ] Deduced a trap composed of 45 places in 433 ms
[2020-05-21 02:03:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1228 ms
[2020-05-21 02:03:52] [INFO ] Computed and/alt/rep : 1205/4691/1085 causal constraints in 57 ms.
[2020-05-21 02:04:12] [INFO ] Added : 981 causal constraints over 197 iterations in 19537 ms. Result :sat
[2020-05-21 02:04:12] [INFO ] Deduced a trap composed of 42 places in 417 ms
[2020-05-21 02:04:13] [INFO ] Deduced a trap composed of 50 places in 435 ms
[2020-05-21 02:04:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1189 ms
Attempting to minimize the solution found.
Minimization took 69 ms.
[2020-05-21 02:04:13] [INFO ] [Real]Absence check using 17 positive place invariants in 72 ms returned sat
[2020-05-21 02:04:13] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 13 ms returned sat
[2020-05-21 02:04:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:04:16] [INFO ] [Real]Absence check using state equation in 2958 ms returned sat
[2020-05-21 02:04:16] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:04:17] [INFO ] [Nat]Absence check using 17 positive place invariants in 81 ms returned sat
[2020-05-21 02:04:17] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 10 ms returned sat
[2020-05-21 02:04:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:04:19] [INFO ] [Nat]Absence check using state equation in 2638 ms returned sat
[2020-05-21 02:04:19] [INFO ] [Nat]Added 230 Read/Feed constraints in 70 ms returned sat
[2020-05-21 02:04:20] [INFO ] Deduced a trap composed of 31 places in 501 ms
[2020-05-21 02:04:20] [INFO ] Deduced a trap composed of 11 places in 555 ms
[2020-05-21 02:04:21] [INFO ] Deduced a trap composed of 29 places in 511 ms
[2020-05-21 02:04:21] [INFO ] Deduced a trap composed of 69 places in 480 ms
[2020-05-21 02:04:22] [INFO ] Deduced a trap composed of 75 places in 482 ms
[2020-05-21 02:04:23] [INFO ] Deduced a trap composed of 55 places in 423 ms
[2020-05-21 02:04:23] [INFO ] Deduced a trap composed of 31 places in 436 ms
[2020-05-21 02:04:24] [INFO ] Deduced a trap composed of 55 places in 443 ms
[2020-05-21 02:04:24] [INFO ] Deduced a trap composed of 55 places in 433 ms
[2020-05-21 02:04:25] [INFO ] Deduced a trap composed of 31 places in 467 ms
[2020-05-21 02:04:25] [INFO ] Deduced a trap composed of 11 places in 441 ms
[2020-05-21 02:04:26] [INFO ] Deduced a trap composed of 75 places in 425 ms
[2020-05-21 02:04:26] [INFO ] Deduced a trap composed of 65 places in 392 ms
[2020-05-21 02:04:26] [INFO ] Deduced a trap composed of 91 places in 378 ms
[2020-05-21 02:04:27] [INFO ] Deduced a trap composed of 91 places in 463 ms
[2020-05-21 02:04:27] [INFO ] Deduced a trap composed of 65 places in 398 ms
[2020-05-21 02:04:28] [INFO ] Deduced a trap composed of 81 places in 458 ms
[2020-05-21 02:04:29] [INFO ] Deduced a trap composed of 11 places in 989 ms
[2020-05-21 02:04:30] [INFO ] Deduced a trap composed of 13 places in 476 ms
[2020-05-21 02:04:30] [INFO ] Deduced a trap composed of 11 places in 507 ms
[2020-05-21 02:04:31] [INFO ] Deduced a trap composed of 11 places in 484 ms
[2020-05-21 02:04:32] [INFO ] Deduced a trap composed of 211 places in 443 ms
[2020-05-21 02:04:32] [INFO ] Deduced a trap composed of 81 places in 459 ms
[2020-05-21 02:04:33] [INFO ] Deduced a trap composed of 81 places in 480 ms
[2020-05-21 02:04:33] [INFO ] Deduced a trap composed of 55 places in 350 ms
[2020-05-21 02:04:34] [INFO ] Deduced a trap composed of 50 places in 337 ms
[2020-05-21 02:04:34] [INFO ] Deduced a trap composed of 44 places in 455 ms
[2020-05-21 02:04:35] [INFO ] Deduced a trap composed of 67 places in 407 ms
[2020-05-21 02:04:35] [INFO ] Deduced a trap composed of 61 places in 348 ms
[2020-05-21 02:04:36] [INFO ] Deduced a trap composed of 81 places in 399 ms
[2020-05-21 02:04:36] [INFO ] Deduced a trap composed of 61 places in 435 ms
[2020-05-21 02:04:37] [INFO ] Deduced a trap composed of 44 places in 422 ms
[2020-05-21 02:04:37] [INFO ] Deduced a trap composed of 19 places in 462 ms
[2020-05-21 02:04:38] [INFO ] Deduced a trap composed of 40 places in 398 ms
[2020-05-21 02:04:38] [INFO ] Deduced a trap composed of 15 places in 507 ms
[2020-05-21 02:04:39] [INFO ] Deduced a trap composed of 15 places in 512 ms
[2020-05-21 02:04:40] [INFO ] Deduced a trap composed of 29 places in 518 ms
[2020-05-21 02:04:40] [INFO ] Deduced a trap composed of 52 places in 464 ms
[2020-05-21 02:04:41] [INFO ] Deduced a trap composed of 15 places in 437 ms
[2020-05-21 02:04:41] [INFO ] Deduced a trap composed of 40 places in 429 ms
[2020-05-21 02:04:42] [INFO ] Deduced a trap composed of 36 places in 367 ms
[2020-05-21 02:04:42] [INFO ] Deduced a trap composed of 55 places in 406 ms
[2020-05-21 02:04:43] [INFO ] Deduced a trap composed of 40 places in 482 ms
[2020-05-21 02:04:43] [INFO ] Deduced a trap composed of 23 places in 511 ms
[2020-05-21 02:04:44] [INFO ] Deduced a trap composed of 73 places in 445 ms
[2020-05-21 02:04:44] [INFO ] Deduced a trap composed of 57 places in 313 ms
[2020-05-21 02:04:45] [INFO ] Deduced a trap composed of 25 places in 478 ms
[2020-05-21 02:04:45] [INFO ] Deduced a trap composed of 130 places in 436 ms
[2020-05-21 02:04:46] [INFO ] Deduced a trap composed of 58 places in 494 ms
[2020-05-21 02:04:46] [INFO ] Deduced a trap composed of 17 places in 432 ms
[2020-05-21 02:04:47] [INFO ] Deduced a trap composed of 36 places in 392 ms
[2020-05-21 02:04:47] [INFO ] Deduced a trap composed of 123 places in 363 ms
[2020-05-21 02:04:48] [INFO ] Deduced a trap composed of 123 places in 347 ms
[2020-05-21 02:04:48] [INFO ] Deduced a trap composed of 121 places in 349 ms
[2020-05-21 02:04:48] [INFO ] Deduced a trap composed of 121 places in 304 ms
[2020-05-21 02:04:48] [INFO ] Trap strengthening (SAT) tested/added 56/55 trap constraints in 29186 ms
[2020-05-21 02:04:48] [INFO ] Computed and/alt/rep : 1205/4691/1085 causal constraints in 50 ms.
[2020-05-21 02:05:01] [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: Broken pipe (=> (> t705 0) (and (and (> t4 0) (< o4 o705)) (or (and (> t701 0) (< o701 o705)) (and (> t713 0) (< o713 o705)) (and (> t724 0) (< o724 o705)) (and (> t726 0) (< o726 o705)) (and (> t762 0) (< o762 o705)))))") while checking expression at index 1
[2020-05-21 02:05:01] [INFO ] [Real]Absence check using 17 positive place invariants in 24 ms returned sat
[2020-05-21 02:05:01] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2020-05-21 02:05:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:05:03] [INFO ] [Real]Absence check using state equation in 1761 ms returned sat
[2020-05-21 02:05:03] [INFO ] [Real]Added 230 Read/Feed constraints in 48 ms returned sat
[2020-05-21 02:05:03] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:05:03] [INFO ] [Nat]Absence check using 17 positive place invariants in 28 ms returned sat
[2020-05-21 02:05:03] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2020-05-21 02:05:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:05:05] [INFO ] [Nat]Absence check using state equation in 1743 ms returned sat
[2020-05-21 02:05:05] [INFO ] [Nat]Added 230 Read/Feed constraints in 55 ms returned sat
[2020-05-21 02:05:06] [INFO ] Deduced a trap composed of 11 places in 399 ms
[2020-05-21 02:05:06] [INFO ] Deduced a trap composed of 11 places in 421 ms
[2020-05-21 02:05:07] [INFO ] Deduced a trap composed of 11 places in 391 ms
[2020-05-21 02:05:07] [INFO ] Deduced a trap composed of 55 places in 423 ms
[2020-05-21 02:05:08] [INFO ] Deduced a trap composed of 55 places in 423 ms
[2020-05-21 02:05:08] [INFO ] Deduced a trap composed of 36 places in 421 ms
[2020-05-21 02:05:08] [INFO ] Deduced a trap composed of 43 places in 432 ms
[2020-05-21 02:05:09] [INFO ] Deduced a trap composed of 29 places in 379 ms
[2020-05-21 02:05:09] [INFO ] Deduced a trap composed of 55 places in 428 ms
[2020-05-21 02:05:10] [INFO ] Deduced a trap composed of 15 places in 475 ms
[2020-05-21 02:05:10] [INFO ] Deduced a trap composed of 13 places in 417 ms
[2020-05-21 02:05:11] [INFO ] Deduced a trap composed of 48 places in 371 ms
[2020-05-21 02:05:11] [INFO ] Deduced a trap composed of 40 places in 404 ms
[2020-05-21 02:05:12] [INFO ] Deduced a trap composed of 31 places in 411 ms
[2020-05-21 02:05:12] [INFO ] Deduced a trap composed of 17 places in 557 ms
[2020-05-21 02:05:13] [INFO ] Deduced a trap composed of 113 places in 450 ms
[2020-05-21 02:05:13] [INFO ] Deduced a trap composed of 65 places in 466 ms
[2020-05-21 02:05:14] [INFO ] Deduced a trap composed of 49 places in 448 ms
[2020-05-21 02:05:14] [INFO ] Deduced a trap composed of 69 places in 423 ms
[2020-05-21 02:05:15] [INFO ] Deduced a trap composed of 55 places in 427 ms
[2020-05-21 02:05:15] [INFO ] Deduced a trap composed of 55 places in 429 ms
[2020-05-21 02:05:16] [INFO ] Deduced a trap composed of 55 places in 407 ms
[2020-05-21 02:05:16] [INFO ] Deduced a trap composed of 41 places in 387 ms
[2020-05-21 02:05:17] [INFO ] Deduced a trap composed of 41 places in 405 ms
[2020-05-21 02:05:17] [INFO ] Deduced a trap composed of 55 places in 410 ms
[2020-05-21 02:05:17] [INFO ] Deduced a trap composed of 55 places in 449 ms
[2020-05-21 02:05:18] [INFO ] Deduced a trap composed of 87 places in 428 ms
[2020-05-21 02:05:18] [INFO ] Deduced a trap composed of 52 places in 499 ms
[2020-05-21 02:05:19] [INFO ] Deduced a trap composed of 75 places in 448 ms
[2020-05-21 02:05:20] [INFO ] Deduced a trap composed of 55 places in 457 ms
[2020-05-21 02:05:20] [INFO ] Deduced a trap composed of 27 places in 464 ms
[2020-05-21 02:05:21] [INFO ] Deduced a trap composed of 27 places in 448 ms
[2020-05-21 02:05:21] [INFO ] Deduced a trap composed of 39 places in 481 ms
[2020-05-21 02:05:22] [INFO ] Deduced a trap composed of 50 places in 494 ms
[2020-05-21 02:05:22] [INFO ] Deduced a trap composed of 77 places in 405 ms
[2020-05-21 02:05:22] [INFO ] Deduced a trap composed of 117 places in 377 ms
[2020-05-21 02:05:23] [INFO ] Deduced a trap composed of 55 places in 221 ms
[2020-05-21 02:05:23] [INFO ] Deduced a trap composed of 61 places in 443 ms
[2020-05-21 02:05:24] [INFO ] Deduced a trap composed of 57 places in 298 ms
[2020-05-21 02:05:24] [INFO ] Deduced a trap composed of 78 places in 413 ms
[2020-05-21 02:05:24] [INFO ] Deduced a trap composed of 69 places in 230 ms
[2020-05-21 02:05:25] [INFO ] Deduced a trap composed of 69 places in 221 ms
[2020-05-21 02:05:25] [INFO ] Deduced a trap composed of 69 places in 229 ms
[2020-05-21 02:05:25] [INFO ] Deduced a trap composed of 69 places in 257 ms
[2020-05-21 02:05:25] [INFO ] Deduced a trap composed of 113 places in 232 ms
[2020-05-21 02:05:26] [INFO ] Trap strengthening (SAT) tested/added 46/45 trap constraints in 20236 ms
[2020-05-21 02:05:26] [INFO ] Computed and/alt/rep : 1205/4691/1085 causal constraints in 50 ms.
[2020-05-21 02:05:47] [INFO ] Added : 975 causal constraints over 195 iterations in 21156 ms.(timeout) Result :sat
[2020-05-21 02:05:47] [INFO ] Deduced a trap composed of 92 places in 278 ms
[2020-05-21 02:05:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 510 ms
Attempting to minimize the solution found.
Minimization took 136 ms.
[2020-05-21 02:05:47] [INFO ] [Real]Absence check using 17 positive place invariants in 25 ms returned sat
[2020-05-21 02:05:47] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 20 ms returned sat
[2020-05-21 02:05:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:05:49] [INFO ] [Real]Absence check using state equation in 1603 ms returned sat
[2020-05-21 02:05:49] [INFO ] [Real]Added 230 Read/Feed constraints in 45 ms returned sat
[2020-05-21 02:05:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:05:49] [INFO ] [Nat]Absence check using 17 positive place invariants in 26 ms returned sat
[2020-05-21 02:05:49] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2020-05-21 02:05:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:05:51] [INFO ] [Nat]Absence check using state equation in 1665 ms returned sat
[2020-05-21 02:05:51] [INFO ] [Nat]Added 230 Read/Feed constraints in 73 ms returned sat
[2020-05-21 02:05:52] [INFO ] Deduced a trap composed of 119 places in 526 ms
[2020-05-21 02:05:52] [INFO ] Deduced a trap composed of 32 places in 536 ms
[2020-05-21 02:05:53] [INFO ] Deduced a trap composed of 32 places in 483 ms
[2020-05-21 02:05:53] [INFO ] Deduced a trap composed of 53 places in 454 ms
[2020-05-21 02:05:54] [INFO ] Deduced a trap composed of 11 places in 486 ms
[2020-05-21 02:05:54] [INFO ] Deduced a trap composed of 53 places in 538 ms
[2020-05-21 02:05:55] [INFO ] Deduced a trap composed of 53 places in 555 ms
[2020-05-21 02:05:55] [INFO ] Deduced a trap composed of 53 places in 483 ms
[2020-05-21 02:05:56] [INFO ] Deduced a trap composed of 53 places in 482 ms
[2020-05-21 02:05:57] [INFO ] Deduced a trap composed of 32 places in 525 ms
[2020-05-21 02:05:57] [INFO ] Deduced a trap composed of 32 places in 494 ms
[2020-05-21 02:05:58] [INFO ] Deduced a trap composed of 32 places in 559 ms
[2020-05-21 02:05:58] [INFO ] Deduced a trap composed of 32 places in 523 ms
[2020-05-21 02:05:59] [INFO ] Deduced a trap composed of 55 places in 481 ms
[2020-05-21 02:05:59] [INFO ] Deduced a trap composed of 55 places in 461 ms
[2020-05-21 02:06:00] [INFO ] Deduced a trap composed of 55 places in 511 ms
[2020-05-21 02:06:00] [INFO ] Deduced a trap composed of 55 places in 457 ms
[2020-05-21 02:06:01] [INFO ] Deduced a trap composed of 55 places in 472 ms
[2020-05-21 02:06:02] [INFO ] Deduced a trap composed of 47 places in 470 ms
[2020-05-21 02:06:02] [INFO ] Deduced a trap composed of 47 places in 433 ms
[2020-05-21 02:06:02] [INFO ] Deduced a trap composed of 47 places in 429 ms
[2020-05-21 02:06:03] [INFO ] Deduced a trap composed of 47 places in 484 ms
[2020-05-21 02:06:04] [INFO ] Deduced a trap composed of 47 places in 528 ms
[2020-05-21 02:06:04] [INFO ] Deduced a trap composed of 39 places in 410 ms
[2020-05-21 02:06:05] [INFO ] Deduced a trap composed of 55 places in 473 ms
[2020-05-21 02:06:05] [INFO ] Deduced a trap composed of 41 places in 457 ms
[2020-05-21 02:06:06] [INFO ] Deduced a trap composed of 27 places in 402 ms
[2020-05-21 02:06:06] [INFO ] Deduced a trap composed of 55 places in 440 ms
[2020-05-21 02:06:07] [INFO ] Deduced a trap composed of 41 places in 445 ms
[2020-05-21 02:06:07] [INFO ] Deduced a trap composed of 65 places in 387 ms
[2020-05-21 02:06:07] [INFO ] Deduced a trap composed of 31 places in 405 ms
[2020-05-21 02:06:08] [INFO ] Deduced a trap composed of 40 places in 379 ms
[2020-05-21 02:06:08] [INFO ] Deduced a trap composed of 29 places in 469 ms
[2020-05-21 02:06:09] [INFO ] Deduced a trap composed of 65 places in 435 ms
[2020-05-21 02:06:09] [INFO ] Deduced a trap composed of 41 places in 395 ms
[2020-05-21 02:06:10] [INFO ] Deduced a trap composed of 101 places in 378 ms
[2020-05-21 02:06:10] [INFO ] Deduced a trap composed of 27 places in 449 ms
[2020-05-21 02:06:11] [INFO ] Deduced a trap composed of 27 places in 412 ms
[2020-05-21 02:06:11] [INFO ] Deduced a trap composed of 27 places in 348 ms
[2020-05-21 02:06:11] [INFO ] Deduced a trap composed of 115 places in 274 ms
[2020-05-21 02:06:12] [INFO ] Deduced a trap composed of 115 places in 230 ms
[2020-05-21 02:06:12] [INFO ] Deduced a trap composed of 115 places in 258 ms
[2020-05-21 02:06:12] [INFO ] Deduced a trap composed of 115 places in 245 ms
[2020-05-21 02:06:12] [INFO ] Trap strengthening (SAT) tested/added 44/43 trap constraints in 21348 ms
[2020-05-21 02:06:12] [INFO ] Computed and/alt/rep : 1205/4691/1085 causal constraints in 50 ms.
[2020-05-21 02:06:32] [INFO ] Added : 1013 causal constraints over 203 iterations in 19127 ms. Result :sat
[2020-05-21 02:06:32] [INFO ] Deduced a trap composed of 37 places in 512 ms
[2020-05-21 02:06:33] [INFO ] Deduced a trap composed of 17 places in 497 ms
[2020-05-21 02:06:33] [INFO ] Deduced a trap composed of 43 places in 523 ms
[2020-05-21 02:06:34] [INFO ] Deduced a trap composed of 17 places in 550 ms
[2020-05-21 02:06:35] [INFO ] Deduced a trap composed of 2 places in 605 ms
[2020-05-21 02:06:35] [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 (> (+ s403 s779) 0)") while checking expression at index 3
Incomplete Parikh walk after 223100 steps, including 1000 resets, run finished after 1744 ms. (steps per millisecond=127 ) properties seen :[1, 1, 0, 1] could not realise parikh vector
FORMULA Peterson-PT-5-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-PT-5-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-PT-5-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 288300 steps, including 1000 resets, run finished after 582 ms. (steps per millisecond=495 ) properties seen :[0] could not realise parikh vector
Support contains 1 out of 803 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 803/803 places, 1211/1211 transitions.
Performed 333 Post agglomeration using F-continuation condition.Transition count delta: 333
Iterating post reduction 0 with 333 rules applied. Total rules applied 333 place count 803 transition count 878
Reduce places removed 333 places and 0 transitions.
Iterating post reduction 1 with 333 rules applied. Total rules applied 666 place count 470 transition count 878
Performed 174 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 174 Pre rules applied. Total rules applied 666 place count 470 transition count 704
Deduced a syphon composed of 174 places in 1 ms
Reduce places removed 174 places and 0 transitions.
Iterating global reduction 2 with 348 rules applied. Total rules applied 1014 place count 296 transition count 704
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 1074 place count 266 transition count 674
Applied a total of 1074 rules in 78 ms. Remains 266 /803 variables (removed 537) and now considering 674/1211 (removed 537) transitions.
Finished structural reductions, in 1 iterations. Remains : 266/803 places, 674/1211 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 1471 ms. (steps per millisecond=679 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 459 ms. (steps per millisecond=2178 ) properties seen :[0]
Interrupted probabilistic random walk after 15287307 steps, run timeout after 30001 ms. (steps per millisecond=509 ) properties seen :[0]
Probabilistic random walk after 15287307 steps, saw 2183902 distinct states, run finished after 30003 ms. (steps per millisecond=509 ) properties seen :[0]
[2020-05-21 02:07:09] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
// Phase 1: matrix 554 rows 266 cols
[2020-05-21 02:07:09] [INFO ] Computed 23 place invariants in 5 ms
[2020-05-21 02:07:09] [INFO ] [Real]Absence check using 17 positive place invariants in 66 ms returned sat
[2020-05-21 02:07:09] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2020-05-21 02:07:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:07:10] [INFO ] [Real]Absence check using state equation in 670 ms returned sat
[2020-05-21 02:07:10] [INFO ] State equation strengthened by 230 read => feed constraints.
[2020-05-21 02:07:10] [INFO ] [Real]Added 230 Read/Feed constraints in 45 ms returned sat
[2020-05-21 02:07:10] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:07:10] [INFO ] [Nat]Absence check using 17 positive place invariants in 24 ms returned sat
[2020-05-21 02:07:10] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2020-05-21 02:07:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:07:10] [INFO ] [Nat]Absence check using state equation in 331 ms returned sat
[2020-05-21 02:07:11] [INFO ] [Nat]Added 230 Read/Feed constraints in 29 ms returned sat
[2020-05-21 02:07:11] [INFO ] Deduced a trap composed of 11 places in 148 ms
[2020-05-21 02:07:11] [INFO ] Deduced a trap composed of 34 places in 142 ms
[2020-05-21 02:07:11] [INFO ] Deduced a trap composed of 23 places in 148 ms
[2020-05-21 02:07:11] [INFO ] Deduced a trap composed of 12 places in 131 ms
[2020-05-21 02:07:11] [INFO ] Deduced a trap composed of 12 places in 148 ms
[2020-05-21 02:07:12] [INFO ] Deduced a trap composed of 12 places in 192 ms
[2020-05-21 02:07:12] [INFO ] Deduced a trap composed of 12 places in 141 ms
[2020-05-21 02:07:12] [INFO ] Deduced a trap composed of 30 places in 143 ms
[2020-05-21 02:07:12] [INFO ] Deduced a trap composed of 16 places in 159 ms
[2020-05-21 02:07:12] [INFO ] Deduced a trap composed of 9 places in 169 ms
[2020-05-21 02:07:12] [INFO ] Deduced a trap composed of 38 places in 154 ms
[2020-05-21 02:07:13] [INFO ] Deduced a trap composed of 18 places in 113 ms
[2020-05-21 02:07:13] [INFO ] Deduced a trap composed of 25 places in 103 ms
[2020-05-21 02:07:13] [INFO ] Deduced a trap composed of 16 places in 114 ms
[2020-05-21 02:07:13] [INFO ] Deduced a trap composed of 18 places in 105 ms
[2020-05-21 02:07:13] [INFO ] Deduced a trap composed of 25 places in 100 ms
[2020-05-21 02:07:13] [INFO ] Deduced a trap composed of 30 places in 105 ms
[2020-05-21 02:07:13] [INFO ] Deduced a trap composed of 25 places in 117 ms
[2020-05-21 02:07:13] [INFO ] Deduced a trap composed of 23 places in 118 ms
[2020-05-21 02:07:14] [INFO ] Deduced a trap composed of 31 places in 117 ms
[2020-05-21 02:07:14] [INFO ] Deduced a trap composed of 16 places in 107 ms
[2020-05-21 02:07:14] [INFO ] Deduced a trap composed of 29 places in 102 ms
[2020-05-21 02:07:14] [INFO ] Deduced a trap composed of 16 places in 100 ms
[2020-05-21 02:07:14] [INFO ] Deduced a trap composed of 23 places in 123 ms
[2020-05-21 02:07:14] [INFO ] Deduced a trap composed of 23 places in 119 ms
[2020-05-21 02:07:14] [INFO ] Deduced a trap composed of 40 places in 101 ms
[2020-05-21 02:07:14] [INFO ] Deduced a trap composed of 32 places in 102 ms
[2020-05-21 02:07:15] [INFO ] Deduced a trap composed of 33 places in 96 ms
[2020-05-21 02:07:15] [INFO ] Deduced a trap composed of 40 places in 110 ms
[2020-05-21 02:07:15] [INFO ] Deduced a trap composed of 40 places in 136 ms
[2020-05-21 02:07:15] [INFO ] Deduced a trap composed of 33 places in 112 ms
[2020-05-21 02:07:15] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 4510 ms
[2020-05-21 02:07:15] [INFO ] Computed and/alt/rep : 668/4274/548 causal constraints in 43 ms.
[2020-05-21 02:07:20] [INFO ] Added : 431 causal constraints over 87 iterations in 5074 ms. Result :sat
[2020-05-21 02:07:20] [INFO ] Deduced a trap composed of 48 places in 185 ms
[2020-05-21 02:07:21] [INFO ] Deduced a trap composed of 9 places in 159 ms
[2020-05-21 02:07:21] [INFO ] Deduced a trap composed of 16 places in 169 ms
[2020-05-21 02:07:21] [INFO ] Deduced a trap composed of 23 places in 149 ms
[2020-05-21 02:07:21] [INFO ] Deduced a trap composed of 34 places in 113 ms
[2020-05-21 02:07:21] [INFO ] Deduced a trap composed of 18 places in 169 ms
[2020-05-21 02:07:22] [INFO ] Deduced a trap composed of 19 places in 144 ms
[2020-05-21 02:07:22] [INFO ] Deduced a trap composed of 12 places in 149 ms
[2020-05-21 02:07:22] [INFO ] Deduced a trap composed of 12 places in 161 ms
[2020-05-21 02:07:22] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1982 ms
Attempting to minimize the solution found.
Minimization took 37 ms.
Incomplete Parikh walk after 81500 steps, including 1000 resets, run finished after 173 ms. (steps per millisecond=471 ) properties seen :[0] could not realise parikh vector
Support contains 1 out of 266 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 266/266 places, 674/674 transitions.
Applied a total of 0 rules in 20 ms. Remains 266 /266 variables (removed 0) and now considering 674/674 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 266/266 places, 674/674 transitions.
Starting structural reductions, iteration 0 : 266/266 places, 674/674 transitions.
Applied a total of 0 rules in 17 ms. Remains 266 /266 variables (removed 0) and now considering 674/674 (removed 0) transitions.
[2020-05-21 02:07:22] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
// Phase 1: matrix 554 rows 266 cols
[2020-05-21 02:07:22] [INFO ] Computed 23 place invariants in 3 ms
[2020-05-21 02:07:23] [INFO ] Implicit Places using invariants in 476 ms returned [230, 242, 243, 244, 245, 246]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 479 ms to find 6 implicit places.
[2020-05-21 02:07:23] [INFO ] Redundant transitions in 45 ms returned []
[2020-05-21 02:07:23] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
// Phase 1: matrix 554 rows 260 cols
[2020-05-21 02:07:23] [INFO ] Computed 17 place invariants in 6 ms
[2020-05-21 02:07:24] [INFO ] Dead Transitions using invariants and state equation in 710 ms returned []
Starting structural reductions, iteration 1 : 260/266 places, 674/674 transitions.
Applied a total of 0 rules in 16 ms. Remains 260 /260 variables (removed 0) and now considering 674/674 (removed 0) transitions.
[2020-05-21 02:07:24] [INFO ] Redundant transitions in 17 ms returned []
[2020-05-21 02:07:24] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
// Phase 1: matrix 554 rows 260 cols
[2020-05-21 02:07:24] [INFO ] Computed 17 place invariants in 3 ms
[2020-05-21 02:07:24] [INFO ] Dead Transitions using invariants and state equation in 791 ms returned []
Finished structural reductions, in 2 iterations. Remains : 260/266 places, 674/674 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 1482 ms. (steps per millisecond=674 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 455 ms. (steps per millisecond=2197 ) properties seen :[0]
Interrupted probabilistic random walk after 15663830 steps, run timeout after 30001 ms. (steps per millisecond=522 ) properties seen :[0]
Probabilistic random walk after 15663830 steps, saw 2237691 distinct states, run finished after 30004 ms. (steps per millisecond=522 ) properties seen :[0]
[2020-05-21 02:07:56] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
// Phase 1: matrix 554 rows 260 cols
[2020-05-21 02:07:56] [INFO ] Computed 17 place invariants in 2 ms
[2020-05-21 02:07:56] [INFO ] [Real]Absence check using 17 positive place invariants in 27 ms returned sat
[2020-05-21 02:07:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:07:57] [INFO ] [Real]Absence check using state equation in 270 ms returned sat
[2020-05-21 02:07:57] [INFO ] State equation strengthened by 230 read => feed constraints.
[2020-05-21 02:07:57] [INFO ] [Real]Added 230 Read/Feed constraints in 39 ms returned sat
[2020-05-21 02:07:57] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:07:57] [INFO ] [Nat]Absence check using 17 positive place invariants in 13 ms returned sat
[2020-05-21 02:07:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:07:57] [INFO ] [Nat]Absence check using state equation in 274 ms returned sat
[2020-05-21 02:07:57] [INFO ] [Nat]Added 230 Read/Feed constraints in 104 ms returned sat
[2020-05-21 02:07:57] [INFO ] Deduced a trap composed of 20 places in 161 ms
[2020-05-21 02:07:58] [INFO ] Deduced a trap composed of 12 places in 126 ms
[2020-05-21 02:07:58] [INFO ] Deduced a trap composed of 20 places in 112 ms
[2020-05-21 02:07:58] [INFO ] Deduced a trap composed of 17 places in 124 ms
[2020-05-21 02:07:58] [INFO ] Deduced a trap composed of 9 places in 188 ms
[2020-05-21 02:07:58] [INFO ] Deduced a trap composed of 9 places in 119 ms
[2020-05-21 02:07:58] [INFO ] Deduced a trap composed of 9 places in 137 ms
[2020-05-21 02:07:58] [INFO ] Deduced a trap composed of 10 places in 126 ms
[2020-05-21 02:07:59] [INFO ] Deduced a trap composed of 9 places in 113 ms
[2020-05-21 02:07:59] [INFO ] Deduced a trap composed of 38 places in 108 ms
[2020-05-21 02:07:59] [INFO ] Deduced a trap composed of 32 places in 107 ms
[2020-05-21 02:07:59] [INFO ] Deduced a trap composed of 24 places in 106 ms
[2020-05-21 02:07:59] [INFO ] Deduced a trap composed of 24 places in 126 ms
[2020-05-21 02:07:59] [INFO ] Deduced a trap composed of 39 places in 110 ms
[2020-05-21 02:07:59] [INFO ] Deduced a trap composed of 37 places in 128 ms
[2020-05-21 02:08:00] [INFO ] Deduced a trap composed of 31 places in 161 ms
[2020-05-21 02:08:00] [INFO ] Deduced a trap composed of 31 places in 123 ms
[2020-05-21 02:08:00] [INFO ] Deduced a trap composed of 28 places in 112 ms
[2020-05-21 02:08:00] [INFO ] Deduced a trap composed of 16 places in 124 ms
[2020-05-21 02:08:00] [INFO ] Deduced a trap composed of 17 places in 101 ms
[2020-05-21 02:08:00] [INFO ] Deduced a trap composed of 36 places in 109 ms
[2020-05-21 02:08:00] [INFO ] Deduced a trap composed of 18 places in 119 ms
[2020-05-21 02:08:01] [INFO ] Deduced a trap composed of 31 places in 103 ms
[2020-05-21 02:08:01] [INFO ] Deduced a trap composed of 48 places in 93 ms
[2020-05-21 02:08:01] [INFO ] Deduced a trap composed of 34 places in 90 ms
[2020-05-21 02:08:01] [INFO ] Deduced a trap composed of 23 places in 70 ms
[2020-05-21 02:08:01] [INFO ] Deduced a trap composed of 25 places in 85 ms
[2020-05-21 02:08:01] [INFO ] Deduced a trap composed of 32 places in 61 ms
[2020-05-21 02:08:01] [INFO ] Deduced a trap composed of 24 places in 71 ms
[2020-05-21 02:08:01] [INFO ] Deduced a trap composed of 38 places in 97 ms
[2020-05-21 02:08:01] [INFO ] Deduced a trap composed of 38 places in 82 ms
[2020-05-21 02:08:01] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 4171 ms
[2020-05-21 02:08:01] [INFO ] Computed and/alt/rep : 668/4274/548 causal constraints in 26 ms.
[2020-05-21 02:08:06] [INFO ] Added : 428 causal constraints over 86 iterations in 4339 ms. Result :sat
[2020-05-21 02:08:06] [INFO ] Deduced a trap composed of 33 places in 144 ms
[2020-05-21 02:08:06] [INFO ] Deduced a trap composed of 47 places in 141 ms
[2020-05-21 02:08:06] [INFO ] Deduced a trap composed of 17 places in 122 ms
[2020-05-21 02:08:07] [INFO ] Deduced a trap composed of 25 places in 161 ms
[2020-05-21 02:08:07] [INFO ] Deduced a trap composed of 33 places in 162 ms
[2020-05-21 02:08:07] [INFO ] Deduced a trap composed of 35 places in 117 ms
[2020-05-21 02:08:07] [INFO ] Deduced a trap composed of 23 places in 134 ms
[2020-05-21 02:08:07] [INFO ] Deduced a trap composed of 23 places in 162 ms
[2020-05-21 02:08:08] [INFO ] Deduced a trap composed of 16 places in 166 ms
[2020-05-21 02:08:08] [INFO ] Deduced a trap composed of 44 places in 97 ms
[2020-05-21 02:08:08] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2066 ms
Attempting to minimize the solution found.
Minimization took 36 ms.
Incomplete Parikh walk after 81800 steps, including 1000 resets, run finished after 173 ms. (steps per millisecond=472 ) properties seen :[0] could not realise parikh vector
Support contains 1 out of 260 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 260/260 places, 674/674 transitions.
Applied a total of 0 rules in 12 ms. Remains 260 /260 variables (removed 0) and now considering 674/674 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 260/260 places, 674/674 transitions.
Starting structural reductions, iteration 0 : 260/260 places, 674/674 transitions.
Applied a total of 0 rules in 11 ms. Remains 260 /260 variables (removed 0) and now considering 674/674 (removed 0) transitions.
[2020-05-21 02:08:08] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
// Phase 1: matrix 554 rows 260 cols
[2020-05-21 02:08:08] [INFO ] Computed 17 place invariants in 1 ms
[2020-05-21 02:08:10] [INFO ] Implicit Places using invariants in 2024 ms returned []
[2020-05-21 02:08:10] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
// Phase 1: matrix 554 rows 260 cols
[2020-05-21 02:08:10] [INFO ] Computed 17 place invariants in 1 ms
[2020-05-21 02:08:11] [INFO ] State equation strengthened by 230 read => feed constraints.
[2020-05-21 02:08:12] [INFO ] Implicit Places using invariants and state equation in 2202 ms returned []
Implicit Place search using SMT with State Equation took 4228 ms to find 0 implicit places.
[2020-05-21 02:08:12] [INFO ] Redundant transitions in 6 ms returned []
[2020-05-21 02:08:12] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
// Phase 1: matrix 554 rows 260 cols
[2020-05-21 02:08:12] [INFO ] Computed 17 place invariants in 2 ms
[2020-05-21 02:08:13] [INFO ] Dead Transitions using invariants and state equation in 750 ms returned []
Finished structural reductions, in 1 iterations. Remains : 260/260 places, 674/674 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 194 ms. (steps per millisecond=515 ) properties seen :[0]
[2020-05-21 02:08:13] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
// Phase 1: matrix 554 rows 260 cols
[2020-05-21 02:08:13] [INFO ] Computed 17 place invariants in 2 ms
[2020-05-21 02:08:13] [INFO ] [Real]Absence check using 17 positive place invariants in 22 ms returned sat
[2020-05-21 02:08:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:08:14] [INFO ] [Real]Absence check using state equation in 444 ms returned sat
[2020-05-21 02:08:14] [INFO ] State equation strengthened by 230 read => feed constraints.
[2020-05-21 02:08:14] [INFO ] [Real]Added 230 Read/Feed constraints in 38 ms returned sat
[2020-05-21 02:08:14] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 02:08:14] [INFO ] [Nat]Absence check using 17 positive place invariants in 20 ms returned sat
[2020-05-21 02:08:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 02:08:14] [INFO ] [Nat]Absence check using state equation in 331 ms returned sat
[2020-05-21 02:08:14] [INFO ] [Nat]Added 230 Read/Feed constraints in 43 ms returned sat
[2020-05-21 02:08:14] [INFO ] Deduced a trap composed of 20 places in 177 ms
[2020-05-21 02:08:15] [INFO ] Deduced a trap composed of 12 places in 115 ms
[2020-05-21 02:08:15] [INFO ] Deduced a trap composed of 20 places in 129 ms
[2020-05-21 02:08:15] [INFO ] Deduced a trap composed of 17 places in 114 ms
[2020-05-21 02:08:15] [INFO ] Deduced a trap composed of 9 places in 124 ms
[2020-05-21 02:08:15] [INFO ] Deduced a trap composed of 9 places in 119 ms
[2020-05-21 02:08:15] [INFO ] Deduced a trap composed of 9 places in 178 ms
[2020-05-21 02:08:16] [INFO ] Deduced a trap composed of 10 places in 140 ms
[2020-05-21 02:08:16] [INFO ] Deduced a trap composed of 9 places in 130 ms
[2020-05-21 02:08:16] [INFO ] Deduced a trap composed of 38 places in 120 ms
[2020-05-21 02:08:16] [INFO ] Deduced a trap composed of 32 places in 123 ms
[2020-05-21 02:08:16] [INFO ] Deduced a trap composed of 24 places in 123 ms
[2020-05-21 02:08:16] [INFO ] Deduced a trap composed of 24 places in 111 ms
[2020-05-21 02:08:16] [INFO ] Deduced a trap composed of 39 places in 127 ms
[2020-05-21 02:08:17] [INFO ] Deduced a trap composed of 37 places in 137 ms
[2020-05-21 02:08:17] [INFO ] Deduced a trap composed of 31 places in 134 ms
[2020-05-21 02:08:17] [INFO ] Deduced a trap composed of 31 places in 128 ms
[2020-05-21 02:08:17] [INFO ] Deduced a trap composed of 28 places in 122 ms
[2020-05-21 02:08:17] [INFO ] Deduced a trap composed of 16 places in 133 ms
[2020-05-21 02:08:17] [INFO ] Deduced a trap composed of 17 places in 109 ms
[2020-05-21 02:08:17] [INFO ] Deduced a trap composed of 36 places in 121 ms
[2020-05-21 02:08:18] [INFO ] Deduced a trap composed of 18 places in 105 ms
[2020-05-21 02:08:18] [INFO ] Deduced a trap composed of 31 places in 112 ms
[2020-05-21 02:08:18] [INFO ] Deduced a trap composed of 48 places in 97 ms
[2020-05-21 02:08:18] [INFO ] Deduced a trap composed of 34 places in 92 ms
[2020-05-21 02:08:18] [INFO ] Deduced a trap composed of 23 places in 62 ms
[2020-05-21 02:08:18] [INFO ] Deduced a trap composed of 25 places in 106 ms
[2020-05-21 02:08:18] [INFO ] Deduced a trap composed of 32 places in 75 ms
[2020-05-21 02:08:18] [INFO ] Deduced a trap composed of 24 places in 79 ms
[2020-05-21 02:08:18] [INFO ] Deduced a trap composed of 38 places in 74 ms
[2020-05-21 02:08:19] [INFO ] Deduced a trap composed of 38 places in 110 ms
[2020-05-21 02:08:19] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 4306 ms
[2020-05-21 02:08:19] [INFO ] Computed and/alt/rep : 668/4274/548 causal constraints in 24 ms.
[2020-05-21 02:08:23] [INFO ] Added : 428 causal constraints over 86 iterations in 4523 ms. Result :sat
[2020-05-21 02:08:23] [INFO ] Deduced a trap composed of 33 places in 162 ms
[2020-05-21 02:08:23] [INFO ] Deduced a trap composed of 47 places in 140 ms
[2020-05-21 02:08:24] [INFO ] Deduced a trap composed of 17 places in 138 ms
[2020-05-21 02:08:24] [INFO ] Deduced a trap composed of 25 places in 132 ms
[2020-05-21 02:08:24] [INFO ] Deduced a trap composed of 33 places in 149 ms
[2020-05-21 02:08:24] [INFO ] Deduced a trap composed of 35 places in 142 ms
[2020-05-21 02:08:25] [INFO ] Deduced a trap composed of 23 places in 147 ms
[2020-05-21 02:08:25] [INFO ] Deduced a trap composed of 23 places in 145 ms
[2020-05-21 02:08:25] [INFO ] Deduced a trap composed of 16 places in 121 ms
[2020-05-21 02:08:25] [INFO ] Deduced a trap composed of 44 places in 118 ms
[2020-05-21 02:08:25] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2037 ms
Graph (trivial) has 510 edges and 260 vertex of which 179 / 260 are part of one of the 30 SCC in 9 ms
Free SCC test removed 149 places
Drop transitions removed 298 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 447 transitions.
Iterating post reduction 0 with 447 rules applied. Total rules applied 448 place count 111 transition count 227
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 29 Pre rules applied. Total rules applied 448 place count 111 transition count 198
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 1 with 58 rules applied. Total rules applied 506 place count 82 transition count 198
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 1 with 2 rules applied. Total rules applied 508 place count 81 transition count 197
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 528 place count 68 transition count 196
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 37 edges and 68 vertex of which 36 / 68 are part of one of the 6 SCC in 1 ms
Free SCC test removed 30 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 530 place count 38 transition count 195
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Discarding 24 places :
Also discarding 100 output transitions
Drop transitions removed 100 transitions
Graph (complete) has 164 edges and 33 vertex of which 9 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.62 ms
Graph (trivial) has 46 edges and 9 vertex of which 5 / 9 are part of one of the 1 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 43 rules applied. Total rules applied 573 place count 5 transition count 59
Drop transitions removed 40 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 3 with 52 rules applied. Total rules applied 625 place count 5 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 625 place count 5 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 628 place count 3 transition count 6
Drop transitions removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 630 place count 3 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 632 place count 2 transition count 3
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 633 place count 2 transition count 2
Applied a total of 633 rules in 107 ms. Remains 2 /260 variables (removed 258) and now considering 2/674 (removed 672) transitions.
// Phase 1: matrix 2 rows 2 cols
[2020-05-21 02:08:25] [INFO ] Computed 1 place invariants in 0 ms
[2020-05-21 02:08:25] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2020-05-21 02:08:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:08:25] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2020-05-21 02:08:25] [INFO ] Computed and/alt/rep : 1/1/1 causal constraints in 0 ms.
[2020-05-21 02:08:25] [INFO ] Added : 0 causal constraints over 0 iterations in 1 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2020-05-21 02:08:26] [INFO ] Flatten gal took : 182 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-21 02:08:26] [INFO ] Applying decomposition
[2020-05-21 02:08:26] [INFO ] Flatten gal took : 66 ms
[2020-05-21 02:08:26] [INFO ] Flatten gal took : 151 ms
[2020-05-21 02:08:26] [INFO ] Input system was already deterministic with 674 transitions.
[2020-05-21 02:08:26] [INFO ] Input system was already deterministic with 674 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/graph12522089270536045152.txt, -o, /tmp/graph12522089270536045152.bin, -w, /tmp/graph12522089270536045152.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/graph12522089270536045152.bin, -l, -1, -v, -w, /tmp/graph12522089270536045152.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-21 02:08:26] [INFO ] Decomposing Gal with order
[2020-05-21 02:08:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-21 02:08:27] [INFO ] Ran tautology test, simplified 0 / 1 in 565 ms.
[2020-05-21 02:08:27] [INFO ] BMC solution for property Peterson-PT-5-ReachabilityFireability-09(UNSAT) depth K=0 took 46 ms
[2020-05-21 02:08:27] [INFO ] BMC solution for property Peterson-PT-5-ReachabilityFireability-09(UNSAT) depth K=1 took 11 ms
[2020-05-21 02:08:27] [INFO ] Removed a total of 914 redundant transitions.
[2020-05-21 02:08:27] [INFO ] BMC solution for property Peterson-PT-5-ReachabilityFireability-09(UNSAT) depth K=2 took 293 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 554 out of 674 initially.
// Phase 1: matrix 554 rows 260 cols
[2020-05-21 02:08:27] [INFO ] Computed 17 place invariants in 2 ms
inv : IsEndLoop_3_0_0 + IsEndLoop_3_1_0 + IsEndLoop_3_2_0 + IsEndLoop_3_3_0 + IsEndLoop_3_4_0 + IsEndLoop_3_0_1 + IsEndLoop_3_1_1 + IsEndLoop_3_2_1 + IsEndLoop_3_3_1 + IsEndLoop_3_4_1 + IsEndLoop_3_0_2 + IsEndLoop_3_2_2 + IsEndLoop_3_1_2 + IsEndLoop_3_3_2 + IsEndLoop_3_4_2 + IsEndLoop_3_0_4 + IsEndLoop_3_2_4 + IsEndLoop_3_1_4 + IsEndLoop_3_3_4 + IsEndLoop_3_4_4 + EndTurn_3_0 + EndTurn_3_3 + EndTurn_3_2 + EndTurn_3_1 + BeginLoop_3_1_0 + BeginLoop_3_0_0 + EndTurn_3_4 + BeginLoop_3_3_0 + BeginLoop_3_2_0 + BeginLoop_3_4_0 + WantSection_3_F + TestTurn_3_0 + TestTurn_3_1 + TestTurn_3_2 + TestTurn_3_3 + TestTurn_3_4 + AskForSection_3_0 = 1
inv : Turn_1_0 + Turn_1_5 + Turn_1_4 + Turn_1_1 + Turn_1_3 + Turn_1_2 = 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_1_2 + IsEndLoop_0_2_2 + IsEndLoop_0_4_2 + IsEndLoop_0_3_2 + IsEndLoop_0_0_3 + IsEndLoop_0_1_3 + IsEndLoop_0_3_3 + IsEndLoop_0_2_3 + IsEndLoop_0_4_3 + IsEndLoop_0_0_4 + IsEndLoop_0_3_4 + IsEndLoop_0_1_4 + IsEndLoop_0_2_4 + IsEndLoop_0_4_4 + EndTurn_0_1 + EndTurn_0_0 + EndTurn_0_4 + EndTurn_0_3 + EndTurn_0_2 + BeginLoop_0_1_0 + BeginLoop_0_0_0 + BeginLoop_0_4_0 + BeginLoop_0_3_0 + BeginLoop_0_2_0 + WantSection_0_F + TestTurn_0_0 + TestTurn_0_2 + TestTurn_0_1 + TestTurn_0_3 + TestAlone_0_2_5 + TestTurn_0_4 + TestIdentity_0_2_5 + AskForSection_0_0 = 1
inv : Turn_4_4 + Turn_4_3 + Turn_4_5 + Turn_4_1 + Turn_4_0 + Turn_4_2 = 1
inv : WantSection_5_F + WantSection_5_T = 1
inv : IsEndLoop_1_0_0 + IsEndLoop_1_1_0 + IsEndLoop_1_2_0 + IsEndLoop_1_3_0 + IsEndLoop_1_4_0 + IsEndLoop_1_1_2 + IsEndLoop_1_0_2 + IsEndLoop_1_2_2 + IsEndLoop_1_3_2 + IsEndLoop_1_0_3 + IsEndLoop_1_4_2 + IsEndLoop_1_1_3 + IsEndLoop_1_2_3 + IsEndLoop_1_4_3 + IsEndLoop_1_3_3 + IsEndLoop_1_0_4 + IsEndLoop_1_2_4 + IsEndLoop_1_3_4 + IsEndLoop_1_1_4 + IsEndLoop_1_4_4 + EndTurn_1_0 + EndTurn_1_1 + EndTurn_1_3 + EndTurn_1_2 + BeginLoop_1_1_0 + BeginLoop_1_0_0 + EndTurn_1_4 + BeginLoop_1_4_0 + BeginLoop_1_3_0 + BeginLoop_1_2_0 + WantSection_1_F + TestTurn_1_0 + TestTurn_1_1 + TestTurn_1_3 + TestTurn_1_2 + TestTurn_1_4 + AskForSection_1_0 = 1
inv : IsEndLoop_5_0_0 + IsEndLoop_5_1_0 + IsEndLoop_5_2_0 + IsEndLoop_5_3_0 + IsEndLoop_5_4_0 + IsEndLoop_5_0_1 + IsEndLoop_5_1_1 + IsEndLoop_5_2_1 + IsEndLoop_5_3_1 + IsEndLoop_5_4_1 + IsEndLoop_5_0_2 + IsEndLoop_5_1_2 + IsEndLoop_5_3_2 + IsEndLoop_5_2_2 + IsEndLoop_5_4_2 + IsEndLoop_5_0_3 + IsEndLoop_5_2_3 + IsEndLoop_5_1_3 + IsEndLoop_5_3_3 + IsEndLoop_5_4_3 + EndTurn_5_0 + EndTurn_5_3 + EndTurn_5_2 + EndTurn_5_1 + BeginLoop_5_0_0 + EndTurn_5_4 + BeginLoop_5_3_0 + BeginLoop_5_2_0 + BeginLoop_5_1_0 + BeginLoop_5_4_0 + WantSection_5_F + TestTurn_5_1 + TestTurn_5_0 + TestTurn_5_2 + TestTurn_5_3 + TestTurn_5_4 + AskForSection_5_0 = 1
inv : IsEndLoop_4_0_0 + IsEndLoop_4_1_0 + IsEndLoop_4_2_0 + IsEndLoop_4_3_0 + IsEndLoop_4_4_0 + IsEndLoop_4_0_1 + IsEndLoop_4_1_1 + IsEndLoop_4_2_1 + IsEndLoop_4_3_1 + IsEndLoop_4_4_1 + IsEndLoop_4_0_2 + IsEndLoop_4_2_2 + IsEndLoop_4_1_2 + IsEndLoop_4_3_2 + IsEndLoop_4_4_2 + IsEndLoop_4_1_3 + IsEndLoop_4_0_3 + IsEndLoop_4_2_3 + IsEndLoop_4_3_3 + IsEndLoop_4_4_3 + EndTurn_4_0 + EndTurn_4_3 + EndTurn_4_2 + EndTurn_4_1 + BeginLoop_4_1_0 + BeginLoop_4_0_0 + EndTurn_4_4 + BeginLoop_4_3_0 + BeginLoop_4_2_0 + BeginLoop_4_4_0 + WantSection_4_F + TestTurn_4_0 + TestTurn_4_1 + TestTurn_4_2 + TestTurn_4_3 + TestTurn_4_4 + AskForSection_4_0 = 1
inv : WantSection_0_T + WantSection_0_F = 1
inv : Turn_3_4 + Turn_3_5 + Turn_3_1 + Turn_3_0 + Turn_3_3 + Turn_3_2 = 1
inv : WantSection_3_F + WantSection_3_T = 1
inv : WantSection_2_F + WantSection_2_T = 1
inv : WantSection_1_F + WantSection_1_T = 1
inv : Turn_0_0 + Turn_0_5 + Turn_0_4 + Turn_0_2 + Turn_0_1 + Turn_0_3 = 1
inv : IsEndLoop_2_0_0 + IsEndLoop_2_1_0 + IsEndLoop_2_2_0 + IsEndLoop_2_3_0 + IsEndLoop_2_4_0 + IsEndLoop_2_0_1 + IsEndLoop_2_1_1 + IsEndLoop_2_2_1 + IsEndLoop_2_3_1 + IsEndLoop_2_4_1 + IsEndLoop_2_0_3 + IsEndLoop_2_1_3 + IsEndLoop_2_2_3 + IsEndLoop_2_4_3 + IsEndLoop_2_3_3 + IsEndLoop_2_0_4 + IsEndLoop_2_2_4 + IsEndLoop_2_3_4 + IsEndLoop_2_1_4 + IsEndLoop_2_4_4 + EndTurn_2_0 + EndTurn_2_1 + EndTurn_2_3 + EndTurn_2_2 + BeginLoop_2_1_0 + BeginLoop_2_0_0 + EndTurn_2_4 + BeginLoop_2_4_0 + BeginLoop_2_3_0 + BeginLoop_2_2_0 + WantSection_2_F + TestTurn_2_0 + TestTurn_2_1 + TestTurn_2_3 + TestTurn_2_2 + TestTurn_2_4 + AskForSection_2_0 = 1
inv : Turn_2_0 + Turn_2_4 + Turn_2_5 + Turn_2_1 + Turn_2_3 + Turn_2_2 = 1
inv : WantSection_4_F + WantSection_4_T = 1
Total of 17 invariants.
[2020-05-21 02:08:27] [INFO ] Computed 17 place invariants in 3 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 554 out of 674 initially.
// Phase 1: matrix 554 rows 260 cols
[2020-05-21 02:08:27] [INFO ] Computed 17 place invariants in 2 ms
inv : IsEndLoop_3_0_0 + IsEndLoop_3_1_0 + IsEndLoop_3_2_0 + IsEndLoop_3_3_0 + IsEndLoop_3_4_0 + IsEndLoop_3_0_1 + IsEndLoop_3_1_1 + IsEndLoop_3_2_1 + IsEndLoop_3_3_1 + IsEndLoop_3_4_1 + IsEndLoop_3_0_2 + IsEndLoop_3_2_2 + IsEndLoop_3_1_2 + IsEndLoop_3_3_2 + IsEndLoop_3_4_2 + IsEndLoop_3_0_4 + IsEndLoop_3_2_4 + IsEndLoop_3_1_4 + IsEndLoop_3_3_4 + IsEndLoop_3_4_4 + EndTurn_3_0 + EndTurn_3_3 + EndTurn_3_2 + EndTurn_3_1 + BeginLoop_3_1_0 + BeginLoop_3_0_0 + EndTurn_3_4 + BeginLoop_3_3_0 + BeginLoop_3_2_0 + BeginLoop_3_4_0 + WantSection_3_F + TestTurn_3_0 + TestTurn_3_1 + TestTurn_3_2 + TestTurn_3_3 + TestTurn_3_4 + AskForSection_3_0 = 1
inv : Turn_1_0 + Turn_1_5 + Turn_1_4 + Turn_1_1 + Turn_1_3 + Turn_1_2 = 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_1_2 + IsEndLoop_0_2_2 + IsEndLoop_0_4_2 + IsEndLoop_0_3_2 + IsEndLoop_0_0_3 + IsEndLoop_0_1_3 + IsEndLoop_0_3_3 + IsEndLoop_0_2_3 + IsEndLoop_0_4_3 + IsEndLoop_0_0_4 + IsEndLoop_0_3_4 + IsEndLoop_0_1_4 + IsEndLoop_0_2_4 + IsEndLoop_0_4_4 + EndTurn_0_1 + EndTurn_0_0 + EndTurn_0_4 + EndTurn_0_3 + EndTurn_0_2 + BeginLoop_0_1_0 + BeginLoop_0_0_0 + BeginLoop_0_4_0 + BeginLoop_0_3_0 + BeginLoop_0_2_0 + WantSection_0_F + TestTurn_0_0 + TestTurn_0_2 + TestTurn_0_1 + TestTurn_0_3 + TestAlone_0_2_5 + TestTurn_0_4 + TestIdentity_0_2_5 + AskForSection_0_0 = 1
inv : Turn_4_4 + Turn_4_3 + Turn_4_5 + Turn_4_1 + Turn_4_0 + Turn_4_2 = 1
inv : WantSection_5_F + WantSection_5_T = 1
inv : IsEndLoop_1_0_0 + IsEndLoop_1_1_0 + IsEndLoop_1_2_0 + IsEndLoop_1_3_0 + IsEndLoop_1_4_0 + IsEndLoop_1_1_2 + IsEndLoop_1_0_2 + IsEndLoop_1_2_2 + IsEndLoop_1_3_2 + IsEndLoop_1_0_3 + IsEndLoop_1_4_2 + IsEndLoop_1_1_3 + IsEndLoop_1_2_3 + IsEndLoop_1_4_3 + IsEndLoop_1_3_3 + IsEndLoop_1_0_4 + IsEndLoop_1_2_4 + IsEndLoop_1_3_4 + IsEndLoop_1_1_4 + IsEndLoop_1_4_4 + EndTurn_1_0 + EndTurn_1_1 + EndTurn_1_3 + EndTurn_1_2 + BeginLoop_1_1_0 + BeginLoop_1_0_0 + EndTurn_1_4 + BeginLoop_1_4_0 + BeginLoop_1_3_0 + BeginLoop_1_2_0 + WantSection_1_F + TestTurn_1_0 + TestTurn_1_1 + TestTurn_1_3 + TestTurn_1_2 + TestTurn_1_4 + AskForSection_1_0 = 1
inv : IsEndLoop_5_0_0 + IsEndLoop_5_1_0 + IsEndLoop_5_2_0 + IsEndLoop_5_3_0 + IsEndLoop_5_4_0 + IsEndLoop_5_0_1 + IsEndLoop_5_1_1 + IsEndLoop_5_2_1 + IsEndLoop_5_3_1 + IsEndLoop_5_4_1 + IsEndLoop_5_0_2 + IsEndLoop_5_1_2 + IsEndLoop_5_3_2 + IsEndLoop_5_2_2 + IsEndLoop_5_4_2 + IsEndLoop_5_0_3 + IsEndLoop_5_2_3 + IsEndLoop_5_1_3 + IsEndLoop_5_3_3 + IsEndLoop_5_4_3 + EndTurn_5_0 + EndTurn_5_3 + EndTurn_5_2 + EndTurn_5_1 + BeginLoop_5_0_0 + EndTurn_5_4 + BeginLoop_5_3_0 + BeginLoop_5_2_0 + BeginLoop_5_1_0 + BeginLoop_5_4_0 + WantSection_5_F + TestTurn_5_1 + TestTurn_5_0 + TestTurn_5_2 + TestTurn_5_3 + TestTurn_5_4 + AskForSection_5_0 = 1
inv : IsEndLoop_4_0_0 + IsEndLoop_4_1_0 + IsEndLoop_4_2_0 + IsEndLoop_4_3_0 + IsEndLoop_4_4_0 + IsEndLoop_4_0_1 + IsEndLoop_4_1_1 + IsEndLoop_4_2_1 + IsEndLoop_4_3_1 + IsEndLoop_4_4_1 + IsEndLoop_4_0_2 + IsEndLoop_4_2_2 + IsEndLoop_4_1_2 + IsEndLoop_4_3_2 + IsEndLoop_4_4_2 + IsEndLoop_4_1_3 + IsEndLoop_4_0_3 + IsEndLoop_4_2_3 + IsEndLoop_4_3_3 + IsEndLoop_4_4_3 + EndTurn_4_0 + EndTurn_4_3 + EndTurn_4_2 + EndTurn_4_1 + BeginLoop_4_1_0 + BeginLoop_4_0_0 + EndTurn_4_4 + BeginLoop_4_3_0 + BeginLoop_4_2_0 + BeginLoop_4_4_0 + WantSection_4_F + TestTurn_4_0 + TestTurn_4_1 + TestTurn_4_2 + TestTurn_4_3 + TestTurn_4_4 + AskForSection_4_0 = 1
inv : WantSection_0_T + WantSection_0_F = 1
inv : Turn_3_4 + Turn_3_5 + Turn_3_1 + Turn_3_0 + Turn_3_3 + Turn_3_2 = 1
inv : WantSection_3_F + WantSection_3_T = 1
inv : WantSection_2_F + WantSection_2_T = 1
inv : WantSection_1_F + WantSection_1_T = 1
inv : Turn_0_0 + Turn_0_5 + Turn_0_4 + Turn_0_2 + Turn_0_1 + Turn_0_3 = 1
inv : IsEndLoop_2_0_0 + IsEndLoop_2_1_0 + IsEndLoop_2_2_0 + IsEndLoop_2_3_0 + IsEndLoop_2_4_0 + IsEndLoop_2_0_1 + IsEndLoop_2_1_1 + IsEndLoop_2_2_1 + IsEndLoop_2_3_1 + IsEndLoop_2_4_1 + IsEndLoop_2_0_3 + IsEndLoop_2_1_3 + IsEndLoop_2_2_3 + IsEndLoop_2_4_3 + IsEndLoop_2_3_3 + IsEndLoop_2_0_4 + IsEndLoop_2_2_4 + IsEndLoop_2_3_4 + IsEndLoop_2_1_4 + IsEndLoop_2_4_4 + EndTurn_2_0 + EndTurn_2_1 + EndTurn_2_3 + EndTurn_2_2 + BeginLoop_2_1_0 + BeginLoop_2_0_0 + EndTurn_2_4 + BeginLoop_2_4_0 + BeginLoop_2_3_0 + BeginLoop_2_2_0 + WantSection_2_F + TestTurn_2_0 + TestTurn_2_1 + TestTurn_2_3 + TestTurn_2_2 + TestTurn_2_4 + AskForSection_2_0 = 1
inv : Turn_2_0 + Turn_2_4 + Turn_2_5 + Turn_2_1 + Turn_2_3 + Turn_2_2 = 1
inv : WantSection_4_F + WantSection_4_T = 1
Total of 17 invariants.
[2020-05-21 02:08:27] [INFO ] Computed 17 place invariants in 3 ms
[2020-05-21 02:08:27] [INFO ] Flatten gal took : 487 ms
[2020-05-21 02:08:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 258 labels/synchronizations in 30 ms.
[2020-05-21 02:08:27] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityFireability.pnml.gal : 17 ms
[2020-05-21 02:08:27] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityFireability.prop : 0 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
Loading property file ReachabilityFireability.prop.
Read [reachable] property : Peterson-PT-5-ReachabilityFireability-09 with value :(i6.u36.TestIdentity_0_2_5>=1)
built 107 ordering constraints for composite.
built 34 ordering constraints for composite.
built 105 ordering constraints for composite.
built 33 ordering constraints for composite.
built 32 ordering constraints for composite.
built 32 ordering constraints for composite.
built 32 ordering constraints for composite.
built 33 ordering constraints for composite.
built 33 ordering constraints for composite.
built 35 ordering constraints for composite.
built 33 ordering constraints for composite.
built 32 ordering constraints for composite.
built 32 ordering constraints for composite.
built 30 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
SDD proceeding with computation, new max is 2048
SDD proceeding with computation, new max is 4096
[2020-05-21 02:08:29] [INFO ] Proved 260 variables to be positive in 1816 ms
[2020-05-21 02:08:29] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-5-ReachabilityFireability-09
[2020-05-21 02:08:29] [INFO ] KInduction solution for property Peterson-PT-5-ReachabilityFireability-09(SAT) depth K=0 took 14 ms
[2020-05-21 02:08:29] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-5-ReachabilityFireability-09
[2020-05-21 02:08:29] [INFO ] KInduction solution for property Peterson-PT-5-ReachabilityFireability-09(SAT) depth K=1 took 84 ms
[2020-05-21 02:08:30] [INFO ] Proved 260 variables to be positive in 2762 ms
[2020-05-21 02:08:30] [INFO ] Computing symmetric may disable matrix : 674 transitions.
[2020-05-21 02:08:30] [INFO ] Computation of disable matrix completed :0/674 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 02:08:30] [INFO ] BMC solution for property Peterson-PT-5-ReachabilityFireability-09(UNSAT) depth K=3 took 2796 ms
[2020-05-21 02:08:30] [INFO ] Computation of Complete disable matrix. took 139 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 02:08:30] [INFO ] Computing symmetric may enable matrix : 674 transitions.
[2020-05-21 02:08:30] [INFO ] Computation of Complete enable matrix. took 141 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 02:08:30] [INFO ] Computing symmetric co enabling matrix : 674 transitions.
SDD proceeding with computation, new max is 8192
[2020-05-21 02:08:35] [INFO ] Computation of co-enabling matrix(2/674) took 4305 ms. Total solver calls (SAT/UNSAT): 572(40/532)
SDD proceeding with computation, new max is 16384
[2020-05-21 02:08:38] [INFO ] Computation of co-enabling matrix(6/674) took 7319 ms. Total solver calls (SAT/UNSAT): 1342(74/1268)
[2020-05-21 02:08:38] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-5-ReachabilityFireability-09
[2020-05-21 02:08:38] [INFO ] KInduction solution for property Peterson-PT-5-ReachabilityFireability-09(SAT) depth K=2 took 8535 ms
[2020-05-21 02:08:41] [INFO ] Computation of co-enabling matrix(11/674) took 10417 ms. Total solver calls (SAT/UNSAT): 2291(117/2174)
[2020-05-21 02:08:44] [INFO ] Computation of co-enabling matrix(18/674) took 13564 ms. Total solver calls (SAT/UNSAT): 3604(176/3428)
SDD proceeding with computation, new max is 32768
[2020-05-21 02:08:47] [INFO ] Computation of co-enabling matrix(21/674) took 17160 ms. Total solver calls (SAT/UNSAT): 4169(200/3969)
[2020-05-21 02:08:51] [INFO ] Computation of co-enabling matrix(24/674) took 21087 ms. Total solver calls (SAT/UNSAT): 4722(223/4499)
[2020-05-21 02:08:56] [INFO ] Computation of co-enabling matrix(27/674) took 25309 ms. Total solver calls (SAT/UNSAT): 5258(247/5011)
[2020-05-21 02:08:58] [INFO ] BMC solution for property Peterson-PT-5-ReachabilityFireability-09(UNSAT) depth K=4 took 27921 ms
[2020-05-21 02:08:59] [INFO ] Computation of co-enabling matrix(30/674) took 28848 ms. Total solver calls (SAT/UNSAT): 5785(268/5517)
[2020-05-21 02:09:02] [INFO ] Computation of co-enabling matrix(32/674) took 31860 ms. Total solver calls (SAT/UNSAT): 6133(282/5851)
[2020-05-21 02:09:06] [INFO ] Computation of co-enabling matrix(39/674) took 35344 ms. Total solver calls (SAT/UNSAT): 7314(335/6979)
SDD proceeding with computation, new max is 65536
[2020-05-21 02:09:09] [INFO ] Computation of co-enabling matrix(43/674) took 38485 ms. Total solver calls (SAT/UNSAT): 8068(373/7695)
[2020-05-21 02:09:12] [INFO ] Computation of co-enabling matrix(46/674) took 42015 ms. Total solver calls (SAT/UNSAT): 8602(393/8209)
[2020-05-21 02:09:15] [INFO ] Computation of co-enabling matrix(48/674) took 45188 ms. Total solver calls (SAT/UNSAT): 8967(409/8558)
[2020-05-21 02:09:20] [INFO ] Computation of co-enabling matrix(51/674) took 49312 ms. Total solver calls (SAT/UNSAT): 9509(433/9076)
[2020-05-21 02:09:23] [INFO ] Computation of co-enabling matrix(54/674) took 52960 ms. Total solver calls (SAT/UNSAT): 10042(454/9588)
[2020-05-21 02:09:23] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-5-ReachabilityFireability-09
[2020-05-21 02:09:23] [INFO ] KInduction solution for property Peterson-PT-5-ReachabilityFireability-09(SAT) depth K=3 took 45917 ms
[2020-05-21 02:09:26] [INFO ] Computation of co-enabling matrix(58/674) took 56176 ms. Total solver calls (SAT/UNSAT): 10764(490/10274)
[2020-05-21 02:09:29] [INFO ] Computation of co-enabling matrix(60/674) took 59208 ms. Total solver calls (SAT/UNSAT): 11127(510/10617)
[2020-05-21 02:09:33] [INFO ] Computation of co-enabling matrix(63/674) took 63187 ms. Total solver calls (SAT/UNSAT): 11677(540/11137)
[2020-05-21 02:09:37] [INFO ] Computation of co-enabling matrix(66/674) took 66932 ms. Total solver calls (SAT/UNSAT): 12151(555/11596)
[2020-05-21 02:09:41] [INFO ] Computation of co-enabling matrix(76/674) took 70598 ms. Total solver calls (SAT/UNSAT): 13897(630/13267)
[2020-05-21 02:09:44] [INFO ] Computation of co-enabling matrix(87/674) took 73717 ms. Total solver calls (SAT/UNSAT): 15815(719/15096)
[2020-05-21 02:09:47] [INFO ] Computation of co-enabling matrix(97/674) took 77144 ms. Total solver calls (SAT/UNSAT): 17469(802/16667)
[2020-05-21 02:09:50] [INFO ] Computation of co-enabling matrix(105/674) took 80271 ms. Total solver calls (SAT/UNSAT): 18763(864/17899)
SDD proceeding with computation, new max is 131072
[2020-05-21 02:09:55] [INFO ] Computation of co-enabling matrix(108/674) took 85220 ms. Total solver calls (SAT/UNSAT): 19279(888/18391)
[2020-05-21 02:09:59] [INFO ] Computation of co-enabling matrix(111/674) took 88672 ms. Total solver calls (SAT/UNSAT): 19786(908/18878)
[2020-05-21 02:10:03] [INFO ] Computation of co-enabling matrix(114/674) took 92544 ms. Total solver calls (SAT/UNSAT): 20283(929/19354)
[2020-05-21 02:10:06] [INFO ] Computation of co-enabling matrix(119/674) took 96275 ms. Total solver calls (SAT/UNSAT): 21092(964/20128)
[2020-05-21 02:10:10] [INFO ] Computation of co-enabling matrix(123/674) took 99996 ms. Total solver calls (SAT/UNSAT): 21735(995/20740)
[2020-05-21 02:10:14] [INFO ] Computation of co-enabling matrix(127/674) took 103759 ms. Total solver calls (SAT/UNSAT): 22362(1025/21337)
[2020-05-21 02:10:17] [INFO ] Computation of co-enabling matrix(130/674) took 107179 ms. Total solver calls (SAT/UNSAT): 22822(1052/21770)
[2020-05-21 02:10:21] [INFO ] Computation of co-enabling matrix(134/674) took 110955 ms. Total solver calls (SAT/UNSAT): 23433(1080/22353)
[2020-05-21 02:10:25] [INFO ] Computation of co-enabling matrix(144/674) took 114634 ms. Total solver calls (SAT/UNSAT): 25002(1154/23848)
[2020-05-21 02:10:28] [INFO ] Computation of co-enabling matrix(155/674) took 118078 ms. Total solver calls (SAT/UNSAT): 26645(1225/25420)
[2020-05-21 02:10:31] [INFO ] Computation of co-enabling matrix(161/674) took 121155 ms. Total solver calls (SAT/UNSAT): 27513(1269/26244)
[2020-05-21 02:10:35] [INFO ] Computation of co-enabling matrix(170/674) took 124649 ms. Total solver calls (SAT/UNSAT): 28771(1318/27453)
[2020-05-21 02:10:36] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-5-ReachabilityFireability-09
[2020-05-21 02:10:36] [INFO ] KInduction solution for property Peterson-PT-5-ReachabilityFireability-09(SAT) depth K=4 took 72931 ms
[2020-05-21 02:10:38] [INFO ] Computation of co-enabling matrix(175/674) took 127979 ms. Total solver calls (SAT/UNSAT): 29437(1333/28104)
[2020-05-21 02:10:42] [INFO ] Computation of co-enabling matrix(181/674) took 131363 ms. Total solver calls (SAT/UNSAT): 30204(1350/28854)
[2020-05-21 02:10:45] [INFO ] Computation of co-enabling matrix(186/674) took 134390 ms. Total solver calls (SAT/UNSAT): 30815(1363/29452)
[2020-05-21 02:10:48] [INFO ] BMC solution for property Peterson-PT-5-ReachabilityFireability-09(UNSAT) depth K=5 took 110331 ms
[2020-05-21 02:10:48] [INFO ] Computation of co-enabling matrix(192/674) took 138021 ms. Total solver calls (SAT/UNSAT): 31564(1376/30188)
[2020-05-21 02:10:52] [INFO ] Computation of co-enabling matrix(199/674) took 142211 ms. Total solver calls (SAT/UNSAT): 32512(1431/31081)
[2020-05-21 02:10:56] [INFO ] Computation of co-enabling matrix(211/674) took 146030 ms. Total solver calls (SAT/UNSAT): 34011(1545/32466)
[2020-05-21 02:10:59] [INFO ] Computation of co-enabling matrix(220/674) took 149056 ms. Total solver calls (SAT/UNSAT): 35001(1610/33391)
[2020-05-21 02:11:03] [INFO ] Computation of co-enabling matrix(226/674) took 152453 ms. Total solver calls (SAT/UNSAT): 35674(1686/33988)
[2020-05-21 02:11:06] [INFO ] Computation of co-enabling matrix(234/674) took 155605 ms. Total solver calls (SAT/UNSAT): 36825(1838/34987)
[2020-05-21 02:11:10] [INFO ] Computation of co-enabling matrix(237/674) took 159666 ms. Total solver calls (SAT/UNSAT): 37292(1891/35401)
[2020-05-21 02:11:14] [INFO ] Computation of co-enabling matrix(239/674) took 163931 ms. Total solver calls (SAT/UNSAT): 37689(1925/35764)
[2020-05-21 02:11:17] [INFO ] Computation of co-enabling matrix(242/674) took 167267 ms. Total solver calls (SAT/UNSAT): 38141(1974/36167)
[2020-05-21 02:11:21] [INFO ] Computation of co-enabling matrix(246/674) took 170781 ms. Total solver calls (SAT/UNSAT): 38775(2030/36745)
[2020-05-21 02:11:25] [INFO ] Computation of co-enabling matrix(253/674) took 174919 ms. Total solver calls (SAT/UNSAT): 39888(2124/37764)
[2020-05-21 02:11:28] [INFO ] Computation of co-enabling matrix(257/674) took 178248 ms. Total solver calls (SAT/UNSAT): 40469(2200/38269)
[2020-05-21 02:11:32] [INFO ] Computation of co-enabling matrix(260/674) took 181984 ms. Total solver calls (SAT/UNSAT): 40979(2252/38727)
[2020-05-21 02:11:35] [INFO ] Computation of co-enabling matrix(262/674) took 185043 ms. Total solver calls (SAT/UNSAT): 41293(2284/39009)
SDD proceeding with computation, new max is 262144
[2020-05-21 02:11:39] [INFO ] Computation of co-enabling matrix(265/674) took 188631 ms. Total solver calls (SAT/UNSAT): 41775(2331/39444)
[2020-05-21 02:11:42] [INFO ] Computation of co-enabling matrix(268/674) took 191972 ms. Total solver calls (SAT/UNSAT): 42198(2374/39824)
[2020-05-21 02:11:45] [INFO ] Computation of co-enabling matrix(272/674) took 195224 ms. Total solver calls (SAT/UNSAT): 42790(2426/40364)
[2020-05-21 02:11:49] [INFO ] Computation of co-enabling matrix(276/674) took 198892 ms. Total solver calls (SAT/UNSAT): 43353(2470/40883)
[2020-05-21 02:11:52] [INFO ] Computation of co-enabling matrix(280/674) took 201895 ms. Total solver calls (SAT/UNSAT): 43913(2510/41403)
[2020-05-21 02:11:55] [INFO ] Computation of co-enabling matrix(285/674) took 205208 ms. Total solver calls (SAT/UNSAT): 44622(2552/42070)
[2020-05-21 02:12:00] [INFO ] Computation of co-enabling matrix(289/674) took 210018 ms. Total solver calls (SAT/UNSAT): 45164(2593/42571)
[2020-05-21 02:12:04] [INFO ] Computation of co-enabling matrix(292/674) took 213459 ms. Total solver calls (SAT/UNSAT): 45536(2618/42918)
[2020-05-21 02:12:08] [INFO ] Computation of co-enabling matrix(295/674) took 217491 ms. Total solver calls (SAT/UNSAT): 45963(2640/43323)
[2020-05-21 02:12:11] [INFO ] Computation of co-enabling matrix(303/674) took 220654 ms. Total solver calls (SAT/UNSAT): 46903(2689/44214)
[2020-05-21 02:12:14] [INFO ] Computation of co-enabling matrix(306/674) took 223864 ms. Total solver calls (SAT/UNSAT): 47303(2704/44599)
[2020-05-21 02:12:17] [INFO ] Computation of co-enabling matrix(311/674) took 227052 ms. Total solver calls (SAT/UNSAT): 47921(2718/45203)
[2020-05-21 02:12:21] [INFO ] Computation of co-enabling matrix(317/674) took 230539 ms. Total solver calls (SAT/UNSAT): 48572(2742/45830)
[2020-05-21 02:12:25] [INFO ] Computation of co-enabling matrix(320/674) took 234772 ms. Total solver calls (SAT/UNSAT): 49034(2800/46234)
[2020-05-21 02:12:28] [INFO ] Computation of co-enabling matrix(325/674) took 237856 ms. Total solver calls (SAT/UNSAT): 49743(2887/46856)
[2020-05-21 02:12:31] [INFO ] Computation of co-enabling matrix(329/674) took 241058 ms. Total solver calls (SAT/UNSAT): 50207(2949/47258)
[2020-05-21 02:12:34] [INFO ] Computation of co-enabling matrix(333/674) took 244257 ms. Total solver calls (SAT/UNSAT): 50719(3005/47714)
[2020-05-21 02:12:38] [INFO ] Computation of co-enabling matrix(339/674) took 247423 ms. Total solver calls (SAT/UNSAT): 51505(3077/48428)
[2020-05-21 02:12:41] [INFO ] Computation of co-enabling matrix(347/674) took 250485 ms. Total solver calls (SAT/UNSAT): 52436(3151/49285)
[2020-05-21 02:12:44] [INFO ] Computation of co-enabling matrix(358/674) took 253743 ms. Total solver calls (SAT/UNSAT): 53564(3210/50354)
[2020-05-21 02:12:47] [INFO ] Computation of co-enabling matrix(377/674) took 256851 ms. Total solver calls (SAT/UNSAT): 55365(3259/52106)
[2020-05-21 02:12:50] [INFO ] Computation of co-enabling matrix(382/674) took 260053 ms. Total solver calls (SAT/UNSAT): 55927(3300/52627)
[2020-05-21 02:12:54] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-5-ReachabilityFireability-09
[2020-05-21 02:12:54] [INFO ] KInduction solution for property Peterson-PT-5-ReachabilityFireability-09(SAT) depth K=5 took 137689 ms
[2020-05-21 02:12:54] [INFO ] Computation of co-enabling matrix(385/674) took 264074 ms. Total solver calls (SAT/UNSAT): 56254(3356/52898)
[2020-05-21 02:12:58] [INFO ] Computation of co-enabling matrix(390/674) took 267860 ms. Total solver calls (SAT/UNSAT): 56808(3448/53360)
[2020-05-21 02:13:02] [INFO ] Computation of co-enabling matrix(393/674) took 271523 ms. Total solver calls (SAT/UNSAT): 57147(3499/53648)
[2020-05-21 02:13:05] [INFO ] Computation of co-enabling matrix(396/674) took 274615 ms. Total solver calls (SAT/UNSAT): 57482(3547/53935)
[2020-05-21 02:13:08] [INFO ] Computation of co-enabling matrix(401/674) took 278166 ms. Total solver calls (SAT/UNSAT): 57989(3636/54353)
[2020-05-21 02:13:12] [INFO ] Computation of co-enabling matrix(409/674) took 281376 ms. Total solver calls (SAT/UNSAT): 58825(3758/55067)
[2020-05-21 02:13:15] [INFO ] Computation of co-enabling matrix(416/674) took 284528 ms. Total solver calls (SAT/UNSAT): 59539(3844/55695)
[2020-05-21 02:13:18] [INFO ] Computation of co-enabling matrix(423/674) took 288051 ms. Total solver calls (SAT/UNSAT): 60189(3912/56277)
[2020-05-21 02:13:21] [INFO ] Computation of co-enabling matrix(431/674) took 291142 ms. Total solver calls (SAT/UNSAT): 60828(3962/56866)
[2020-05-21 02:13:25] [INFO ] Computation of co-enabling matrix(438/674) took 294373 ms. Total solver calls (SAT/UNSAT): 61335(3984/57351)
[2020-05-21 02:13:28] [INFO ] Computation of co-enabling matrix(452/674) took 297550 ms. Total solver calls (SAT/UNSAT): 62363(4130/58233)
[2020-05-21 02:13:31] [INFO ] Computation of co-enabling matrix(460/674) took 300916 ms. Total solver calls (SAT/UNSAT): 62990(4234/58756)
[2020-05-21 02:13:32] [INFO ] BMC solution for property Peterson-PT-5-ReachabilityFireability-09(UNSAT) depth K=6 took 163661 ms
[2020-05-21 02:13:34] [INFO ] Computation of co-enabling matrix(467/674) took 304026 ms. Total solver calls (SAT/UNSAT): 63498(4308/59190)
[2020-05-21 02:13:37] [INFO ] Computation of co-enabling matrix(470/674) took 307212 ms. Total solver calls (SAT/UNSAT): 63706(4334/59372)
[2020-05-21 02:13:40] [INFO ] Computation of co-enabling matrix(474/674) took 310239 ms. Total solver calls (SAT/UNSAT): 63969(4366/59603)
[2020-05-21 02:13:44] [INFO ] Computation of co-enabling matrix(478/674) took 313311 ms. Total solver calls (SAT/UNSAT): 64246(4397/59849)
[2020-05-21 02:13:47] [INFO ] Computation of co-enabling matrix(485/674) took 316331 ms. Total solver calls (SAT/UNSAT): 64641(4436/60205)
[2020-05-21 02:13:50] [INFO ] Computation of co-enabling matrix(491/674) took 319639 ms. Total solver calls (SAT/UNSAT): 64980(4465/60515)
[2020-05-21 02:13:53] [INFO ] Computation of co-enabling matrix(498/674) took 322900 ms. Total solver calls (SAT/UNSAT): 65356(4490/60866)
[2020-05-21 02:13:56] [INFO ] Computation of co-enabling matrix(505/674) took 325947 ms. Total solver calls (SAT/UNSAT): 65738(4520/61218)
[2020-05-21 02:13:59] [INFO ] Computation of co-enabling matrix(513/674) took 329168 ms. Total solver calls (SAT/UNSAT): 66136(4550/61586)
[2020-05-21 02:14:03] [INFO ] Computation of co-enabling matrix(521/674) took 332320 ms. Total solver calls (SAT/UNSAT): 66480(4570/61910)
[2020-05-21 02:14:06] [INFO ] Computation of co-enabling matrix(528/674) took 335444 ms. Total solver calls (SAT/UNSAT): 66826(4599/62227)
[2020-05-21 02:14:09] [INFO ] Computation of co-enabling matrix(536/674) took 338599 ms. Total solver calls (SAT/UNSAT): 67173(4629/62544)
[2020-05-21 02:14:12] [INFO ] Computation of co-enabling matrix(544/674) took 341691 ms. Total solver calls (SAT/UNSAT): 67538(4643/62895)
[2020-05-21 02:14:15] [INFO ] Computation of co-enabling matrix(550/674) took 344918 ms. Total solver calls (SAT/UNSAT): 67889(4667/63222)
[2020-05-21 02:14:18] [INFO ] Computation of co-enabling matrix(558/674) took 348152 ms. Total solver calls (SAT/UNSAT): 68220(4702/63518)
[2020-05-21 02:14:22] [INFO ] Computation of co-enabling matrix(564/674) took 351691 ms. Total solver calls (SAT/UNSAT): 68570(4721/63849)
[2020-05-21 02:14:25] [INFO ] Computation of co-enabling matrix(572/674) took 354781 ms. Total solver calls (SAT/UNSAT): 68860(4736/64124)
[2020-05-21 02:14:28] [INFO ] Computation of co-enabling matrix(583/674) took 357812 ms. Total solver calls (SAT/UNSAT): 69203(4742/64461)
[2020-05-21 02:14:31] [INFO ] Computation of co-enabling matrix(595/674) took 360832 ms. Total solver calls (SAT/UNSAT): 69581(4772/64809)
[2020-05-21 02:14:34] [INFO ] Computation of co-enabling matrix(605/674) took 363923 ms. Total solver calls (SAT/UNSAT): 70002(4804/65198)
[2020-05-21 02:14:37] [INFO ] Computation of co-enabling matrix(630/674) took 367037 ms. Total solver calls (SAT/UNSAT): 70488(4842/65646)
[2020-05-21 02:14:41] [INFO ] Computation of co-enabling matrix(648/674) took 370633 ms. Total solver calls (SAT/UNSAT): 70796(4870/65926)
[2020-05-21 02:14:44] [INFO ] Computation of co-enabling matrix(653/674) took 373887 ms. Total solver calls (SAT/UNSAT): 70906(4956/65950)
[2020-05-21 02:14:47] [INFO ] Computation of co-enabling matrix(659/674) took 377057 ms. Total solver calls (SAT/UNSAT): 71005(5024/65981)
[2020-05-21 02:14:49] [INFO ] Computation of Finished co-enabling matrix. took 379298 ms. Total solver calls (SAT/UNSAT): 71096(5100/65996)
[2020-05-21 02:14:50] [INFO ] Computing Do-Not-Accords matrix : 674 transitions.
[2020-05-21 02:14:50] [INFO ] Computation of Completed DNA matrix. took 162 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 02:14:50] [INFO ] Built C files in 383964ms 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 12440 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 144 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, PetersonPT5ReachabilityFireability09==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, PetersonPT5ReachabilityFireability09==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, PetersonPT5ReachabilityFireability09==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)
Reachability property Peterson-PT-5-ReachabilityFireability-09 is true.
FORMULA Peterson-PT-5-ReachabilityFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 262145 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,5.86945e+07,441.577,3471328,165354,987,5.7146e+06,8218,1396,1.00801e+07,136,78327,0
Total reachable state count : 58694544

Verifying 1 reachability properties.
Reachability property Peterson-PT-5-ReachabilityFireability-09 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Peterson-PT-5-ReachabilityFireability-09,24,443.037,3471328,56,51,5.7146e+06,8218,1353,1.00801e+07,133,78327,0
[2020-05-21 02:15:58] [WARNING] Interrupting SMT solver.
[2020-05-21 02:15:58] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:384)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$0(Gal2SMTFrontEnd.java:356)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:163)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-21 02:15:58] [WARNING] Unexpected error occurred while running SMT. Was verifying Peterson-PT-5-ReachabilityFireability-09 SMT depth 7
java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:410)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$0(Gal2SMTFrontEnd.java:356)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:163)
at java.base/java.lang.Thread.run(Thread.java:834)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:384)
... 3 more
[2020-05-21 02:15:58] [INFO ] During BMC, SMT solver timed out at depth 7
[2020-05-21 02:15:58] [INFO ] BMC solving timed out (3600000 secs) at depth 7
[2020-05-21 02:15:58] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:586)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:305)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$1(Gal2SMTFrontEnd.java:278)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:170)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-21 02:15:58] [WARNING] Unexpected error occurred while running SMT. Was verifying Peterson-PT-5-ReachabilityFireability-09 K-induction depth 6
Exception in thread "Thread-5" java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:343)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$1(Gal2SMTFrontEnd.java:278)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:170)
at java.base/java.lang.Thread.run(Thread.java:834)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:586)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:305)
... 3 more
[2020-05-21 02:15:58] [INFO ] SMT solved 0/ 1 properties. Interrupting SMT analysis.

BK_STOP 1590027359114

--------------------
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-5"
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-5, 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-158961258100735"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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