Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r210-tajo-159033475300167.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldIIPs-PT-030B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tajo-159033475300167
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 672K
-rw-r--r-- 1 mcc users 3.8K May 14 00:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 14 00:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 17:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 13 17:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 14 10:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 14 10:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.6K May 13 13:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 13 13:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 07:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 13 07:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 503K May 12 20:42 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 ShieldIIPs-PT-030B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1590571937816

[2020-05-27 09:32:19] [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-27 09:32:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 09:32:19] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2020-05-27 09:32:19] [INFO ] Transformed 1803 places.
[2020-05-27 09:32:19] [INFO ] Transformed 1773 transitions.
[2020-05-27 09:32:19] [INFO ] Found NUPN structural information;
[2020-05-27 09:32:19] [INFO ] Parsed PT model containing 1803 places and 1773 transitions in 236 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 43 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties seen :[0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0]
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 1, 0, 0, 0, 0]
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0]
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]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 1773 rows 1803 cols
[2020-05-27 09:32:20] [INFO ] Computed 271 place invariants in 48 ms
[2020-05-27 09:32:20] [INFO ] [Real]Absence check using 271 positive place invariants in 292 ms returned sat
[2020-05-27 09:32:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 09:32:25] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 09:32:25] [INFO ] [Real]Absence check using state equation in 4442 ms returned (error "Failed to check-sat")
[2020-05-27 09:32:25] [INFO ] [Real]Absence check using 271 positive place invariants in 348 ms returned sat
[2020-05-27 09:32:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 09:32:30] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 09:32:30] [INFO ] [Real]Absence check using state equation in 4371 ms returned unknown
[2020-05-27 09:32:30] [INFO ] [Real]Absence check using 271 positive place invariants in 499 ms returned sat
[2020-05-27 09:32:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 09:32:35] [INFO ] [Real]Absence check using state equation in 4272 ms returned (error "Solver has unexpectedly terminated")
[2020-05-27 09:32:35] [INFO ] [Real]Absence check using 271 positive place invariants in 319 ms returned sat
[2020-05-27 09:32:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 09:32:40] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 09:32:40] [INFO ] [Real]Absence check using state equation in 4455 ms returned (error "Failed to check-sat")
[2020-05-27 09:32:40] [INFO ] [Real]Absence check using 271 positive place invariants in 328 ms returned sat
[2020-05-27 09:32:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 09:32:45] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 09:32:45] [INFO ] [Real]Absence check using state equation in 4452 ms returned (error "Failed to check-sat")
Support contains 40 out of 1803 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1803/1803 places, 1773/1773 transitions.
Performed 145 Post agglomeration using F-continuation condition.Transition count delta: 145
Iterating post reduction 0 with 145 rules applied. Total rules applied 145 place count 1803 transition count 1628
Reduce places removed 145 places and 0 transitions.
Iterating post reduction 1 with 145 rules applied. Total rules applied 290 place count 1658 transition count 1628
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 290 place count 1658 transition count 1478
Deduced a syphon composed of 150 places in 3 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 590 place count 1508 transition count 1478
Symmetric choice reduction at 2 with 199 rule applications. Total rules 789 place count 1508 transition count 1478
Deduced a syphon composed of 199 places in 11 ms
Reduce places removed 199 places and 199 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 1187 place count 1309 transition count 1279
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 1187 place count 1309 transition count 1200
Deduced a syphon composed of 79 places in 7 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 1345 place count 1230 transition count 1200
Performed 436 Post agglomeration using F-continuation condition.Transition count delta: 436
Deduced a syphon composed of 436 places in 4 ms
Reduce places removed 436 places and 0 transitions.
Iterating global reduction 2 with 872 rules applied. Total rules applied 2217 place count 794 transition count 764
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 198 times.
Drop transitions removed 198 transitions
Iterating global reduction 2 with 198 rules applied. Total rules applied 2415 place count 794 transition count 764
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 2416 place count 794 transition count 764
Applied a total of 2416 rules in 910 ms. Remains 794 /1803 variables (removed 1009) and now considering 764/1773 (removed 1009) transitions.
Finished structural reductions, in 1 iterations. Remains : 794/1803 places, 764/1773 transitions.
Incomplete random walk after 1000000 steps, including 328 resets, run finished after 6443 ms. (steps per millisecond=155 ) properties seen :[0, 1, 0, 1, 1]
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 21 resets, run finished after 3232 ms. (steps per millisecond=309 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 20 resets, run finished after 3029 ms. (steps per millisecond=330 ) properties seen :[0, 1]
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 764 rows 794 cols
[2020-05-27 09:32:58] [INFO ] Computed 271 place invariants in 77 ms
[2020-05-27 09:32:59] [INFO ] [Real]Absence check using 266 positive place invariants in 135 ms returned sat
[2020-05-27 09:32:59] [INFO ] [Real]Absence check using 266 positive and 5 generalized place invariants in 4 ms returned sat
[2020-05-27 09:32:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 09:33:00] [INFO ] [Real]Absence check using state equation in 1393 ms returned sat
[2020-05-27 09:33:00] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 09:33:00] [INFO ] [Nat]Absence check using 266 positive place invariants in 159 ms returned sat
[2020-05-27 09:33:00] [INFO ] [Nat]Absence check using 266 positive and 5 generalized place invariants in 5 ms returned sat
[2020-05-27 09:33:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 09:33:02] [INFO ] [Nat]Absence check using state equation in 1359 ms returned sat
[2020-05-27 09:33:02] [INFO ] State equation strengthened by 5 read => feed constraints.
[2020-05-27 09:33:02] [INFO ] [Nat]Added 5 Read/Feed constraints in 7 ms returned sat
[2020-05-27 09:33:02] [INFO ] Deduced a trap composed of 7 places in 160 ms
[2020-05-27 09:33:02] [INFO ] Deduced a trap composed of 6 places in 116 ms
[2020-05-27 09:33:02] [INFO ] Deduced a trap composed of 8 places in 113 ms
[2020-05-27 09:33:03] [INFO ] Deduced a trap composed of 5 places in 178 ms
[2020-05-27 09:33:03] [INFO ] Deduced a trap composed of 6 places in 137 ms
[2020-05-27 09:33:03] [INFO ] Deduced a trap composed of 7 places in 111 ms
[2020-05-27 09:33:03] [INFO ] Deduced a trap composed of 5 places in 177 ms
[2020-05-27 09:33:03] [INFO ] Deduced a trap composed of 6 places in 150 ms
[2020-05-27 09:33:03] [INFO ] Deduced a trap composed of 5 places in 140 ms
[2020-05-27 09:33:04] [INFO ] Deduced a trap composed of 7 places in 125 ms
[2020-05-27 09:33:04] [INFO ] Deduced a trap composed of 11 places in 125 ms
[2020-05-27 09:33:04] [INFO ] Deduced a trap composed of 9 places in 112 ms
[2020-05-27 09:33:04] [INFO ] Deduced a trap composed of 6 places in 143 ms
[2020-05-27 09:33:04] [INFO ] Deduced a trap composed of 7 places in 149 ms
[2020-05-27 09:33:04] [INFO ] Deduced a trap composed of 5 places in 117 ms
[2020-05-27 09:33:05] [INFO ] Deduced a trap composed of 11 places in 113 ms
[2020-05-27 09:33:05] [INFO ] Deduced a trap composed of 15 places in 109 ms
[2020-05-27 09:33:05] [INFO ] Deduced a trap composed of 6 places in 123 ms
[2020-05-27 09:33:05] [INFO ] Deduced a trap composed of 7 places in 135 ms
[2020-05-27 09:33:05] [INFO ] Deduced a trap composed of 11 places in 130 ms
[2020-05-27 09:33:05] [INFO ] Deduced a trap composed of 8 places in 113 ms
[2020-05-27 09:33:05] [INFO ] Deduced a trap composed of 11 places in 111 ms
[2020-05-27 09:33:06] [INFO ] Deduced a trap composed of 8 places in 97 ms
[2020-05-27 09:33:06] [INFO ] Deduced a trap composed of 8 places in 78 ms
[2020-05-27 09:33:06] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 3933 ms
[2020-05-27 09:33:06] [INFO ] Computed and/alt/rep : 763/4584/763 causal constraints in 54 ms.
[2020-05-27 09:33:26] [INFO ] Added : 690 causal constraints over 138 iterations in 20438 ms.(timeout) Result :sat
[2020-05-27 09:33:26] [INFO ] Deduced a trap composed of 11 places in 131 ms
[2020-05-27 09:33:27] [INFO ] Deduced a trap composed of 10 places in 114 ms
[2020-05-27 09:33:27] [INFO ] Deduced a trap composed of 7 places in 88 ms
[2020-05-27 09:33:28] [INFO ] Deduced a trap composed of 9 places in 111 ms
[2020-05-27 09:33:28] [INFO ] Deduced a trap composed of 10 places in 112 ms
[2020-05-27 09:33:28] [INFO ] Deduced a trap composed of 21 places in 115 ms
[2020-05-27 09:33:29] [INFO ] Deduced a trap composed of 19 places in 110 ms
[2020-05-27 09:33:29] [INFO ] Deduced a trap composed of 10 places in 80 ms
[2020-05-27 09:33:29] [INFO ] Deduced a trap composed of 6 places in 58 ms
[2020-05-27 09:33:30] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3311 ms
Attempting to minimize the solution found.
Minimization took 129 ms.
Incomplete Parikh walk after 84500 steps, including 999 resets, run finished after 712 ms. (steps per millisecond=118 ) properties seen :[0] could not realise parikh vector
Support contains 8 out of 794 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 794/794 places, 764/764 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 794 transition count 760
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 790 transition count 760
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 8 place count 790 transition count 755
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 18 place count 785 transition count 755
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 70 place count 759 transition count 729
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 79 place count 759 transition count 729
Applied a total of 79 rules in 117 ms. Remains 759 /794 variables (removed 35) and now considering 729/764 (removed 35) transitions.
Finished structural reductions, in 1 iterations. Remains : 759/794 places, 729/764 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 5254 ms. (steps per millisecond=190 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3107 ms. (steps per millisecond=321 ) properties seen :[0]
Interrupted probabilistic random walk after 3263807 steps, run timeout after 30001 ms. (steps per millisecond=108 ) properties seen :[0]
Probabilistic random walk after 3263807 steps, saw 425383 distinct states, run finished after 30001 ms. (steps per millisecond=108 ) properties seen :[0]
// Phase 1: matrix 729 rows 759 cols
[2020-05-27 09:34:09] [INFO ] Computed 271 place invariants in 27 ms
[2020-05-27 09:34:09] [INFO ] [Real]Absence check using 270 positive place invariants in 113 ms returned sat
[2020-05-27 09:34:09] [INFO ] [Real]Absence check using 270 positive and 1 generalized place invariants in 1 ms returned sat
[2020-05-27 09:34:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 09:34:10] [INFO ] [Real]Absence check using state equation in 1181 ms returned sat
[2020-05-27 09:34:10] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 09:34:11] [INFO ] [Nat]Absence check using 270 positive place invariants in 154 ms returned sat
[2020-05-27 09:34:11] [INFO ] [Nat]Absence check using 270 positive and 1 generalized place invariants in 2 ms returned sat
[2020-05-27 09:34:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 09:34:12] [INFO ] [Nat]Absence check using state equation in 1268 ms returned sat
[2020-05-27 09:34:12] [INFO ] State equation strengthened by 5 read => feed constraints.
[2020-05-27 09:34:12] [INFO ] [Nat]Added 5 Read/Feed constraints in 19 ms returned sat
[2020-05-27 09:34:12] [INFO ] Deduced a trap composed of 5 places in 57 ms
[2020-05-27 09:34:12] [INFO ] Deduced a trap composed of 8 places in 51 ms
[2020-05-27 09:34:12] [INFO ] Deduced a trap composed of 7 places in 48 ms
[2020-05-27 09:34:12] [INFO ] Deduced a trap composed of 8 places in 52 ms
[2020-05-27 09:34:12] [INFO ] Deduced a trap composed of 11 places in 55 ms
[2020-05-27 09:34:12] [INFO ] Deduced a trap composed of 8 places in 42 ms
[2020-05-27 09:34:12] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 588 ms
[2020-05-27 09:34:13] [INFO ] Computed and/alt/rep : 728/4673/728 causal constraints in 73 ms.
[2020-05-27 09:34:34] [INFO ] Added : 680 causal constraints over 136 iterations in 21484 ms.(timeout) Result :sat
[2020-05-27 09:34:34] [INFO ] Deduced a trap composed of 10 places in 47 ms
[2020-05-27 09:34:34] [INFO ] Deduced a trap composed of 11 places in 43 ms
[2020-05-27 09:34:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 443 ms
Attempting to minimize the solution found.
Minimization took 132 ms.
Incomplete Parikh walk after 84300 steps, including 1000 resets, run finished after 577 ms. (steps per millisecond=146 ) properties seen :[0] could not realise parikh vector
Support contains 8 out of 759 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 759/759 places, 729/729 transitions.
Applied a total of 0 rules in 21 ms. Remains 759 /759 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 759/759 places, 729/729 transitions.
Starting structural reductions, iteration 0 : 759/759 places, 729/729 transitions.
Applied a total of 0 rules in 20 ms. Remains 759 /759 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 759 cols
[2020-05-27 09:34:35] [INFO ] Computed 271 place invariants in 9 ms
[2020-05-27 09:34:37] [INFO ] Implicit Places using invariants in 1521 ms returned [745]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1525 ms to find 1 implicit places.
[2020-05-27 09:34:37] [INFO ] Redundant transitions in 45 ms returned []
// Phase 1: matrix 729 rows 758 cols
[2020-05-27 09:34:37] [INFO ] Computed 270 place invariants in 5 ms
[2020-05-27 09:34:38] [INFO ] Dead Transitions using invariants and state equation in 1393 ms returned []
Starting structural reductions, iteration 1 : 758/759 places, 729/729 transitions.
Applied a total of 0 rules in 19 ms. Remains 758 /758 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2020-05-27 09:34:38] [INFO ] Redundant transitions in 31 ms returned []
// Phase 1: matrix 729 rows 758 cols
[2020-05-27 09:34:38] [INFO ] Computed 270 place invariants in 27 ms
[2020-05-27 09:34:40] [INFO ] Dead Transitions using invariants and state equation in 1646 ms returned []
Finished structural reductions, in 2 iterations. Remains : 758/759 places, 729/729 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 5058 ms. (steps per millisecond=197 ) properties seen :[0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 3100 ms. (steps per millisecond=322 ) properties seen :[0]
Interrupted probabilistic random walk after 3096645 steps, run timeout after 30001 ms. (steps per millisecond=103 ) properties seen :[0]
Probabilistic random walk after 3096645 steps, saw 407095 distinct states, run finished after 30002 ms. (steps per millisecond=103 ) properties seen :[0]
// Phase 1: matrix 729 rows 758 cols
[2020-05-27 09:35:18] [INFO ] Computed 270 place invariants in 6 ms
[2020-05-27 09:35:18] [INFO ] [Real]Absence check using 269 positive place invariants in 189 ms returned sat
[2020-05-27 09:35:18] [INFO ] [Real]Absence check using 269 positive and 1 generalized place invariants in 3 ms returned sat
[2020-05-27 09:35:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 09:35:20] [INFO ] [Real]Absence check using state equation in 1153 ms returned sat
[2020-05-27 09:35:20] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 09:35:20] [INFO ] [Nat]Absence check using 269 positive place invariants in 127 ms returned sat
[2020-05-27 09:35:20] [INFO ] [Nat]Absence check using 269 positive and 1 generalized place invariants in 2 ms returned sat
[2020-05-27 09:35:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 09:35:21] [INFO ] [Nat]Absence check using state equation in 1408 ms returned sat
[2020-05-27 09:35:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-05-27 09:35:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 15 ms returned sat
[2020-05-27 09:35:21] [INFO ] Deduced a trap composed of 6 places in 83 ms
[2020-05-27 09:35:22] [INFO ] Deduced a trap composed of 20 places in 101 ms
[2020-05-27 09:35:22] [INFO ] Deduced a trap composed of 18 places in 67 ms
[2020-05-27 09:35:22] [INFO ] Deduced a trap composed of 7 places in 63 ms
[2020-05-27 09:35:22] [INFO ] Deduced a trap composed of 8 places in 94 ms
[2020-05-27 09:35:22] [INFO ] Deduced a trap composed of 8 places in 82 ms
[2020-05-27 09:35:22] [INFO ] Deduced a trap composed of 6 places in 91 ms
[2020-05-27 09:35:22] [INFO ] Deduced a trap composed of 8 places in 84 ms
[2020-05-27 09:35:22] [INFO ] Deduced a trap composed of 5 places in 77 ms
[2020-05-27 09:35:22] [INFO ] Deduced a trap composed of 6 places in 65 ms
[2020-05-27 09:35:22] [INFO ] Deduced a trap composed of 19 places in 45 ms
[2020-05-27 09:35:23] [INFO ] Deduced a trap composed of 8 places in 45 ms
[2020-05-27 09:35:23] [INFO ] Deduced a trap composed of 7 places in 40 ms
[2020-05-27 09:35:23] [INFO ] Deduced a trap composed of 12 places in 42 ms
[2020-05-27 09:35:23] [INFO ] Deduced a trap composed of 11 places in 49 ms
[2020-05-27 09:35:23] [INFO ] Deduced a trap composed of 11 places in 42 ms
[2020-05-27 09:35:23] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1561 ms
[2020-05-27 09:35:23] [INFO ] Computed and/alt/rep : 728/4669/728 causal constraints in 49 ms.
[2020-05-27 09:35:43] [INFO ] Added : 660 causal constraints over 132 iterations in 20223 ms.(timeout) Result :sat
[2020-05-27 09:35:43] [INFO ] Deduced a trap composed of 9 places in 114 ms
[2020-05-27 09:35:44] [INFO ] Deduced a trap composed of 10 places in 124 ms
[2020-05-27 09:35:44] [INFO ] Deduced a trap composed of 10 places in 92 ms
[2020-05-27 09:35:44] [INFO ] Deduced a trap composed of 19 places in 90 ms
[2020-05-27 09:35:44] [INFO ] Deduced a trap composed of 15 places in 64 ms
[2020-05-27 09:35:45] [INFO ] Deduced a trap composed of 10 places in 35 ms
[2020-05-27 09:35:45] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1717 ms
Attempting to minimize the solution found.
Minimization took 140 ms.
Incomplete Parikh walk after 98000 steps, including 1000 resets, run finished after 653 ms. (steps per millisecond=150 ) properties seen :[0] could not realise parikh vector
Support contains 8 out of 758 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 758/758 places, 729/729 transitions.
Applied a total of 0 rules in 24 ms. Remains 758 /758 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 758/758 places, 729/729 transitions.
Starting structural reductions, iteration 0 : 758/758 places, 729/729 transitions.
Applied a total of 0 rules in 36 ms. Remains 758 /758 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 758 cols
[2020-05-27 09:35:46] [INFO ] Computed 270 place invariants in 13 ms
[2020-05-27 09:35:48] [INFO ] Implicit Places using invariants in 1805 ms returned []
// Phase 1: matrix 729 rows 758 cols
[2020-05-27 09:35:48] [INFO ] Computed 270 place invariants in 8 ms
[2020-05-27 09:35:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-05-27 09:35:54] [INFO ] Implicit Places using invariants and state equation in 6196 ms returned []
Implicit Place search using SMT with State Equation took 8010 ms to find 0 implicit places.
[2020-05-27 09:35:54] [INFO ] Redundant transitions in 26 ms returned []
// Phase 1: matrix 729 rows 758 cols
[2020-05-27 09:35:54] [INFO ] Computed 270 place invariants in 14 ms
[2020-05-27 09:35:55] [INFO ] Dead Transitions using invariants and state equation in 1605 ms returned []
Finished structural reductions, in 1 iterations. Remains : 758/758 places, 729/729 transitions.
Incomplete random walk after 100000 steps, including 4 resets, run finished after 561 ms. (steps per millisecond=178 ) properties seen :[0]
// Phase 1: matrix 729 rows 758 cols
[2020-05-27 09:35:56] [INFO ] Computed 270 place invariants in 5 ms
[2020-05-27 09:35:56] [INFO ] [Real]Absence check using 269 positive place invariants in 152 ms returned sat
[2020-05-27 09:35:56] [INFO ] [Real]Absence check using 269 positive and 1 generalized place invariants in 2 ms returned sat
[2020-05-27 09:35:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 09:35:57] [INFO ] [Real]Absence check using state equation in 1155 ms returned sat
[2020-05-27 09:35:57] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 09:35:58] [INFO ] [Nat]Absence check using 269 positive place invariants in 163 ms returned sat
[2020-05-27 09:35:58] [INFO ] [Nat]Absence check using 269 positive and 1 generalized place invariants in 2 ms returned sat
[2020-05-27 09:35:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 09:35:59] [INFO ] [Nat]Absence check using state equation in 1198 ms returned sat
[2020-05-27 09:35:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-05-27 09:35:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 16 ms returned sat
[2020-05-27 09:35:59] [INFO ] Deduced a trap composed of 6 places in 90 ms
[2020-05-27 09:35:59] [INFO ] Deduced a trap composed of 20 places in 96 ms
[2020-05-27 09:35:59] [INFO ] Deduced a trap composed of 18 places in 86 ms
[2020-05-27 09:35:59] [INFO ] Deduced a trap composed of 7 places in 69 ms
[2020-05-27 09:35:59] [INFO ] Deduced a trap composed of 8 places in 91 ms
[2020-05-27 09:36:00] [INFO ] Deduced a trap composed of 8 places in 73 ms
[2020-05-27 09:36:00] [INFO ] Deduced a trap composed of 6 places in 93 ms
[2020-05-27 09:36:00] [INFO ] Deduced a trap composed of 8 places in 75 ms
[2020-05-27 09:36:00] [INFO ] Deduced a trap composed of 5 places in 72 ms
[2020-05-27 09:36:00] [INFO ] Deduced a trap composed of 6 places in 110 ms
[2020-05-27 09:36:00] [INFO ] Deduced a trap composed of 19 places in 90 ms
[2020-05-27 09:36:00] [INFO ] Deduced a trap composed of 8 places in 82 ms
[2020-05-27 09:36:00] [INFO ] Deduced a trap composed of 7 places in 52 ms
[2020-05-27 09:36:01] [INFO ] Deduced a trap composed of 12 places in 73 ms
[2020-05-27 09:36:01] [INFO ] Deduced a trap composed of 11 places in 74 ms
[2020-05-27 09:36:01] [INFO ] Deduced a trap composed of 11 places in 68 ms
[2020-05-27 09:36:01] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1904 ms
[2020-05-27 09:36:01] [INFO ] Computed and/alt/rep : 728/4669/728 causal constraints in 48 ms.
[2020-05-27 09:36:17] [INFO ] Added : 575 causal constraints over 115 iterations in 16570 ms. Result :(error "Failed to check-sat")
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 758 transition count 729
Applied a total of 1 rules in 40 ms. Remains 758 /758 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 758 cols
[2020-05-27 09:36:17] [INFO ] Computed 270 place invariants in 9 ms
[2020-05-27 09:36:18] [INFO ] [Real]Absence check using 269 positive place invariants in 156 ms returned sat
[2020-05-27 09:36:18] [INFO ] [Real]Absence check using 269 positive and 1 generalized place invariants in 3 ms returned sat
[2020-05-27 09:36:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 09:36:19] [INFO ] [Real]Absence check using state equation in 1198 ms returned sat
[2020-05-27 09:36:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-05-27 09:36:19] [INFO ] [Real]Added 1 Read/Feed constraints in 9 ms returned sat
[2020-05-27 09:36:19] [INFO ] Deduced a trap composed of 6 places in 109 ms
[2020-05-27 09:36:19] [INFO ] Deduced a trap composed of 7 places in 107 ms
[2020-05-27 09:36:19] [INFO ] Deduced a trap composed of 5 places in 113 ms
[2020-05-27 09:36:20] [INFO ] Deduced a trap composed of 8 places in 106 ms
[2020-05-27 09:36:20] [INFO ] Deduced a trap composed of 8 places in 76 ms
[2020-05-27 09:36:20] [INFO ] Deduced a trap composed of 7 places in 88 ms
[2020-05-27 09:36:20] [INFO ] Deduced a trap composed of 19 places in 63 ms
[2020-05-27 09:36:20] [INFO ] Deduced a trap composed of 10 places in 42 ms
[2020-05-27 09:36:20] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1030 ms
[2020-05-27 09:36:20] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 09:36:20] [INFO ] [Nat]Absence check using 269 positive place invariants in 163 ms returned sat
[2020-05-27 09:36:20] [INFO ] [Nat]Absence check using 269 positive and 1 generalized place invariants in 2 ms returned sat
[2020-05-27 09:36:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 09:36:21] [INFO ] [Nat]Absence check using state equation in 1127 ms returned sat
[2020-05-27 09:36:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2020-05-27 09:36:22] [INFO ] Deduced a trap composed of 5 places in 104 ms
[2020-05-27 09:36:22] [INFO ] Deduced a trap composed of 11 places in 121 ms
[2020-05-27 09:36:22] [INFO ] Deduced a trap composed of 7 places in 88 ms
[2020-05-27 09:36:22] [INFO ] Deduced a trap composed of 7 places in 112 ms
[2020-05-27 09:36:22] [INFO ] Deduced a trap composed of 8 places in 115 ms
[2020-05-27 09:36:22] [INFO ] Deduced a trap composed of 20 places in 81 ms
[2020-05-27 09:36:22] [INFO ] Deduced a trap composed of 9 places in 64 ms
[2020-05-27 09:36:22] [INFO ] Deduced a trap composed of 11 places in 84 ms
[2020-05-27 09:36:23] [INFO ] Deduced a trap composed of 8 places in 75 ms
[2020-05-27 09:36:23] [INFO ] Deduced a trap composed of 11 places in 103 ms
[2020-05-27 09:36:23] [INFO ] Deduced a trap composed of 6 places in 70 ms
[2020-05-27 09:36:23] [INFO ] Deduced a trap composed of 7 places in 75 ms
[2020-05-27 09:36:23] [INFO ] Deduced a trap composed of 11 places in 63 ms
[2020-05-27 09:36:23] [INFO ] Deduced a trap composed of 16 places in 76 ms
[2020-05-27 09:36:23] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1752 ms
[2020-05-27 09:36:23] [INFO ] Computed and/alt/rep : 728/4669/728 causal constraints in 72 ms.
[2020-05-27 09:36:43] [INFO ] Added : 620 causal constraints over 124 iterations in 20142 ms.(timeout) Result :sat
[2020-05-27 09:36:43] [INFO ] Deduced a trap composed of 10 places in 53 ms
[2020-05-27 09:36:44] [INFO ] Deduced a trap composed of 13 places in 42 ms
[2020-05-27 09:36:44] [INFO ] Deduced a trap composed of 10 places in 37 ms
[2020-05-27 09:36:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 646 ms
Attempting to minimize the solution found.
Minimization took 110 ms.
[2020-05-27 09:36:45] [INFO ] Flatten gal took : 156 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-27 09:36:45] [INFO ] Applying decomposition
[2020-05-27 09:36:45] [INFO ] Flatten gal took : 166 ms
[2020-05-27 09:36:45] [INFO ] Input system was already deterministic with 729 transitions.
[2020-05-27 09:36:45] [INFO ] Input system was already deterministic with 729 transitions.
[2020-05-27 09:36:45] [INFO ] Flatten gal took : 186 ms
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/graph978875547190600069.txt, -o, /tmp/graph978875547190600069.bin, -w, /tmp/graph978875547190600069.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/graph978875547190600069.bin, -l, -1, -v, -w, /tmp/graph978875547190600069.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 09:36:45] [INFO ] Decomposing Gal with order
[2020-05-27 09:36:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 09:36:45] [INFO ] Ran tautology test, simplified 0 / 1 in 524 ms.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 729 rows 758 cols
[2020-05-27 09:36:45] [INFO ] Computed 270 place invariants in 10 ms
inv : p0 + p1 + p100 + p102 = 1
inv : p0 + p1 + p1467 + p1469 = 1
inv : p0 + p1 + p529 + p531 + p533 + p535 = 1
inv : p0 + p1 + p126 + p128 = 1
inv : p0 + p1 + p848 + p851 + p853 + p855 = 1
inv : p0 + p1 + p41 + p43 = 1
inv : p0 + p1 + p1408 + p1410 = 1
inv : p0 + p1 + p67 + p69 = 1
inv : p0 + p1 + p575 + p578 + p579 = 1
inv : p0 + p1 + p1601 + p1603 = 1
inv : p0 + p1 + p1634 + p1636 = 1
inv : p0 + p1 + p277 + p279 = 1
inv : p0 + p1 + p1349 + p1351 = 1
inv : p0 + p1 + p1526 + p1528 = 1
inv : p0 + p1 + p185 + p187 = 1
inv : p0 + p1 + p883 + p885 + p887 + p889 = 1
inv : p0 + p1 + p44 + p49 + p50 = 1
inv : p0 + p1 + p218 + p220 = 1
inv : p0 + p1 + p421 + p423 = 1
inv : p0 + p1 + p1546 + p1548 + p1550 + p1552 = 1
inv : p0 + p1 + p159 + p161 = 1
inv : p0 + p1 + p1113 + p1115 = 1
inv : p0 + p1 + p513 + p515 = 1
inv : p0 + p1 + p572 + p574 = 1
inv : p0 + p1 + p661 + p663 + p665 + p667 = 1
inv : p0 + p1 + p480 + p482 = 1
inv : p0 + p1 + p1674 + p1677 + p1679 + p1681 = 1
inv : p0 + p1 + p1251 + p1253 + p1255 + p1257 = 1
inv : p0 + p1 + p1342 + p1347 + p1348 = 1
inv : p0 + p1 + p1172 + p1174 = 1
inv : p0 + p1 + p516 + p521 + p522 = 1
inv : p0 + p1 + p1571 + p1572 + p1588 + p1590 = 1
inv : p0 + p1 + p1379 + p1382 + p1384 + p1386 = 1
inv : p0 + p1 + p303 + p305 = 1
inv : p0 + p1 + p1290 + p1292 = 1
inv : p0 + p1 + p395 + p397 = 1
inv : p0 + p1 + p366 + p368 + p370 + p372 = 1
inv : p0 + p1 + p926 + p928 = 1
inv : p0 + p1 + p1637 + p1640 + p1641 = 1
inv : p0 + p1 + p118 + p120 + p122 + p124 = 1
inv : p0 + p1 + p598 + p600 = 1
inv : p0 + p1 + p690 + p692 = 1
inv : p0 + p1 + p494 + p497 + p499 + p501 = 1
inv : p0 + p1 + p759 + p761 = 1
inv : p0 + p1 + p1662 + p1663 = 1
inv : p0 + p1 + p248 + p250 + p252 + p254 = 1
inv : p0 + p1 + p641 + p643 = 1
inv : p0 + p1 + p1571 + p1572 + p1585 + p1587 = 1
inv : p0 + p1 + p1025 + p1028 + p1030 + p1032 = 1
inv : p0 + p1 + p988 + p991 + p992 = 1
inv : p0 + p1 + p1103 + p1105 = 1
inv : p0 + p1 + p516 + p519 + p520 = 1
inv : p0 + p1 + p103 + p108 + p109 = 1
inv : p0 + p1 + p716 + p718 = 1
inv : p0 + p1 + p838 + p840 + p842 + p844 = 1
inv : p0 + p1 + p880 + p882 = 1
inv : p0 + p1 + p1133 + p1135 + p1137 + p1139 = 1
inv : p0 + p1 + p777 + p778 = 1
inv : p0 + p1 + p582 + p584 = 1
inv : p0 + p1 + p228 + p230 = 1
inv : p0 + p1 + p539 + p541 = 1
inv : p0 + p1 + p631 + p633 = 1
inv : p0 + p1 + p457 + p462 + p463 = 1
inv : p0 + p1 + p454 + p456 = 1
inv : p0 + p1 + p1261 + p1264 + p1266 + p1268 = 1
inv : p0 + p1 + p1457 + p1459 = 1
inv : p0 + p1 + p362 + p364 = 1
inv : p0 + p1 + p1365 + p1367 = 1
inv : p0 + p1 + p162 + p165 + p166 = 1
inv : p0 + p1 + p1280 + p1282 = 1
inv : p0 + p1 + p405 + p407 = 1
inv : p0 + p1 + p234 + p236 + p238 + p240 = 1
inv : p0 + p1 + p1106 + p1109 + p1110 = 1
inv : p0 + p1 + p1719 + p1721 = 1
inv : p0 + p1 + p1188 + p1190 = 1
inv : p0 + p1 + p1231 + p1233 = 1
inv : p0 + p1 + p1460 + p1463 + p1464 = 1
inv : p0 + p1768 + p1772 + p1774 = 1
inv : p0 + p1 + p376 + p379 + p381 + p383 = 1
inv : p0 + p1 + p1401 + p1406 + p1407 = 1
inv : p0 + p1 + p1119 + p1121 + p1123 + p1125 = 1
inv : p0 + p1 + p1342 + p1345 + p1346 = 1
inv : p0 + p1 + p162 + p167 + p168 = 1
inv : p0 + p1 + p693 + p696 + p697 = 1
inv : p0 + p1 + p1044 + p1046 = 1
inv : p0 + p1 + p1234 + p1236 = 1
inv : p0 + p1 + p1352 + p1354 = 1
inv : p0 + p1 + p130 + p132 + p134 + p136 = 1
inv : p0 + p1 + p1637 + p1642 + p1643 = 1
inv : p0 + p1 + p221 + p224 + p225 = 1
inv : p0 + p1 + p1283 + p1288 + p1289 = 1
inv : p0 + p1 + p703 + p705 = 1
inv : p0 + p1 + p575 + p580 + p581 = 1
inv : p0 + p1 + p1339 + p1341 = 1
inv : p0 + p1 + p818 + p820 = 1
inv : p0 + p1 + p1529 + p1531 = 1
inv : p0 + p1 + p1703 + p1705 = 1
inv : p0 + p1 + p346 + p348 = 1
inv : p0 + p1 + p1411 + p1413 = 1
inv : p0 + p1 + p169 + p171 = 1
inv : p0 + p1 + p51 + p53 = 1
inv : p0 + p1 + p585 + p587 = 1
inv : p0 + p1 + p1516 + p1518 = 1
inv : p0 + p1 + p811 + p814 + p815 = 1
inv : p0 + p1 + p1129 + p1131 = 1
inv : p0 + p1 + p71 + p73 + p75 + p77 = 1
inv : p0 + p1 + p730 + p733 + p735 + p737 = 1
inv : p0 + p1 + p231 + p233 = 1
inv : p0 + p1 + p1401 + p1404 + p1405 = 1
inv : p0 + p1 + p700 + p702 = 1
inv : p0 + p1 + p553 + p556 + p558 + p560 = 1
inv : p0 + p1 + p408 + p410 = 1
inv : p0 + p1 + p942 + p944 + p946 + p948 + p950 + p951 = 1
inv : p0 + p1 + p523 + p525 = 1
inv : p0 + p1 + p929 + p932 + p933 = 1
inv : p0 + p1 + p821 + p823 = 1
inv : p0 + p1 + p54 + p56 = 1
inv : p0 + p1792 + p1795 + p1797 + p1799 = 1
inv : p0 + p1 + p57 + p59 + p61 + p63 = 1
inv : p0 + p1 + p1571 + p1591 + p1593 + p1595 + p1597 = 1
inv : p0 + p1 + p779 + p781 + p782 + p783 + p785 = 1
inv : p0 + p1 + p1306 + p1308 = 1
inv : p0 + p1 + p221 + p226 + p227 = 1
inv : p0 + p1 + p1556 + p1559 + p1561 + p1563 = 1
inv : p0 + p1 + p1696 + p1699 + p1700 = 1
inv : p0 + p1 + p634 + p637 + p638 = 1
inv : p0 + p1 + p280 + p283 + p284 = 1
inv : p0 + p1 + p1438 + p1441 + p1443 + p1445 = 1
inv : p0 + p1 + p789 + p792 + p794 + p796 = 1
inv : p0 + p1 + p671 + p674 + p676 + p678 = 1
inv : p0 + p1 + p657 + p659 = 1
inv : p0 + p1 + p907 + p910 + p912 + p914 + p915 = 1
inv : p0 + p1 + p1693 + p1695 = 1
inv : p0 + p1 + p336 + p338 = 1
inv : p0 + p1 + p612 + p615 + p617 + p619 = 1
inv : p0 + p1 + p1162 + p1164 = 1
inv : p0 + p1 + p1483 + p1485 = 1
inv : -p1758 - p1759 + p1760 + p1761 = 0
inv : p0 + p1 + p1497 + p1500 + p1502 + p1504 = 1
inv : p0 + p1 + p808 + p810 = 1
inv : p0 + p1 + p1192 + p1194 + p1196 + p1198 = 1
inv : p0 + p1 + p1605 + p1607 + p1609 + p1611 = 1
inv : p0 + p1 + p834 + p836 = 1
inv : p0 + p1 + p280 + p285 + p286 = 1
inv : p0 + p1 + p1060 + p1062 + p1063 + p1064 + p1066 = 1
inv : p0 + p1 + p939 + p941 = 1
inv : p0 + p1 + p1320 + p1323 + p1325 + p1327 = 1
inv : p0 + p1 + p1733 + p1736 + p1738 + p1740 = 1
inv : p0 + p1 + p720 + p722 + p724 + p726 = 1
inv : p0 + p1 + p867 + p869 = 1
inv : p0 + p1 + p995 + p997 = 1
inv : p0 + p1 + p435 + p438 + p440 + p442 = 1
inv : p0 + p1 + p811 + p816 + p817 = 1
inv : p0 + p1 + p1047 + p1052 + p1053 = 1
inv : p0 + p1 + p870 + p873 + p874 = 1
inv : p0 + p1 + p1054 + p1056 = 1
inv : p0 + p1 + p1224 + p1227 + p1228 = 1
inv : p0 + p1 + p177 + p179 + p181 + p183 = 1
inv : p0 + p1 + p893 + p895 = 1
inv : p0 + p1 + p1001 + p1003 + p1005 + p1007 = 1
inv : p0 + p1762 + p1764 = 1
inv : p0 + p1778 + p1780 = 1
inv : p0 + p1782 + p1784 + p1786 + p1788 = 1
inv : p0 + p1 + p966 + p969 + p971 + p973 = 1
inv : p0 + p1 + p309 + p311 + p313 + p315 = 1
inv : p0 + p1 + p693 + p698 + p699 = 1
inv : p0 + p1 + p1165 + p1170 + p1171 = 1
inv : p0 + p1 + p1106 + p1111 + p1112 = 1
inv : p0 + p1 + p1487 + p1489 + p1491 + p1493 = 1
inv : p0 + p1 + p398 + p401 + p402 = 1
inv : p0 + p1 + p349 + p351 = 1
inv : p0 + p1 + p172 + p174 = 1
inv : p0 + p1 + p1696 + p1701 + p1702 = 1
inv : p0 + p1 + p929 + p934 + p935 = 1
inv : p0 + p1 + p526 + p528 = 1
inv : p0 + p1 + p1615 + p1618 + p1620 + p1622 = 1
inv : p0 + p1752 + p1754 = 1
inv : p0 + p1 + p113 + p115 = 1
inv : p0 + p1 + p762 + p764 = 1
inv : p0 + p1 + p317 + p320 + p322 + p324 = 1
inv : p0 + p1 + p634 + p639 + p640 = 1
inv : p0 + p1 + p339 + p342 + p343 = 1
inv : p0 + p1 + p765 + p767 + p769 + p771 = 1
inv : p0 + p1 + p293 + p295 + p297 + p299 = 1
inv : p0 + p1 + p998 + p1000 = 1
inv : p0 + p1755 + p1758 + p1759 = 1
inv : p0 + p1 + p936 + p938 = 1
inv : p0 + p1 + p189 + p191 + p193 + p195 = 1
inv : p0 + p1 + p1202 + p1205 + p1207 + p1209 = 1
inv : p0 + p1 + p1011 + p1013 = 1
inv : p0 + p1 + p1074 + p1076 + p1078 + p1080 = 1
inv : p0 + p1 + p1706 + p1708 = 1
inv : p0 + p1 + p1283 + p1286 + p1287 = 1
inv : p0 + p1 + p1224 + p1229 + p1230 = 1
inv : p0 + p1 + p706 + p708 + p710 + p712 = 1
inv : p0 + p1 + p1175 + p1177 = 1
inv : p0 + p1 + p1116 + p1118 = 1
inv : p0 + p1 + p897 + p899 + p901 + p903 = 1
inv : p0 + p1 + p258 + p261 + p263 + p265 = 1
inv : p0 + p1 + p352 + p354 + p356 + p358 = 1
inv : p0 + p1 + p1369 + p1371 + p1373 + p1375 = 1
inv : p0 + p1 + p543 + p545 + p547 + p549 = 1
inv : p0 + p1 + p457 + p460 + p461 = 1
inv : p0 + p1 + p1293 + p1295 = 1
inv : p0 + p1 + p985 + p987 = 1
inv : p0 + p1 + p1460 + p1465 + p1466 = 1
inv : p0 + p1 + p1650 + p1652 + p1654 + p1656 = 1
inv : p0 + p1 + p956 + p958 + p960 + p962 = 1
inv : p0 + p1 + p1143 + p1146 + p1148 + p1150 = 1
inv : p0 + p1 + p1571 + p1572 + p1578 + p1581 + p1582 = 1
inv : p0 + p1 + p398 + p403 + p404 = 1
inv : p0 + p1 + p1178 + p1180 + p1182 + p1184 = 1
inv : p0 + p1 + p30 + p32 = 1
inv : p0 + p1 + p1398 + p1400 = 1
inv : p0 + p1 + p1571 + p1572 + p1575 + p1577 = 1
inv : p0 + p1 + p1428 + p1430 + p1432 + p1434 = 1
inv : p0 + p1 + p1424 + p1426 = 1
inv : p0 + p1 + p1542 + p1544 = 1
inv : p0 + p1 + p44 + p47 + p48 = 1
inv : p0 + p1 + p952 + p954 = 1
inv : p0 + p1 + p1221 + p1223 = 1
inv : p0 + p1 + p647 + p649 + p651 + p653 = 1
inv : p0 + p1 + p464 + p466 = 1
inv : p0 + p1 + p411 + p413 + p415 + p417 = 1
inv : p0 + p1 + p339 + p344 + p345 = 1
inv : p0 + p1 + p1532 + p1534 + p1536 + p1538 = 1
inv : p0 + p1 + p1015 + p1017 + p1019 + p1021 = 1
inv : p0 + p1 + p1237 + p1239 + p1241 + p1243 = 1
inv : p0 + p1 + p1057 + p1059 = 1
inv : p0 + p1 + p1084 + p1087 + p1089 + p1091 = 1
inv : p0 + p1 + p1647 + p1649 = 1
inv : p0 + p1 + p1473 + p1475 + p1477 + p1479 = 1
inv : p0 + p1 + p290 + p292 = 1
inv : p0 + p1 + p824 + p826 + p828 + p830 = 1
inv : p0 + p1 + p427 + p429 + p431 + p433 = 1
inv : p0 + p1 + p1296 + p1298 + p1300 + p1302 = 1
inv : p0 + p1 + p602 + p604 + p606 + p608 = 1
inv : p0 + p1 + p1709 + p1711 + p1713 + p1715 = 1
inv : p0 + p1 + p1070 + p1072 = 1
inv : p0 + p1 + p752 + p755 + p756 = 1
inv : p0 + p1 + p199 + p202 + p204 + p206 = 1
inv : p0 + p1 + p1165 + p1168 + p1169 = 1
inv : p0 + p1 + p1519 + p1524 + p1525 = 1
inv : p0 + p1 + p1723 + p1725 + p1727 + p1729 = 1
inv : p0 + p1 + p752 + p757 + p758 = 1
inv : p0 + p1 + p1519 + p1522 + p1523 = 1
inv : p0 + p1 + p103 + p106 + p107 = 1
inv : p0 + p1 + p1247 + p1249 = 1
inv : p0 + p1 + p287 + p289 = 1
inv : p0 + p1 + p470 + p472 + p474 + p476 = 1
inv : p0 + p1 + p588 + p590 + p592 + p594 = 1
inv : p0 + p1 + p467 + p469 = 1
inv : p0 + p1 + p1644 + p1646 = 1
inv : p0 + p1 + p140 + p143 + p145 + p147 = 1
inv : p0 + p1 + p877 + p879 = 1
inv : p0 + p1 + p1664 + p1666 + p1668 + p1670 = 1
inv : p0 + p1 + p1355 + p1357 + p1359 + p1361 = 1
inv : p0 + p1 + p1414 + p1416 + p1418 + p1420 = 1
inv : p0 + p1 + p749 + p751 = 1
inv : p0 + p1 + p988 + p993 + p994 = 1
inv : p0 + p1 + p1310 + p1312 + p1314 + p1316 = 1
inv : p0 + p1 + p870 + p875 + p876 = 1
inv : p0 + p1 + p1047 + p1050 + p1051 = 1
inv : p0 + p1 + p1571 + p1572 + p1578 + p1583 + p1584 = 1
inv : p0 + p1 + p1470 + p1472 = 1
inv : p0 + p1 + p110 + p112 = 1
inv : p0 + p1 + p81 + p84 + p86 + p88 = 1
inv : p0 + p1 + p244 + p246 = 1
inv : p0 + p1 + p644 + p646 = 1
inv : p0 + p1 + p484 + p486 + p488 + p490 = 1
Total of 270 invariants.
[2020-05-27 09:36:45] [INFO ] Computed 270 place invariants in 14 ms
[2020-05-27 09:36:45] [INFO ] BMC solution for property ShieldIIPs-PT-030B-ReachabilityFireability-00(UNSAT) depth K=0 took 15 ms
[2020-05-27 09:36:45] [INFO ] BMC solution for property ShieldIIPs-PT-030B-ReachabilityFireability-00(UNSAT) depth K=1 took 30 ms
[2020-05-27 09:36:46] [INFO ] Removed a total of 583 redundant transitions.
[2020-05-27 09:36:46] [INFO ] Flatten gal took : 216 ms
[2020-05-27 09:36:46] [INFO ] BMC solution for property ShieldIIPs-PT-030B-ReachabilityFireability-00(UNSAT) depth K=2 took 117 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 729 rows 758 cols
[2020-05-27 09:36:46] [INFO ] Computed 270 place invariants in 6 ms
inv : p0 + p1 + p100 + p102 = 1
inv : p0 + p1 + p1467 + p1469 = 1
inv : p0 + p1 + p529 + p531 + p533 + p535 = 1
inv : p0 + p1 + p126 + p128 = 1
inv : p0 + p1 + p848 + p851 + p853 + p855 = 1
inv : p0 + p1 + p41 + p43 = 1
inv : p0 + p1 + p1408 + p1410 = 1
inv : p0 + p1 + p67 + p69 = 1
inv : p0 + p1 + p575 + p578 + p579 = 1
inv : p0 + p1 + p1601 + p1603 = 1
inv : p0 + p1 + p1634 + p1636 = 1
inv : p0 + p1 + p277 + p279 = 1
inv : p0 + p1 + p1349 + p1351 = 1
inv : p0 + p1 + p1526 + p1528 = 1
inv : p0 + p1 + p185 + p187 = 1
inv : p0 + p1 + p883 + p885 + p887 + p889 = 1
inv : p0 + p1 + p44 + p49 + p50 = 1
inv : p0 + p1 + p218 + p220 = 1
inv : p0 + p1 + p421 + p423 = 1
inv : p0 + p1 + p1546 + p1548 + p1550 + p1552 = 1
inv : p0 + p1 + p159 + p161 = 1
inv : p0 + p1 + p1113 + p1115 = 1
inv : p0 + p1 + p513 + p515 = 1
inv : p0 + p1 + p572 + p574 = 1
inv : p0 + p1 + p661 + p663 + p665 + p667 = 1
inv : p0 + p1 + p480 + p482 = 1
inv : p0 + p1 + p1674 + p1677 + p1679 + p1681 = 1
inv : p0 + p1 + p1251 + p1253 + p1255 + p1257 = 1
inv : p0 + p1 + p1342 + p1347 + p1348 = 1
inv : p0 + p1 + p1172 + p1174 = 1
inv : p0 + p1 + p516 + p521 + p522 = 1
inv : p0 + p1 + p1571 + p1572 + p1588 + p1590 = 1
inv : p0 + p1 + p1379 + p1382 + p1384 + p1386 = 1
inv : p0 + p1 + p303 + p305 = 1
inv : p0 + p1 + p1290 + p1292 = 1
inv : p0 + p1 + p395 + p397 = 1
inv : p0 + p1 + p366 + p368 + p370 + p372 = 1
inv : p0 + p1 + p926 + p928 = 1
inv : p0 + p1 + p1637 + p1640 + p1641 = 1
inv : p0 + p1 + p118 + p120 + p122 + p124 = 1
inv : p0 + p1 + p598 + p600 = 1
inv : p0 + p1 + p690 + p692 = 1
inv : p0 + p1 + p494 + p497 + p499 + p501 = 1
inv : p0 + p1 + p759 + p761 = 1
inv : p0 + p1 + p1662 + p1663 = 1
inv : p0 + p1 + p248 + p250 + p252 + p254 = 1
inv : p0 + p1 + p641 + p643 = 1
inv : p0 + p1 + p1571 + p1572 + p1585 + p1587 = 1
inv : p0 + p1 + p1025 + p1028 + p1030 + p1032 = 1
inv : p0 + p1 + p988 + p991 + p992 = 1
inv : p0 + p1 + p1103 + p1105 = 1
inv : p0 + p1 + p516 + p519 + p520 = 1
inv : p0 + p1 + p103 + p108 + p109 = 1
inv : p0 + p1 + p716 + p718 = 1
inv : p0 + p1 + p838 + p840 + p842 + p844 = 1
inv : p0 + p1 + p880 + p882 = 1
inv : p0 + p1 + p1133 + p1135 + p1137 + p1139 = 1
inv : p0 + p1 + p777 + p778 = 1
inv : p0 + p1 + p582 + p584 = 1
inv : p0 + p1 + p228 + p230 = 1
inv : p0 + p1 + p539 + p541 = 1
inv : p0 + p1 + p631 + p633 = 1
inv : p0 + p1 + p457 + p462 + p463 = 1
inv : p0 + p1 + p454 + p456 = 1
inv : p0 + p1 + p1261 + p1264 + p1266 + p1268 = 1
inv : p0 + p1 + p1457 + p1459 = 1
inv : p0 + p1 + p362 + p364 = 1
inv : p0 + p1 + p1365 + p1367 = 1
inv : p0 + p1 + p162 + p165 + p166 = 1
inv : p0 + p1 + p1280 + p1282 = 1
inv : p0 + p1 + p405 + p407 = 1
inv : p0 + p1 + p234 + p236 + p238 + p240 = 1
inv : p0 + p1 + p1106 + p1109 + p1110 = 1
inv : p0 + p1 + p1719 + p1721 = 1
inv : p0 + p1 + p1188 + p1190 = 1
inv : p0 + p1 + p1231 + p1233 = 1
inv : p0 + p1 + p1460 + p1463 + p1464 = 1
inv : p0 + p1768 + p1772 + p1774 = 1
inv : p0 + p1 + p376 + p379 + p381 + p383 = 1
inv : p0 + p1 + p1401 + p1406 + p1407 = 1
inv : p0 + p1 + p1119 + p1121 + p1123 + p1125 = 1
inv : p0 + p1 + p1342 + p1345 + p1346 = 1
inv : p0 + p1 + p162 + p167 + p168 = 1
inv : p0 + p1 + p693 + p696 + p697 = 1
inv : p0 + p1 + p1044 + p1046 = 1
inv : p0 + p1 + p1234 + p1236 = 1
inv : p0 + p1 + p1352 + p1354 = 1
inv : p0 + p1 + p130 + p132 + p134 + p136 = 1
inv : p0 + p1 + p1637 + p1642 + p1643 = 1
inv : p0 + p1 + p221 + p224 + p225 = 1
inv : p0 + p1 + p1283 + p1288 + p1289 = 1
inv : p0 + p1 + p703 + p705 = 1
inv : p0 + p1 + p575 + p580 + p581 = 1
inv : p0 + p1 + p1339 + p1341 = 1
inv : p0 + p1 + p818 + p820 = 1
inv : p0 + p1 + p1529 + p1531 = 1
inv : p0 + p1 + p1703 + p1705 = 1
inv : p0 + p1 + p346 + p348 = 1
inv : p0 + p1 + p1411 + p1413 = 1
inv : p0 + p1 + p169 + p171 = 1
inv : p0 + p1 + p51 + p53 = 1
inv : p0 + p1 + p585 + p587 = 1
inv : p0 + p1 + p1516 + p1518 = 1
inv : p0 + p1 + p811 + p814 + p815 = 1
inv : p0 + p1 + p1129 + p1131 = 1
inv : p0 + p1 + p71 + p73 + p75 + p77 = 1
inv : p0 + p1 + p730 + p733 + p735 + p737 = 1
inv : p0 + p1 + p231 + p233 = 1
inv : p0 + p1 + p1401 + p1404 + p1405 = 1
inv : p0 + p1 + p700 + p702 = 1
inv : p0 + p1 + p553 + p556 + p558 + p560 = 1
inv : p0 + p1 + p408 + p410 = 1
inv : p0 + p1 + p942 + p944 + p946 + p948 + p950 + p951 = 1
inv : p0 + p1 + p523 + p525 = 1
inv : p0 + p1 + p929 + p932 + p933 = 1
inv : p0 + p1 + p821 + p823 = 1
inv : p0 + p1 + p54 + p56 = 1
inv : p0 + p1792 + p1795 + p1797 + p1799 = 1
inv : p0 + p1 + p57 + p59 + p61 + p63 = 1
inv : p0 + p1 + p1571 + p1591 + p1593 + p1595 + p1597 = 1
inv : p0 + p1 + p779 + p781 + p782 + p783 + p785 = 1
inv : p0 + p1 + p1306 + p1308 = 1
inv : p0 + p1 + p221 + p226 + p227 = 1
inv : p0 + p1 + p1556 + p1559 + p1561 + p1563 = 1
inv : p0 + p1 + p1696 + p1699 + p1700 = 1
inv : p0 + p1 + p634 + p637 + p638 = 1
inv : p0 + p1 + p280 + p283 + p284 = 1
inv : p0 + p1 + p1438 + p1441 + p1443 + p1445 = 1
inv : p0 + p1 + p789 + p792 + p794 + p796 = 1
inv : p0 + p1 + p671 + p674 + p676 + p678 = 1
inv : p0 + p1 + p657 + p659 = 1
inv : p0 + p1 + p907 + p910 + p912 + p914 + p915 = 1
inv : p0 + p1 + p1693 + p1695 = 1
inv : p0 + p1 + p336 + p338 = 1
inv : p0 + p1 + p612 + p615 + p617 + p619 = 1
inv : p0 + p1 + p1162 + p1164 = 1
inv : p0 + p1 + p1483 + p1485 = 1
inv : -p1758 - p1759 + p1760 + p1761 = 0
inv : p0 + p1 + p1497 + p1500 + p1502 + p1504 = 1
inv : p0 + p1 + p808 + p810 = 1
inv : p0 + p1 + p1192 + p1194 + p1196 + p1198 = 1
inv : p0 + p1 + p1605 + p1607 + p1609 + p1611 = 1
inv : p0 + p1 + p834 + p836 = 1
inv : p0 + p1 + p280 + p285 + p286 = 1
inv : p0 + p1 + p1060 + p1062 + p1063 + p1064 + p1066 = 1
inv : p0 + p1 + p939 + p941 = 1
inv : p0 + p1 + p1320 + p1323 + p1325 + p1327 = 1
inv : p0 + p1 + p1733 + p1736 + p1738 + p1740 = 1
inv : p0 + p1 + p720 + p722 + p724 + p726 = 1
inv : p0 + p1 + p867 + p869 = 1
inv : p0 + p1 + p995 + p997 = 1
inv : p0 + p1 + p435 + p438 + p440 + p442 = 1
inv : p0 + p1 + p811 + p816 + p817 = 1
inv : p0 + p1 + p1047 + p1052 + p1053 = 1
inv : p0 + p1 + p870 + p873 + p874 = 1
inv : p0 + p1 + p1054 + p1056 = 1
inv : p0 + p1 + p1224 + p1227 + p1228 = 1
inv : p0 + p1 + p177 + p179 + p181 + p183 = 1
inv : p0 + p1 + p893 + p895 = 1
inv : p0 + p1 + p1001 + p1003 + p1005 + p1007 = 1
inv : p0 + p1762 + p1764 = 1
inv : p0 + p1778 + p1780 = 1
inv : p0 + p1782 + p1784 + p1786 + p1788 = 1
inv : p0 + p1 + p966 + p969 + p971 + p973 = 1
inv : p0 + p1 + p309 + p311 + p313 + p315 = 1
inv : p0 + p1 + p693 + p698 + p699 = 1
inv : p0 + p1 + p1165 + p1170 + p1171 = 1
inv : p0 + p1 + p1106 + p1111 + p1112 = 1
inv : p0 + p1 + p1487 + p1489 + p1491 + p1493 = 1
inv : p0 + p1 + p398 + p401 + p402 = 1
inv : p0 + p1 + p349 + p351 = 1
inv : p0 + p1 + p172 + p174 = 1
inv : p0 + p1 + p1696 + p1701 + p1702 = 1
inv : p0 + p1 + p929 + p934 + p935 = 1
inv : p0 + p1 + p526 + p528 = 1
inv : p0 + p1 + p1615 + p1618 + p1620 + p1622 = 1
inv : p0 + p1752 + p1754 = 1
inv : p0 + p1 + p113 + p115 = 1
inv : p0 + p1 + p762 + p764 = 1
inv : p0 + p1 + p317 + p320 + p322 + p324 = 1
inv : p0 + p1 + p634 + p639 + p640 = 1
inv : p0 + p1 + p339 + p342 + p343 = 1
inv : p0 + p1 + p765 + p767 + p769 + p771 = 1
inv : p0 + p1 + p293 + p295 + p297 + p299 = 1
inv : p0 + p1 + p998 + p1000 = 1
inv : p0 + p1755 + p1758 + p1759 = 1
inv : p0 + p1 + p936 + p938 = 1
inv : p0 + p1 + p189 + p191 + p193 + p195 = 1
inv : p0 + p1 + p1202 + p1205 + p1207 + p1209 = 1
inv : p0 + p1 + p1011 + p1013 = 1
inv : p0 + p1 + p1074 + p1076 + p1078 + p1080 = 1
inv : p0 + p1 + p1706 + p1708 = 1
inv : p0 + p1 + p1283 + p1286 + p1287 = 1
inv : p0 + p1 + p1224 + p1229 + p1230 = 1
inv : p0 + p1 + p706 + p708 + p710 + p712 = 1
inv : p0 + p1 + p1175 + p1177 = 1
inv : p0 + p1 + p1116 + p1118 = 1
inv : p0 + p1 + p897 + p899 + p901 + p903 = 1
inv : p0 + p1 + p258 + p261 + p263 + p265 = 1
inv : p0 + p1 + p352 + p354 + p356 + p358 = 1
inv : p0 + p1 + p1369 + p1371 + p1373 + p1375 = 1
inv : p0 + p1 + p543 + p545 + p547 + p549 = 1
inv : p0 + p1 + p457 + p460 + p461 = 1
inv : p0 + p1 + p1293 + p1295 = 1
inv : p0 + p1 + p985 + p987 = 1
inv : p0 + p1 + p1460 + p1465 + p1466 = 1
inv : p0 + p1 + p1650 + p1652 + p1654 + p1656 = 1
inv : p0 + p1 + p956 + p958 + p960 + p962 = 1
inv : p0 + p1 + p1143 + p1146 + p1148 + p1150 = 1
inv : p0 + p1 + p1571 + p1572 + p1578 + p1581 + p1582 = 1
inv : p0 + p1 + p398 + p403 + p404 = 1
inv : p0 + p1 + p1178 + p1180 + p1182 + p1184 = 1
inv : p0 + p1 + p30 + p32 = 1
inv : p0 + p1 + p1398 + p1400 = 1
inv : p0 + p1 + p1571 + p1572 + p1575 + p1577 = 1
inv : p0 + p1 + p1428 + p1430 + p1432 + p1434 = 1
inv : p0 + p1 + p1424 + p1426 = 1
inv : p0 + p1 + p1542 + p1544 = 1
inv : p0 + p1 + p44 + p47 + p48 = 1
inv : p0 + p1 + p952 + p954 = 1
inv : p0 + p1 + p1221 + p1223 = 1
inv : p0 + p1 + p647 + p649 + p651 + p653 = 1
inv : p0 + p1 + p464 + p466 = 1
inv : p0 + p1 + p411 + p413 + p415 + p417 = 1
inv : p0 + p1 + p339 + p344 + p345 = 1
inv : p0 + p1 + p1532 + p1534 + p1536 + p1538 = 1
inv : p0 + p1 + p1015 + p1017 + p1019 + p1021 = 1
inv : p0 + p1 + p1237 + p1239 + p1241 + p1243 = 1
inv : p0 + p1 + p1057 + p1059 = 1
inv : p0 + p1 + p1084 + p1087 + p1089 + p1091 = 1
inv : p0 + p1 + p1647 + p1649 = 1
inv : p0 + p1 + p1473 + p1475 + p1477 + p1479 = 1
inv : p0 + p1 + p290 + p292 = 1
inv : p0 + p1 + p824 + p826 + p828 + p830 = 1
inv : p0 + p1 + p427 + p429 + p431 + p433 = 1
inv : p0 + p1 + p1296 + p1298 + p1300 + p1302 = 1
inv : p0 + p1 + p602 + p604 + p606 + p608 = 1
inv : p0 + p1 + p1709 + p1711 + p1713 + p1715 = 1
inv : p0 + p1 + p1070 + p1072 = 1
inv : p0 + p1 + p752 + p755 + p756 = 1
inv : p0 + p1 + p199 + p202 + p204 + p206 = 1
inv : p0 + p1 + p1165 + p1168 + p1169 = 1
inv : p0 + p1 + p1519 + p1524 + p1525 = 1
inv : p0 + p1 + p1723 + p1725 + p1727 + p1729 = 1
inv : p0 + p1 + p752 + p757 + p758 = 1
inv : p0 + p1 + p1519 + p1522 + p1523 = 1
inv : p0 + p1 + p103 + p106 + p107 = 1
inv : p0 + p1 + p1247 + p1249 = 1
inv : p0 + p1 + p287 + p289 = 1
inv : p0 + p1 + p470 + p472 + p474 + p476 = 1
inv : p0 + p1 + p588 + p590 + p592 + p594 = 1
inv : p0 + p1 + p467 + p469 = 1
inv : p0 + p1 + p1644 + p1646 = 1
inv : p0 + p1 + p140 + p143 + p145 + p147 = 1
inv : p0 + p1 + p877 + p879 = 1
inv : p0 + p1 + p1664 + p1666 + p1668 + p1670 = 1
inv : p0 + p1 + p1355 + p1357 + p1359 + p1361 = 1
inv : p0 + p1 + p1414 + p1416 + p1418 + p1420 = 1
inv : p0 + p1 + p749 + p751 = 1
inv : p0 + p1 + p988 + p993 + p994 = 1
inv : p0 + p1 + p1310 + p1312 + p1314 + p1316 = 1
inv : p0 + p1 + p870 + p875 + p876 = 1
inv : p0 + p1 + p1047 + p1050 + p1051 = 1
inv : p0 + p1 + p1571 + p1572 + p1578 + p1583 + p1584 = 1
inv : p0 + p1 + p1470 + p1472 = 1
inv : p0 + p1 + p110 + p112 = 1
inv : p0 + p1 + p81 + p84 + p86 + p88 = 1
inv : p0 + p1 + p244 + p246 = 1
inv : p0 + p1 + p644 + p646 = 1
inv : p0 + p1 + p484 + p486 + p488 + p490 = 1
Total of 270 invariants.
[2020-05-27 09:36:46] [INFO ] Computed 270 place invariants in 11 ms
[2020-05-27 09:36:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 753 labels/synchronizations in 191 ms.
[2020-05-27 09:36:46] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityFireability.pnml.gal : 38 ms
[2020-05-27 09:36:46] [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 : ShieldIIPs-PT-030B-ReachabilityFireability-00 with value :((((((i6.i1.i0.u115.p882==1)&&(i6.i0.i0.u117.p901==1))&&(i6.i1.i1.u118.p915==1))&&(i11.u200.p1572==1))&&((i7.u139.p1063!=1)||(i12.i1.i1.u230.p1==1)))&&((i4.i0.i1.u100.p782==1)||(i6.i1.i2.u125.p951==1)))
built 13 ordering constraints for composite.
built 23 ordering constraints for composite.
built 21 ordering constraints for composite.
built 8 ordering constraints for composite.
built 15 ordering constraints for composite.
built 21 ordering constraints for composite.
built 9 ordering constraints for composite.
built 37 ordering constraints for composite.
built 33 ordering constraints for composite.
built 16 ordering constraints for composite.
built 14 ordering constraints for composite.
built 25 ordering constraints for composite.
built 20 ordering constraints for composite.
built 17 ordering constraints for composite.
built 10 ordering constraints for composite.
built 17 ordering constraints for composite.
built 17 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 16 ordering constraints for composite.
built 14 ordering constraints for composite.
built 6 ordering constraints for composite.
built 12 ordering constraints for composite.
built 6 ordering constraints for composite.
built 30 ordering constraints for composite.
built 28 ordering constraints for composite.
built 25 ordering constraints for composite.
built 14 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 12 ordering constraints for composite.
built 22 ordering constraints for composite.
built 19 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 12 ordering constraints for composite.
built 15 ordering constraints for composite.
built 17 ordering constraints for composite.
built 6 ordering constraints for composite.
built 12 ordering constraints for composite.
built 6 ordering constraints for composite.
built 32 ordering constraints for composite.
built 8 ordering constraints for composite.
built 28 ordering constraints for composite.
built 22 ordering constraints for composite.
built 20 ordering constraints for composite.
built 12 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 17 ordering constraints for composite.
built 12 ordering constraints for composite.
built 8 ordering constraints for composite.
built 13 ordering constraints for composite.
built 30 ordering constraints for composite.
built 21 ordering constraints for composite.
built 19 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 12 ordering constraints for composite.
built 5 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
SDD proceeding with computation, new max is 8192
[2020-05-27 09:36:48] [INFO ] BMC solution for property ShieldIIPs-PT-030B-ReachabilityFireability-00(UNSAT) depth K=3 took 2056 ms
[2020-05-27 09:36:48] [INFO ] Proved 758 variables to be positive in 2050 ms
[2020-05-27 09:36:48] [INFO ] Proved 758 variables to be positive in 2389 ms
[2020-05-27 09:36:48] [INFO ] Computing symmetric may disable matrix : 729 transitions.
[2020-05-27 09:36:48] [INFO ] Computation of disable matrix completed :0/729 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 09:36:48] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-030B-ReachabilityFireability-00
[2020-05-27 09:36:48] [INFO ] KInduction solution for property ShieldIIPs-PT-030B-ReachabilityFireability-00(SAT) depth K=0 took 75 ms
[2020-05-27 09:36:48] [INFO ] Computation of Complete disable matrix. took 108 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 09:36:48] [INFO ] Computing symmetric may enable matrix : 729 transitions.
[2020-05-27 09:36:48] [INFO ] Computation of Complete enable matrix. took 47 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 09:36:48] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-030B-ReachabilityFireability-00
[2020-05-27 09:36:48] [INFO ] KInduction solution for property ShieldIIPs-PT-030B-ReachabilityFireability-00(SAT) depth K=1 took 114 ms
[2020-05-27 09:36:48] [INFO ] Computing symmetric co enabling matrix : 729 transitions.
SDD proceeding with computation, new max is 16384
[2020-05-27 09:36:51] [INFO ] Computation of co-enabling matrix(117/729) took 2683 ms. Total solver calls (SAT/UNSAT): 1541(55/1486)
[2020-05-27 09:36:54] [INFO ] Computation of co-enabling matrix(292/729) took 5684 ms. Total solver calls (SAT/UNSAT): 3372(287/3085)
[2020-05-27 09:36:57] [INFO ] Computation of co-enabling matrix(424/729) took 8686 ms. Total solver calls (SAT/UNSAT): 4710(440/4270)
SDD proceeding with computation, new max is 32768
[2020-05-27 09:37:00] [INFO ] Computation of co-enabling matrix(566/729) took 11688 ms. Total solver calls (SAT/UNSAT): 5730(518/5212)
[2020-05-27 09:37:00] [INFO ] BMC solution for property ShieldIIPs-PT-030B-ReachabilityFireability-00(UNSAT) depth K=4 took 12232 ms
[2020-05-27 09:37:02] [INFO ] Computation of Finished co-enabling matrix. took 13920 ms. Total solver calls (SAT/UNSAT): 6102(548/5554)
[2020-05-27 09:37:02] [INFO ] Computing Do-Not-Accords matrix : 729 transitions.
[2020-05-27 09:37:02] [INFO ] Computation of Completed DNA matrix. took 154 ms. Total solver calls (SAT/UNSAT): 3(0/3)
[2020-05-27 09:37:03] [INFO ] Built C files in 17838ms 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]
[2020-05-27 09:37:11] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-030B-ReachabilityFireability-00
[2020-05-27 09:37:11] [INFO ] KInduction solution for property ShieldIIPs-PT-030B-ReachabilityFireability-00(SAT) depth K=2 took 23097 ms
Compilation finished in 9081 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 61 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, ShieldIIPsPT030BReachabilityFireability00==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, ShieldIIPsPT030BReachabilityFireability00==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, ShieldIIPsPT030BReachabilityFireability00==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)
SDD proceeding with computation, new max is 65536
SDD proceeding with computation, new max is 131072
SDD proceeding with computation, new max is 262144
[2020-05-27 09:38:52] [INFO ] BMC solution for property ShieldIIPs-PT-030B-ReachabilityFireability-00(UNSAT) depth K=5 took 111549 ms
SDD proceeding with computation, new max is 524288
[2020-05-27 09:47:21] [INFO ] BMC solution for property ShieldIIPs-PT-030B-ReachabilityFireability-00(UNSAT) depth K=6 took 509073 ms
Detected timeout of ITS tools.
[2020-05-27 09:58:14] [INFO ] Applying decomposition
[2020-05-27 09:58:14] [INFO ] Flatten gal took : 136 ms
[2020-05-27 09:58:15] [INFO ] Decomposing Gal with order
[2020-05-27 09:58:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 09:58:15] [INFO ] Removed a total of 685 redundant transitions.
[2020-05-27 09:58:15] [INFO ] Flatten gal took : 84 ms
[2020-05-27 09:58:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 1480 labels/synchronizations in 188 ms.
[2020-05-27 09:58:15] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityFireability.pnml.gal : 28 ms
[2020-05-27 09:58:15] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityFireability.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/ReachabilityFireability.pnml.gal, -t, CGAL, -reachable-file, ReachabilityFireability.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/ReachabilityFireability.pnml.gal -t CGAL -reachable-file ReachabilityFireability.prop --nowitness
Loading property file ReachabilityFireability.prop.
Read [reachable] property : ShieldIIPs-PT-030B-ReachabilityFireability-00 with value :((((((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.u281.p882==1)&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u284.p901==1))&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u285.p915==1))&&(i0.i0.i0.i1.i0.i0.i0.i0.u610.p1572==1))&&((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u333.p1063!=1)||(i0.u796.p1==1)))&&((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u250.p782==1)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u299.p951==1)))
built 2 ordering constraints for composite.
built 5 ordering constraints for composite.
built 224 ordering constraints for composite.
built 216 ordering constraints for composite.
built 212 ordering constraints for composite.
built 204 ordering constraints for composite.
built 196 ordering constraints for composite.
built 188 ordering constraints for composite.
built 180 ordering constraints for composite.
built 172 ordering constraints for composite.
built 164 ordering constraints for composite.
built 156 ordering constraints for composite.
built 148 ordering constraints for composite.
built 140 ordering constraints for composite.
built 132 ordering constraints for composite.
built 124 ordering constraints for composite.
built 13 ordering constraints for composite.
built 17 ordering constraints for composite.
built 15 ordering constraints for composite.
built 20 ordering constraints for composite.
built 17 ordering constraints for composite.
built 9 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 17 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 17 ordering constraints for composite.
built 15 ordering constraints for composite.
built 20 ordering constraints for composite.
built 116 ordering constraints for composite.
built 108 ordering constraints for composite.
built 13 ordering constraints for composite.
built 17 ordering constraints for composite.
built 13 ordering constraints for composite.
built 17 ordering constraints for composite.
built 15 ordering constraints for composite.
built 20 ordering constraints for composite.
built 100 ordering constraints for composite.
built 92 ordering constraints for composite.
built 84 ordering constraints for composite.
built 76 ordering constraints for composite.
built 68 ordering constraints for composite.
built 60 ordering constraints for composite.
built 52 ordering constraints for composite.
built 44 ordering constraints for composite.
built 36 ordering constraints for composite.
built 28 ordering constraints for composite.
built 20 ordering constraints for composite.
built 12 ordering constraints for composite.
built 13 ordering constraints for composite.
built 17 ordering constraints for composite.
built 15 ordering constraints for composite.
built 20 ordering constraints for composite.
built 17 ordering constraints for composite.
built 14 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 13 ordering constraints for composite.
built 17 ordering constraints for composite.
built 15 ordering constraints for composite.
built 20 ordering constraints for composite.
built 17 ordering constraints for composite.
built 14 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 13 ordering constraints for composite.
built 17 ordering constraints for composite.
built 15 ordering constraints for composite.
built 20 ordering constraints for composite.
built 17 ordering constraints for composite.
built 14 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 13 ordering constraints for composite.
built 17 ordering constraints for composite.
built 15 ordering constraints for composite.
built 20 ordering constraints for composite.
built 17 ordering constraints for composite.
built 14 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 13 ordering constraints for composite.
built 17 ordering constraints for composite.
built 15 ordering constraints for composite.
built 20 ordering constraints for composite.
built 17 ordering constraints for composite.
built 14 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 13 ordering constraints for composite.
built 17 ordering constraints for composite.
built 15 ordering constraints for composite.
built 20 ordering constraints for composite.
built 17 ordering constraints for composite.
built 14 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 13 ordering constraints for composite.
built 17 ordering constraints for composite.
built 15 ordering constraints for composite.
built 20 ordering constraints for composite.
built 17 ordering constraints for composite.
built 14 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 13 ordering constraints for composite.
built 17 ordering constraints for composite.
built 15 ordering constraints for composite.
built 20 ordering constraints for composite.
built 17 ordering constraints for composite.
built 14 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 13 ordering constraints for composite.
built 17 ordering constraints for composite.
built 15 ordering constraints for composite.
built 20 ordering constraints for composite.
built 17 ordering constraints for composite.
built 14 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 13 ordering constraints for composite.
built 17 ordering constraints for composite.
built 15 ordering constraints for composite.
built 20 ordering constraints for composite.
built 17 ordering constraints for composite.
built 14 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 13 ordering constraints for composite.
built 17 ordering constraints for composite.
built 15 ordering constraints for composite.
built 20 ordering constraints for composite.
built 17 ordering constraints for composite.
built 14 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 13 ordering constraints for composite.
built 17 ordering constraints for composite.
built 15 ordering constraints for composite.
built 20 ordering constraints for composite.
built 17 ordering constraints for composite.
built 14 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 15 ordering constraints for composite.
built 20 ordering constraints for composite.
built 17 ordering constraints for composite.
built 14 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 13 ordering constraints for composite.
built 17 ordering constraints for composite.
built 15 ordering constraints for composite.
built 20 ordering constraints for composite.
built 17 ordering constraints for composite.
built 14 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 14 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 17 ordering constraints for composite.
built 14 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 13 ordering constraints for composite.
built 17 ordering constraints for composite.
built 15 ordering constraints for composite.
built 20 ordering constraints for composite.
built 17 ordering constraints for composite.
built 14 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 17 ordering constraints for composite.
built 14 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 13 ordering constraints for composite.
built 17 ordering constraints for composite.
built 15 ordering constraints for composite.
built 20 ordering constraints for composite.
built 17 ordering constraints for composite.
built 14 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 13 ordering constraints for composite.
built 17 ordering constraints for composite.
built 15 ordering constraints for composite.
built 20 ordering constraints for composite.
built 17 ordering constraints for composite.
built 14 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 13 ordering constraints for composite.
built 17 ordering constraints for composite.
built 15 ordering constraints for composite.
built 20 ordering constraints for composite.
built 17 ordering constraints for composite.
built 14 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 13 ordering constraints for composite.
built 17 ordering constraints for composite.
built 15 ordering constraints for composite.
built 20 ordering constraints for composite.
built 17 ordering constraints for composite.
built 14 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 13 ordering constraints for composite.
built 17 ordering constraints for composite.
built 15 ordering constraints for composite.
built 20 ordering constraints for composite.
built 17 ordering constraints for composite.
built 14 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 13 ordering constraints for composite.
built 17 ordering constraints for composite.
built 15 ordering constraints for composite.
built 20 ordering constraints for composite.
built 17 ordering constraints for composite.
built 14 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 13 ordering constraints for composite.
built 17 ordering constraints for composite.
built 15 ordering constraints for composite.
built 20 ordering constraints for composite.
built 17 ordering constraints for composite.
built 14 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 13 ordering constraints for composite.
built 17 ordering constraints for composite.
built 15 ordering constraints for composite.
built 20 ordering constraints for composite.
built 17 ordering constraints for composite.
built 14 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 14 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 13 ordering constraints for composite.
built 17 ordering constraints for composite.
built 15 ordering constraints for composite.
built 20 ordering constraints for composite.
built 17 ordering constraints for composite.
built 14 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 13 ordering constraints for composite.
built 17 ordering constraints for composite.
built 15 ordering constraints for composite.
built 20 ordering constraints for composite.
built 17 ordering constraints for composite.
built 14 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 10 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 16 ordering constraints for composite.
built 14 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
SDD proceeding with computation, new max is 8192
SDD proceeding with computation, new max is 16384
SDD proceeding with computation, new max is 32768
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.69892e+06,17.8105,452388,6615,31,660558,55,1255,3.49276e+06,72,229,0
Total reachable state count : 5698919

Verifying 1 reachability properties.
Reachability property ShieldIIPs-PT-030B-ReachabilityFireability-00 does not hold.
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
No reachable states exhibit your property : ShieldIIPs-PT-030B-ReachabilityFireability-00

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldIIPs-PT-030B-ReachabilityFireability-00,0,17.8862,452388,1,0,660558,55,1443,3.49276e+06,75,229,318
[2020-05-27 09:58:33] [WARNING] Interrupting SMT solver.
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
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-27 09:58:33] [WARNING] Unexpected error occurred while running SMT. Was verifying ShieldIIPs-PT-030B-ReachabilityFireability-00 SMT depth 7
java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
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 "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
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-27 09:58:33] [INFO ] During BMC, SMT solver timed out at depth 7
[2020-05-27 09:58:33] [INFO ] BMC solving timed out (3600000 secs) at depth 7
[2020-05-27 09:58:33] [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-27 09:58:33] [WARNING] Unexpected error occurred while running SMT. Was verifying ShieldIIPs-PT-030B-ReachabilityFireability-00 K-induction depth 3
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-27 09:58:33] [INFO ] SMT solved 0/ 1 properties. Interrupting SMT analysis.

BK_STOP 1590573514047

--------------------
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="ShieldIIPs-PT-030B"
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 ShieldIIPs-PT-030B, 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 r210-tajo-159033475300167"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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