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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 3.3K May 14 00:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 14 00:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 18:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 18:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 14 10:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K 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 16K May 14 10:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.5K May 13 13:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 13 13:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 07:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 13 07:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 426K 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-050A-ReachabilityFireability-00
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-01
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-02
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-03
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-04
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-05
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-06
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-07
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-08
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-09
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-10
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-11
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-12
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-13
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-14
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1590575503002

[2020-05-27 10:31:44] [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:31:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 10:31:44] [INFO ] Load time of PNML (sax parser for PT used): 154 ms
[2020-05-27 10:31:44] [INFO ] Transformed 1253 places.
[2020-05-27 10:31:44] [INFO ] Transformed 1203 transitions.
[2020-05-27 10:31:44] [INFO ] Found NUPN structural information;
[2020-05-27 10:31:44] [INFO ] Parsed PT model containing 1253 places and 1203 transitions in 211 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 45 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 3 resets, run finished after 148 ms. (steps per millisecond=67 ) properties seen :[1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1]
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 67 ms. (steps per millisecond=149 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 68 ms. (steps per millisecond=147 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 77 ms. (steps per millisecond=129 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 57 ms. (steps per millisecond=175 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 60 ms. (steps per millisecond=166 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 64 ms. (steps per millisecond=156 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 77 ms. (steps per millisecond=129 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 1203 rows 1253 cols
[2020-05-27 10:31:45] [INFO ] Computed 451 place invariants in 34 ms
[2020-05-27 10:31:46] [INFO ] [Real]Absence check using 451 positive place invariants in 288 ms returned sat
[2020-05-27 10:31:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 10:31:49] [INFO ] [Real]Absence check using state equation in 3145 ms returned sat
[2020-05-27 10:31:49] [INFO ] Deduced a trap composed of 18 places in 106 ms
[2020-05-27 10:31:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 232 ms
[2020-05-27 10:31:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 10:31:50] [INFO ] [Nat]Absence check using 451 positive place invariants in 369 ms returned sat
[2020-05-27 10:31:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 10:31:53] [INFO ] [Nat]Absence check using state equation in 3489 ms returned sat
[2020-05-27 10:31:53] [INFO ] Deduced a trap composed of 13 places in 140 ms
[2020-05-27 10:31:54] [INFO ] Deduced a trap composed of 18 places in 45 ms
[2020-05-27 10:31:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 401 ms
[2020-05-27 10:31:54] [INFO ] Computed and/alt/rep : 1202/4803/1202 causal constraints in 119 ms.
[2020-05-27 10:31:54] [INFO ] Added : 25 causal constraints over 5 iterations in 562 ms. Result :unknown
[2020-05-27 10:31:55] [INFO ] [Real]Absence check using 451 positive place invariants in 302 ms returned sat
[2020-05-27 10:31:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 10:31:59] [INFO ] [Real]Absence check using state equation in 3722 ms returned sat
[2020-05-27 10:31:59] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 10:31:59] [INFO ] [Nat]Absence check using 451 positive place invariants in 261 ms returned sat
[2020-05-27 10:31:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 10:32:02] [INFO ] [Nat]Absence check using state equation in 3093 ms returned sat
[2020-05-27 10:32:02] [INFO ] Deduced a trap composed of 11 places in 68 ms
[2020-05-27 10:32:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 200 ms
[2020-05-27 10:32:03] [INFO ] Computed and/alt/rep : 1202/4803/1202 causal constraints in 115 ms.
[2020-05-27 10:32:04] [INFO ] Added : 60 causal constraints over 12 iterations in 1268 ms. Result :unknown
[2020-05-27 10:32:04] [INFO ] [Real]Absence check using 451 positive place invariants in 431 ms returned sat
[2020-05-27 10:32:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 10:32:07] [INFO ] [Real]Absence check using state equation in 3116 ms returned sat
[2020-05-27 10:32:08] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 10:32:08] [INFO ] [Nat]Absence check using 451 positive place invariants in 352 ms returned sat
[2020-05-27 10:32:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 10:32:11] [INFO ] [Nat]Absence check using state equation in 3004 ms returned sat
[2020-05-27 10:32:11] [INFO ] Computed and/alt/rep : 1202/4803/1202 causal constraints in 75 ms.
[2020-05-27 10:32:13] [INFO ] Added : 95 causal constraints over 19 iterations in 1351 ms. Result :unknown
[2020-05-27 10:32:13] [INFO ] [Real]Absence check using 451 positive place invariants in 350 ms returned sat
[2020-05-27 10:32:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 10:32:16] [INFO ] [Real]Absence check using state equation in 3069 ms returned sat
[2020-05-27 10:32:16] [INFO ] Deduced a trap composed of 18 places in 28 ms
[2020-05-27 10:32:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2020-05-27 10:32:16] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 10:32:17] [INFO ] [Nat]Absence check using 451 positive place invariants in 359 ms returned sat
[2020-05-27 10:32:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 10:32:20] [INFO ] [Nat]Absence check using state equation in 3140 ms returned sat
[2020-05-27 10:32:20] [INFO ] Deduced a trap composed of 18 places in 26 ms
[2020-05-27 10:32:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2020-05-27 10:32:20] [INFO ] Computed and/alt/rep : 1202/4803/1202 causal constraints in 72 ms.
[2020-05-27 10:32:21] [INFO ] Added : 95 causal constraints over 19 iterations in 1186 ms. Result :unknown
[2020-05-27 10:32:22] [INFO ] [Real]Absence check using 451 positive place invariants in 344 ms returned sat
[2020-05-27 10:32:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 10:32:25] [INFO ] [Real]Absence check using state equation in 3149 ms returned sat
[2020-05-27 10:32:25] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 10:32:26] [INFO ] [Nat]Absence check using 451 positive place invariants in 347 ms returned sat
[2020-05-27 10:32:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 10:32:29] [INFO ] [Nat]Absence check using state equation in 2949 ms returned sat
[2020-05-27 10:32:29] [INFO ] Deduced a trap composed of 18 places in 740 ms
[2020-05-27 10:32:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 879 ms
[2020-05-27 10:32:30] [INFO ] Computed and/alt/rep : 1202/4803/1202 causal constraints in 93 ms.
[2020-05-27 10:32:30] [INFO ] Added : 40 causal constraints over 8 iterations in 636 ms. Result :(error "Failed to check-sat")
[2020-05-27 10:32:30] [INFO ] [Real]Absence check using 451 positive place invariants in 222 ms returned sat
[2020-05-27 10:32:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 10:32:34] [INFO ] [Real]Absence check using state equation in 3130 ms returned sat
[2020-05-27 10:32:34] [INFO ] Deduced a trap composed of 15 places in 15 ms
[2020-05-27 10:32:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2020-05-27 10:32:34] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 10:32:34] [INFO ] [Nat]Absence check using 451 positive place invariants in 312 ms returned sat
[2020-05-27 10:32:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 10:32:37] [INFO ] [Nat]Absence check using state equation in 3010 ms returned sat
[2020-05-27 10:32:37] [INFO ] Deduced a trap composed of 15 places in 20 ms
[2020-05-27 10:32:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2020-05-27 10:32:37] [INFO ] Computed and/alt/rep : 1202/4803/1202 causal constraints in 76 ms.
[2020-05-27 10:32:39] [INFO ] Added : 105 causal constraints over 21 iterations in 1425 ms. Result :unknown
[2020-05-27 10:32:39] [INFO ] [Real]Absence check using 451 positive place invariants in 273 ms returned sat
[2020-05-27 10:32:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 10:32:42] [INFO ] [Real]Absence check using state equation in 3092 ms returned sat
[2020-05-27 10:32:42] [INFO ] Deduced a trap composed of 15 places in 54 ms
[2020-05-27 10:32:43] [INFO ] Deduced a trap composed of 24 places in 45 ms
[2020-05-27 10:32:43] [INFO ] Deduced a trap composed of 18 places in 34 ms
[2020-05-27 10:32:43] [INFO ] Deduced a trap composed of 18 places in 63 ms
[2020-05-27 10:32:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 427 ms
[2020-05-27 10:32:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 10:32:43] [INFO ] [Nat]Absence check using 451 positive place invariants in 329 ms returned sat
[2020-05-27 10:32:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 10:32:46] [INFO ] [Nat]Absence check using state equation in 3066 ms returned sat
[2020-05-27 10:32:46] [INFO ] Computed and/alt/rep : 1202/4803/1202 causal constraints in 64 ms.
[2020-05-27 10:32:48] [INFO ] Added : 120 causal constraints over 24 iterations in 1428 ms. Result :unknown
Incomplete Parikh walk after 160000 steps, including 1002 resets, run finished after 1220 ms. (steps per millisecond=131 ) properties seen :[0, 0, 1, 1, 0, 0, 0] could not realise parikh vector
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 158000 steps, including 978 resets, run finished after 1131 ms. (steps per millisecond=139 ) properties seen :[0, 0, 0, 0, 1] could not realise parikh vector
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 113300 steps, including 1019 resets, run finished after 852 ms. (steps per millisecond=132 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 126700 steps, including 992 resets, run finished after 886 ms. (steps per millisecond=143 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 139100 steps, including 1000 resets, run finished after 935 ms. (steps per millisecond=148 ) properties seen :[0, 0, 1, 0] could not realise parikh vector
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 114000 steps, including 1015 resets, run finished after 1071 ms. (steps per millisecond=106 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 29 out of 1253 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1253 transition count 1202
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Partial Free-agglomeration rule applied 335 times.
Drop transitions removed 335 transitions
Iterating global reduction 0 with 335 rules applied. Total rules applied 339 place count 1251 transition count 1201
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 340 place count 1251 transition count 1201
Applied a total of 340 rules in 490 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 1251/1253 places, 1201/1203 transitions.
Incomplete random walk after 1000000 steps, including 209 resets, run finished after 8721 ms. (steps per millisecond=114 ) properties seen :[1, 0, 0]
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 786404 steps, including 8 resets, run timeout after 5001 ms. (steps per millisecond=157 ) properties seen :[1, 0]
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 794713 steps, including 11 resets, run timeout after 5001 ms. (steps per millisecond=158 ) properties seen :[0]
// Phase 1: matrix 1201 rows 1251 cols
[2020-05-27 10:33:13] [INFO ] Computed 451 place invariants in 109 ms
[2020-05-27 10:33:14] [INFO ] [Real]Absence check using 448 positive place invariants in 331 ms returned sat
[2020-05-27 10:33:14] [INFO ] [Real]Absence check using 448 positive and 3 generalized place invariants in 4 ms returned sat
[2020-05-27 10:33:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 10:33:17] [INFO ] [Real]Absence check using state equation in 2882 ms returned sat
[2020-05-27 10:33:17] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 10:33:17] [INFO ] [Nat]Absence check using 448 positive place invariants in 351 ms returned sat
[2020-05-27 10:33:17] [INFO ] [Nat]Absence check using 448 positive and 3 generalized place invariants in 3 ms returned sat
[2020-05-27 10:33:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 10:33:20] [INFO ] [Nat]Absence check using state equation in 3046 ms returned sat
[2020-05-27 10:33:20] [INFO ] State equation strengthened by 5 read => feed constraints.
[2020-05-27 10:33:20] [INFO ] [Nat]Added 5 Read/Feed constraints in 11 ms returned sat
[2020-05-27 10:33:21] [INFO ] Deduced a trap composed of 23 places in 171 ms
[2020-05-27 10:33:21] [INFO ] Deduced a trap composed of 6 places in 150 ms
[2020-05-27 10:33:21] [INFO ] Deduced a trap composed of 5 places in 99 ms
[2020-05-27 10:33:21] [INFO ] Deduced a trap composed of 6 places in 150 ms
[2020-05-27 10:33:21] [INFO ] Deduced a trap composed of 6 places in 89 ms
[2020-05-27 10:33:21] [INFO ] Deduced a trap composed of 23 places in 114 ms
[2020-05-27 10:33:21] [INFO ] Deduced a trap composed of 18 places in 83 ms
[2020-05-27 10:33:22] [INFO ] Deduced a trap composed of 9 places in 56 ms
[2020-05-27 10:33:22] [INFO ] Deduced a trap composed of 17 places in 53 ms
[2020-05-27 10:33:22] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1379 ms
[2020-05-27 10:33:22] [INFO ] Computed and/alt/rep : 1200/7713/1200 causal constraints in 92 ms.
[2020-05-27 10:33:42] [INFO ] Added : 635 causal constraints over 127 iterations in 20111 ms.(timeout) Result :sat
[2020-05-27 10:33:42] [INFO ] Deduced a trap composed of 6 places in 130 ms
[2020-05-27 10:33:42] [INFO ] Deduced a trap composed of 6 places in 152 ms
[2020-05-27 10:33:43] [INFO ] Deduced a trap composed of 5 places in 185 ms
[2020-05-27 10:33:43] [INFO ] Deduced a trap composed of 6 places in 110 ms
[2020-05-27 10:33:43] [INFO ] Deduced a trap composed of 5 places in 129 ms
[2020-05-27 10:33:44] [INFO ] Deduced a trap composed of 5 places in 115 ms
[2020-05-27 10:33:44] [INFO ] Deduced a trap composed of 6 places in 113 ms
[2020-05-27 10:33:44] [INFO ] Deduced a trap composed of 9 places in 148 ms
[2020-05-27 10:33:44] [INFO ] Deduced a trap composed of 6 places in 110 ms
[2020-05-27 10:33:45] [INFO ] Deduced a trap composed of 9 places in 110 ms
[2020-05-27 10:33:45] [INFO ] Deduced a trap composed of 26 places in 109 ms
[2020-05-27 10:33:45] [INFO ] Deduced a trap composed of 18 places in 130 ms
[2020-05-27 10:33:46] [INFO ] Deduced a trap composed of 8 places in 128 ms
[2020-05-27 10:33:46] [INFO ] Deduced a trap composed of 15 places in 90 ms
[2020-05-27 10:33:46] [INFO ] Deduced a trap composed of 15 places in 109 ms
[2020-05-27 10:33:46] [INFO ] Deduced a trap composed of 9 places in 110 ms
[2020-05-27 10:33:46] [INFO ] Deduced a trap composed of 15 places in 70 ms
[2020-05-27 10:33:47] [INFO ] Deduced a trap composed of 15 places in 96 ms
[2020-05-27 10:33:47] [INFO ] Deduced a trap composed of 27 places in 89 ms
[2020-05-27 10:33:47] [INFO ] Deduced a trap composed of 24 places in 92 ms
[2020-05-27 10:33:47] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 5572 ms
Attempting to minimize the solution found.
Minimization took 98 ms.
Incomplete Parikh walk after 209700 steps, including 483 resets, run finished after 1838 ms. (steps per millisecond=114 ) properties seen :[0] could not realise parikh vector
Support contains 12 out of 1251 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1251/1251 places, 1201/1201 transitions.
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 1251 transition count 1201
Applied a total of 9 rules in 58 ms. Remains 1251 /1251 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1251/1251 places, 1201/1201 transitions.
Incomplete random walk after 1000000 steps, including 170 resets, run finished after 8309 ms. (steps per millisecond=120 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 13 resets, run finished after 4704 ms. (steps per millisecond=212 ) properties seen :[0]
Interrupted probabilistic random walk after 2067613 steps, run timeout after 30070 ms. (steps per millisecond=68 ) properties seen :[0]
Probabilistic random walk after 2067613 steps, saw 142180 distinct states, run finished after 30071 ms. (steps per millisecond=68 ) properties seen :[0]
// Phase 1: matrix 1201 rows 1251 cols
[2020-05-27 10:34:33] [INFO ] Computed 451 place invariants in 38 ms
[2020-05-27 10:34:33] [INFO ] [Real]Absence check using 450 positive place invariants in 327 ms returned sat
[2020-05-27 10:34:33] [INFO ] [Real]Absence check using 450 positive and 1 generalized place invariants in 3 ms returned sat
[2020-05-27 10:34:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 10:34:37] [INFO ] [Real]Absence check using state equation in 3290 ms returned sat
[2020-05-27 10:34:37] [INFO ] State equation strengthened by 5 read => feed constraints.
[2020-05-27 10:34:37] [INFO ] [Real]Added 5 Read/Feed constraints in 20 ms returned sat
[2020-05-27 10:34:37] [INFO ] Deduced a trap composed of 5 places in 137 ms
[2020-05-27 10:34:37] [INFO ] Deduced a trap composed of 5 places in 133 ms
[2020-05-27 10:34:37] [INFO ] Deduced a trap composed of 6 places in 81 ms
[2020-05-27 10:34:37] [INFO ] Deduced a trap composed of 9 places in 95 ms
[2020-05-27 10:34:37] [INFO ] Deduced a trap composed of 17 places in 53 ms
[2020-05-27 10:34:37] [INFO ] Deduced a trap composed of 18 places in 42 ms
[2020-05-27 10:34:38] [INFO ] Deduced a trap composed of 18 places in 30 ms
[2020-05-27 10:34:38] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 969 ms
[2020-05-27 10:34:38] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 10:34:38] [INFO ] [Nat]Absence check using 450 positive place invariants in 323 ms returned sat
[2020-05-27 10:34:38] [INFO ] [Nat]Absence check using 450 positive and 1 generalized place invariants in 2 ms returned sat
[2020-05-27 10:34:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 10:34:41] [INFO ] [Nat]Absence check using state equation in 2927 ms returned sat
[2020-05-27 10:34:41] [INFO ] [Nat]Added 5 Read/Feed constraints in 10 ms returned sat
[2020-05-27 10:34:41] [INFO ] Deduced a trap composed of 5 places in 109 ms
[2020-05-27 10:34:41] [INFO ] Deduced a trap composed of 6 places in 111 ms
[2020-05-27 10:34:42] [INFO ] Deduced a trap composed of 9 places in 106 ms
[2020-05-27 10:34:42] [INFO ] Deduced a trap composed of 17 places in 87 ms
[2020-05-27 10:34:42] [INFO ] Deduced a trap composed of 5 places in 42 ms
[2020-05-27 10:34:42] [INFO ] Deduced a trap composed of 18 places in 61 ms
[2020-05-27 10:34:42] [INFO ] Deduced a trap composed of 18 places in 48 ms
[2020-05-27 10:34:42] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1016 ms
[2020-05-27 10:34:42] [INFO ] Computed and/alt/rep : 1200/7796/1200 causal constraints in 96 ms.
[2020-05-27 10:35:02] [INFO ] Added : 780 causal constraints over 156 iterations in 20177 ms.(timeout) Result :sat
[2020-05-27 10:35:02] [INFO ] Deduced a trap composed of 5 places in 157 ms
[2020-05-27 10:35:03] [INFO ] Deduced a trap composed of 12 places in 138 ms
[2020-05-27 10:35:03] [INFO ] Deduced a trap composed of 5 places in 112 ms
[2020-05-27 10:35:03] [INFO ] Deduced a trap composed of 5 places in 95 ms
[2020-05-27 10:35:04] [INFO ] Deduced a trap composed of 5 places in 95 ms
[2020-05-27 10:35:04] [INFO ] Deduced a trap composed of 6 places in 92 ms
[2020-05-27 10:35:04] [INFO ] Deduced a trap composed of 5 places in 120 ms
[2020-05-27 10:35:04] [INFO ] Deduced a trap composed of 5 places in 104 ms
[2020-05-27 10:35:05] [INFO ] Deduced a trap composed of 6 places in 119 ms
[2020-05-27 10:35:05] [INFO ] Deduced a trap composed of 9 places in 119 ms
[2020-05-27 10:35:05] [INFO ] Deduced a trap composed of 17 places in 118 ms
[2020-05-27 10:35:05] [INFO ] Deduced a trap composed of 15 places in 126 ms
[2020-05-27 10:35:06] [INFO ] Deduced a trap composed of 9 places in 107 ms
[2020-05-27 10:35:06] [INFO ] Deduced a trap composed of 23 places in 104 ms
[2020-05-27 10:35:06] [INFO ] Deduced a trap composed of 5 places in 54 ms
[2020-05-27 10:35:06] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 4153 ms
Attempting to minimize the solution found.
Minimization took 152 ms.
Incomplete Parikh walk after 222500 steps, including 337 resets, run finished after 2042 ms. (steps per millisecond=108 ) properties seen :[0] could not realise parikh vector
Support contains 12 out of 1251 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1251/1251 places, 1201/1201 transitions.
Applied a total of 0 rules in 34 ms. Remains 1251 /1251 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1251/1251 places, 1201/1201 transitions.
Starting structural reductions, iteration 0 : 1251/1251 places, 1201/1201 transitions.
Applied a total of 0 rules in 64 ms. Remains 1251 /1251 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
// Phase 1: matrix 1201 rows 1251 cols
[2020-05-27 10:35:09] [INFO ] Computed 451 place invariants in 31 ms
[2020-05-27 10:35:13] [INFO ] Implicit Places using invariants in 3826 ms returned [1237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 3834 ms to find 1 implicit places.
[2020-05-27 10:35:13] [INFO ] Redundant transitions in 306 ms returned []
// Phase 1: matrix 1201 rows 1250 cols
[2020-05-27 10:35:13] [INFO ] Computed 450 place invariants in 11 ms
[2020-05-27 10:35:17] [INFO ] Dead Transitions using invariants and state equation in 3579 ms returned []
Starting structural reductions, iteration 1 : 1250/1251 places, 1201/1201 transitions.
Applied a total of 0 rules in 37 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
[2020-05-27 10:35:17] [INFO ] Redundant transitions in 149 ms returned []
// Phase 1: matrix 1201 rows 1250 cols
[2020-05-27 10:35:17] [INFO ] Computed 450 place invariants in 16 ms
[2020-05-27 10:35:21] [INFO ] Dead Transitions using invariants and state equation in 4007 ms returned []
Finished structural reductions, in 2 iterations. Remains : 1250/1251 places, 1201/1201 transitions.
Incomplete random walk after 1000000 steps, including 179 resets, run finished after 8583 ms. (steps per millisecond=116 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 13 resets, run finished after 4771 ms. (steps per millisecond=209 ) properties seen :[0]
Interrupted probabilistic random walk after 2076529 steps, run timeout after 30001 ms. (steps per millisecond=69 ) properties seen :[0]
Probabilistic random walk after 2076529 steps, saw 191346 distinct states, run finished after 30002 ms. (steps per millisecond=69 ) properties seen :[0]
// Phase 1: matrix 1201 rows 1250 cols
[2020-05-27 10:36:04] [INFO ] Computed 450 place invariants in 31 ms
[2020-05-27 10:36:05] [INFO ] [Real]Absence check using 449 positive place invariants in 380 ms returned sat
[2020-05-27 10:36:05] [INFO ] [Real]Absence check using 449 positive and 1 generalized place invariants in 4 ms returned sat
[2020-05-27 10:36:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 10:36:08] [INFO ] [Real]Absence check using state equation in 3079 ms returned sat
[2020-05-27 10:36:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-05-27 10:36:08] [INFO ] [Real]Added 1 Read/Feed constraints in 22 ms returned sat
[2020-05-27 10:36:08] [INFO ] Deduced a trap composed of 6 places in 160 ms
[2020-05-27 10:36:08] [INFO ] Deduced a trap composed of 12 places in 173 ms
[2020-05-27 10:36:09] [INFO ] Deduced a trap composed of 8 places in 137 ms
[2020-05-27 10:36:09] [INFO ] Deduced a trap composed of 12 places in 123 ms
[2020-05-27 10:36:09] [INFO ] Deduced a trap composed of 6 places in 123 ms
[2020-05-27 10:36:09] [INFO ] Deduced a trap composed of 18 places in 115 ms
[2020-05-27 10:36:09] [INFO ] Deduced a trap composed of 9 places in 123 ms
[2020-05-27 10:36:09] [INFO ] Deduced a trap composed of 9 places in 117 ms
[2020-05-27 10:36:10] [INFO ] Deduced a trap composed of 5 places in 90 ms
[2020-05-27 10:36:10] [INFO ] Deduced a trap composed of 12 places in 115 ms
[2020-05-27 10:36:10] [INFO ] Deduced a trap composed of 18 places in 124 ms
[2020-05-27 10:36:10] [INFO ] Deduced a trap composed of 19 places in 129 ms
[2020-05-27 10:36:10] [INFO ] Deduced a trap composed of 18 places in 123 ms
[2020-05-27 10:36:10] [INFO ] Deduced a trap composed of 18 places in 125 ms
[2020-05-27 10:36:11] [INFO ] Deduced a trap composed of 18 places in 136 ms
[2020-05-27 10:36:11] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2668 ms
[2020-05-27 10:36:11] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 10:36:11] [INFO ] [Nat]Absence check using 449 positive place invariants in 407 ms returned sat
[2020-05-27 10:36:11] [INFO ] [Nat]Absence check using 449 positive and 1 generalized place invariants in 3 ms returned sat
[2020-05-27 10:36:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 10:36:15] [INFO ] [Nat]Absence check using state equation in 3765 ms returned sat
[2020-05-27 10:36:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 15 ms returned sat
[2020-05-27 10:36:15] [INFO ] Deduced a trap composed of 5 places in 226 ms
[2020-05-27 10:36:16] [INFO ] Deduced a trap composed of 12 places in 188 ms
[2020-05-27 10:36:16] [INFO ] Deduced a trap composed of 18 places in 120 ms
[2020-05-27 10:36:16] [INFO ] Deduced a trap composed of 5 places in 116 ms
[2020-05-27 10:36:16] [INFO ] Deduced a trap composed of 12 places in 108 ms
[2020-05-27 10:36:16] [INFO ] Deduced a trap composed of 20 places in 116 ms
[2020-05-27 10:36:16] [INFO ] Deduced a trap composed of 15 places in 176 ms
[2020-05-27 10:36:17] [INFO ] Deduced a trap composed of 18 places in 161 ms
[2020-05-27 10:36:17] [INFO ] Deduced a trap composed of 18 places in 90 ms
[2020-05-27 10:36:17] [INFO ] Deduced a trap composed of 18 places in 152 ms
[2020-05-27 10:36:17] [INFO ] Deduced a trap composed of 9 places in 134 ms
[2020-05-27 10:36:17] [INFO ] Deduced a trap composed of 9 places in 138 ms
[2020-05-27 10:36:17] [INFO ] Deduced a trap composed of 12 places in 111 ms
[2020-05-27 10:36:18] [INFO ] Deduced a trap composed of 5 places in 116 ms
[2020-05-27 10:36:18] [INFO ] Deduced a trap composed of 9 places in 85 ms
[2020-05-27 10:36:18] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2636 ms
[2020-05-27 10:36:18] [INFO ] Computed and/alt/rep : 1200/7792/1200 causal constraints in 59 ms.
[2020-05-27 10:36:38] [INFO ] Added : 705 causal constraints over 141 iterations in 20231 ms.(timeout) Result :sat
[2020-05-27 10:36:38] [INFO ] Deduced a trap composed of 5 places in 57 ms
[2020-05-27 10:36:38] [INFO ] Deduced a trap composed of 5 places in 46 ms
[2020-05-27 10:36:39] [INFO ] Deduced a trap composed of 9 places in 56 ms
[2020-05-27 10:36:39] [INFO ] Deduced a trap composed of 9 places in 42 ms
[2020-05-27 10:36:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 975 ms
Attempting to minimize the solution found.
Minimization took 92 ms.
Incomplete Parikh walk after 225900 steps, including 929 resets, run finished after 1946 ms. (steps per millisecond=116 ) properties seen :[0] could not realise parikh vector
Support contains 12 out of 1250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1250/1250 places, 1201/1201 transitions.
Applied a total of 0 rules in 47 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1250/1250 places, 1201/1201 transitions.
Starting structural reductions, iteration 0 : 1250/1250 places, 1201/1201 transitions.
Applied a total of 0 rules in 23 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
// Phase 1: matrix 1201 rows 1250 cols
[2020-05-27 10:36:41] [INFO ] Computed 450 place invariants in 10 ms
[2020-05-27 10:36:45] [INFO ] Implicit Places using invariants in 4015 ms returned []
// Phase 1: matrix 1201 rows 1250 cols
[2020-05-27 10:36:45] [INFO ] Computed 450 place invariants in 16 ms
[2020-05-27 10:36:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-05-27 10:37:05] [INFO ] Implicit Places using invariants and state equation in 19645 ms returned []
Implicit Place search using SMT with State Equation took 23680 ms to find 0 implicit places.
[2020-05-27 10:37:05] [INFO ] Redundant transitions in 156 ms returned []
// Phase 1: matrix 1201 rows 1250 cols
[2020-05-27 10:37:05] [INFO ] Computed 450 place invariants in 11 ms
[2020-05-27 10:37:08] [INFO ] Dead Transitions using invariants and state equation in 3485 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1250/1250 places, 1201/1201 transitions.
Incomplete random walk after 100000 steps, including 17 resets, run finished after 879 ms. (steps per millisecond=113 ) properties seen :[0]
// Phase 1: matrix 1201 rows 1250 cols
[2020-05-27 10:37:09] [INFO ] Computed 450 place invariants in 13 ms
[2020-05-27 10:37:10] [INFO ] [Real]Absence check using 449 positive place invariants in 241 ms returned sat
[2020-05-27 10:37:10] [INFO ] [Real]Absence check using 449 positive and 1 generalized place invariants in 5 ms returned sat
[2020-05-27 10:37:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 10:37:13] [INFO ] [Real]Absence check using state equation in 3363 ms returned sat
[2020-05-27 10:37:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-05-27 10:37:13] [INFO ] [Real]Added 1 Read/Feed constraints in 20 ms returned sat
[2020-05-27 10:37:13] [INFO ] Deduced a trap composed of 6 places in 177 ms
[2020-05-27 10:37:14] [INFO ] Deduced a trap composed of 12 places in 165 ms
[2020-05-27 10:37:14] [INFO ] Deduced a trap composed of 8 places in 134 ms
[2020-05-27 10:37:14] [INFO ] Deduced a trap composed of 12 places in 146 ms
[2020-05-27 10:37:14] [INFO ] Deduced a trap composed of 6 places in 136 ms
[2020-05-27 10:37:14] [INFO ] Deduced a trap composed of 18 places in 137 ms
[2020-05-27 10:37:15] [INFO ] Deduced a trap composed of 9 places in 136 ms
[2020-05-27 10:37:15] [INFO ] Deduced a trap composed of 9 places in 129 ms
[2020-05-27 10:37:15] [INFO ] Deduced a trap composed of 5 places in 116 ms
[2020-05-27 10:37:15] [INFO ] Deduced a trap composed of 12 places in 90 ms
[2020-05-27 10:37:15] [INFO ] Deduced a trap composed of 18 places in 101 ms
[2020-05-27 10:37:15] [INFO ] Deduced a trap composed of 19 places in 141 ms
[2020-05-27 10:37:16] [INFO ] Deduced a trap composed of 18 places in 149 ms
[2020-05-27 10:37:16] [INFO ] Deduced a trap composed of 18 places in 125 ms
[2020-05-27 10:37:16] [INFO ] Deduced a trap composed of 18 places in 95 ms
[2020-05-27 10:37:16] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2722 ms
[2020-05-27 10:37:16] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 10:37:17] [INFO ] [Nat]Absence check using 449 positive place invariants in 336 ms returned sat
[2020-05-27 10:37:17] [INFO ] [Nat]Absence check using 449 positive and 1 generalized place invariants in 3 ms returned sat
[2020-05-27 10:37:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 10:37:19] [INFO ] [Nat]Absence check using state equation in 2841 ms returned sat
[2020-05-27 10:37:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 14 ms returned sat
[2020-05-27 10:37:20] [INFO ] Deduced a trap composed of 5 places in 227 ms
[2020-05-27 10:37:20] [INFO ] Deduced a trap composed of 12 places in 184 ms
[2020-05-27 10:37:20] [INFO ] Deduced a trap composed of 18 places in 190 ms
[2020-05-27 10:37:20] [INFO ] Deduced a trap composed of 5 places in 198 ms
[2020-05-27 10:37:21] [INFO ] Deduced a trap composed of 12 places in 181 ms
[2020-05-27 10:37:21] [INFO ] Deduced a trap composed of 20 places in 194 ms
[2020-05-27 10:37:21] [INFO ] Deduced a trap composed of 15 places in 155 ms
[2020-05-27 10:37:21] [INFO ] Deduced a trap composed of 18 places in 123 ms
[2020-05-27 10:37:21] [INFO ] Deduced a trap composed of 18 places in 137 ms
[2020-05-27 10:37:22] [INFO ] Deduced a trap composed of 18 places in 128 ms
[2020-05-27 10:37:22] [INFO ] Deduced a trap composed of 9 places in 144 ms
[2020-05-27 10:37:22] [INFO ] Deduced a trap composed of 9 places in 104 ms
[2020-05-27 10:37:22] [INFO ] Deduced a trap composed of 12 places in 105 ms
[2020-05-27 10:37:22] [INFO ] Deduced a trap composed of 5 places in 111 ms
[2020-05-27 10:37:22] [INFO ] Deduced a trap composed of 9 places in 108 ms
[2020-05-27 10:37:22] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2959 ms
[2020-05-27 10:37:22] [INFO ] Computed and/alt/rep : 1200/7792/1200 causal constraints in 107 ms.
[2020-05-27 10:37:36] [INFO ] Added : 520 causal constraints over 104 iterations in 13653 ms. Result :(error "Failed to check-sat")
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1250 transition count 1201
Applied a total of 1 rules in 75 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
// Phase 1: matrix 1201 rows 1250 cols
[2020-05-27 10:37:36] [INFO ] Computed 450 place invariants in 15 ms
[2020-05-27 10:37:37] [INFO ] [Real]Absence check using 449 positive place invariants in 343 ms returned sat
[2020-05-27 10:37:37] [INFO ] [Real]Absence check using 449 positive and 1 generalized place invariants in 2 ms returned sat
[2020-05-27 10:37:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 10:37:40] [INFO ] [Real]Absence check using state equation in 3454 ms returned sat
[2020-05-27 10:37:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-05-27 10:37:40] [INFO ] [Real]Added 1 Read/Feed constraints in 13 ms returned sat
[2020-05-27 10:37:41] [INFO ] Deduced a trap composed of 6 places in 210 ms
[2020-05-27 10:37:41] [INFO ] Deduced a trap composed of 6 places in 206 ms
[2020-05-27 10:37:41] [INFO ] Deduced a trap composed of 12 places in 175 ms
[2020-05-27 10:37:41] [INFO ] Deduced a trap composed of 6 places in 202 ms
[2020-05-27 10:37:42] [INFO ] Deduced a trap composed of 8 places in 176 ms
[2020-05-27 10:37:42] [INFO ] Deduced a trap composed of 18 places in 141 ms
[2020-05-27 10:37:42] [INFO ] Deduced a trap composed of 9 places in 154 ms
[2020-05-27 10:37:42] [INFO ] Deduced a trap composed of 9 places in 156 ms
[2020-05-27 10:37:42] [INFO ] Deduced a trap composed of 12 places in 114 ms
[2020-05-27 10:37:42] [INFO ] Deduced a trap composed of 8 places in 87 ms
[2020-05-27 10:37:43] [INFO ] Deduced a trap composed of 9 places in 84 ms
[2020-05-27 10:37:43] [INFO ] Deduced a trap composed of 12 places in 92 ms
[2020-05-27 10:37:43] [INFO ] Deduced a trap composed of 9 places in 73 ms
[2020-05-27 10:37:43] [INFO ] Deduced a trap composed of 19 places in 61 ms
[2020-05-27 10:37:43] [INFO ] Deduced a trap composed of 18 places in 72 ms
[2020-05-27 10:37:43] [INFO ] Deduced a trap composed of 18 places in 58 ms
[2020-05-27 10:37:43] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2754 ms
[2020-05-27 10:37:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 10:37:44] [INFO ] [Nat]Absence check using 449 positive place invariants in 247 ms returned sat
[2020-05-27 10:37:44] [INFO ] [Nat]Absence check using 449 positive and 1 generalized place invariants in 3 ms returned sat
[2020-05-27 10:37:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 10:37:47] [INFO ] [Nat]Absence check using state equation in 3575 ms returned sat
[2020-05-27 10:37:47] [INFO ] [Nat]Added 1 Read/Feed constraints in 12 ms returned sat
[2020-05-27 10:37:47] [INFO ] Deduced a trap composed of 9 places in 229 ms
[2020-05-27 10:37:48] [INFO ] Deduced a trap composed of 6 places in 163 ms
[2020-05-27 10:37:48] [INFO ] Deduced a trap composed of 6 places in 166 ms
[2020-05-27 10:37:48] [INFO ] Deduced a trap composed of 5 places in 143 ms
[2020-05-27 10:37:48] [INFO ] Deduced a trap composed of 8 places in 133 ms
[2020-05-27 10:37:48] [INFO ] Deduced a trap composed of 8 places in 140 ms
[2020-05-27 10:37:49] [INFO ] Deduced a trap composed of 12 places in 145 ms
[2020-05-27 10:37:49] [INFO ] Deduced a trap composed of 9 places in 139 ms
[2020-05-27 10:37:49] [INFO ] Deduced a trap composed of 18 places in 111 ms
[2020-05-27 10:37:49] [INFO ] Deduced a trap composed of 9 places in 137 ms
[2020-05-27 10:37:49] [INFO ] Deduced a trap composed of 8 places in 86 ms
[2020-05-27 10:37:49] [INFO ] Deduced a trap composed of 9 places in 83 ms
[2020-05-27 10:37:49] [INFO ] Deduced a trap composed of 12 places in 117 ms
[2020-05-27 10:37:50] [INFO ] Deduced a trap composed of 9 places in 104 ms
[2020-05-27 10:37:50] [INFO ] Deduced a trap composed of 12 places in 83 ms
[2020-05-27 10:37:50] [INFO ] Deduced a trap composed of 19 places in 69 ms
[2020-05-27 10:37:50] [INFO ] Deduced a trap composed of 18 places in 75 ms
[2020-05-27 10:37:50] [INFO ] Deduced a trap composed of 12 places in 92 ms
[2020-05-27 10:37:50] [INFO ] Deduced a trap composed of 24 places in 70 ms
[2020-05-27 10:37:50] [INFO ] Deduced a trap composed of 23 places in 60 ms
[2020-05-27 10:37:50] [INFO ] Deduced a trap composed of 18 places in 67 ms
[2020-05-27 10:37:50] [INFO ] Deduced a trap composed of 18 places in 55 ms
[2020-05-27 10:37:51] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 3395 ms
[2020-05-27 10:37:51] [INFO ] Computed and/alt/rep : 1200/7792/1200 causal constraints in 54 ms.
[2020-05-27 10:38:11] [INFO ] Added : 805 causal constraints over 161 iterations in 20150 ms.(timeout) Result :sat
[2020-05-27 10:38:11] [INFO ] Deduced a trap composed of 5 places in 115 ms
[2020-05-27 10:38:11] [INFO ] Deduced a trap composed of 5 places in 155 ms
[2020-05-27 10:38:11] [INFO ] Deduced a trap composed of 5 places in 112 ms
[2020-05-27 10:38:12] [INFO ] Deduced a trap composed of 6 places in 92 ms
[2020-05-27 10:38:12] [INFO ] Deduced a trap composed of 5 places in 92 ms
[2020-05-27 10:38:12] [INFO ] Deduced a trap composed of 6 places in 97 ms
[2020-05-27 10:38:12] [INFO ] Deduced a trap composed of 5 places in 112 ms
[2020-05-27 10:38:13] [INFO ] Deduced a trap composed of 8 places in 90 ms
[2020-05-27 10:38:13] [INFO ] Deduced a trap composed of 5 places in 99 ms
[2020-05-27 10:38:13] [INFO ] Deduced a trap composed of 8 places in 81 ms
[2020-05-27 10:38:13] [INFO ] Deduced a trap composed of 5 places in 54 ms
[2020-05-27 10:38:14] [INFO ] Deduced a trap composed of 5 places in 78 ms
[2020-05-27 10:38:14] [INFO ] Deduced a trap composed of 6 places in 77 ms
[2020-05-27 10:38:14] [INFO ] Deduced a trap composed of 5 places in 58 ms
[2020-05-27 10:38:14] [INFO ] Deduced a trap composed of 9 places in 64 ms
[2020-05-27 10:38:14] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3797 ms
Attempting to minimize the solution found.
Minimization took 103 ms.
[2020-05-27 10:38:15] [INFO ] Flatten gal took : 302 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-27 10:38:16] [INFO ] Applying decomposition
[2020-05-27 10:38:16] [INFO ] Flatten gal took : 370 ms
[2020-05-27 10:38:16] [INFO ] Input system was already deterministic with 1201 transitions.
[2020-05-27 10:38:16] [INFO ] Flatten gal took : 282 ms
[2020-05-27 10:38:16] [INFO ] Input system was already deterministic with 1201 transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 1201 rows 1250 cols
[2020-05-27 10:38:16] [INFO ] Computed 450 place invariants in 11 ms
inv : p0 + p35 + p36 = 1
inv : p0 + p612 + p613 = 1
inv : p0 + p85 + p86 = 1
inv : p0 + p662 + p663 = 1
inv : p0 + p555 + p556 + p557 = 1
inv : p0 + p135 + p136 = 1
inv : p0 + p512 + p513 = 1
inv : p0 + p1130 + p1131 + p1132 = 1
inv : p0 + p99 + p100 + p101 + p102 = 1
inv : p0 + p574 + p575 + p576 + p577 = 1
inv : p0 + p289 + p290 + p291 + p292 = 1
inv : p0 + p762 + p763 = 1
inv : p0 + p220 + p221 + p222 + p223 = 1
inv : p0 + p530 + p533 + p534 = 1
inv : p0 + p812 + p813 = 1
inv : p0 + p695 + p696 + p697 + p698 = 1
inv : p0 + p164 + p165 + p166 + p167 = 1
inv : p0 + p862 + p863 = 1
inv : p0 + p285 + p286 = 1
inv : p0 + p345 + p346 + p347 + p348 = 1
inv : p0 + p380 + p381 + p382 = 1
inv : p0 + p355 + p358 + p359 = 1
inv : p0 + p335 + p336 = 1
inv : p0 + p562 + p563 = 1
inv : p0 + p130 + p133 + p134 = 1
inv : p0 + p820 + p821 + p822 + p823 = 1
inv : p0 + p224 + p225 + p226 + p227 = 1
inv : p0 + p639 + p640 + p641 + p642 = 1
inv : p0 + p385 + p386 = 1
inv : p0 + p962 + p963 = 1
inv : p0 + p924 + p925 + p926 + p927 = 1
inv : p0 + p180 + p183 + p184 = 1
inv : p0 + p1062 + p1063 = 1
inv : p0 + p362 + p363 = 1
inv : p0 + p205 + p206 + p207 = 1
inv : p0 + p414 + p415 + p416 + p417 = 1
inv : p0 + p212 + p213 = 1
inv : p0 + p449 + p450 + p451 + p452 = 1
inv : p0 + p889 + p890 + p891 + p892 = 1
inv : p0 + p462 + p463 = 1
inv : p0 + p235 + p236 = 1
inv : p0 + p112 + p113 = 1
inv : p0 + p699 + p700 + p701 + p702 = 1
inv : p0 + p1212 + p1213 = 1
inv : p0 + p1114 + p1115 + p1116 + p1117 = 1
inv : p0 + p712 + p713 = 1
inv : -p1181 - p1182 + p1183 + p1184 = 0
inv : p0 + p705 + p708 + p709 = 1
inv : p0 + p1230 + p1233 + p1234 = 1
inv : p0 + p485 + p486 = 1
inv : p0 + p730 + p731 + p732 = 1
inv : p0 + p930 + p933 + p934 = 1
inv : p0 + p735 + p736 = 1
inv : p0 + p1174 + p1175 + p1176 + p1177 = 1
inv : p0 + p955 + p956 + p957 = 1
inv : p0 + p118 + p119 = 1
inv : p0 + p64 + p65 + p66 + p67 = 1
inv : p0 + p799 + p800 + p801 + p802 = 1
inv : p0 + p595 + p596 + p597 + p598 = 1
inv : p0 + p330 + p331 + p332 = 1
inv : p0 + p605 + p606 + p607 = 1
inv : p0 + p128 + p129 = 1
inv : p0 + p480 + p483 + p484 = 1
inv : p0 + p218 + p219 = 1
inv : p0 + p1080 + p1081 + p1082 = 1
inv : p0 + p5 + p8 + p9 = 1
inv : p0 + p785 + p786 = 1
inv : p0 + p349 + p350 + p351 + p352 = 1
inv : p0 + p68 + p69 = 1
inv : p0 + p989 + p990 + p991 + p992 = 1
inv : p0 + p514 + p515 + p516 + p517 = 1
inv : p0 + p755 + p758 + p759 = 1
inv : p0 + p445 + p446 + p447 + p448 = 1
inv : p0 + p78 + p79 = 1
inv : p0 + p585 + p586 = 1
inv : p0 + p1162 + p1163 = 1
inv : p0 + p935 + p936 = 1
inv : p0 + p120 + p121 + p122 + p123 = 1
inv : p0 + p635 + p636 = 1
inv : p0 + p1070 + p1071 + p1072 + p1073 = 1
inv : p0 + p12 + p13 = 1
inv : p0 + p580 + p583 + p584 = 1
inv : p0 + p324 + p325 + p326 + p327 = 1
inv : p0 + p1055 + p1058 + p1059 = 1
inv : p0 + p920 + p921 + p922 + p923 = 1
inv : p0 + p268 + p269 = 1
inv : p0 + p1045 + p1046 + p1047 + p1048 = 1
inv : p0 + p470 + p471 + p472 + p473 = 1
inv : p0 + p39 + p40 + p41 + p42 = 1
inv : p0 + p155 + p156 + p157 = 1
inv : p0 + p428 + p429 = 1
inv : p0 + p568 + p569 = 1
inv : p0 + p435 + p436 = 1
inv : p0 + p945 + p946 + p947 + p948 = 1
inv : p0 + p1012 + p1013 = 1
inv : p0 + p312 + p313 = 1
inv : p0 + p1135 + p1136 = 1
inv : p0 + p1193 + p1194 = 1
inv : p0 + p880 + p883 + p884 = 1
inv : p0 + p1203 + p1204 = 1
inv : p0 + p905 + p906 + p907 = 1
inv : p0 + p570 + p571 + p572 + p573 = 1
inv : p0 + p628 + p629 = 1
inv : p0 + p305 + p308 + p309 = 1
inv : p0 + p780 + p781 + p782 = 1
inv : p0 + p95 + p96 + p97 + p98 = 1
inv : p0 + p539 + p540 + p541 + p542 = 1
inv : p0 + p30 + p31 + p32 = 1
inv : p0 + p278 + p279 = 1
inv : p0 + p162 + p163 = 1
inv : p0 + p418 + p419 = 1
inv : p0 + p824 + p825 + p826 + p827 = 1
inv : p0 + p1014 + p1015 + p1016 + p1017 = 1
inv : p0 + p430 + p433 + p434 = 1
inv : p0 + p55 + p58 + p59 = 1
inv : p0 + p280 + p281 + p282 = 1
inv : p0 + p943 + p944 = 1
inv : p0 + p139 + p140 + p141 + p142 = 1
inv : p0 + p670 + p671 + p672 + p673 = 1
inv : p0 + p868 + p869 = 1
inv : p0 + p878 + p879 = 1
inv : p0 + p953 + p954 = 1
inv : p0 + p1245 + p1246 + p1247 + p1248 = 1
inv : p0 + p803 + p804 = 1
inv : p0 + p1018 + p1019 = 1
inv : p0 + p970 + p971 + p972 + p973 = 1
inv : p0 + p768 + p769 = 1
inv : p0 + p1024 + p1025 + p1026 + p1027 = 1
inv : p0 + p1214 + p1215 + p1216 + p1217 = 1
inv : p0 + p1199 + p1200 + p1201 + p1202 = 1
inv : p0 + p1103 + p1104 = 1
inv : p0 + p830 + p831 + p832 = 1
inv : p0 + p605 + p608 + p609 = 1
inv : p0 + p728 + p729 = 1
inv : p0 + p980 + p983 + p984 = 1
inv : p0 + p1205 + p1206 + p1207 = 1
inv : p0 + p845 + p846 + p847 + p848 = 1
inv : p0 + p855 + p856 + p857 = 1
inv : p0 + p899 + p900 + p901 + p902 = 1
inv : p0 + p1028 + p1029 = 1
inv : p0 + p1243 + p1244 = 1
inv : p0 + p1185 + p1186 = 1
inv : p0 + p693 + p694 = 1
inv : p0 + p264 + p265 + p266 + p267 = 1
inv : p0 + p299 + p300 + p301 + p302 = 1
inv : p0 + p74 + p75 + p76 + p77 = 1
inv : p0 + p405 + p408 + p409 = 1
inv : p0 + p1164 + p1165 + p1166 + p1167 = 1
inv : p0 + p643 + p644 = 1
inv : p0 + p189 + p190 + p191 + p192 = 1
inv : p0 + p468 + p469 = 1
inv : p0 + p653 + p654 = 1
inv : p0 + p1178 + p1179 = 1
inv : p0 + p478 + p479 = 1
inv : p0 + p1149 + p1150 + p1151 + p1152 = 1
inv : p0 + p1089 + p1090 + p1091 + p1092 = 1
inv : p0 + p503 + p504 = 1
inv : p0 + p620 + p621 + p622 + p623 = 1
inv : p0 + p1 + p2 = 1
inv : p0 + p30 + p33 + p34 = 1
inv : p0 + p974 + p975 + p976 + p977 = 1
inv : p0 + p618 + p619 = 1
inv : p0 + p805 + p806 + p807 = 1
inv : p0 + p1180 + p1181 + p1182 = 1
inv : p0 + p630 + p633 + p634 = 1
inv : p0 + p505 + p506 + p507 = 1
inv : p0 + p403 + p404 = 1
inv : p0 + p328 + p329 = 1
inv : p0 + p718 + p719 = 1
inv : p0 + p793 + p794 = 1
inv : p0 + p439 + p440 + p441 + p442 = 1
inv : p0 + p880 + p881 + p882 = 1
inv : p0 + p249 + p250 + p251 + p252 = 1
inv : p0 + p1005 + p1008 + p1009 = 1
inv : p0 + p578 + p579 = 1
inv : p0 + p543 + p544 = 1
inv : p0 + p178 + p179 = 1
inv : p0 + p168 + p169 = 1
inv : p0 + p949 + p950 + p951 + p952 = 1
inv : p0 + p214 + p215 + p216 + p217 = 1
inv : p0 + p745 + p746 + p747 + p748 = 1
inv : p0 + p1139 + p1140 + p1141 + p1142 = 1
inv : p0 + p1099 + p1100 + p1101 + p1102 = 1
inv : p0 + p364 + p365 + p366 + p367 = 1
inv : p0 + p253 + p254 = 1
inv : p0 + p103 + p104 = 1
inv : p0 + p174 + p175 + p176 + p177 = 1
inv : p0 + p318 + p319 = 1
inv : p0 + p380 + p383 + p384 = 1
inv : p0 + p105 + p108 + p109 = 1
inv : p0 + p810 + p811 = 1
inv : p0 + p49 + p50 + p51 + p52 = 1
inv : p0 + p62 + p63 = 1
inv : p0 + p1124 + p1125 + p1126 + p1127 = 1
inv : p0 + p389 + p390 + p391 + p392 = 1
inv : p0 + p955 + p958 + p959 = 1
inv : p0 + p239 + p240 + p241 + p242 = 1
inv : p0 + p655 + p658 + p659 = 1
inv : p0 + p18 + p19 = 1
inv : p0 + p1155 + p1156 + p1157 = 1
inv : p0 + p93 + p94 = 1
inv : p0 + p530 + p531 + p532 = 1
inv : p0 + p199 + p200 + p201 + p202 = 1
inv : p0 + p230 + p231 + p232 = 1
inv : p0 + p393 + p394 = 1
inv : p0 + p137 + p138 = 1
inv : p0 + p885 + p886 = 1
inv : p0 + p149 + p150 + p151 + p152 = 1
inv : p0 + p987 + p988 = 1
inv : p0 + p255 + p256 + p257 = 1
inv : p0 + p80 + p83 + p84 = 1
inv : p0 + p720 + p721 + p722 + p723 = 1
inv : p0 + p1074 + p1075 + p1076 + p1077 = 1
inv : p0 + p680 + p683 + p684 = 1
inv : p0 + p339 + p340 + p341 + p342 = 1
inv : p0 + p795 + p796 + p797 + p798 = 1
inv : p0 + p1168 + p1169 = 1
inv : p0 + p260 + p261 = 1
inv : p0 + p1110 + p1111 = 1
inv : p0 + p912 + p913 = 1
inv : p0 + p960 + p961 = 1
inv : p0 + p28 + p29 = 1
inv : p0 + p314 + p315 + p316 + p317 = 1
inv : p0 + p770 + p771 + p772 + p773 = 1
inv : p0 + p1093 + p1094 = 1
inv : p0 + p1049 + p1050 + p1051 + p1052 = 1
inv : p0 + p124 + p125 + p126 + p127 = 1
inv : p0 + p1035 + p1036 = 1
inv : p0 + p243 + p244 = 1
inv : p0 + p185 + p186 = 1
inv : p0 + p837 + p838 = 1
inv : p0 + p520 + p521 + p522 + p523 = 1
inv : p0 + p874 + p875 + p876 + p877 = 1
inv : p0 + p637 + p638 = 1
inv : p0 + p60 + p61 = 1
inv : p0 + p10 + p11 = 1
inv : p0 + p587 + p588 = 1
inv : p0 + p155 + p158 + p159 = 1
inv : p0 + p330 + p333 + p334 = 1
inv : p0 + p180 + p181 + p182 = 1
inv : p0 + p589 + p590 + p591 + p592 = 1
inv : p0 + p905 + p908 + p909 = 1
inv : p0 + p274 + p275 + p276 + p277 = 1
inv : p0 + p930 + p931 + p932 = 1
inv : p0 + p487 + p488 = 1
inv : p0 + p45 + p46 + p47 + p48 = 1
inv : p0 + p110 + p111 = 1
inv : p0 + p464 + p465 + p466 + p467 = 1
inv : p0 + p437 + p438 = 1
inv : p0 + p210 + p211 = 1
inv : p0 + p399 + p400 + p401 + p402 = 1
inv : p0 + p1189 + p1190 + p1191 + p1192 = 1
inv : p0 + p160 + p161 = 1
inv : p0 + p387 + p388 = 1
inv : p0 + p737 + p738 = 1
inv : p0 + p755 + p756 + p757 = 1
inv : p0 + p5 + p6 + p7 = 1
inv : p0 + p505 + p508 + p509 = 1
inv : p0 + p687 + p688 = 1
inv : p0 + p1064 + p1065 + p1066 + p1067 = 1
inv : p0 + p999 + p1000 + p1001 + p1002 = 1
inv : p0 + p714 + p715 + p716 + p717 = 1
inv : p0 + p287 + p288 = 1
inv : p0 + p410 + p411 = 1
inv : p0 + p939 + p940 + p941 + p942 = 1
inv : p0 + p170 + p171 + p172 + p173 = 1
inv : p0 + p580 + p581 + p582 = 1
inv : p0 + p524 + p525 + p526 + p527 = 1
inv : p0 + p355 + p356 + p357 = 1
inv : p0 + p187 + p188 = 1
inv : p0 + p749 + p750 + p751 + p752 = 1
inv : p0 + p887 + p888 = 1
inv : p0 + p395 + p396 + p397 + p398 = 1
inv : p0 + p1037 + p1038 = 1
inv : p0 + p560 + p561 = 1
inv : p0 + p787 + p788 = 1
inv : p0 + p1137 + p1138 = 1
inv : p0 + p555 + p558 + p559 = 1
inv : p0 + p37 + p38 = 1
inv : p0 + p1120 + p1121 + p1122 + p1123 = 1
inv : p0 + p24 + p25 + p26 + p27 = 1
inv : p0 + p1105 + p1106 + p1107 = 1
inv : p0 + p310 + p311 = 1
inv : p0 + p645 + p646 + p647 + p648 = 1
inv : p0 + p1080 + p1083 + p1084 = 1
inv : p0 + p870 + p871 + p872 + p873 = 1
inv : p0 + p537 + p538 = 1
inv : p0 + p153 + p154 = 1
inv : p0 + p855 + p858 + p859 = 1
inv : p0 + p203 + p204 = 1
inv : p0 + p143 + p144 = 1
inv : p0 + p145 + p146 + p147 + p148 = 1
inv : p0 + p710 + p711 = 1
inv : p0 + p895 + p896 + p897 + p898 = 1
inv : p0 + p660 + p661 = 1
inv : p0 + p55 + p56 + p57 = 1
inv : p0 + p1030 + p1033 + p1034 = 1
inv : p0 + p1240 + p1241 + p1242 = 1
inv : p0 + p193 + p194 = 1
inv : p0 + p3 + p4 = 1
inv : p0 + p353 + p354 = 1
inv : p0 + p964 + p965 + p966 + p967 = 1
inv : p0 + p87 + p88 = 1
inv : p0 + p343 + p344 = 1
inv : p0 + p53 + p54 = 1
inv : p0 + p1010 + p1011 = 1
inv : p0 + p1224 + p1225 + p1226 + p1227 = 1
inv : p0 + p280 + p283 + p284 = 1
inv : p0 + p774 + p775 + p776 + p777 = 1
inv : p0 + p489 + p490 + p491 + p492 = 1
inv : p0 + p305 + p306 + p307 = 1
inv : p0 + p20 + p21 + p22 + p23 = 1
inv : p0 + p374 + p375 + p376 + p377 = 1
inv : p0 + p553 + p554 = 1
inv : p0 + p1055 + p1056 + p1057 = 1
inv : p0 + p1205 + p1208 + p1209 = 1
inv : p0 + p937 + p938 = 1
inv : p0 + p564 + p565 + p566 + p567 = 1
inv : p0 + p1210 + p1211 = 1
inv : p0 + p360 + p361 = 1
inv : p0 + p730 + p733 + p734 = 1
inv : p0 + p237 + p238 = 1
inv : p0 + p510 + p511 = 1
inv : p0 + p849 + p850 + p851 + p852 = 1
inv : p0 + p114 + p115 + p116 + p117 = 1
inv : p0 + p493 + p494 = 1
inv : p0 + p495 + p496 + p497 + p498 = 1
inv : p0 + p455 + p458 + p459 = 1
inv : p0 + p1020 + p1021 + p1022 + p1023 = 1
inv : p0 + p630 + p631 + p632 = 1
inv : p0 + p1039 + p1040 + p1041 + p1042 = 1
inv : p0 + p480 + p481 + p482 = 1
inv : p0 + p545 + p546 + p547 + p548 = 1
inv : p0 + p860 + p861 = 1
inv : p0 + p1087 + p1088 = 1
inv : p0 + p70 + p71 + p72 + p73 = 1
inv : p0 + p843 + p844 = 1
inv : p0 + p995 + p996 + p997 + p998 = 1
inv : p0 + p703 + p704 = 1
inv : p0 + p1128 + p1129 = 1
inv : p0 + p89 + p90 + p91 + p92 = 1
inv : p0 + p918 + p919 = 1
inv : p0 + p655 + p656 + p657 = 1
inv : p0 + p805 + p808 + p809 = 1
inv : p0 + p903 + p904 = 1
inv : p0 + p370 + p371 + p372 + p373 = 1
inv : p0 + p724 + p725 + p726 + p727 = 1
inv : p0 + p914 + p915 + p916 + p917 = 1
inv : p0 + p1145 + p1146 + p1147 + p1148 = 1
inv : p0 + p778 + p779 = 1
inv : p0 + p1053 + p1054 = 1
inv : p0 + p1043 + p1044 = 1
inv : p0 + p893 + p894 = 1
inv : p0 + p928 + p929 = 1
inv : p0 + p743 + p744 = 1
inv : p0 + p549 + p550 + p551 + p552 = 1
inv : p0 + p455 + p456 + p457 = 1
inv : p0 + p1118 + p1119 = 1
inv : p0 + p80 + p81 + p82 = 1
inv : p0 + p739 + p740 + p741 + p742 = 1
inv : p0 + p1230 + p1231 + p1232 = 1
inv : p0 + p1068 + p1069 = 1
inv : p0 + p678 + p679 = 1
inv : p0 + p818 + p819 = 1
inv : p0 + p993 + p994 = 1
inv : p0 + p1153 + p1154 = 1
inv : p0 + p978 + p979 = 1
inv : p0 + p614 + p615 + p616 + p617 = 1
inv : p0 + p245 + p246 + p247 + p248 = 1
inv : p0 + p853 + p854 = 1
inv : p0 + p424 + p425 + p426 + p427 = 1
inv : p0 + p780 + p783 + p784 = 1
inv : p0 + p1095 + p1096 + p1097 + p1098 = 1
inv : p0 + p1160 + p1161 = 1
inv : p0 + p1155 + p1158 + p1159 = 1
inv : p0 + p1218 + p1219 = 1
inv : p0 + p1060 + p1061 = 1
inv : p0 + p674 + p675 + p676 + p677 = 1
inv : p0 + p1235 + p1236 = 1
inv : p0 + p443 + p444 = 1
inv : p0 + p14 + p15 + p16 + p17 = 1
inv : p0 + p1085 + p1086 = 1
inv : p0 + p864 + p865 + p866 + p867 = 1
inv : p0 + p195 + p196 + p197 + p198 = 1
inv : p0 + p255 + p258 + p259 = 1
inv : p0 + p1078 + p1079 = 1
inv : p0 + p474 + p475 + p476 + p477 = 1
inv : p0 + p910 + p911 = 1
inv : p0 + p985 + p986 = 1
inv : p0 + p293 + p294 = 1
inv : p0 + p753 + p754 = 1
inv : p0 + p430 + p431 + p432 = 1
inv : p0 + p368 + p369 = 1
inv : p0 + p1143 + p1144 = 1
inv : p0 + p1003 + p1004 = 1
inv : p0 + p828 + p829 = 1
inv : p0 + p420 + p421 + p422 + p423 = 1
inv : p0 + p664 + p665 + p666 + p667 = 1
inv : p0 + p1030 + p1031 + p1032 = 1
inv : p0 + p968 + p969 = 1
inv : p0 + p760 + p761 = 1
inv : p0 + p980 + p981 + p982 = 1
inv : p0 + p295 + p296 + p297 + p298 = 1
inv : p0 + p499 + p500 + p501 + p502 = 1
inv : p0 + p1130 + p1133 + p1134 = 1
inv : p0 + p685 + p686 = 1
inv : p0 + p689 + p690 + p691 + p692 = 1
inv : p0 + p835 + p836 = 1
inv : p0 + p43 + p44 = 1
inv : p0 + p1195 + p1196 + p1197 + p1198 = 1
inv : p0 + p814 + p815 + p816 + p817 = 1
inv : p0 + p130 + p131 + p132 = 1
inv : p0 + p228 + p229 = 1
inv : p0 + p705 + p706 + p707 = 1
inv : p0 + p1187 + p1188 = 1
inv : p0 + p270 + p271 + p272 + p273 = 1
inv : p0 + p378 + p379 = 1
inv : p0 + p839 + p840 + p841 + p842 = 1
inv : p0 + p303 + p304 = 1
inv : p0 + p1249 + p1250 + p1251 + p1252 = 1
inv : p0 + p649 + p650 + p651 + p652 = 1
inv : p0 + p1112 + p1113 = 1
inv : p0 + p460 + p461 = 1
inv : p0 + p205 + p208 + p209 = 1
inv : p0 + p1170 + p1171 + p1172 + p1173 = 1
inv : p0 + p262 + p263 = 1
inv : p0 + p528 + p529 = 1
inv : p0 + p1005 + p1006 + p1007 = 1
inv : p0 + p789 + p790 + p791 + p792 = 1
inv : p0 + p830 + p833 + p834 = 1
inv : p0 + p593 + p594 = 1
inv : p0 + p603 + p604 = 1
inv : p0 + p680 + p681 + p682 = 1
inv : p0 + p518 + p519 = 1
inv : p0 + p337 + p338 = 1
inv : p0 + p320 + p321 + p322 + p323 = 1
inv : p0 + p405 + p406 + p407 = 1
inv : p0 + p1228 + p1229 = 1
inv : p0 + p1105 + p1108 + p1109 = 1
inv : p0 + p624 + p625 + p626 + p627 = 1
inv : p0 + p535 + p536 = 1
inv : p0 + p230 + p233 + p234 = 1
inv : p0 + p764 + p765 + p766 + p767 = 1
inv : p0 + p105 + p106 + p107 = 1
inv : p0 + p453 + p454 = 1
inv : p0 + p599 + p600 + p601 + p602 = 1
inv : p0 + p668 + p669 = 1
inv : p0 + p412 + p413 = 1
inv : p0 + p610 + p611 = 1
inv : p0 + p1220 + p1221 + p1222 + p1223 = 1
Total of 450 invariants.
[2020-05-27 10:38:16] [INFO ] Computed 450 place invariants in 45 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph17680155982173602261.txt, -o, /tmp/graph17680155982173602261.bin, -w, /tmp/graph17680155982173602261.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph17680155982173602261.bin, -l, -1, -v, -w, /tmp/graph17680155982173602261.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 10:38:16] [INFO ] Decomposing Gal with order
[2020-05-27 10:38:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 10:38:17] [INFO ] Ran tautology test, simplified 0 / 1 in 1125 ms.
[2020-05-27 10:38:17] [INFO ] Removed a total of 960 redundant transitions.
[2020-05-27 10:38:17] [INFO ] BMC solution for property ShieldIIPs-PT-050A-ReachabilityFireability-12(UNSAT) depth K=0 took 68 ms
[2020-05-27 10:38:17] [INFO ] BMC solution for property ShieldIIPs-PT-050A-ReachabilityFireability-12(UNSAT) depth K=1 took 35 ms
[2020-05-27 10:38:17] [INFO ] Flatten gal took : 507 ms
[2020-05-27 10:38:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 1231 labels/synchronizations in 242 ms.
[2020-05-27 10:38:18] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityFireability.pnml.gal : 53 ms
[2020-05-27 10:38:18] [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
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 1201 rows 1250 cols
[2020-05-27 10:38:18] [INFO ] Computed 450 place invariants in 11 ms
inv : p0 + p35 + p36 = 1
inv : p0 + p612 + p613 = 1
inv : p0 + p85 + p86 = 1
inv : p0 + p662 + p663 = 1
inv : p0 + p555 + p556 + p557 = 1
inv : p0 + p135 + p136 = 1
inv : p0 + p512 + p513 = 1
inv : p0 + p1130 + p1131 + p1132 = 1
inv : p0 + p99 + p100 + p101 + p102 = 1
inv : p0 + p574 + p575 + p576 + p577 = 1
inv : p0 + p289 + p290 + p291 + p292 = 1
inv : p0 + p762 + p763 = 1
inv : p0 + p220 + p221 + p222 + p223 = 1
inv : p0 + p530 + p533 + p534 = 1
inv : p0 + p812 + p813 = 1
inv : p0 + p695 + p696 + p697 + p698 = 1
inv : p0 + p164 + p165 + p166 + p167 = 1
inv : p0 + p862 + p863 = 1
inv : p0 + p285 + p286 = 1
inv : p0 + p345 + p346 + p347 + p348 = 1
inv : p0 + p380 + p381 + p382 = 1
inv : p0 + p355 + p358 + p359 = 1
inv : p0 + p335 + p336 = 1
inv : p0 + p562 + p563 = 1
inv : p0 + p130 + p133 + p134 = 1
inv : p0 + p820 + p821 + p822 + p823 = 1
inv : p0 + p224 + p225 + p226 + p227 = 1
inv : p0 + p639 + p640 + p641 + p642 = 1
inv : p0 + p385 + p386 = 1
inv : p0 + p962 + p963 = 1
inv : p0 + p924 + p925 + p926 + p927 = 1
inv : p0 + p180 + p183 + p184 = 1
inv : p0 + p1062 + p1063 = 1
inv : p0 + p362 + p363 = 1
inv : p0 + p205 + p206 + p207 = 1
inv : p0 + p414 + p415 + p416 + p417 = 1
inv : p0 + p212 + p213 = 1
inv : p0 + p449 + p450 + p451 + p452 = 1
inv : p0 + p889 + p890 + p891 + p892 = 1
inv : p0 + p462 + p463 = 1
inv : p0 + p235 + p236 = 1
inv : p0 + p112 + p113 = 1
inv : p0 + p699 + p700 + p701 + p702 = 1
inv : p0 + p1212 + p1213 = 1
inv : p0 + p1114 + p1115 + p1116 + p1117 = 1
inv : p0 + p712 + p713 = 1
inv : -p1181 - p1182 + p1183 + p1184 = 0
inv : p0 + p705 + p708 + p709 = 1
inv : p0 + p1230 + p1233 + p1234 = 1
inv : p0 + p485 + p486 = 1
inv : p0 + p730 + p731 + p732 = 1
inv : p0 + p930 + p933 + p934 = 1
inv : p0 + p735 + p736 = 1
inv : p0 + p1174 + p1175 + p1176 + p1177 = 1
inv : p0 + p955 + p956 + p957 = 1
inv : p0 + p118 + p119 = 1
inv : p0 + p64 + p65 + p66 + p67 = 1
inv : p0 + p799 + p800 + p801 + p802 = 1
inv : p0 + p595 + p596 + p597 + p598 = 1
inv : p0 + p330 + p331 + p332 = 1
inv : p0 + p605 + p606 + p607 = 1
inv : p0 + p128 + p129 = 1
inv : p0 + p480 + p483 + p484 = 1
inv : p0 + p218 + p219 = 1
inv : p0 + p1080 + p1081 + p1082 = 1
inv : p0 + p5 + p8 + p9 = 1
inv : p0 + p785 + p786 = 1
inv : p0 + p349 + p350 + p351 + p352 = 1
inv : p0 + p68 + p69 = 1
inv : p0 + p989 + p990 + p991 + p992 = 1
inv : p0 + p514 + p515 + p516 + p517 = 1
inv : p0 + p755 + p758 + p759 = 1
inv : p0 + p445 + p446 + p447 + p448 = 1
inv : p0 + p78 + p79 = 1
inv : p0 + p585 + p586 = 1
inv : p0 + p1162 + p1163 = 1
inv : p0 + p935 + p936 = 1
inv : p0 + p120 + p121 + p122 + p123 = 1
inv : p0 + p635 + p636 = 1
inv : p0 + p1070 + p1071 + p1072 + p1073 = 1
inv : p0 + p12 + p13 = 1
inv : p0 + p580 + p583 + p584 = 1
inv : p0 + p324 + p325 + p326 + p327 = 1
inv : p0 + p1055 + p1058 + p1059 = 1
inv : p0 + p920 + p921 + p922 + p923 = 1
inv : p0 + p268 + p269 = 1
inv : p0 + p1045 + p1046 + p1047 + p1048 = 1
inv : p0 + p470 + p471 + p472 + p473 = 1
inv : p0 + p39 + p40 + p41 + p42 = 1
inv : p0 + p155 + p156 + p157 = 1
inv : p0 + p428 + p429 = 1
inv : p0 + p568 + p569 = 1
inv : p0 + p435 + p436 = 1
inv : p0 + p945 + p946 + p947 + p948 = 1
inv : p0 + p1012 + p1013 = 1
inv : p0 + p312 + p313 = 1
inv : p0 + p1135 + p1136 = 1
inv : p0 + p1193 + p1194 = 1
inv : p0 + p880 + p883 + p884 = 1
inv : p0 + p1203 + p1204 = 1
inv : p0 + p905 + p906 + p907 = 1
inv : p0 + p570 + p571 + p572 + p573 = 1
inv : p0 + p628 + p629 = 1
inv : p0 + p305 + p308 + p309 = 1
inv : p0 + p780 + p781 + p782 = 1
inv : p0 + p95 + p96 + p97 + p98 = 1
inv : p0 + p539 + p540 + p541 + p542 = 1
inv : p0 + p30 + p31 + p32 = 1
inv : p0 + p278 + p279 = 1
inv : p0 + p162 + p163 = 1
inv : p0 + p418 + p419 = 1
inv : p0 + p824 + p825 + p826 + p827 = 1
inv : p0 + p1014 + p1015 + p1016 + p1017 = 1
inv : p0 + p430 + p433 + p434 = 1
inv : p0 + p55 + p58 + p59 = 1
inv : p0 + p280 + p281 + p282 = 1
inv : p0 + p943 + p944 = 1
inv : p0 + p139 + p140 + p141 + p142 = 1
inv : p0 + p670 + p671 + p672 + p673 = 1
inv : p0 + p868 + p869 = 1
inv : p0 + p878 + p879 = 1
inv : p0 + p953 + p954 = 1
inv : p0 + p1245 + p1246 + p1247 + p1248 = 1
inv : p0 + p803 + p804 = 1
inv : p0 + p1018 + p1019 = 1
inv : p0 + p970 + p971 + p972 + p973 = 1
inv : p0 + p768 + p769 = 1
inv : p0 + p1024 + p1025 + p1026 + p1027 = 1
inv : p0 + p1214 + p1215 + p1216 + p1217 = 1
inv : p0 + p1199 + p1200 + p1201 + p1202 = 1
inv : p0 + p1103 + p1104 = 1
inv : p0 + p830 + p831 + p832 = 1
inv : p0 + p605 + p608 + p609 = 1
inv : p0 + p728 + p729 = 1
inv : p0 + p980 + p983 + p984 = 1
inv : p0 + p1205 + p1206 + p1207 = 1
inv : p0 + p845 + p846 + p847 + p848 = 1
inv : p0 + p855 + p856 + p857 = 1
inv : p0 + p899 + p900 + p901 + p902 = 1
inv : p0 + p1028 + p1029 = 1
inv : p0 + p1243 + p1244 = 1
inv : p0 + p1185 + p1186 = 1
inv : p0 + p693 + p694 = 1
inv : p0 + p264 + p265 + p266 + p267 = 1
inv : p0 + p299 + p300 + p301 + p302 = 1
inv : p0 + p74 + p75 + p76 + p77 = 1
inv : p0 + p405 + p408 + p409 = 1
inv : p0 + p1164 + p1165 + p1166 + p1167 = 1
inv : p0 + p643 + p644 = 1
inv : p0 + p189 + p190 + p191 + p192 = 1
inv : p0 + p468 + p469 = 1
inv : p0 + p653 + p654 = 1
inv : p0 + p1178 + p1179 = 1
inv : p0 + p478 + p479 = 1
inv : p0 + p1149 + p1150 + p1151 + p1152 = 1
inv : p0 + p1089 + p1090 + p1091 + p1092 = 1
inv : p0 + p503 + p504 = 1
inv : p0 + p620 + p621 + p622 + p623 = 1
inv : p0 + p1 + p2 = 1
inv : p0 + p30 + p33 + p34 = 1
inv : p0 + p974 + p975 + p976 + p977 = 1
inv : p0 + p618 + p619 = 1
inv : p0 + p805 + p806 + p807 = 1
inv : p0 + p1180 + p1181 + p1182 = 1
inv : p0 + p630 + p633 + p634 = 1
inv : p0 + p505 + p506 + p507 = 1
inv : p0 + p403 + p404 = 1
inv : p0 + p328 + p329 = 1
inv : p0 + p718 + p719 = 1
inv : p0 + p793 + p794 = 1
inv : p0 + p439 + p440 + p441 + p442 = 1
inv : p0 + p880 + p881 + p882 = 1
inv : p0 + p249 + p250 + p251 + p252 = 1
inv : p0 + p1005 + p1008 + p1009 = 1
inv : p0 + p578 + p579 = 1
inv : p0 + p543 + p544 = 1
inv : p0 + p178 + p179 = 1
inv : p0 + p168 + p169 = 1
inv : p0 + p949 + p950 + p951 + p952 = 1
inv : p0 + p214 + p215 + p216 + p217 = 1
inv : p0 + p745 + p746 + p747 + p748 = 1
inv : p0 + p1139 + p1140 + p1141 + p1142 = 1
inv : p0 + p1099 + p1100 + p1101 + p1102 = 1
inv : p0 + p364 + p365 + p366 + p367 = 1
inv : p0 + p253 + p254 = 1
inv : p0 + p103 + p104 = 1
inv : p0 + p174 + p175 + p176 + p177 = 1
inv : p0 + p318 + p319 = 1
inv : p0 + p380 + p383 + p384 = 1
inv : p0 + p105 + p108 + p109 = 1
inv : p0 + p810 + p811 = 1
inv : p0 + p49 + p50 + p51 + p52 = 1
inv : p0 + p62 + p63 = 1
inv : p0 + p1124 + p1125 + p1126 + p1127 = 1
inv : p0 + p389 + p390 + p391 + p392 = 1
inv : p0 + p955 + p958 + p959 = 1
inv : p0 + p239 + p240 + p241 + p242 = 1
inv : p0 + p655 + p658 + p659 = 1
inv : p0 + p18 + p19 = 1
inv : p0 + p1155 + p1156 + p1157 = 1
inv : p0 + p93 + p94 = 1
inv : p0 + p530 + p531 + p532 = 1
inv : p0 + p199 + p200 + p201 + p202 = 1
inv : p0 + p230 + p231 + p232 = 1
inv : p0 + p393 + p394 = 1
inv : p0 + p137 + p138 = 1
inv : p0 + p885 + p886 = 1
inv : p0 + p149 + p150 + p151 + p152 = 1
inv : p0 + p987 + p988 = 1
inv : p0 + p255 + p256 + p257 = 1
inv : p0 + p80 + p83 + p84 = 1
inv : p0 + p720 + p721 + p722 + p723 = 1
inv : p0 + p1074 + p1075 + p1076 + p1077 = 1
inv : p0 + p680 + p683 + p684 = 1
inv : p0 + p339 + p340 + p341 + p342 = 1
inv : p0 + p795 + p796 + p797 + p798 = 1
inv : p0 + p1168 + p1169 = 1
inv : p0 + p260 + p261 = 1
inv : p0 + p1110 + p1111 = 1
inv : p0 + p912 + p913 = 1
inv : p0 + p960 + p961 = 1
inv : p0 + p28 + p29 = 1
inv : p0 + p314 + p315 + p316 + p317 = 1
inv : p0 + p770 + p771 + p772 + p773 = 1
inv : p0 + p1093 + p1094 = 1
inv : p0 + p1049 + p1050 + p1051 + p1052 = 1
inv : p0 + p124 + p125 + p126 + p127 = 1
inv : p0 + p1035 + p1036 = 1
inv : p0 + p243 + p244 = 1
inv : p0 + p185 + p186 = 1
inv : p0 + p837 + p838 = 1
inv : p0 + p520 + p521 + p522 + p523 = 1
inv : p0 + p874 + p875 + p876 + p877 = 1
inv : p0 + p637 + p638 = 1
inv : p0 + p60 + p61 = 1
inv : p0 + p10 + p11 = 1
inv : p0 + p587 + p588 = 1
inv : p0 + p155 + p158 + p159 = 1
inv : p0 + p330 + p333 + p334 = 1
inv : p0 + p180 + p181 + p182 = 1
inv : p0 + p589 + p590 + p591 + p592 = 1
inv : p0 + p905 + p908 + p909 = 1
inv : p0 + p274 + p275 + p276 + p277 = 1
inv : p0 + p930 + p931 + p932 = 1
inv : p0 + p487 + p488 = 1
inv : p0 + p45 + p46 + p47 + p48 = 1
inv : p0 + p110 + p111 = 1
inv : p0 + p464 + p465 + p466 + p467 = 1
inv : p0 + p437 + p438 = 1
inv : p0 + p210 + p211 = 1
inv : p0 + p399 + p400 + p401 + p402 = 1
inv : p0 + p1189 + p1190 + p1191 + p1192 = 1
inv : p0 + p160 + p161 = 1
inv : p0 + p387 + p388 = 1
inv : p0 + p737 + p738 = 1
inv : p0 + p755 + p756 + p757 = 1
inv : p0 + p5 + p6 + p7 = 1
inv : p0 + p505 + p508 + p509 = 1
inv : p0 + p687 + p688 = 1
inv : p0 + p1064 + p1065 + p1066 + p1067 = 1
inv : p0 + p999 + p1000 + p1001 + p1002 = 1
inv : p0 + p714 + p715 + p716 + p717 = 1
inv : p0 + p287 + p288 = 1
inv : p0 + p410 + p411 = 1
inv : p0 + p939 + p940 + p941 + p942 = 1
inv : p0 + p170 + p171 + p172 + p173 = 1
inv : p0 + p580 + p581 + p582 = 1
inv : p0 + p524 + p525 + p526 + p527 = 1
inv : p0 + p355 + p356 + p357 = 1
inv : p0 + p187 + p188 = 1
inv : p0 + p749 + p750 + p751 + p752 = 1
inv : p0 + p887 + p888 = 1
inv : p0 + p395 + p396 + p397 + p398 = 1
inv : p0 + p1037 + p1038 = 1
inv : p0 + p560 + p561 = 1
inv : p0 + p787 + p788 = 1
inv : p0 + p1137 + p1138 = 1
inv : p0 + p555 + p558 + p559 = 1
inv : p0 + p37 + p38 = 1
inv : p0 + p1120 + p1121 + p1122 + p1123 = 1
inv : p0 + p24 + p25 + p26 + p27 = 1
inv : p0 + p1105 + p1106 + p1107 = 1
inv : p0 + p310 + p311 = 1
inv : p0 + p645 + p646 + p647 + p648 = 1
inv : p0 + p1080 + p1083 + p1084 = 1
inv : p0 + p870 + p871 + p872 + p873 = 1
inv : p0 + p537 + p538 = 1
inv : p0 + p153 + p154 = 1
inv : p0 + p855 + p858 + p859 = 1
inv : p0 + p203 + p204 = 1
inv : p0 + p143 + p144 = 1
inv : p0 + p145 + p146 + p147 + p148 = 1
inv : p0 + p710 + p711 = 1
inv : p0 + p895 + p896 + p897 + p898 = 1
inv : p0 + p660 + p661 = 1
inv : p0 + p55 + p56 + p57 = 1
inv : p0 + p1030 + p1033 + p1034 = 1
inv : p0 + p1240 + p1241 + p1242 = 1
inv : p0 + p193 + p194 = 1
inv : p0 + p3 + p4 = 1
inv : p0 + p353 + p354 = 1
inv : p0 + p964 + p965 + p966 + p967 = 1
inv : p0 + p87 + p88 = 1
inv : p0 + p343 + p344 = 1
inv : p0 + p53 + p54 = 1
inv : p0 + p1010 + p1011 = 1
inv : p0 + p1224 + p1225 + p1226 + p1227 = 1
inv : p0 + p280 + p283 + p284 = 1
inv : p0 + p774 + p775 + p776 + p777 = 1
inv : p0 + p489 + p490 + p491 + p492 = 1
inv : p0 + p305 + p306 + p307 = 1
inv : p0 + p20 + p21 + p22 + p23 = 1
inv : p0 + p374 + p375 + p376 + p377 = 1
inv : p0 + p553 + p554 = 1
inv : p0 + p1055 + p1056 + p1057 = 1
inv : p0 + p1205 + p1208 + p1209 = 1
inv : p0 + p937 + p938 = 1
inv : p0 + p564 + p565 + p566 + p567 = 1
inv : p0 + p1210 + p1211 = 1
inv : p0 + p360 + p361 = 1
inv : p0 + p730 + p733 + p734 = 1
inv : p0 + p237 + p238 = 1
inv : p0 + p510 + p511 = 1
inv : p0 + p849 + p850 + p851 + p852 = 1
inv : p0 + p114 + p115 + p116 + p117 = 1
inv : p0 + p493 + p494 = 1
inv : p0 + p495 + p496 + p497 + p498 = 1
inv : p0 + p455 + p458 + p459 = 1
inv : p0 + p1020 + p1021 + p1022 + p1023 = 1
inv : p0 + p630 + p631 + p632 = 1
inv : p0 + p1039 + p1040 + p1041 + p1042 = 1
inv : p0 + p480 + p481 + p482 = 1
inv : p0 + p545 + p546 + p547 + p548 = 1
inv : p0 + p860 + p861 = 1
inv : p0 + p1087 + p1088 = 1
inv : p0 + p70 + p71 + p72 + p73 = 1
inv : p0 + p843 + p844 = 1
inv : p0 + p995 + p996 + p997 + p998 = 1
inv : p0 + p703 + p704 = 1
inv : p0 + p1128 + p1129 = 1
inv : p0 + p89 + p90 + p91 + p92 = 1
inv : p0 + p918 + p919 = 1
inv : p0 + p655 + p656 + p657 = 1
inv : p0 + p805 + p808 + p809 = 1
inv : p0 + p903 + p904 = 1
inv : p0 + p370 + p371 + p372 + p373 = 1
inv : p0 + p724 + p725 + p726 + p727 = 1
inv : p0 + p914 + p915 + p916 + p917 = 1
inv : p0 + p1145 + p1146 + p1147 + p1148 = 1
inv : p0 + p778 + p779 = 1
inv : p0 + p1053 + p1054 = 1
inv : p0 + p1043 + p1044 = 1
inv : p0 + p893 + p894 = 1
inv : p0 + p928 + p929 = 1
inv : p0 + p743 + p744 = 1
inv : p0 + p549 + p550 + p551 + p552 = 1
inv : p0 + p455 + p456 + p457 = 1
inv : p0 + p1118 + p1119 = 1
inv : p0 + p80 + p81 + p82 = 1
inv : p0 + p739 + p740 + p741 + p742 = 1
inv : p0 + p1230 + p1231 + p1232 = 1
inv : p0 + p1068 + p1069 = 1
inv : p0 + p678 + p679 = 1
inv : p0 + p818 + p819 = 1
inv : p0 + p993 + p994 = 1
inv : p0 + p1153 + p1154 = 1
inv : p0 + p978 + p979 = 1
inv : p0 + p614 + p615 + p616 + p617 = 1
inv : p0 + p245 + p246 + p247 + p248 = 1
inv : p0 + p853 + p854 = 1
inv : p0 + p424 + p425 + p426 + p427 = 1
inv : p0 + p780 + p783 + p784 = 1
inv : p0 + p1095 + p1096 + p1097 + p1098 = 1
inv : p0 + p1160 + p1161 = 1
inv : p0 + p1155 + p1158 + p1159 = 1
inv : p0 + p1218 + p1219 = 1
inv : p0 + p1060 + p1061 = 1
inv : p0 + p674 + p675 + p676 + p677 = 1
inv : p0 + p1235 + p1236 = 1
inv : p0 + p443 + p444 = 1
inv : p0 + p14 + p15 + p16 + p17 = 1
inv : p0 + p1085 + p1086 = 1
inv : p0 + p864 + p865 + p866 + p867 = 1
inv : p0 + p195 + p196 + p197 + p198 = 1
inv : p0 + p255 + p258 + p259 = 1
inv : p0 + p1078 + p1079 = 1
inv : p0 + p474 + p475 + p476 + p477 = 1
inv : p0 + p910 + p911 = 1
inv : p0 + p985 + p986 = 1
inv : p0 + p293 + p294 = 1
inv : p0 + p753 + p754 = 1
inv : p0 + p430 + p431 + p432 = 1
inv : p0 + p368 + p369 = 1
inv : p0 + p1143 + p1144 = 1
inv : p0 + p1003 + p1004 = 1
inv : p0 + p828 + p829 = 1
inv : p0 + p420 + p421 + p422 + p423 = 1
inv : p0 + p664 + p665 + p666 + p667 = 1
inv : p0 + p1030 + p1031 + p1032 = 1
inv : p0 + p968 + p969 = 1
inv : p0 + p760 + p761 = 1
inv : p0 + p980 + p981 + p982 = 1
inv : p0 + p295 + p296 + p297 + p298 = 1
inv : p0 + p499 + p500 + p501 + p502 = 1
inv : p0 + p1130 + p1133 + p1134 = 1
inv : p0 + p685 + p686 = 1
inv : p0 + p689 + p690 + p691 + p692 = 1
inv : p0 + p835 + p836 = 1
inv : p0 + p43 + p44 = 1
inv : p0 + p1195 + p1196 + p1197 + p1198 = 1
inv : p0 + p814 + p815 + p816 + p817 = 1
inv : p0 + p130 + p131 + p132 = 1
inv : p0 + p228 + p229 = 1
inv : p0 + p705 + p706 + p707 = 1
inv : p0 + p1187 + p1188 = 1
inv : p0 + p270 + p271 + p272 + p273 = 1
inv : p0 + p378 + p379 = 1
inv : p0 + p839 + p840 + p841 + p842 = 1
inv : p0 + p303 + p304 = 1
inv : p0 + p1249 + p1250 + p1251 + p1252 = 1
inv : p0 + p649 + p650 + p651 + p652 = 1
inv : p0 + p1112 + p1113 = 1
inv : p0 + p460 + p461 = 1
inv : p0 + p205 + p208 + p209 = 1
inv : p0 + p1170 + p1171 + p1172 + p1173 = 1
inv : p0 + p262 + p263 = 1
inv : p0 + p528 + p529 = 1
inv : p0 + p1005 + p1006 + p1007 = 1
inv : p0 + p789 + p790 + p791 + p792 = 1
inv : p0 + p830 + p833 + p834 = 1
inv : p0 + p593 + p594 = 1
inv : p0 + p603 + p604 = 1
inv : p0 + p680 + p681 + p682 = 1
inv : p0 + p518 + p519 = 1
inv : p0 + p337 + p338 = 1
inv : p0 + p320 + p321 + p322 + p323 = 1
inv : p0 + p405 + p406 + p407 = 1
inv : p0 + p1228 + p1229 = 1
inv : p0 + p1105 + p1108 + p1109 = 1
inv : p0 + p624 + p625 + p626 + p627 = 1
inv : p0 + p535 + p536 = 1
inv : p0 + p230 + p233 + p234 = 1
inv : p0 + p764 + p765 + p766 + p767 = 1
inv : p0 + p105 + p106 + p107 = 1
inv : p0 + p453 + p454 = 1
inv : p0 + p599 + p600 + p601 + p602 = 1
inv : p0 + p668 + p669 = 1
inv : p0 + p412 + p413 = 1
inv : p0 + p610 + p611 = 1
inv : p0 + p1220 + p1221 + p1222 + p1223 = 1
Total of 450 invariants.
[2020-05-27 10:38:18] [INFO ] Computed 450 place invariants in 31 ms
Loading property file ReachabilityFireability.prop.
Read [reachable] property : ShieldIIPs-PT-050A-ReachabilityFireability-12 with value :((((((((((((i2.u36.p113==1)&&(i1.i0.i0.u28.p123==1))&&(i1.i0.i1.u38.p125==1))&&(i12.u249.p811==1))&&(i13.i0.i1.u251.p817==1))&&(i13.i0.i0.u254.p826==1))&&(i17.u320.p1038==1))&&(i17.u322.p1048==1))&&(i17.u316.p1052==1))&&(i19.u370.p1211==1))&&(i20.u372.p1215==1))&&(i20.u374.p1226==1))
built 21 ordering constraints for composite.
built 34 ordering constraints for composite.
built 23 ordering constraints for composite.
built 20 ordering constraints for composite.
built 21 ordering constraints for composite.
built 9 ordering constraints for composite.
built 28 ordering constraints for composite.
built 19 ordering constraints for composite.
built 17 ordering constraints for composite.
built 12 ordering constraints for composite.
built 9 ordering constraints for composite.
built 41 ordering constraints for composite.
built 28 ordering constraints for composite.
built 30 ordering constraints for composite.
built 30 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 14 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 12 ordering constraints for composite.
built 42 ordering constraints for composite.
built 29 ordering constraints for composite.
built 24 ordering constraints for composite.
built 21 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 21 ordering constraints for composite.
built 14 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 19 ordering constraints for composite.
built 17 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 12 ordering constraints for composite.
built 17 ordering constraints for composite.
built 6 ordering constraints for composite.
built 12 ordering constraints for composite.
built 6 ordering constraints for composite.
built 30 ordering constraints for composite.
built 24 ordering constraints for composite.
built 19 ordering constraints for composite.
built 16 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 25 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 12 ordering constraints for composite.
built 10 ordering constraints for composite.
built 36 ordering constraints for composite.
built 27 ordering constraints for composite.
built 25 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 8 ordering constraints for composite.
built 13 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 32 ordering constraints for composite.
built 30 ordering constraints for composite.
built 8 ordering constraints for composite.
built 14 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 12 ordering constraints for composite.
built 32 ordering constraints for composite.
built 17 ordering constraints for composite.
built 16 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 16 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 32 ordering constraints for composite.
built 26 ordering constraints for composite.
built 15 ordering constraints for composite.
built 6 ordering constraints for composite.
built 21 ordering constraints for composite.
built 21 ordering constraints for composite.
built 12 ordering constraints for composite.
built 6 ordering constraints for composite.
built 19 ordering constraints for composite.
built 6 ordering constraints for composite.
SDD proceeding with computation, new max is 4
SDD proceeding with computation, new max is 8
SDD proceeding with computation, new max is 16
SDD proceeding with computation, new max is 32
SDD proceeding with computation, new max is 64
SDD proceeding with computation, new max is 128
SDD proceeding with computation, new max is 256
SDD proceeding with computation, new max is 512
SDD proceeding with computation, new max is 1024
SDD proceeding with computation, new max is 2048
SDD proceeding with computation, new max is 4096
[2020-05-27 10:38:20] [INFO ] BMC solution for property ShieldIIPs-PT-050A-ReachabilityFireability-12(UNSAT) depth K=2 took 3221 ms
SDD proceeding with computation, new max is 8192
[2020-05-27 10:38:21] [INFO ] BMC solution for property ShieldIIPs-PT-050A-ReachabilityFireability-12(UNSAT) depth K=3 took 249 ms
SDD proceeding with computation, new max is 16384
[2020-05-27 10:38:22] [INFO ] BMC solution for property ShieldIIPs-PT-050A-ReachabilityFireability-12(UNSAT) depth K=4 took 821 ms
[2020-05-27 10:38:25] [INFO ] Proved 1250 variables to be positive in 6968 ms
[2020-05-27 10:38:25] [INFO ] BMC solution for property ShieldIIPs-PT-050A-ReachabilityFireability-12(UNSAT) depth K=5 took 3356 ms
[2020-05-27 10:38:25] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-050A-ReachabilityFireability-12
[2020-05-27 10:38:25] [INFO ] KInduction solution for property ShieldIIPs-PT-050A-ReachabilityFireability-12(SAT) depth K=0 took 103 ms
[2020-05-27 10:38:25] [INFO ] Proved 1250 variables to be positive in 9031 ms
[2020-05-27 10:38:25] [INFO ] Computing symmetric may disable matrix : 1201 transitions.
[2020-05-27 10:38:25] [INFO ] Computation of disable matrix completed :0/1201 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 10:38:25] [INFO ] Computation of Complete disable matrix. took 114 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 10:38:25] [INFO ] Computing symmetric may enable matrix : 1201 transitions.
[2020-05-27 10:38:26] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-050A-ReachabilityFireability-12
[2020-05-27 10:38:26] [INFO ] KInduction solution for property ShieldIIPs-PT-050A-ReachabilityFireability-12(SAT) depth K=1 took 396 ms
[2020-05-27 10:38:26] [INFO ] Computation of Complete enable matrix. took 99 ms. Total solver calls (SAT/UNSAT): 0(0/0)
SDD proceeding with computation, new max is 32768
[2020-05-27 10:38:27] [INFO ] Computing symmetric co enabling matrix : 1201 transitions.
[2020-05-27 10:38:29] [INFO ] Computation of co-enabling matrix(50/1201) took 2058 ms. Total solver calls (SAT/UNSAT): 1790(8/1782)
[2020-05-27 10:38:32] [INFO ] Computation of co-enabling matrix(83/1201) took 5187 ms. Total solver calls (SAT/UNSAT): 2177(8/2169)
SDD proceeding with computation, new max is 65536
[2020-05-27 10:38:36] [INFO ] Computation of co-enabling matrix(93/1201) took 9147 ms. Total solver calls (SAT/UNSAT): 2297(8/2289)
[2020-05-27 10:38:39] [INFO ] Computation of co-enabling matrix(122/1201) took 12156 ms. Total solver calls (SAT/UNSAT): 2575(30/2545)
[2020-05-27 10:38:42] [INFO ] Computation of co-enabling matrix(176/1201) took 15219 ms. Total solver calls (SAT/UNSAT): 3021(99/2922)
[2020-05-27 10:38:45] [INFO ] Computation of co-enabling matrix(225/1201) took 18235 ms. Total solver calls (SAT/UNSAT): 3428(154/3274)
[2020-05-27 10:38:48] [INFO ] Computation of co-enabling matrix(279/1201) took 21263 ms. Total solver calls (SAT/UNSAT): 3886(222/3664)
[2020-05-27 10:38:49] [INFO ] BMC solution for property ShieldIIPs-PT-050A-ReachabilityFireability-12(UNSAT) depth K=6 took 24504 ms
[2020-05-27 10:38:51] [INFO ] Computation of co-enabling matrix(335/1201) took 24266 ms. Total solver calls (SAT/UNSAT): 4360(290/4070)
[2020-05-27 10:38:54] [INFO ] Computation of co-enabling matrix(392/1201) took 27271 ms. Total solver calls (SAT/UNSAT): 4827(354/4473)
SDD proceeding with computation, new max is 131072
[2020-05-27 10:38:57] [INFO ] Computation of co-enabling matrix(457/1201) took 30286 ms. Total solver calls (SAT/UNSAT): 5371(433/4938)
[2020-05-27 10:39:00] [INFO ] Computation of co-enabling matrix(517/1201) took 33310 ms. Total solver calls (SAT/UNSAT): 5875(505/5370)
[2020-05-27 10:39:03] [INFO ] Computation of co-enabling matrix(582/1201) took 36330 ms. Total solver calls (SAT/UNSAT): 6418(583/5835)
[2020-05-27 10:39:06] [INFO ] Computation of co-enabling matrix(641/1201) took 39338 ms. Total solver calls (SAT/UNSAT): 6917(655/6262)
[2020-05-27 10:39:09] [INFO ] Computation of co-enabling matrix(697/1201) took 42367 ms. Total solver calls (SAT/UNSAT): 7387(721/6666)
[2020-05-27 10:39:12] [INFO ] Computation of co-enabling matrix(767/1201) took 45369 ms. Total solver calls (SAT/UNSAT): 7977(804/7173)
[2020-05-27 10:39:15] [INFO ] Computation of co-enabling matrix(1050/1201) took 48376 ms. Total solver calls (SAT/UNSAT): 8761(907/7854)
[2020-05-27 10:39:17] [INFO ] Computation of Finished co-enabling matrix. took 50124 ms. Total solver calls (SAT/UNSAT): 8822(907/7915)
[2020-05-27 10:39:17] [INFO ] Computing Do-Not-Accords matrix : 1201 transitions.
[2020-05-27 10:39:17] [INFO ] Computation of Completed DNA matrix. took 351 ms. Total solver calls (SAT/UNSAT): 4(0/4)
[2020-05-27 10:39:17] [INFO ] Built C files in 61740ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
Compilation finished in 14250 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 87 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, ShieldIIPsPT050AReachabilityFireability12==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, ShieldIIPsPT050AReachabilityFireability12==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, ShieldIIPsPT050AReachabilityFireability12==true], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
SDD proceeding with computation, new max is 262144
SDD proceeding with computation, new max is 524288
[2020-05-27 10:45:00] [INFO ] BMC solution for property ShieldIIPs-PT-050A-ReachabilityFireability-12(UNSAT) depth K=7 took 370827 ms
SDD proceeding with computation, new max is 1048576
ITS-tools command line returned an error code 137
[2020-05-27 10:48:36] [INFO ] Applying decomposition
[2020-05-27 10:48:36] [INFO ] Flatten gal took : 181 ms
[2020-05-27 10:48:36] [INFO ] Decomposing Gal with order
[2020-05-27 10:48:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 10:48:37] [INFO ] Removed a total of 1142 redundant transitions.
[2020-05-27 10:48:37] [INFO ] Flatten gal took : 128 ms
[2020-05-27 10:48:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 1044 labels/synchronizations in 112 ms.
[2020-05-27 10:48:37] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityFireability.pnml.gal : 57 ms
[2020-05-27 10:48:37] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityFireability.prop : 4 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/ReachabilityFireability.pnml.gal, -t, CGAL, -reachable-file, ReachabilityFireability.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/ReachabilityFireability.pnml.gal -t CGAL -reachable-file ReachabilityFireability.prop --nowitness
Loading property file ReachabilityFireability.prop.
Read [reachable] property : ShieldIIPs-PT-050A-ReachabilityFireability-12 with value :((((((((((((u47.p113==1)&&(u50.p123==1))&&(u51.p125==1))&&(u326.p811==1))&&(u328.p817==1))&&(u331.p826==1))&&(u417.p1038==1))&&(u420.p1048==1))&&(u421.p1052==1))&&(u486.p1211==1))&&(u488.p1215==1))&&(u491.p1226==1))
built 451 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 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
[2020-05-27 10:49:42] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-050A-ReachabilityFireability-12
[2020-05-27 10:49:42] [INFO ] KInduction solution for property ShieldIIPs-PT-050A-ReachabilityFireability-12(SAT) depth K=2 took 676222 ms
SDD proceeding with computation, new max is 262144
SDD proceeding with computation, new max is 524288
SDD proceeding with computation, new max is 1048576
ITS-tools command line returned an error code 137
[2020-05-27 10:56:12] [INFO ] Flatten gal took : 176 ms
[2020-05-27 10:56:14] [INFO ] Input system was already deterministic with 1201 transitions.
[2020-05-27 10:56:14] [INFO ] Transformed 1250 places.
[2020-05-27 10:56:14] [INFO ] Transformed 1201 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:14] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityFireability.pnml.gal : 18 ms
[2020-05-27 10:56:14] [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, --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 [reachable] property : ShieldIIPs-PT-050A-ReachabilityFireability-12 with value :((((((((((((p113==1)&&(p123==1))&&(p125==1))&&(p811==1))&&(p817==1))&&(p826==1))&&(p1038==1))&&(p1048==1))&&(p1052==1))&&(p1211==1))&&(p1215==1))&&(p1226==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
[2020-05-27 11:02:58] [INFO ] BMC solution for property ShieldIIPs-PT-050A-ReachabilityFireability-12(UNSAT) depth K=8 took 1077574 ms
ITS-tools command line returned an error code 137

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

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