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-159033475300183.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-040B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tajo-159033475300183
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 832K
-rw-r--r-- 1 mcc users 3.1K May 14 00:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 14 00:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 17:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 17:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 14 10:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 14 10:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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.0K May 13 13:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K May 13 13:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 13 07:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 07:46 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 675K 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-040B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1590574415187

[2020-05-27 10:13:36] [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 10:13:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 10:13:36] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2020-05-27 10:13:36] [INFO ] Transformed 2403 places.
[2020-05-27 10:13:36] [INFO ] Transformed 2363 transitions.
[2020-05-27 10:13:36] [INFO ] Found NUPN structural information;
[2020-05-27 10:13:36] [INFO ] Parsed PT model containing 2403 places and 2363 transitions in 251 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 42 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties seen :[1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1]
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[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]
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]
// Phase 1: matrix 2363 rows 2403 cols
[2020-05-27 10:13:37] [INFO ] Computed 361 place invariants in 55 ms
[2020-05-27 10:13:38] [INFO ] [Real]Absence check using 361 positive place invariants in 421 ms returned sat
[2020-05-27 10:13:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 10:13:42] [INFO ] [Real]Absence check using state equation in 4266 ms returned (error "Solver has unexpectedly terminated")
[2020-05-27 10:13:43] [INFO ] [Real]Absence check using 361 positive place invariants in 527 ms returned sat
[2020-05-27 10:13:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 10:13:47] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 10:13:47] [INFO ] [Real]Absence check using state equation in 3903 ms returned (error "Failed to check-sat")
[2020-05-27 10:13:48] [INFO ] [Real]Absence check using 361 positive place invariants in 832 ms returned sat
[2020-05-27 10:13:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 10:13:52] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 10:13:52] [INFO ] [Real]Absence check using state equation in 3770 ms returned (error "Failed to check-sat")
Support contains 13 out of 2403 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2403/2403 places, 2363/2363 transitions.
Performed 198 Post agglomeration using F-continuation condition.Transition count delta: 198
Iterating post reduction 0 with 198 rules applied. Total rules applied 198 place count 2403 transition count 2165
Reduce places removed 198 places and 0 transitions.
Iterating post reduction 1 with 198 rules applied. Total rules applied 396 place count 2205 transition count 2165
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 202 Pre rules applied. Total rules applied 396 place count 2205 transition count 1963
Deduced a syphon composed of 202 places in 6 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 2 with 404 rules applied. Total rules applied 800 place count 2003 transition count 1963
Symmetric choice reduction at 2 with 278 rule applications. Total rules 1078 place count 2003 transition count 1963
Deduced a syphon composed of 278 places in 37 ms
Reduce places removed 278 places and 278 transitions.
Iterating global reduction 2 with 556 rules applied. Total rules applied 1634 place count 1725 transition count 1685
Performed 117 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 117 Pre rules applied. Total rules applied 1634 place count 1725 transition count 1568
Deduced a syphon composed of 117 places in 6 ms
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 234 rules applied. Total rules applied 1868 place count 1608 transition count 1568
Performed 594 Post agglomeration using F-continuation condition.Transition count delta: 594
Deduced a syphon composed of 594 places in 3 ms
Reduce places removed 594 places and 0 transitions.
Iterating global reduction 2 with 1188 rules applied. Total rules applied 3056 place count 1014 transition count 974
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 273 times.
Drop transitions removed 273 transitions
Iterating global reduction 2 with 273 rules applied. Total rules applied 3329 place count 1014 transition count 974
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 3330 place count 1014 transition count 974
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3331 place count 1013 transition count 973
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3332 place count 1012 transition count 973
Applied a total of 3332 rules in 1263 ms. Remains 1012 /2403 variables (removed 1391) and now considering 973/2363 (removed 1390) transitions.
Finished structural reductions, in 1 iterations. Remains : 1012/2403 places, 973/2363 transitions.
Incomplete random walk after 1000000 steps, including 9 resets, run finished after 8302 ms. (steps per millisecond=120 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 6 resets, run finished after 4686 ms. (steps per millisecond=213 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 4 resets, run finished after 4546 ms. (steps per millisecond=219 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 9 resets, run finished after 4303 ms. (steps per millisecond=232 ) properties seen :[0, 0, 0]
Interrupted probabilistic random walk after 1646170 steps, run timeout after 30001 ms. (steps per millisecond=54 ) properties seen :[0, 0, 0]
Probabilistic random walk after 1646170 steps, saw 252395 distinct states, run finished after 30001 ms. (steps per millisecond=54 ) properties seen :[0, 0, 0]
// Phase 1: matrix 973 rows 1012 cols
[2020-05-27 10:14:45] [INFO ] Computed 360 place invariants in 113 ms
[2020-05-27 10:14:46] [INFO ] [Real]Absence check using 357 positive place invariants in 232 ms returned sat
[2020-05-27 10:14:46] [INFO ] [Real]Absence check using 357 positive and 3 generalized place invariants in 3 ms returned sat
[2020-05-27 10:14:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 10:14:47] [INFO ] [Real]Absence check using state equation in 1868 ms returned sat
[2020-05-27 10:14:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 10:14:48] [INFO ] [Nat]Absence check using 357 positive place invariants in 160 ms returned sat
[2020-05-27 10:14:48] [INFO ] [Nat]Absence check using 357 positive and 3 generalized place invariants in 2 ms returned sat
[2020-05-27 10:14:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 10:14:50] [INFO ] [Nat]Absence check using state equation in 1981 ms returned sat
[2020-05-27 10:14:50] [INFO ] Deduced a trap composed of 3 places in 260 ms
[2020-05-27 10:14:50] [INFO ] Deduced a trap composed of 6 places in 131 ms
[2020-05-27 10:14:51] [INFO ] Deduced a trap composed of 5 places in 172 ms
[2020-05-27 10:14:51] [INFO ] Deduced a trap composed of 5 places in 169 ms
[2020-05-27 10:14:51] [INFO ] Deduced a trap composed of 7 places in 145 ms
[2020-05-27 10:14:51] [INFO ] Deduced a trap composed of 4 places in 116 ms
[2020-05-27 10:14:51] [INFO ] Deduced a trap composed of 6 places in 130 ms
[2020-05-27 10:14:51] [INFO ] Deduced a trap composed of 17 places in 105 ms
[2020-05-27 10:14:52] [INFO ] Deduced a trap composed of 11 places in 132 ms
[2020-05-27 10:14:52] [INFO ] Deduced a trap composed of 11 places in 89 ms
[2020-05-27 10:14:52] [INFO ] Deduced a trap composed of 4 places in 84 ms
[2020-05-27 10:14:52] [INFO ] Deduced a trap composed of 9 places in 90 ms
[2020-05-27 10:14:52] [INFO ] Deduced a trap composed of 9 places in 74 ms
[2020-05-27 10:14:52] [INFO ] Deduced a trap composed of 15 places in 84 ms
[2020-05-27 10:14:52] [INFO ] Deduced a trap composed of 3 places in 79 ms
[2020-05-27 10:14:52] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2428 ms
[2020-05-27 10:14:52] [INFO ] Computed and/alt/rep : 966/3271/966 causal constraints in 50 ms.
[2020-05-27 10:15:13] [INFO ] Added : 795 causal constraints over 159 iterations in 20268 ms.(timeout) Result :sat
[2020-05-27 10:15:13] [INFO ] Deduced a trap composed of 5 places in 133 ms
[2020-05-27 10:15:13] [INFO ] Deduced a trap composed of 4 places in 87 ms
[2020-05-27 10:15:13] [INFO ] Deduced a trap composed of 7 places in 62 ms
[2020-05-27 10:15:13] [INFO ] Deduced a trap composed of 6 places in 97 ms
[2020-05-27 10:15:14] [INFO ] Deduced a trap composed of 7 places in 57 ms
[2020-05-27 10:15:14] [INFO ] Deduced a trap composed of 8 places in 54 ms
[2020-05-27 10:15:14] [INFO ] Deduced a trap composed of 9 places in 61 ms
[2020-05-27 10:15:14] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1628 ms
Attempting to minimize the solution found.
Minimization took 116 ms.
[2020-05-27 10:15:15] [INFO ] [Real]Absence check using 357 positive place invariants in 353 ms returned sat
[2020-05-27 10:15:15] [INFO ] [Real]Absence check using 357 positive and 3 generalized place invariants in 3 ms returned sat
[2020-05-27 10:15:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 10:15:17] [INFO ] [Real]Absence check using state equation in 2377 ms returned sat
[2020-05-27 10:15:17] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 10:15:18] [INFO ] [Nat]Absence check using 357 positive place invariants in 171 ms returned sat
[2020-05-27 10:15:18] [INFO ] [Nat]Absence check using 357 positive and 3 generalized place invariants in 2 ms returned sat
[2020-05-27 10:15:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 10:15:20] [INFO ] [Nat]Absence check using state equation in 2335 ms returned sat
[2020-05-27 10:15:20] [INFO ] Deduced a trap composed of 7 places in 158 ms
[2020-05-27 10:15:20] [INFO ] Deduced a trap composed of 6 places in 126 ms
[2020-05-27 10:15:21] [INFO ] Deduced a trap composed of 4 places in 137 ms
[2020-05-27 10:15:21] [INFO ] Deduced a trap composed of 9 places in 118 ms
[2020-05-27 10:15:21] [INFO ] Deduced a trap composed of 6 places in 120 ms
[2020-05-27 10:15:21] [INFO ] Deduced a trap composed of 5 places in 107 ms
[2020-05-27 10:15:21] [INFO ] Deduced a trap composed of 6 places in 169 ms
[2020-05-27 10:15:22] [INFO ] Deduced a trap composed of 7 places in 841 ms
[2020-05-27 10:15:22] [INFO ] Deduced a trap composed of 3 places in 138 ms
[2020-05-27 10:15:23] [INFO ] Deduced a trap composed of 11 places in 98 ms
[2020-05-27 10:15:23] [INFO ] Deduced a trap composed of 7 places in 104 ms
[2020-05-27 10:15:23] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2636 ms
[2020-05-27 10:15:23] [INFO ] Computed and/alt/rep : 966/3271/966 causal constraints in 70 ms.
[2020-05-27 10:15:43] [INFO ] Added : 785 causal constraints over 157 iterations in 20152 ms.(timeout) Result :sat
[2020-05-27 10:15:43] [INFO ] Deduced a trap composed of 8 places in 52 ms
[2020-05-27 10:15:43] [INFO ] Deduced a trap composed of 6 places in 37 ms
[2020-05-27 10:15:43] [INFO ] Deduced a trap composed of 6 places in 40 ms
[2020-05-27 10:15:44] [INFO ] Deduced a trap composed of 8 places in 35 ms
[2020-05-27 10:15:44] [INFO ] Deduced a trap composed of 9 places in 29 ms
[2020-05-27 10:15:44] [INFO ] Deduced a trap composed of 9 places in 28 ms
[2020-05-27 10:15:44] [INFO ] Deduced a trap composed of 5 places in 29 ms
[2020-05-27 10:15:44] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1271 ms
Attempting to minimize the solution found.
Minimization took 106 ms.
[2020-05-27 10:15:45] [INFO ] [Real]Absence check using 357 positive place invariants in 274 ms returned sat
[2020-05-27 10:15:45] [INFO ] [Real]Absence check using 357 positive and 3 generalized place invariants in 4 ms returned sat
[2020-05-27 10:15:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 10:15:47] [INFO ] [Real]Absence check using state equation in 2153 ms returned sat
[2020-05-27 10:15:47] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 10:15:48] [INFO ] [Nat]Absence check using 357 positive place invariants in 236 ms returned sat
[2020-05-27 10:15:48] [INFO ] [Nat]Absence check using 357 positive and 3 generalized place invariants in 3 ms returned sat
[2020-05-27 10:15:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 10:15:50] [INFO ] [Nat]Absence check using state equation in 2002 ms returned sat
[2020-05-27 10:15:50] [INFO ] Deduced a trap composed of 5 places in 179 ms
[2020-05-27 10:15:50] [INFO ] Deduced a trap composed of 6 places in 138 ms
[2020-05-27 10:15:50] [INFO ] Deduced a trap composed of 6 places in 158 ms
[2020-05-27 10:15:50] [INFO ] Deduced a trap composed of 10 places in 105 ms
[2020-05-27 10:15:50] [INFO ] Deduced a trap composed of 5 places in 91 ms
[2020-05-27 10:15:51] [INFO ] Deduced a trap composed of 4 places in 152 ms
[2020-05-27 10:15:51] [INFO ] Deduced a trap composed of 6 places in 101 ms
[2020-05-27 10:15:51] [INFO ] Deduced a trap composed of 11 places in 145 ms
[2020-05-27 10:15:51] [INFO ] Deduced a trap composed of 9 places in 143 ms
[2020-05-27 10:15:51] [INFO ] Deduced a trap composed of 16 places in 160 ms
[2020-05-27 10:15:51] [INFO ] Deduced a trap composed of 15 places in 99 ms
[2020-05-27 10:15:52] [INFO ] Deduced a trap composed of 17 places in 114 ms
[2020-05-27 10:15:52] [INFO ] Deduced a trap composed of 14 places in 70 ms
[2020-05-27 10:15:52] [INFO ] Deduced a trap composed of 11 places in 114 ms
[2020-05-27 10:15:52] [INFO ] Deduced a trap composed of 20 places in 95 ms
[2020-05-27 10:15:52] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2409 ms
[2020-05-27 10:15:52] [INFO ] Computed and/alt/rep : 966/3271/966 causal constraints in 62 ms.
[2020-05-27 10:16:12] [INFO ] Added : 835 causal constraints over 167 iterations in 20356 ms.(timeout) Result :sat
[2020-05-27 10:16:13] [INFO ] Deduced a trap composed of 8 places in 67 ms
[2020-05-27 10:16:13] [INFO ] Deduced a trap composed of 8 places in 68 ms
[2020-05-27 10:16:13] [INFO ] Deduced a trap composed of 8 places in 53 ms
[2020-05-27 10:16:13] [INFO ] Deduced a trap composed of 8 places in 45 ms
[2020-05-27 10:16:13] [INFO ] Deduced a trap composed of 4 places in 27 ms
[2020-05-27 10:16:13] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1046 ms
Attempting to minimize the solution found.
Minimization took 106 ms.
Incomplete Parikh walk after 144900 steps, including 495 resets, run finished after 1381 ms. (steps per millisecond=104 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 152100 steps, including 991 resets, run finished after 1054 ms. (steps per millisecond=144 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 157100 steps, including 808 resets, run finished after 1401 ms. (steps per millisecond=112 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 13 out of 1012 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1012/1012 places, 973/973 transitions.
Applied a total of 0 rules in 78 ms. Remains 1012 /1012 variables (removed 0) and now considering 973/973 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1012/1012 places, 973/973 transitions.
Starting structural reductions, iteration 0 : 1012/1012 places, 973/973 transitions.
Applied a total of 0 rules in 83 ms. Remains 1012 /1012 variables (removed 0) and now considering 973/973 (removed 0) transitions.
// Phase 1: matrix 973 rows 1012 cols
[2020-05-27 10:16:18] [INFO ] Computed 360 place invariants in 26 ms
[2020-05-27 10:16:20] [INFO ] Implicit Places using invariants in 2780 ms returned []
// Phase 1: matrix 973 rows 1012 cols
[2020-05-27 10:16:20] [INFO ] Computed 360 place invariants in 23 ms
[2020-05-27 10:16:33] [INFO ] Implicit Places using invariants and state equation in 12261 ms returned []
Implicit Place search using SMT with State Equation took 15043 ms to find 0 implicit places.
[2020-05-27 10:16:33] [INFO ] Redundant transitions in 113 ms returned []
// Phase 1: matrix 973 rows 1012 cols
[2020-05-27 10:16:33] [INFO ] Computed 360 place invariants in 11 ms
[2020-05-27 10:16:35] [INFO ] Dead Transitions using invariants and state equation in 2587 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1012/1012 places, 973/973 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 634 ms. (steps per millisecond=157 ) properties seen :[0, 0, 0]
// Phase 1: matrix 973 rows 1012 cols
[2020-05-27 10:16:36] [INFO ] Computed 360 place invariants in 8 ms
[2020-05-27 10:16:36] [INFO ] [Real]Absence check using 357 positive place invariants in 216 ms returned sat
[2020-05-27 10:16:36] [INFO ] [Real]Absence check using 357 positive and 3 generalized place invariants in 3 ms returned sat
[2020-05-27 10:16:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 10:16:39] [INFO ] [Real]Absence check using state equation in 2602 ms returned sat
[2020-05-27 10:16:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 10:16:39] [INFO ] [Nat]Absence check using 357 positive place invariants in 230 ms returned sat
[2020-05-27 10:16:39] [INFO ] [Nat]Absence check using 357 positive and 3 generalized place invariants in 3 ms returned sat
[2020-05-27 10:16:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 10:16:42] [INFO ] [Nat]Absence check using state equation in 2058 ms returned sat
[2020-05-27 10:16:42] [INFO ] Deduced a trap composed of 3 places in 184 ms
[2020-05-27 10:16:42] [INFO ] Deduced a trap composed of 6 places in 117 ms
[2020-05-27 10:16:42] [INFO ] Deduced a trap composed of 5 places in 168 ms
[2020-05-27 10:16:42] [INFO ] Deduced a trap composed of 5 places in 147 ms
[2020-05-27 10:16:42] [INFO ] Deduced a trap composed of 7 places in 107 ms
[2020-05-27 10:16:43] [INFO ] Deduced a trap composed of 4 places in 140 ms
[2020-05-27 10:16:43] [INFO ] Deduced a trap composed of 6 places in 138 ms
[2020-05-27 10:16:43] [INFO ] Deduced a trap composed of 17 places in 74 ms
[2020-05-27 10:16:43] [INFO ] Deduced a trap composed of 11 places in 127 ms
[2020-05-27 10:16:43] [INFO ] Deduced a trap composed of 11 places in 116 ms
[2020-05-27 10:16:43] [INFO ] Deduced a trap composed of 4 places in 122 ms
[2020-05-27 10:16:44] [INFO ] Deduced a trap composed of 9 places in 111 ms
[2020-05-27 10:16:44] [INFO ] Deduced a trap composed of 9 places in 113 ms
[2020-05-27 10:16:44] [INFO ] Deduced a trap composed of 15 places in 106 ms
[2020-05-27 10:16:44] [INFO ] Deduced a trap composed of 3 places in 105 ms
[2020-05-27 10:16:44] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2434 ms
[2020-05-27 10:16:44] [INFO ] Computed and/alt/rep : 966/3271/966 causal constraints in 50 ms.
[2020-05-27 10:16:59] [INFO ] Added : 700 causal constraints over 140 iterations in 15100 ms. Result :(error "Failed to check-sat")
[2020-05-27 10:17:00] [INFO ] [Real]Absence check using 357 positive place invariants in 271 ms returned sat
[2020-05-27 10:17:00] [INFO ] [Real]Absence check using 357 positive and 3 generalized place invariants in 3 ms returned sat
[2020-05-27 10:17:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 10:17:02] [INFO ] [Real]Absence check using state equation in 2746 ms returned sat
[2020-05-27 10:17:02] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 10:17:03] [INFO ] [Nat]Absence check using 357 positive place invariants in 249 ms returned sat
[2020-05-27 10:17:03] [INFO ] [Nat]Absence check using 357 positive and 3 generalized place invariants in 5 ms returned sat
[2020-05-27 10:17:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 10:17:05] [INFO ] [Nat]Absence check using state equation in 2650 ms returned sat
[2020-05-27 10:17:06] [INFO ] Deduced a trap composed of 7 places in 155 ms
[2020-05-27 10:17:06] [INFO ] Deduced a trap composed of 6 places in 152 ms
[2020-05-27 10:17:06] [INFO ] Deduced a trap composed of 4 places in 136 ms
[2020-05-27 10:17:06] [INFO ] Deduced a trap composed of 9 places in 117 ms
[2020-05-27 10:17:06] [INFO ] Deduced a trap composed of 6 places in 93 ms
[2020-05-27 10:17:06] [INFO ] Deduced a trap composed of 5 places in 101 ms
[2020-05-27 10:17:07] [INFO ] Deduced a trap composed of 6 places in 89 ms
[2020-05-27 10:17:07] [INFO ] Deduced a trap composed of 7 places in 99 ms
[2020-05-27 10:17:07] [INFO ] Deduced a trap composed of 3 places in 99 ms
[2020-05-27 10:17:07] [INFO ] Deduced a trap composed of 11 places in 86 ms
[2020-05-27 10:17:07] [INFO ] Deduced a trap composed of 7 places in 63 ms
[2020-05-27 10:17:07] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1641 ms
[2020-05-27 10:17:07] [INFO ] Computed and/alt/rep : 966/3271/966 causal constraints in 51 ms.
[2020-05-27 10:17:22] [INFO ] Added : 710 causal constraints over 142 iterations in 15261 ms. Result :unknown
[2020-05-27 10:17:23] [INFO ] [Real]Absence check using 357 positive place invariants in 223 ms returned sat
[2020-05-27 10:17:23] [INFO ] [Real]Absence check using 357 positive and 3 generalized place invariants in 3 ms returned sat
[2020-05-27 10:17:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 10:17:25] [INFO ] [Real]Absence check using state equation in 2192 ms returned sat
[2020-05-27 10:17:25] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 10:17:25] [INFO ] [Nat]Absence check using 357 positive place invariants in 167 ms returned sat
[2020-05-27 10:17:25] [INFO ] [Nat]Absence check using 357 positive and 3 generalized place invariants in 2 ms returned sat
[2020-05-27 10:17:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 10:17:27] [INFO ] [Nat]Absence check using state equation in 2072 ms returned sat
[2020-05-27 10:17:28] [INFO ] Deduced a trap composed of 5 places in 180 ms
[2020-05-27 10:17:28] [INFO ] Deduced a trap composed of 6 places in 162 ms
[2020-05-27 10:17:28] [INFO ] Deduced a trap composed of 6 places in 111 ms
[2020-05-27 10:17:28] [INFO ] Deduced a trap composed of 10 places in 108 ms
[2020-05-27 10:17:28] [INFO ] Deduced a trap composed of 5 places in 110 ms
[2020-05-27 10:17:28] [INFO ] Deduced a trap composed of 4 places in 132 ms
[2020-05-27 10:17:29] [INFO ] Deduced a trap composed of 6 places in 146 ms
[2020-05-27 10:17:29] [INFO ] Deduced a trap composed of 11 places in 149 ms
[2020-05-27 10:17:29] [INFO ] Deduced a trap composed of 9 places in 167 ms
[2020-05-27 10:17:29] [INFO ] Deduced a trap composed of 16 places in 196 ms
[2020-05-27 10:17:29] [INFO ] Deduced a trap composed of 15 places in 84 ms
[2020-05-27 10:17:29] [INFO ] Deduced a trap composed of 17 places in 98 ms
[2020-05-27 10:17:30] [INFO ] Deduced a trap composed of 14 places in 84 ms
[2020-05-27 10:17:30] [INFO ] Deduced a trap composed of 11 places in 84 ms
[2020-05-27 10:17:30] [INFO ] Deduced a trap composed of 20 places in 84 ms
[2020-05-27 10:17:30] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2508 ms
[2020-05-27 10:17:30] [INFO ] Computed and/alt/rep : 966/3271/966 causal constraints in 67 ms.
[2020-05-27 10:17:45] [INFO ] Added : 700 causal constraints over 140 iterations in 15118 ms. Result :unknown
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 1012 transition count 973
Applied a total of 1 rules in 57 ms. Remains 1012 /1012 variables (removed 0) and now considering 973/973 (removed 0) transitions.
// Phase 1: matrix 973 rows 1012 cols
[2020-05-27 10:17:45] [INFO ] Computed 360 place invariants in 11 ms
[2020-05-27 10:17:46] [INFO ] [Real]Absence check using 357 positive place invariants in 349 ms returned sat
[2020-05-27 10:17:46] [INFO ] [Real]Absence check using 357 positive and 3 generalized place invariants in 3 ms returned sat
[2020-05-27 10:17:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 10:17:48] [INFO ] [Real]Absence check using state equation in 2295 ms returned sat
[2020-05-27 10:17:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 10:17:48] [INFO ] [Nat]Absence check using 357 positive place invariants in 167 ms returned sat
[2020-05-27 10:17:48] [INFO ] [Nat]Absence check using 357 positive and 3 generalized place invariants in 2 ms returned sat
[2020-05-27 10:17:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 10:17:50] [INFO ] [Nat]Absence check using state equation in 2053 ms returned sat
[2020-05-27 10:17:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-05-27 10:17:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 7 ms returned sat
[2020-05-27 10:17:51] [INFO ] Deduced a trap composed of 6 places in 163 ms
[2020-05-27 10:17:51] [INFO ] Deduced a trap composed of 4 places in 139 ms
[2020-05-27 10:17:51] [INFO ] Deduced a trap composed of 9 places in 155 ms
[2020-05-27 10:17:51] [INFO ] Deduced a trap composed of 5 places in 157 ms
[2020-05-27 10:17:51] [INFO ] Deduced a trap composed of 8 places in 146 ms
[2020-05-27 10:17:52] [INFO ] Deduced a trap composed of 9 places in 173 ms
[2020-05-27 10:17:52] [INFO ] Deduced a trap composed of 8 places in 159 ms
[2020-05-27 10:17:52] [INFO ] Deduced a trap composed of 5 places in 153 ms
[2020-05-27 10:17:52] [INFO ] Deduced a trap composed of 6 places in 118 ms
[2020-05-27 10:17:52] [INFO ] Deduced a trap composed of 3 places in 121 ms
[2020-05-27 10:17:52] [INFO ] Deduced a trap composed of 6 places in 114 ms
[2020-05-27 10:17:53] [INFO ] Deduced a trap composed of 12 places in 128 ms
[2020-05-27 10:17:53] [INFO ] Deduced a trap composed of 11 places in 92 ms
[2020-05-27 10:17:53] [INFO ] Deduced a trap composed of 9 places in 85 ms
[2020-05-27 10:17:53] [INFO ] Deduced a trap composed of 4 places in 93 ms
[2020-05-27 10:17:53] [INFO ] Deduced a trap composed of 3 places in 84 ms
[2020-05-27 10:17:53] [INFO ] Deduced a trap composed of 9 places in 102 ms
[2020-05-27 10:17:53] [INFO ] Deduced a trap composed of 5 places in 110 ms
[2020-05-27 10:17:54] [INFO ] Deduced a trap composed of 15 places in 95 ms
[2020-05-27 10:17:54] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3057 ms
[2020-05-27 10:17:54] [INFO ] Computed and/alt/rep : 966/3275/966 causal constraints in 39 ms.
[2020-05-27 10:18:14] [INFO ] Added : 855 causal constraints over 171 iterations in 20074 ms.(timeout) Result :sat
[2020-05-27 10:18:14] [INFO ] Deduced a trap composed of 8 places in 64 ms
[2020-05-27 10:18:14] [INFO ] Deduced a trap composed of 10 places in 45 ms
[2020-05-27 10:18:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 520 ms
Attempting to minimize the solution found.
Minimization took 86 ms.
[2020-05-27 10:18:15] [INFO ] [Real]Absence check using 357 positive place invariants in 236 ms returned sat
[2020-05-27 10:18:15] [INFO ] [Real]Absence check using 357 positive and 3 generalized place invariants in 4 ms returned sat
[2020-05-27 10:18:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 10:18:17] [INFO ] [Real]Absence check using state equation in 2718 ms returned sat
[2020-05-27 10:18:17] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 10:18:18] [INFO ] [Nat]Absence check using 357 positive place invariants in 238 ms returned sat
[2020-05-27 10:18:18] [INFO ] [Nat]Absence check using 357 positive and 3 generalized place invariants in 2 ms returned sat
[2020-05-27 10:18:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 10:18:21] [INFO ] [Nat]Absence check using state equation in 2741 ms returned sat
[2020-05-27 10:18:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 11 ms returned sat
[2020-05-27 10:18:21] [INFO ] Deduced a trap composed of 7 places in 138 ms
[2020-05-27 10:18:21] [INFO ] Deduced a trap composed of 6 places in 145 ms
[2020-05-27 10:18:21] [INFO ] Deduced a trap composed of 4 places in 126 ms
[2020-05-27 10:18:21] [INFO ] Deduced a trap composed of 9 places in 109 ms
[2020-05-27 10:18:21] [INFO ] Deduced a trap composed of 6 places in 110 ms
[2020-05-27 10:18:22] [INFO ] Deduced a trap composed of 5 places in 123 ms
[2020-05-27 10:18:22] [INFO ] Deduced a trap composed of 14 places in 99 ms
[2020-05-27 10:18:22] [INFO ] Deduced a trap composed of 5 places in 93 ms
[2020-05-27 10:18:22] [INFO ] Deduced a trap composed of 3 places in 102 ms
[2020-05-27 10:18:22] [INFO ] Deduced a trap composed of 17 places in 95 ms
[2020-05-27 10:18:22] [INFO ] Deduced a trap composed of 11 places in 89 ms
[2020-05-27 10:18:22] [INFO ] Deduced a trap composed of 5 places in 63 ms
[2020-05-27 10:18:22] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1787 ms
[2020-05-27 10:18:22] [INFO ] Computed and/alt/rep : 966/3275/966 causal constraints in 47 ms.
[2020-05-27 10:18:43] [INFO ] Added : 835 causal constraints over 167 iterations in 20190 ms.(timeout) Result :sat
[2020-05-27 10:18:43] [INFO ] Deduced a trap composed of 7 places in 68 ms
[2020-05-27 10:18:43] [INFO ] Deduced a trap composed of 5 places in 41 ms
[2020-05-27 10:18:43] [INFO ] Deduced a trap composed of 9 places in 60 ms
[2020-05-27 10:18:43] [INFO ] Deduced a trap composed of 13 places in 58 ms
[2020-05-27 10:18:43] [INFO ] Deduced a trap composed of 5 places in 43 ms
[2020-05-27 10:18:44] [INFO ] Deduced a trap composed of 17 places in 49 ms
[2020-05-27 10:18:44] [INFO ] Deduced a trap composed of 19 places in 35 ms
[2020-05-27 10:18:44] [INFO ] Deduced a trap composed of 9 places in 35 ms
[2020-05-27 10:18:44] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1532 ms
Attempting to minimize the solution found.
Minimization took 108 ms.
[2020-05-27 10:18:45] [INFO ] [Real]Absence check using 357 positive place invariants in 236 ms returned sat
[2020-05-27 10:18:45] [INFO ] [Real]Absence check using 357 positive and 3 generalized place invariants in 3 ms returned sat
[2020-05-27 10:18:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 10:18:47] [INFO ] [Real]Absence check using state equation in 2047 ms returned sat
[2020-05-27 10:18:47] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 10:18:47] [INFO ] [Nat]Absence check using 357 positive place invariants in 211 ms returned sat
[2020-05-27 10:18:47] [INFO ] [Nat]Absence check using 357 positive and 3 generalized place invariants in 2 ms returned sat
[2020-05-27 10:18:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 10:18:49] [INFO ] [Nat]Absence check using state equation in 2216 ms returned sat
[2020-05-27 10:18:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 7 ms returned sat
[2020-05-27 10:18:49] [INFO ] Deduced a trap composed of 5 places in 98 ms
[2020-05-27 10:18:50] [INFO ] Deduced a trap composed of 6 places in 114 ms
[2020-05-27 10:18:50] [INFO ] Deduced a trap composed of 6 places in 105 ms
[2020-05-27 10:18:50] [INFO ] Deduced a trap composed of 10 places in 128 ms
[2020-05-27 10:18:50] [INFO ] Deduced a trap composed of 5 places in 108 ms
[2020-05-27 10:18:50] [INFO ] Deduced a trap composed of 4 places in 102 ms
[2020-05-27 10:18:50] [INFO ] Deduced a trap composed of 6 places in 94 ms
[2020-05-27 10:18:50] [INFO ] Deduced a trap composed of 11 places in 98 ms
[2020-05-27 10:18:51] [INFO ] Deduced a trap composed of 9 places in 102 ms
[2020-05-27 10:18:51] [INFO ] Deduced a trap composed of 16 places in 106 ms
[2020-05-27 10:18:51] [INFO ] Deduced a trap composed of 15 places in 73 ms
[2020-05-27 10:18:51] [INFO ] Deduced a trap composed of 17 places in 64 ms
[2020-05-27 10:18:51] [INFO ] Deduced a trap composed of 14 places in 68 ms
[2020-05-27 10:18:51] [INFO ] Deduced a trap composed of 11 places in 61 ms
[2020-05-27 10:18:51] [INFO ] Deduced a trap composed of 20 places in 61 ms
[2020-05-27 10:18:51] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1848 ms
[2020-05-27 10:18:51] [INFO ] Computed and/alt/rep : 966/3275/966 causal constraints in 40 ms.
[2020-05-27 10:19:11] [INFO ] Added : 870 causal constraints over 174 iterations in 20267 ms.(timeout) Result :sat
[2020-05-27 10:19:12] [INFO ] Deduced a trap composed of 8 places in 79 ms
[2020-05-27 10:19:12] [INFO ] Deduced a trap composed of 8 places in 54 ms
[2020-05-27 10:19:12] [INFO ] Deduced a trap composed of 8 places in 43 ms
[2020-05-27 10:19:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 636 ms
Attempting to minimize the solution found.
Minimization took 98 ms.
[2020-05-27 10:19:13] [INFO ] Flatten gal took : 323 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-27 10:19:13] [INFO ] Flatten gal took : 205 ms
[2020-05-27 10:19:13] [INFO ] Applying decomposition
[2020-05-27 10:19:13] [INFO ] Flatten gal took : 183 ms
[2020-05-27 10:19:14] [INFO ] Input system was already deterministic with 973 transitions.
[2020-05-27 10:19:14] [INFO ] Input system was already deterministic with 973 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph7691871396785161713.txt, -o, /tmp/graph7691871396785161713.bin, -w, /tmp/graph7691871396785161713.weights], workingDir=null]
[2020-05-27 10:19:14] [INFO ] Ran tautology test, simplified 0 / 3 in 1093 ms.
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph7691871396785161713.bin, -l, -1, -v, -w, /tmp/graph7691871396785161713.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 10:19:15] [INFO ] Decomposing Gal with order
[2020-05-27 10:19:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 10:19:15] [INFO ] BMC solution for property ShieldIIPs-PT-040B-ReachabilityFireability-06(UNSAT) depth K=0 took 52 ms
[2020-05-27 10:19:15] [INFO ] BMC solution for property ShieldIIPs-PT-040B-ReachabilityFireability-12(UNSAT) depth K=0 took 17 ms
[2020-05-27 10:19:15] [INFO ] BMC solution for property ShieldIIPs-PT-040B-ReachabilityFireability-13(UNSAT) depth K=0 took 9 ms
[2020-05-27 10:19:15] [INFO ] BMC solution for property ShieldIIPs-PT-040B-ReachabilityFireability-06(UNSAT) depth K=1 took 60 ms
[2020-05-27 10:19:15] [INFO ] Removed a total of 781 redundant transitions.
[2020-05-27 10:19:15] [INFO ] BMC solution for property ShieldIIPs-PT-040B-ReachabilityFireability-12(UNSAT) depth K=1 took 16 ms
[2020-05-27 10:19:15] [INFO ] BMC solution for property ShieldIIPs-PT-040B-ReachabilityFireability-13(UNSAT) depth K=1 took 22 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 973 rows 1012 cols
[2020-05-27 10:19:15] [INFO ] Flatten gal took : 620 ms
[2020-05-27 10:19:15] [INFO ] Computed 360 place invariants in 77 ms
inv : p287 + p289 = 1
inv : p313 + p315 = 1
inv : p998 + p1001 + p1002 = 1
inv : p1703 + p1705 = 1
inv : p1670 + p1672 = 1
inv : p1330 + p1333 + p1335 + p1337 = 1
inv : p1521 + p1522 + p1539 + p1541 = 1
inv : p2274 + p2277 + p2279 + p2281 = 1
inv : p1861 + p1864 + p1866 + p1868 = 1
inv : p1352 + p1357 + p1358 = 1
inv : p1762 + p1764 = 1
inv : p821 + p824 + p825 = 1
inv : p789 + p791 + p793 + p795 = 1
inv : p1788 + p1790 = 1
inv : p346 + p348 = 1
inv : p431 + p433 = 1
inv : p1202 + p1204 + p1206 + p1208 = 1
inv : p598 + p600 + p602 + p604 = 1
inv : p254 + p256 = 1
inv : p1883 + p1888 + p1889 = 1
inv : p657 + p659 + p661 + p663 = 1
inv : p1942 + p1945 + p1946 = 1
inv : p464 + p466 = 1
inv : p435 + p437 + p439 + p441 = 1
inv : p405 + p407 = 1
inv : p372 + p374 = 1
inv : p1706 + p1711 + p1712 = 1
inv : p1362 + p1364 = 1
inv : p1765 + p1768 + p1769 = 1
inv : p1896 + p1898 + p1900 + p1902 = 1
inv : p1729 + p1731 = 1
inv : p1470 + p1473 + p1474 = 1
inv : p1411 + p1414 + p1415 = 1
inv : p772 + p774 = 1
inv : p2146 + p2148 + p2150 + p2152 = 1
inv : p1303 + p1305 = 1
inv : p150 + p153 + p155 + p157 = 1
inv : p563 + p566 + p568 + p570 = 1
inv : p608 + p610 = 1
inv : p490 + p492 = 1
inv : p54 + p59 + p60 = 1
inv : p113 + p116 + p117 = 1
inv : p1577 + p1579 + p1611 + p1613 = 1
inv : p946 + p948 = 1
inv : p1480 + p1482 = 1
inv : p1035 + p1038 + p1040 + p1042 = 1
inv : p1521 + p1522 + p1529 + p1532 + p1533 = 1
inv : p1483 + p1485 + p1487 + p1489 = 1
inv : p1743 + p1746 + p1748 + p1750 = 1
inv : p195 + p197 = 1
inv : p907 + p909 + p911 + p913 = 1
inv : p654 + p656 = 1
inv : p120 + p122 = 1
inv : p1185 + p1187 = 1
inv : p2309 + p2311 + p2313 + p2315 = 1
inv : p582 + p584 = 1
inv : p1644 + p1646 = 1
inv : p1057 + p1060 + p1061 = 1
inv : p2234 + p2236 = 1
inv : p445 + p448 + p450 + p452 = 1
inv : p1182 + p1184 = 1
inv : p2142 + p2144 = 1
inv : p890 + p892 = 1
inv : p1241 + p1243 = 1
inv : p949 + p951 = 1
inv : p1411 + p1416 + p1417 = 1
inv : p1647 + p1652 + p1653 = 1
inv : p585 + p590 + p591 = 1
inv : p1851 + p1853 + p1855 + p1857 = 1
inv : p1965 + p1967 = 1
inv : p1998 + p2000 = 1
inv : p1418 + p1420 = 1
inv : p533 + p535 = 1
inv : p1906 + p1908 = 1
inv : p2057 + p2059 = 1
inv : p474 + p476 = 1
inv : p831 + p833 = 1
inv : p939 + p942 + p943 = 1
inv : p113 + p118 + p119 = 1
inv : p136 + p138 = 1
inv : p762 + p765 + p766 = 1
inv : p317 + p319 + p321 + p323 = 1
inv : p703 + p708 + p709 = 1
inv : p1821 + p1823 = 1
inv : p1365 + p1367 + p1369 + p1371 = 1
inv : p1126 + p1128 = 1
inv : p231 + p236 + p237 = 1
inv : p1654 + p1656 = 1
inv : p1706 + p1709 + p1710 = 1
inv : p1979 + p1982 + p1984 + p1986 = 1
inv : p1448 + p1451 + p1453 + p1455 = 1
inv : p523 + p525 = 1
inv : p290 + p293 + p294 = 1
inv : p303 + p305 + p307 + p309 = 1
inv : p1005 + p1007 = 1
inv : p1320 + p1322 + p1324 + p1326 = 1
inv : p297 + p299 = 1
inv : p1521 + p1552 + p1554 = 1
inv : p1942 + p1947 + p1948 = 1
inv : p917 + p920 + p922 + p924 = 1
inv : p2001 + p2004 + p2005 = 1
inv : p1566 + p1569 + p1571 + p1573 = 1
inv : p651 + p653 = 1
inv : p710 + p712 = 1
inv : p408 + p411 + p412 = 1
inv : p1116 + p1119 + p1120 = 1
inv : p64 + p66 = 1
inv : p875 + p876 + p880 + p885 + p886 = 1
inv : p2038 + p2041 + p2043 + p2045 = 1
inv : p740 + p743 + p745 + p747 = 1
inv : p1153 + p1156 + p1158 + p1160 = 1
inv : p123 + p125 = 1
inv : p2060 + p2063 + p2064 = 1
inv : p2001 + p2006 + p2007 = 1
inv : p1379 + p1381 + p1383 + p1385 = 1
inv : -p2358 - p2359 + p2360 + p2361 = 0
inv : p2293 + p2295 = 1
inv : p349 + p354 + p355 = 1
inv : -p647 - p648 + p649 + p650 = 0
inv : p681 + p684 + p686 + p688 = 1
inv : p1172 + p1174 = 1
inv : p1057 + p1062 + p1063 = 1
inv : p995 + p997 = 1
inv : p1094 + p1097 + p1099 + p1101 = 1
inv : p165 + p172 + p177 + p178 = 1
inv : p238 + p240 = 1
inv : p1359 + p1361 = 1
inv : p828 + p830 = 1
inv : p1765 + p1770 + p1771 = 1
inv : p2097 + p2100 + p2102 + p2104 = 1
inv : p2368 + p2372 + p2374 = 1
inv : p1198 + p1200 = 1
inv : p2083 + p2085 = 1
inv : p1949 + p1951 = 1
inv : p1802 + p1805 + p1807 + p1809 + p1811 + p1812 = 1
inv : p51 + p53 = 1
inv : p1438 + p1440 + p1442 + p1444 = 1
inv : p2319 + p2321 = 1
inv : p622 + p625 + p627 + p629 = 1
inv : p2119 + p2122 + p2123 = 1
inv : p1064 + p1066 = 1
inv : p300 + p302 = 1
inv : p2116 + p2118 = 1
inv : p1067 + p1069 = 1
inv : p2264 + p2266 + p2268 + p2270 + p2271 + p2272 = 1
inv : p799 + p802 + p804 + p806 = 1
inv : p2126 + p2128 = 1
inv : p1349 + p1351 = 1
inv : p1271 + p1274 + p1276 + p1278 = 1
inv : p349 + p352 + p353 = 1
inv : p1497 + p1499 + p1501 + p1503 = 1
inv : p290 + p295 + p296 = 1
inv : p2260 + p2262 = 1
inv : p875 + p876 + p880 + p883 + p884 = 1
inv : p2156 + p2159 + p2161 + p2163 = 1
inv : p713 + p715 = 1
inv : p1772 + p1774 = 1
inv : p821 + p826 + p827 = 1
inv : p1244 + p1246 = 1
inv : p1834 + p1836 = 1
inv : p1021 + p1023 = 1
inv : p2011 + p2013 = 1
inv : p2382 + p2384 + p2386 + p2388 = 1
inv : p1212 + p1215 + p1217 + p1219 = 1
inv : p415 + p417 = 1
inv : p1421 + p1423 = 1
inv : p54 + p57 + p58 = 1
inv : p1939 + p1941 = 1
inv : p1521 + p1522 + p1529 + p1534 + p1535 = 1
inv : p644 + p646 + p647 + p648 = 1
inv : p61 + p63 = 1
inv : p592 + p594 = 1
inv : p549 + p551 = 1
inv : p1521 + p1522 + p1542 + p1544 + p1546 + p1548 = 1
inv : p858 + p861 + p863 + p865 = 1
inv : p1470 + p1475 + p1476 = 1
inv : p228 + p230 = 1
inv : p1175 + p1178 + p1179 = 1
inv : p165 + p185 + p187 + p189 + p191 + p193 = 1
inv : p2215 + p2218 + p2220 + p2222 = 1
inv : p1116 + p1121 + p1122 = 1
inv : p1577 + p1579 + p1598 + p1600 = 1
inv : p2178 + p2181 + p2182 = 1
inv : p2362 + p2364 = 1
inv : p2355 + p2358 + p2359 = 1
inv : p165 + p169 + p171 = 1
inv : p244 + p246 + p248 + p250 = 1
inv : p2378 + p2380 = 1
inv : p2247 + p2249 = 1
inv : p1674 + p1676 + p1678 + p1680 = 1
inv : p844 + p846 = 1
inv : p2087 + p2089 + p2091 + p2093 = 1
inv : -p765 - p766 + p767 + p768 = 0
inv : p1424 + p1426 + p1428 + p1430 = 1
inv : p1234 + p1237 + p1238 = 1
inv : p818 + p820 = 1
inv : p726 + p728 = 1
inv : p165 + p172 + p175 + p176 = 1
inv : p526 + p529 + p530 = 1
inv : p976 + p979 + p981 + p983 = 1
inv : p785 + p787 = 1
inv : p1011 + p1013 + p1015 + p1017 = 1
inv : p2303 + p2305 = 1
inv : p848 + p850 + p852 + p854 = 1
inv : p209 + p212 + p214 + p216 = 1
inv : p667 + p669 = 1
inv : p2296 + p2301 + p2302 = 1
inv : p126 + p128 + p130 + p132 = 1
inv : p2060 + p2065 + p2066 = 1
inv : p2070 + p2072 = 1
inv : p504 + p507 + p509 + p511 = 1
inv : p1893 + p1895 = 1
inv : p759 + p761 = 1
inv : p1143 + p1145 + p1147 + p1149 = 1
inv : p1657 + p1659 = 1
inv : p2188 + p2190 = 1
inv : p1955 + p1957 + p1959 + p1961 = 1
inv : p2250 + p2252 + p2254 + p2256 = 1
inv : p376 + p378 + p380 + p382 = 1
inv : p1493 + p1495 = 1
inv : p1831 + p1833 = 1
inv : p467 + p470 + p471 = 1
inv : p477 + p479 = 1
inv : p2296 + p2299 + p2300 = 1
inv : p40 + p42 = 1
inv : p418 + p420 = 1
inv : p1375 + p1377 = 1
inv : p595 + p597 = 1
inv : p1306 + p1308 + p1310 + p1312 = 1
inv : p1467 + p1469 = 1
inv : p2008 + p2010 = 1
inv : p2333 + p2336 + p2338 + p2340 = 1
inv : p1175 + p1180 + p1181 = 1
inv : p1521 + p1522 + p1526 + p1528 = 1
inv : p1556 + p1558 + p1560 + p1562 = 1
inv : p1293 + p1296 + p1297 = 1
inv : p1684 + p1687 + p1689 + p1691 = 1
inv : p1408 + p1410 = 1
inv : p1775 + p1777 = 1
inv : p362 + p364 + p366 + p368 = 1
inv : p1316 + p1318 = 1
inv : p1389 + p1392 + p1394 + p1396 = 1
inv : p1261 + p1263 + p1265 + p1267 = 1
inv : p2119 + p2124 + p2125 = 1
inv : p1054 + p1056 = 1
inv : p165 + p179 + p181 = 1
inv : p1952 + p1954 = 1
inv : p386 + p389 + p391 + p393 = 1
inv : p2352 + p2354 = 1
inv : p199 + p201 + p203 + p205 = 1
inv : p2185 + p2187 = 1
inv : p91 + p94 + p96 + p98 = 1
inv : p408 + p413 + p414 = 1
inv : p1920 + p1923 + p1925 + p1927 = 1
inv : p2129 + p2131 = 1
inv : p258 + p260 + p262 + p264 = 1
inv : p241 + p243 = 1
inv : p1139 + p1141 = 1
inv : p1824 + p1827 + p1828 = 1
inv : p700 + p702 = 1
inv : p1231 + p1233 = 1
inv : p1837 + p1839 + p1841 + p1843 = 1
inv : p421 + p423 + p425 + p427 = 1
inv : p1507 + p1510 + p1512 + p1514 = 1
inv : p2323 + p2325 + p2327 + p2329 = 1
inv : p1910 + p1912 + p1914 + p1916 = 1
inv : p1234 + p1239 + p1240 = 1
inv : p327 + p330 + p332 + p334 = 1
inv : p2392 + p2395 + p2397 + p2399 = 1
inv : p612 + p614 + p616 + p618 = 1
inv : p1719 + p1721 + p1723 + p1725 = 1
inv : p893 + p895 + p897 + p899 = 1
inv : p1577 + p1579 + p1595 + p1597 = 1
inv : p962 + p964 = 1
inv : p1521 + p1522 + p1536 + p1538 = 1
inv : p1577 + p1579 + p1588 + p1591 + p1592 = 1
inv : p356 + p358 = 1
inv : p2244 + p2246 = 1
inv : p1080 + p1082 = 1
inv : p998 + p1003 + p1004 = 1
inv : p2178 + p2183 + p2184 = 1
inv : p875 + p887 + p889 = 1
inv : p1647 + p1650 + p1651 = 1
inv : p1883 + p1886 + p1887 = 1
inv : p2237 + p2242 + p2243 = 1
inv : p77 + p79 = 1
inv : p1188 + p1190 + p1192 + p1194 = 1
inv : p1969 + p1971 + p1973 + p1975 = 1
inv : p834 + p836 + p838 + p840 = 1
inv : p1247 + p1249 + p1251 + p1253 = 1
inv : p903 + p905 = 1
inv : p1660 + p1662 + p1664 + p1666 = 1
inv : p231 + p234 + p235 = 1
inv : p1577 + p1625 + p1628 + p1630 + p1632 = 1
inv : p1290 + p1292 = 1
inv : p2306 + p2308 = 1
inv : p67 + p69 + p71 + p73 = 1
inv : p585 + p588 + p589 = 1
inv : p1880 + p1882 = 1
inv : p875 + p876 + p877 + p879 = 1
inv : p526 + p531 + p532 = 1
inv : p2205 + p2207 + p2209 + p2211 = 1
inv : p1713 + p1715 = 1
inv : p268 + p271 + p273 + p275 = 1
inv : p952 + p954 + p956 + p958 = 1
inv : p2014 + p2016 + p2018 + p2020 = 1
inv : p1123 + p1125 = 1
inv : p2175 + p2177 = 1
inv : p1434 + p1436 = 1
inv : p1890 + p1892 = 1
inv : p2237 + p2240 + p2241 = 1
inv : p1577 + p1579 + p1615 + p1617 + p1619 + p1621 = 1
inv : p716 + p718 + p720 + p722 = 1
inv : p1778 + p1780 + p1782 + p1784 = 1
inv : p1129 + p1131 + p1133 + p1135 = 1
inv : p2191 + p2193 + p2195 + p2197 = 1
inv : p1716 + p1718 = 1
inv : p81 + p83 + p85 + p87 = 1
inv : p494 + p496 + p498 + p500 = 1
inv : p1577 + p1579 + p1585 + p1587 = 1
inv : p730 + p732 + p734 + p736 = 1
inv : p2201 + p2203 = 1
inv : p2028 + p2030 + p2032 + p2034 = 1
inv : p2024 + p2026 = 1
inv : p1008 + p1010 = 1
inv : p2067 + p2069 = 1
inv : p1257 + p1259 = 1
inv : p1824 + p1829 + p1830 = 1
inv : p480 + p482 + p484 + p486 = 1
inv : p359 + p361 = 1
inv : p467 + p472 + p473 = 1
inv : p1477 + p1479 = 1
inv : p165 + p182 + p184 = 1
inv : p1792 + p1794 + p1796 + p1798 = 1
inv : p966 + p968 + p970 + p972 = 1
inv : p939 + p944 + p945 = 1
inv : p1113 + p1115 = 1
inv : p671 + p673 + p675 + p677 = 1
inv : p1733 + p1735 + p1737 + p1739 = 1
inv : p1084 + p1086 + p1088 + p1090 = 1
inv : p775 + p777 + p779 + p781 = 1
inv : p1847 + p1849 = 1
inv : p110 + p112 = 1
inv : p641 + p643 = 1
inv : p140 + p142 + p144 + p146 = 1
inv : p2132 + p2134 + p2136 + p2138 = 1
inv : p2073 + p2075 + p2077 + p2079 = 1
inv : p553 + p555 + p557 + p559 = 1
inv : p539 + p541 + p543 + p545 = 1
inv : p1577 + p1579 + p1601 + p1603 + p1605 + p1607 = 1
inv : p703 + p706 + p707 = 1
inv : p1577 + p1579 + p1588 + p1593 + p1594 = 1
inv : p936 + p938 = 1
inv : p1293 + p1298 + p1299 = 1
inv : p1025 + p1027 + p1029 + p1031 = 1
inv : p1070 + p1072 + p1074 + p1076 = 1
inv : p769 + p771 = 1
inv : p536 + p538 = 1
inv : p1352 + p1355 + p1356 = 1
inv : p1300 + p1302 = 1
Total of 360 invariants.
[2020-05-27 10:19:15] [INFO ] Computed 360 place invariants in 82 ms
[2020-05-27 10:19:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 934 labels/synchronizations in 90 ms.
[2020-05-27 10:19:16] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityFireability.pnml.gal : 29 ms
[2020-05-27 10:19:16] [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 [invariant] property : ShieldIIPs-PT-040B-ReachabilityFireability-06 with value :(((i0.u2.p58!=1)||(i0.u3.p60!=1))||(i10.u204.p1579!=1))
Read [reachable] property : ShieldIIPs-PT-040B-ReachabilityFireability-12 with value :((((((i13.i1.i2.u257.p1959==1)&&(i1.u23.p185==1))&&(i4.u100.p781==1))&&(i5.i1.i1.u111.p876==1))&&(i15.u298.p2272==1))||(((i3.i1.i2.u78.p647==1)&&(i3.i1.i2.u82.p663==1))&&(i12.u236.p1812==1)))
Read [reachable] property : ShieldIIPs-PT-040B-ReachabilityFireability-13 with value :((i10.u197.p1522==1)&&(i2.i1.i3.u63.p498==1))
built 16 ordering constraints for composite.
built 25 ordering constraints for composite.
built 28 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 33 ordering constraints for composite.
built 22 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 15 ordering constraints for composite.
built 22 ordering constraints for composite.
built 7 ordering constraints for composite.
built 11 ordering constraints for composite.
built 14 ordering constraints for composite.
built 24 ordering constraints for composite.
built 7 ordering constraints for composite.
built 11 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
[2020-05-27 10:19:16] [INFO ] BMC solution for property ShieldIIPs-PT-040B-ReachabilityFireability-06(UNSAT) depth K=2 took 1068 ms
built 9 ordering constraints for composite.
built 13 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 11 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 9 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 20 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 11 ordering constraints for composite.
built 10 ordering constraints for composite.
built 4 ordering constraints for composite.
built 8 ordering constraints for composite.
built 5 ordering constraints for composite.
built 14 ordering constraints for composite.
built 20 ordering constraints for composite.
built 21 ordering constraints for composite.
built 22 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 8 ordering constraints for composite.
built 14 ordering constraints for composite.
built 4 ordering constraints for composite.
built 9 ordering constraints for composite.
built 19 ordering constraints for composite.
built 26 ordering constraints for composite.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 973 rows 1012 cols
[2020-05-27 10:19:16] [INFO ] Computed 360 place invariants in 21 ms
inv : p287 + p289 = 1
inv : p313 + p315 = 1
inv : p998 + p1001 + p1002 = 1
inv : p1703 + p1705 = 1
inv : p1670 + p1672 = 1
inv : p1330 + p1333 + p1335 + p1337 = 1
inv : p1521 + p1522 + p1539 + p1541 = 1
inv : p2274 + p2277 + p2279 + p2281 = 1
inv : p1861 + p1864 + p1866 + p1868 = 1
inv : p1352 + p1357 + p1358 = 1
inv : p1762 + p1764 = 1
inv : p821 + p824 + p825 = 1
inv : p789 + p791 + p793 + p795 = 1
inv : p1788 + p1790 = 1
inv : p346 + p348 = 1
inv : p431 + p433 = 1
inv : p1202 + p1204 + p1206 + p1208 = 1
inv : p598 + p600 + p602 + p604 = 1
inv : p254 + p256 = 1
inv : p1883 + p1888 + p1889 = 1
inv : p657 + p659 + p661 + p663 = 1
inv : p1942 + p1945 + p1946 = 1
inv : p464 + p466 = 1
inv : p435 + p437 + p439 + p441 = 1
inv : p405 + p407 = 1
inv : p372 + p374 = 1
inv : p1706 + p1711 + p1712 = 1
inv : p1362 + p1364 = 1
inv : p1765 + p1768 + p1769 = 1
inv : p1896 + p1898 + p1900 + p1902 = 1
inv : p1729 + p1731 = 1
inv : p1470 + p1473 + p1474 = 1
inv : p1411 + p1414 + p1415 = 1
inv : p772 + p774 = 1
inv : p2146 + p2148 + p2150 + p2152 = 1
inv : p1303 + p1305 = 1
inv : p150 + p153 + p155 + p157 = 1
inv : p563 + p566 + p568 + p570 = 1
inv : p608 + p610 = 1
inv : p490 + p492 = 1
inv : p54 + p59 + p60 = 1
inv : p113 + p116 + p117 = 1
inv : p1577 + p1579 + p1611 + p1613 = 1
inv : p946 + p948 = 1
inv : p1480 + p1482 = 1
inv : p1035 + p1038 + p1040 + p1042 = 1
inv : p1521 + p1522 + p1529 + p1532 + p1533 = 1
inv : p1483 + p1485 + p1487 + p1489 = 1
inv : p1743 + p1746 + p1748 + p1750 = 1
inv : p195 + p197 = 1
inv : p907 + p909 + p911 + p913 = 1
inv : p654 + p656 = 1
inv : p120 + p122 = 1
inv : p1185 + p1187 = 1
inv : p2309 + p2311 + p2313 + p2315 = 1
inv : p582 + p584 = 1
inv : p1644 + p1646 = 1
inv : p1057 + p1060 + p1061 = 1
inv : p2234 + p2236 = 1
inv : p445 + p448 + p450 + p452 = 1
inv : p1182 + p1184 = 1
inv : p2142 + p2144 = 1
inv : p890 + p892 = 1
inv : p1241 + p1243 = 1
inv : p949 + p951 = 1
inv : p1411 + p1416 + p1417 = 1
inv : p1647 + p1652 + p1653 = 1
inv : p585 + p590 + p591 = 1
inv : p1851 + p1853 + p1855 + p1857 = 1
inv : p1965 + p1967 = 1
inv : p1998 + p2000 = 1
inv : p1418 + p1420 = 1
inv : p533 + p535 = 1
inv : p1906 + p1908 = 1
inv : p2057 + p2059 = 1
inv : p474 + p476 = 1
inv : p831 + p833 = 1
inv : p939 + p942 + p943 = 1
inv : p113 + p118 + p119 = 1
inv : p136 + p138 = 1
inv : p762 + p765 + p766 = 1
inv : p317 + p319 + p321 + p323 = 1
inv : p703 + p708 + p709 = 1
inv : p1821 + p1823 = 1
inv : p1365 + p1367 + p1369 + p1371 = 1
inv : p1126 + p1128 = 1
inv : p231 + p236 + p237 = 1
inv : p1654 + p1656 = 1
inv : p1706 + p1709 + p1710 = 1
inv : p1979 + p1982 + p1984 + p1986 = 1
inv : p1448 + p1451 + p1453 + p1455 = 1
inv : p523 + p525 = 1
inv : p290 + p293 + p294 = 1
inv : p303 + p305 + p307 + p309 = 1
inv : p1005 + p1007 = 1
inv : p1320 + p1322 + p1324 + p1326 = 1
inv : p297 + p299 = 1
inv : p1521 + p1552 + p1554 = 1
inv : p1942 + p1947 + p1948 = 1
inv : p917 + p920 + p922 + p924 = 1
inv : p2001 + p2004 + p2005 = 1
inv : p1566 + p1569 + p1571 + p1573 = 1
inv : p651 + p653 = 1
inv : p710 + p712 = 1
inv : p408 + p411 + p412 = 1
inv : p1116 + p1119 + p1120 = 1
inv : p64 + p66 = 1
inv : p875 + p876 + p880 + p885 + p886 = 1
inv : p2038 + p2041 + p2043 + p2045 = 1
inv : p740 + p743 + p745 + p747 = 1
inv : p1153 + p1156 + p1158 + p1160 = 1
inv : p123 + p125 = 1
inv : p2060 + p2063 + p2064 = 1
inv : p2001 + p2006 + p2007 = 1
inv : p1379 + p1381 + p1383 + p1385 = 1
inv : -p2358 - p2359 + p2360 + p2361 = 0
inv : p2293 + p2295 = 1
inv : p349 + p354 + p355 = 1
inv : -p647 - p648 + p649 + p650 = 0
inv : p681 + p684 + p686 + p688 = 1
inv : p1172 + p1174 = 1
inv : p1057 + p1062 + p1063 = 1
inv : p995 + p997 = 1
inv : p1094 + p1097 + p1099 + p1101 = 1
inv : p165 + p172 + p177 + p178 = 1
inv : p238 + p240 = 1
inv : p1359 + p1361 = 1
inv : p828 + p830 = 1
inv : p1765 + p1770 + p1771 = 1
inv : p2097 + p2100 + p2102 + p2104 = 1
inv : p2368 + p2372 + p2374 = 1
inv : p1198 + p1200 = 1
inv : p2083 + p2085 = 1
inv : p1949 + p1951 = 1
inv : p1802 + p1805 + p1807 + p1809 + p1811 + p1812 = 1
inv : p51 + p53 = 1
inv : p1438 + p1440 + p1442 + p1444 = 1
inv : p2319 + p2321 = 1
inv : p622 + p625 + p627 + p629 = 1
inv : p2119 + p2122 + p2123 = 1
inv : p1064 + p1066 = 1
inv : p300 + p302 = 1
inv : p2116 + p2118 = 1
inv : p1067 + p1069 = 1
inv : p2264 + p2266 + p2268 + p2270 + p2271 + p2272 = 1
inv : p799 + p802 + p804 + p806 = 1
inv : p2126 + p2128 = 1
inv : p1349 + p1351 = 1
inv : p1271 + p1274 + p1276 + p1278 = 1
inv : p349 + p352 + p353 = 1
inv : p1497 + p1499 + p1501 + p1503 = 1
inv : p290 + p295 + p296 = 1
inv : p2260 + p2262 = 1
inv : p875 + p876 + p880 + p883 + p884 = 1
inv : p2156 + p2159 + p2161 + p2163 = 1
inv : p713 + p715 = 1
inv : p1772 + p1774 = 1
inv : p821 + p826 + p827 = 1
inv : p1244 + p1246 = 1
inv : p1834 + p1836 = 1
inv : p1021 + p1023 = 1
inv : p2011 + p2013 = 1
inv : p2382 + p2384 + p2386 + p2388 = 1
inv : p1212 + p1215 + p1217 + p1219 = 1
inv : p415 + p417 = 1
inv : p1421 + p1423 = 1
inv : p54 + p57 + p58 = 1
inv : p1939 + p1941 = 1
inv : p1521 + p1522 + p1529 + p1534 + p1535 = 1
inv : p644 + p646 + p647 + p648 = 1
inv : p61 + p63 = 1
inv : p592 + p594 = 1
inv : p549 + p551 = 1
inv : p1521 + p1522 + p1542 + p1544 + p1546 + p1548 = 1
inv : p858 + p861 + p863 + p865 = 1
inv : p1470 + p1475 + p1476 = 1
inv : p228 + p230 = 1
inv : p1175 + p1178 + p1179 = 1
inv : p165 + p185 + p187 + p189 + p191 + p193 = 1
inv : p2215 + p2218 + p2220 + p2222 = 1
inv : p1116 + p1121 + p1122 = 1
inv : p1577 + p1579 + p1598 + p1600 = 1
inv : p2178 + p2181 + p2182 = 1
inv : p2362 + p2364 = 1
inv : p2355 + p2358 + p2359 = 1
inv : p165 + p169 + p171 = 1
inv : p244 + p246 + p248 + p250 = 1
inv : p2378 + p2380 = 1
inv : p2247 + p2249 = 1
inv : p1674 + p1676 + p1678 + p1680 = 1
inv : p844 + p846 = 1
inv : p2087 + p2089 + p2091 + p2093 = 1
inv : -p765 - p766 + p767 + p768 = 0
inv : p1424 + p1426 + p1428 + p1430 = 1
inv : p1234 + p1237 + p1238 = 1
inv : p818 + p820 = 1
inv : p726 + p728 = 1
inv : p165 + p172 + p175 + p176 = 1
inv : p526 + p529 + p530 = 1
inv : p976 + p979 + p981 + p983 = 1
inv : p785 + p787 = 1
inv : p1011 + p1013 + p1015 + p1017 = 1
inv : p2303 + p2305 = 1
inv : p848 + p850 + p852 + p854 = 1
inv : p209 + p212 + p214 + p216 = 1
inv : p667 + p669 = 1
inv : p2296 + p2301 + p2302 = 1
inv : p126 + p128 + p130 + p132 = 1
inv : p2060 + p2065 + p2066 = 1
inv : p2070 + p2072 = 1
inv : p504 + p507 + p509 + p511 = 1
inv : p1893 + p1895 = 1
inv : p759 + p761 = 1
inv : p1143 + p1145 + p1147 + p1149 = 1
inv : p1657 + p1659 = 1
inv : p2188 + p2190 = 1
inv : p1955 + p1957 + p1959 + p1961 = 1
inv : p2250 + p2252 + p2254 + p2256 = 1
inv : p376 + p378 + p380 + p382 = 1
inv : p1493 + p1495 = 1
inv : p1831 + p1833 = 1
inv : p467 + p470 + p471 = 1
inv : p477 + p479 = 1
inv : p2296 + p2299 + p2300 = 1
inv : p40 + p42 = 1
inv : p418 + p420 = 1
inv : p1375 + p1377 = 1
inv : p595 + p597 = 1
inv : p1306 + p1308 + p1310 + p1312 = 1
inv : p1467 + p1469 = 1
inv : p2008 + p2010 = 1
inv : p2333 + p2336 + p2338 + p2340 = 1
inv : p1175 + p1180 + p1181 = 1
inv : p1521 + p1522 + p1526 + p1528 = 1
inv : p1556 + p1558 + p1560 + p1562 = 1
inv : p1293 + p1296 + p1297 = 1
inv : p1684 + p1687 + p1689 + p1691 = 1
inv : p1408 + p1410 = 1
inv : p1775 + p1777 = 1
inv : p362 + p364 + p366 + p368 = 1
inv : p1316 + p1318 = 1
inv : p1389 + p1392 + p1394 + p1396 = 1
inv : p1261 + p1263 + p1265 + p1267 = 1
inv : p2119 + p2124 + p2125 = 1
inv : p1054 + p1056 = 1
inv : p165 + p179 + p181 = 1
inv : p1952 + p1954 = 1
inv : p386 + p389 + p391 + p393 = 1
inv : p2352 + p2354 = 1
inv : p199 + p201 + p203 + p205 = 1
inv : p2185 + p2187 = 1
inv : p91 + p94 + p96 + p98 = 1
inv : p408 + p413 + p414 = 1
inv : p1920 + p1923 + p1925 + p1927 = 1
inv : p2129 + p2131 = 1
inv : p258 + p260 + p262 + p264 = 1
inv : p241 + p243 = 1
inv : p1139 + p1141 = 1
inv : p1824 + p1827 + p1828 = 1
inv : p700 + p702 = 1
inv : p1231 + p1233 = 1
inv : p1837 + p1839 + p1841 + p1843 = 1
inv : p421 + p423 + p425 + p427 = 1
inv : p1507 + p1510 + p1512 + p1514 = 1
inv : p2323 + p2325 + p2327 + p2329 = 1
inv : p1910 + p1912 + p1914 + p1916 = 1
inv : p1234 + p1239 + p1240 = 1
inv : p327 + p330 + p332 + p334 = 1
inv : p2392 + p2395 + p2397 + p2399 = 1
inv : p612 + p614 + p616 + p618 = 1
inv : p1719 + p1721 + p1723 + p1725 = 1
inv : p893 + p895 + p897 + p899 = 1
inv : p1577 + p1579 + p1595 + p1597 = 1
inv : p962 + p964 = 1
inv : p1521 + p1522 + p1536 + p1538 = 1
inv : p1577 + p1579 + p1588 + p1591 + p1592 = 1
inv : p356 + p358 = 1
inv : p2244 + p2246 = 1
inv : p1080 + p1082 = 1
inv : p998 + p1003 + p1004 = 1
inv : p2178 + p2183 + p2184 = 1
inv : p875 + p887 + p889 = 1
inv : p1647 + p1650 + p1651 = 1
inv : p1883 + p1886 + p1887 = 1
inv : p2237 + p2242 + p2243 = 1
inv : p77 + p79 = 1
inv : p1188 + p1190 + p1192 + p1194 = 1
inv : p1969 + p1971 + p1973 + p1975 = 1
inv : p834 + p836 + p838 + p840 = 1
inv : p1247 + p1249 + p1251 + p1253 = 1
inv : p903 + p905 = 1
inv : p1660 + p1662 + p1664 + p1666 = 1
inv : p231 + p234 + p235 = 1
inv : p1577 + p1625 + p1628 + p1630 + p1632 = 1
inv : p1290 + p1292 = 1
inv : p2306 + p2308 = 1
inv : p67 + p69 + p71 + p73 = 1
inv : p585 + p588 + p589 = 1
inv : p1880 + p1882 = 1
inv : p875 + p876 + p877 + p879 = 1
inv : p526 + p531 + p532 = 1
inv : p2205 + p2207 + p2209 + p2211 = 1
inv : p1713 + p1715 = 1
inv : p268 + p271 + p273 + p275 = 1
inv : p952 + p954 + p956 + p958 = 1
inv : p2014 + p2016 + p2018 + p2020 = 1
inv : p1123 + p1125 = 1
inv : p2175 + p2177 = 1
inv : p1434 + p1436 = 1
inv : p1890 + p1892 = 1
inv : p2237 + p2240 + p2241 = 1
inv : p1577 + p1579 + p1615 + p1617 + p1619 + p1621 = 1
inv : p716 + p718 + p720 + p722 = 1
inv : p1778 + p1780 + p1782 + p1784 = 1
inv : p1129 + p1131 + p1133 + p1135 = 1
inv : p2191 + p2193 + p2195 + p2197 = 1
inv : p1716 + p1718 = 1
inv : p81 + p83 + p85 + p87 = 1
inv : p494 + p496 + p498 + p500 = 1
inv : p1577 + p1579 + p1585 + p1587 = 1
inv : p730 + p732 + p734 + p736 = 1
inv : p2201 + p2203 = 1
inv : p2028 + p2030 + p2032 + p2034 = 1
inv : p2024 + p2026 = 1
inv : p1008 + p1010 = 1
inv : p2067 + p2069 = 1
inv : p1257 + p1259 = 1
inv : p1824 + p1829 + p1830 = 1
inv : p480 + p482 + p484 + p486 = 1
inv : p359 + p361 = 1
inv : p467 + p472 + p473 = 1
inv : p1477 + p1479 = 1
inv : p165 + p182 + p184 = 1
inv : p1792 + p1794 + p1796 + p1798 = 1
inv : p966 + p968 + p970 + p972 = 1
inv : p939 + p944 + p945 = 1
inv : p1113 + p1115 = 1
inv : p671 + p673 + p675 + p677 = 1
inv : p1733 + p1735 + p1737 + p1739 = 1
inv : p1084 + p1086 + p1088 + p1090 = 1
inv : p775 + p777 + p779 + p781 = 1
inv : p1847 + p1849 = 1
inv : p110 + p112 = 1
inv : p641 + p643 = 1
inv : p140 + p142 + p144 + p146 = 1
inv : p2132 + p2134 + p2136 + p2138 = 1
inv : p2073 + p2075 + p2077 + p2079 = 1
inv : p553 + p555 + p557 + p559 = 1
inv : p539 + p541 + p543 + p545 = 1
inv : p1577 + p1579 + p1601 + p1603 + p1605 + p1607 = 1
inv : p703 + p706 + p707 = 1
inv : p1577 + p1579 + p1588 + p1593 + p1594 = 1
inv : p936 + p938 = 1
inv : p1293 + p1298 + p1299 = 1
inv : p1025 + p1027 + p1029 + p1031 = 1
inv : p1070 + p1072 + p1074 + p1076 = 1
inv : p769 + p771 = 1
inv : p536 + p538 = 1
inv : p1352 + p1355 + p1356 = 1
inv : p1300 + p1302 = 1
Total of 360 invariants.
[2020-05-27 10:19:16] [INFO ] Computed 360 place invariants in 24 ms
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 10:19:18] [INFO ] BMC solution for property ShieldIIPs-PT-040B-ReachabilityFireability-12(UNSAT) depth K=2 took 1441 ms
SDD proceeding with computation, new max is 16384
[2020-05-27 10:19:19] [INFO ] BMC solution for property ShieldIIPs-PT-040B-ReachabilityFireability-13(UNSAT) depth K=2 took 1071 ms
SDD proceeding with computation, new max is 32768
SDD proceeding with computation, new max is 65536
[2020-05-27 10:19:25] [INFO ] BMC solution for property ShieldIIPs-PT-040B-ReachabilityFireability-06(UNSAT) depth K=3 took 6468 ms
[2020-05-27 10:19:25] [INFO ] Proved 1012 variables to be positive in 10026 ms
[2020-05-27 10:19:25] [INFO ] Computing symmetric may disable matrix : 973 transitions.
[2020-05-27 10:19:25] [INFO ] Computation of disable matrix completed :0/973 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 10:19:26] [INFO ] Proved 1012 variables to be positive in 9372 ms
[2020-05-27 10:19:26] [INFO ] Computation of Complete disable matrix. took 203 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 10:19:26] [INFO ] Computing symmetric may enable matrix : 973 transitions.
[2020-05-27 10:19:26] [INFO ] Computation of Complete enable matrix. took 111 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 10:19:26] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-040B-ReachabilityFireability-06
[2020-05-27 10:19:26] [INFO ] KInduction solution for property ShieldIIPs-PT-040B-ReachabilityFireability-06(SAT) depth K=0 took 162 ms
[2020-05-27 10:19:26] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-040B-ReachabilityFireability-12
[2020-05-27 10:19:26] [INFO ] KInduction solution for property ShieldIIPs-PT-040B-ReachabilityFireability-12(SAT) depth K=0 took 97 ms
[2020-05-27 10:19:26] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-040B-ReachabilityFireability-13
[2020-05-27 10:19:26] [INFO ] KInduction solution for property ShieldIIPs-PT-040B-ReachabilityFireability-13(SAT) depth K=0 took 93 ms
[2020-05-27 10:19:26] [INFO ] Computing symmetric co enabling matrix : 973 transitions.
[2020-05-27 10:19:26] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-040B-ReachabilityFireability-06
[2020-05-27 10:19:26] [INFO ] KInduction solution for property ShieldIIPs-PT-040B-ReachabilityFireability-06(SAT) depth K=1 took 237 ms
[2020-05-27 10:19:26] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-040B-ReachabilityFireability-12
[2020-05-27 10:19:26] [INFO ] KInduction solution for property ShieldIIPs-PT-040B-ReachabilityFireability-12(SAT) depth K=1 took 206 ms
[2020-05-27 10:19:27] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-040B-ReachabilityFireability-13
[2020-05-27 10:19:27] [INFO ] KInduction solution for property ShieldIIPs-PT-040B-ReachabilityFireability-13(SAT) depth K=1 took 176 ms
[2020-05-27 10:19:29] [INFO ] Computation of co-enabling matrix(33/973) took 2676 ms. Total solver calls (SAT/UNSAT): 402(7/395)
[2020-05-27 10:19:32] [INFO ] Computation of co-enabling matrix(60/973) took 5700 ms. Total solver calls (SAT/UNSAT): 724(7/717)
[2020-05-27 10:19:35] [INFO ] Computation of co-enabling matrix(83/973) took 8888 ms. Total solver calls (SAT/UNSAT): 1002(7/995)
[2020-05-27 10:19:38] [INFO ] Computation of co-enabling matrix(114/973) took 11947 ms. Total solver calls (SAT/UNSAT): 1336(11/1325)
SDD proceeding with computation, new max is 131072
[2020-05-27 10:19:41] [INFO ] Computation of co-enabling matrix(142/973) took 15110 ms. Total solver calls (SAT/UNSAT): 1643(25/1618)
[2020-05-27 10:19:44] [INFO ] Computation of co-enabling matrix(157/973) took 18172 ms. Total solver calls (SAT/UNSAT): 1777(59/1718)
[2020-05-27 10:19:47] [INFO ] Computation of co-enabling matrix(217/973) took 21176 ms. Total solver calls (SAT/UNSAT): 2310(183/2127)
[2020-05-27 10:19:50] [INFO ] Computation of co-enabling matrix(274/973) took 24218 ms. Total solver calls (SAT/UNSAT): 2786(247/2539)
[2020-05-27 10:19:53] [INFO ] Computation of co-enabling matrix(341/973) took 27237 ms. Total solver calls (SAT/UNSAT): 3320(325/2995)
[2020-05-27 10:19:56] [INFO ] Computation of co-enabling matrix(397/973) took 30249 ms. Total solver calls (SAT/UNSAT): 3746(391/3355)
[2020-05-27 10:19:59] [INFO ] Computation of co-enabling matrix(466/973) took 33258 ms. Total solver calls (SAT/UNSAT): 4315(473/3842)
[2020-05-27 10:20:02] [INFO ] Computation of co-enabling matrix(540/973) took 36263 ms. Total solver calls (SAT/UNSAT): 4941(557/4384)
[2020-05-27 10:20:05] [INFO ] Computation of co-enabling matrix(656/973) took 39272 ms. Total solver calls (SAT/UNSAT): 5873(689/5184)
[2020-05-27 10:20:08] [INFO ] Computation of co-enabling matrix(776/973) took 42273 ms. Total solver calls (SAT/UNSAT): 6231(741/5490)
[2020-05-27 10:20:11] [INFO ] Computation of Finished co-enabling matrix. took 44962 ms. Total solver calls (SAT/UNSAT): 6315(741/5574)
[2020-05-27 10:20:11] [INFO ] Computing Do-Not-Accords matrix : 973 transitions.
[2020-05-27 10:20:12] [INFO ] Computation of Completed DNA matrix. took 343 ms. Total solver calls (SAT/UNSAT): 12(0/12)
[2020-05-27 10:20:12] [INFO ] Built C files in 58359ms 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]
SDD proceeding with computation, new max is 262144
Compilation finished in 12478 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 96 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, ShieldIIPsPT040BReachabilityFireability06==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, ShieldIIPsPT040BReachabilityFireability06==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, ShieldIIPsPT040BReachabilityFireability06==true], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-27 10:20:28] [INFO ] BMC solution for property ShieldIIPs-PT-040B-ReachabilityFireability-12(UNSAT) depth K=3 took 62512 ms
[2020-05-27 10:21:04] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-040B-ReachabilityFireability-06
[2020-05-27 10:21:04] [INFO ] KInduction solution for property ShieldIIPs-PT-040B-ReachabilityFireability-06(SAT) depth K=2 took 97230 ms
[2020-05-27 10:21:16] [INFO ] BMC solution for property ShieldIIPs-PT-040B-ReachabilityFireability-13(UNSAT) depth K=3 took 48514 ms
[2020-05-27 10:23:49] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-040B-ReachabilityFireability-12
[2020-05-27 10:23:49] [INFO ] KInduction solution for property ShieldIIPs-PT-040B-ReachabilityFireability-12(SAT) depth K=2 took 165444 ms
SDD proceeding with computation, new max is 524288
SDD proceeding with computation, new max is 1048576
[2020-05-27 10:25:46] [INFO ] BMC solution for property ShieldIIPs-PT-040B-ReachabilityFireability-06(UNSAT) depth K=4 took 269685 ms
[2020-05-27 10:33:57] [INFO ] BMC solution for property ShieldIIPs-PT-040B-ReachabilityFireability-12(UNSAT) depth K=4 took 490764 ms
ITS-tools command line returned an error code 137
[2020-05-27 10:36:13] [INFO ] Applying decomposition
[2020-05-27 10:36:14] [INFO ] Flatten gal took : 732 ms
[2020-05-27 10:36:14] [INFO ] Decomposing Gal with order
[2020-05-27 10:36:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 10:36:17] [INFO ] Removed a total of 911 redundant transitions.
[2020-05-27 10:36:19] [INFO ] Flatten gal took : 3673 ms
[2020-05-27 10:36:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 1962 labels/synchronizations in 2769 ms.
[2020-05-27 10:36:26] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityFireability.pnml.gal : 222 ms
[2020-05-27 10:36:26] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityFireability.prop : 2 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 [invariant] property : ShieldIIPs-PT-040B-ReachabilityFireability-06 with value :(((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.i1.u50.p58!=1)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.i1.u51.p60!=1))||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u969.p1579!=1))
Read [reachable] property : ShieldIIPs-PT-040B-ReachabilityFireability-12 with value :((((((i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u598.p1959==1)&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u88.p185==1))&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u258.p781==1))&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.u1045.p876==1))&&(i0.i0.i1.i0.u685.p2272==1))||(((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.i1.u220.p647==1)&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u224.p663==1))&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u550.p1812==1)))
Read [reachable] property : ShieldIIPs-PT-040B-ReachabilityFireability-13 with value :((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u898.p1522==1)&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u175.p498==1))
built 1 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 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.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 16 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 14 ordering constraints for composite.
built 12 ordering constraints for composite.
built 10 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 17 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 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 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 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 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 3 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 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
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 10:41:26] [INFO ] BMC solution for property ShieldIIPs-PT-040B-ReachabilityFireability-13(UNSAT) depth K=4 took 449213 ms
SDD proceeding with computation, new max is 524288
ITS-tools command line returned an error code 137
[2020-05-27 10:56:08] [INFO ] Flatten gal took : 502 ms
[2020-05-27 10:56:16] [INFO ] Input system was already deterministic with 973 transitions.
[2020-05-27 10:56:16] [INFO ] Transformed 1012 places.
[2020-05-27 10:56:16] [INFO ] Transformed 973 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2020-05-27 10:56:16] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityFireability.pnml.gal : 95 ms
[2020-05-27 10:56:16] [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, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/ReachabilityFireability.pnml.gal -t CGAL -reachable-file ReachabilityFireability.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file ReachabilityFireability.prop.
Read [invariant] property : ShieldIIPs-PT-040B-ReachabilityFireability-06 with value :(((p58!=1)||(p60!=1))||(p1579!=1))
Read [reachable] property : ShieldIIPs-PT-040B-ReachabilityFireability-12 with value :((((((p1959==1)&&(p185==1))&&(p781==1))&&(p876==1))&&(p2272==1))||(((p647==1)&&(p663==1))&&(p1812==1)))
Read [reachable] property : ShieldIIPs-PT-040B-ReachabilityFireability-13 with value :((p1522==1)&&(p498==1))
SDD proceeding with computation, new max is 4
SDD proceeding with computation, new max is 8
SDD proceeding with computation, new max is 16
SDD proceeding with computation, new max is 32
SDD proceeding with computation, new max is 64
SDD proceeding with computation, new max is 128
SDD proceeding with computation, new max is 256
SDD proceeding with computation, new max is 512
SDD proceeding with computation, new max is 1024
SDD proceeding with computation, new max is 2048
SDD proceeding with computation, new max is 4096
SDD proceeding with computation, new max is 8192
SDD proceeding with computation, new max is 16384
SDD proceeding with computation, new max is 32768
SDD proceeding with computation, new max is 65536
SDD proceeding with computation, new max is 131072
SDD proceeding with computation, new max is 262144
SDD proceeding with computation, new max is 524288
SDD proceeding with computation, new max is 1048576
SDD proceeding with computation, new max is 2097152
[2020-05-27 11:08:59] [INFO ] BMC solution for property ShieldIIPs-PT-040B-ReachabilityFireability-06(UNSAT) depth K=5 took 1653128 ms

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-040B"
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-040B, 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-159033475300183"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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