fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r096-oct2-158940145400638
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for LamportFastMutEx-COL-8

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15744.450 3600000.00 10776907.00 10215.80 TT?FFFTFFTTF?FFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r096-oct2-158940145400638.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is LamportFastMutEx-COL-8, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r096-oct2-158940145400638
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 220K
-rw-r--r-- 1 mcc users 3.4K Apr 30 13:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 30 13:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 30 13:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 30 13:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 30 13:04 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Apr 30 13:04 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 30 13:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 30 13:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 30 13:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 30 13:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 30 13:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 30 13:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Apr 30 13:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 30 13:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 30 13:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 30 13:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 30 13:04 equiv_pt
-rw-r--r-- 1 mcc users 2 Apr 30 13:04 instance
-rw-r--r-- 1 mcc users 5 Apr 30 13:04 iscolored
-rw-r--r-- 1 mcc users 44K Apr 30 13:04 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 LamportFastMutEx-COL-8-ReachabilityCardinality-00
FORMULA_NAME LamportFastMutEx-COL-8-ReachabilityCardinality-01
FORMULA_NAME LamportFastMutEx-COL-8-ReachabilityCardinality-02
FORMULA_NAME LamportFastMutEx-COL-8-ReachabilityCardinality-03
FORMULA_NAME LamportFastMutEx-COL-8-ReachabilityCardinality-04
FORMULA_NAME LamportFastMutEx-COL-8-ReachabilityCardinality-05
FORMULA_NAME LamportFastMutEx-COL-8-ReachabilityCardinality-06
FORMULA_NAME LamportFastMutEx-COL-8-ReachabilityCardinality-07
FORMULA_NAME LamportFastMutEx-COL-8-ReachabilityCardinality-08
FORMULA_NAME LamportFastMutEx-COL-8-ReachabilityCardinality-09
FORMULA_NAME LamportFastMutEx-COL-8-ReachabilityCardinality-10
FORMULA_NAME LamportFastMutEx-COL-8-ReachabilityCardinality-11
FORMULA_NAME LamportFastMutEx-COL-8-ReachabilityCardinality-12
FORMULA_NAME LamportFastMutEx-COL-8-ReachabilityCardinality-13
FORMULA_NAME LamportFastMutEx-COL-8-ReachabilityCardinality-14
FORMULA_NAME LamportFastMutEx-COL-8-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1589592171584

[2020-05-16 01:22:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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-16 01:22:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-16 01:22:53] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-05-16 01:22:54] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 598 ms
[2020-05-16 01:22:54] [INFO ] sort/places :
pid * pid->wait,done,
pid * bool->b,
pid->P-start_1,x,y,P-setx_3,P-setbi_5,P-ify0_4,P-sety_9,P-ifxi_10,P-setbi_11,P-fordo_12,P-await_13,P-ifyi_15,P-awaity,P-CS_21,P-setbi_24,

[2020-05-16 01:22:54] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 315 PT places and 837.0 transition bindings in 133 ms.
[2020-05-16 01:22:54] [INFO ] Computed order based on color domains.
[2020-05-16 01:22:54] [INFO ] Unfolded HLPN to a Petri net with 315 places and 666 transitions in 25 ms.
[2020-05-16 01:22:54] [INFO ] Unfolded HLPN properties in 0 ms.
Deduced a syphon composed of 49 places in 3 ms
Reduce places removed 49 places and 82 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 69 ms.
Working with output stream class java.io.PrintStream
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 65 ms. (steps per millisecond=153 ) properties seen :[1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0]
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0]
[2020-05-16 01:22:54] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2020-05-16 01:22:54] [INFO ] Computed 82 place invariants in 38 ms
[2020-05-16 01:22:55] [INFO ] [Real]Absence check using 82 positive place invariants in 112 ms returned sat
[2020-05-16 01:22:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:22:55] [INFO ] [Real]Absence check using state equation in 250 ms returned sat
[2020-05-16 01:22:55] [INFO ] State equation strengthened by 128 read => feed constraints.
[2020-05-16 01:22:55] [INFO ] [Real]Added 128 Read/Feed constraints in 33 ms returned sat
[2020-05-16 01:22:55] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:22:55] [INFO ] [Nat]Absence check using 82 positive place invariants in 154 ms returned sat
[2020-05-16 01:22:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:22:55] [INFO ] [Nat]Absence check using state equation in 217 ms returned sat
[2020-05-16 01:22:55] [INFO ] [Nat]Added 128 Read/Feed constraints in 17 ms returned sat
[2020-05-16 01:22:56] [INFO ] Deduced a trap composed of 51 places in 123 ms
[2020-05-16 01:22:56] [INFO ] Deduced a trap composed of 45 places in 168 ms
[2020-05-16 01:22:56] [INFO ] Deduced a trap composed of 52 places in 157 ms
[2020-05-16 01:22:56] [INFO ] Deduced a trap composed of 52 places in 121 ms
[2020-05-16 01:22:56] [INFO ] Deduced a trap composed of 48 places in 122 ms
[2020-05-16 01:22:56] [INFO ] Deduced a trap composed of 52 places in 90 ms
[2020-05-16 01:22:56] [INFO ] Deduced a trap composed of 52 places in 127 ms
[2020-05-16 01:22:57] [INFO ] Deduced a trap composed of 48 places in 91 ms
[2020-05-16 01:22:57] [INFO ] Deduced a trap composed of 48 places in 89 ms
[2020-05-16 01:22:57] [INFO ] Deduced a trap composed of 48 places in 87 ms
[2020-05-16 01:22:57] [INFO ] Deduced a trap composed of 44 places in 92 ms
[2020-05-16 01:22:57] [INFO ] Deduced a trap composed of 54 places in 89 ms
[2020-05-16 01:22:57] [INFO ] Deduced a trap composed of 55 places in 119 ms
[2020-05-16 01:22:57] [INFO ] Deduced a trap composed of 50 places in 81 ms
[2020-05-16 01:22:57] [INFO ] Deduced a trap composed of 9 places in 73 ms
[2020-05-16 01:22:57] [INFO ] Deduced a trap composed of 53 places in 88 ms
[2020-05-16 01:22:58] [INFO ] Deduced a trap composed of 17 places in 73 ms
[2020-05-16 01:22:58] [INFO ] Deduced a trap composed of 54 places in 136 ms
[2020-05-16 01:22:58] [INFO ] Deduced a trap composed of 66 places in 82 ms
[2020-05-16 01:22:58] [INFO ] Deduced a trap composed of 62 places in 76 ms
[2020-05-16 01:22:58] [INFO ] Deduced a trap composed of 55 places in 87 ms
[2020-05-16 01:22:58] [INFO ] Deduced a trap composed of 52 places in 90 ms
[2020-05-16 01:22:59] [INFO ] Deduced a trap composed of 9 places in 524 ms
[2020-05-16 01:22:59] [INFO ] Deduced a trap composed of 51 places in 119 ms
[2020-05-16 01:22:59] [INFO ] Deduced a trap composed of 52 places in 172 ms
[2020-05-16 01:22:59] [INFO ] Deduced a trap composed of 9 places in 82 ms
[2020-05-16 01:22:59] [INFO ] Deduced a trap composed of 53 places in 98 ms
[2020-05-16 01:22:59] [INFO ] Deduced a trap composed of 56 places in 68 ms
[2020-05-16 01:22:59] [INFO ] Deduced a trap composed of 49 places in 83 ms
[2020-05-16 01:22:59] [INFO ] Deduced a trap composed of 8 places in 84 ms
[2020-05-16 01:23:00] [INFO ] Deduced a trap composed of 60 places in 81 ms
[2020-05-16 01:23:00] [INFO ] Deduced a trap composed of 17 places in 87 ms
[2020-05-16 01:23:00] [INFO ] Deduced a trap composed of 54 places in 230 ms
[2020-05-16 01:23:00] [INFO ] Deduced a trap composed of 52 places in 115 ms
[2020-05-16 01:23:00] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s6 s7 s18 s19 s20 s21 s22 s23 s24 s25 s27 s35 s36 s43 s44 s45 s47 s48 s49 s59 s60 s61 s63 s64 s65 s67 s68 s69 s71 s72 s73 s90 s94 s103 s132 s204 s238 s242 s246 s258 s259 s260 s261 s262 s263 s264 s265) 0)") while checking expression at index 0
[2020-05-16 01:23:00] [INFO ] [Real]Absence check using 82 positive place invariants in 43 ms returned sat
[2020-05-16 01:23:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:23:00] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2020-05-16 01:23:00] [INFO ] [Real]Added 128 Read/Feed constraints in 18 ms returned sat
[2020-05-16 01:23:00] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:23:00] [INFO ] [Nat]Absence check using 82 positive place invariants in 24 ms returned sat
[2020-05-16 01:23:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:23:01] [INFO ] [Nat]Absence check using state equation in 214 ms returned sat
[2020-05-16 01:23:01] [INFO ] [Nat]Added 128 Read/Feed constraints in 17 ms returned sat
[2020-05-16 01:23:01] [INFO ] Deduced a trap composed of 14 places in 196 ms
[2020-05-16 01:23:01] [INFO ] Deduced a trap composed of 30 places in 172 ms
[2020-05-16 01:23:01] [INFO ] Deduced a trap composed of 46 places in 98 ms
[2020-05-16 01:23:01] [INFO ] Deduced a trap composed of 49 places in 87 ms
[2020-05-16 01:23:01] [INFO ] Deduced a trap composed of 17 places in 72 ms
[2020-05-16 01:23:01] [INFO ] Deduced a trap composed of 24 places in 69 ms
[2020-05-16 01:23:02] [INFO ] Deduced a trap composed of 16 places in 84 ms
[2020-05-16 01:23:02] [INFO ] Deduced a trap composed of 23 places in 67 ms
[2020-05-16 01:23:02] [INFO ] Deduced a trap composed of 24 places in 67 ms
[2020-05-16 01:23:02] [INFO ] Deduced a trap composed of 50 places in 86 ms
[2020-05-16 01:23:02] [INFO ] Deduced a trap composed of 9 places in 113 ms
[2020-05-16 01:23:02] [INFO ] Deduced a trap composed of 48 places in 91 ms
[2020-05-16 01:23:02] [INFO ] Deduced a trap composed of 49 places in 307 ms
[2020-05-16 01:23:03] [INFO ] Deduced a trap composed of 9 places in 245 ms
[2020-05-16 01:23:03] [INFO ] Deduced a trap composed of 49 places in 102 ms
[2020-05-16 01:23:03] [INFO ] Deduced a trap composed of 9 places in 127 ms
[2020-05-16 01:23:03] [INFO ] Deduced a trap composed of 8 places in 112 ms
[2020-05-16 01:23:03] [INFO ] Deduced a trap composed of 9 places in 139 ms
[2020-05-16 01:23:03] [INFO ] Deduced a trap composed of 42 places in 128 ms
[2020-05-16 01:23:03] [INFO ] Deduced a trap composed of 8 places in 115 ms
[2020-05-16 01:23:04] [INFO ] Deduced a trap composed of 17 places in 63 ms
[2020-05-16 01:23:04] [INFO ] Deduced a trap composed of 9 places in 107 ms
[2020-05-16 01:23:04] [INFO ] Deduced a trap composed of 44 places in 153 ms
[2020-05-16 01:23:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 23 trap constraints in 3195 ms
[2020-05-16 01:23:04] [INFO ] [Real]Absence check using 82 positive place invariants in 27 ms returned sat
[2020-05-16 01:23:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:23:04] [INFO ] [Real]Absence check using state equation in 231 ms returned sat
[2020-05-16 01:23:04] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:23:04] [INFO ] [Nat]Absence check using 82 positive place invariants in 24 ms returned sat
[2020-05-16 01:23:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:23:04] [INFO ] [Nat]Absence check using state equation in 229 ms returned sat
[2020-05-16 01:23:04] [INFO ] [Nat]Added 128 Read/Feed constraints in 20 ms returned sat
[2020-05-16 01:23:05] [INFO ] Deduced a trap composed of 56 places in 125 ms
[2020-05-16 01:23:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2020-05-16 01:23:05] [INFO ] Computed and/alt/rep : 576/5248/408 causal constraints in 38 ms.
[2020-05-16 01:23:06] [INFO ] Added : 175 causal constraints over 36 iterations in 1380 ms. Result :sat
[2020-05-16 01:23:06] [INFO ] Deduced a trap composed of 20 places in 71 ms
[2020-05-16 01:23:06] [INFO ] Deduced a trap composed of 10 places in 65 ms
[2020-05-16 01:23:06] [INFO ] Deduced a trap composed of 9 places in 18 ms
[2020-05-16 01:23:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 306 ms
Attempting to minimize the solution found.
Minimization took 32 ms.
[2020-05-16 01:23:06] [INFO ] [Real]Absence check using 82 positive place invariants in 1 ms returned unsat
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 31600 steps, including 880 resets, run finished after 153 ms. (steps per millisecond=206 ) properties seen :[0, 0] could not realise parikh vector
Support contains 40 out of 266 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 35 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 266/266 places, 584/584 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2255 ms. (steps per millisecond=443 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 885 ms. (steps per millisecond=1129 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 820 ms. (steps per millisecond=1219 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 13748328 steps, run timeout after 30001 ms. (steps per millisecond=458 ) properties seen :[0, 0]
Probabilistic random walk after 13748328 steps, saw 1719720 distinct states, run finished after 30001 ms. (steps per millisecond=458 ) properties seen :[0, 0]
[2020-05-16 01:23:41] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2020-05-16 01:23:41] [INFO ] Computed 82 place invariants in 4 ms
[2020-05-16 01:23:41] [INFO ] [Real]Absence check using 82 positive place invariants in 27 ms returned sat
[2020-05-16 01:23:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:23:41] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2020-05-16 01:23:41] [INFO ] State equation strengthened by 128 read => feed constraints.
[2020-05-16 01:23:41] [INFO ] [Real]Added 128 Read/Feed constraints in 28 ms returned sat
[2020-05-16 01:23:41] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:23:41] [INFO ] [Nat]Absence check using 82 positive place invariants in 68 ms returned sat
[2020-05-16 01:23:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:23:41] [INFO ] [Nat]Absence check using state equation in 232 ms returned sat
[2020-05-16 01:23:41] [INFO ] [Nat]Added 128 Read/Feed constraints in 57 ms returned sat
[2020-05-16 01:23:41] [INFO ] Deduced a trap composed of 51 places in 110 ms
[2020-05-16 01:23:42] [INFO ] Deduced a trap composed of 45 places in 128 ms
[2020-05-16 01:23:42] [INFO ] Deduced a trap composed of 52 places in 99 ms
[2020-05-16 01:23:42] [INFO ] Deduced a trap composed of 52 places in 93 ms
[2020-05-16 01:23:42] [INFO ] Deduced a trap composed of 48 places in 81 ms
[2020-05-16 01:23:42] [INFO ] Deduced a trap composed of 52 places in 80 ms
[2020-05-16 01:23:42] [INFO ] Deduced a trap composed of 52 places in 82 ms
[2020-05-16 01:23:42] [INFO ] Deduced a trap composed of 48 places in 83 ms
[2020-05-16 01:23:42] [INFO ] Deduced a trap composed of 48 places in 89 ms
[2020-05-16 01:23:42] [INFO ] Deduced a trap composed of 48 places in 120 ms
[2020-05-16 01:23:43] [INFO ] Deduced a trap composed of 44 places in 87 ms
[2020-05-16 01:23:43] [INFO ] Deduced a trap composed of 54 places in 84 ms
[2020-05-16 01:23:43] [INFO ] Deduced a trap composed of 55 places in 86 ms
[2020-05-16 01:23:43] [INFO ] Deduced a trap composed of 50 places in 308 ms
[2020-05-16 01:23:43] [INFO ] Deduced a trap composed of 9 places in 115 ms
[2020-05-16 01:23:43] [INFO ] Deduced a trap composed of 53 places in 95 ms
[2020-05-16 01:23:43] [INFO ] Deduced a trap composed of 17 places in 71 ms
[2020-05-16 01:23:44] [INFO ] Deduced a trap composed of 54 places in 132 ms
[2020-05-16 01:23:44] [INFO ] Deduced a trap composed of 66 places in 77 ms
[2020-05-16 01:23:44] [INFO ] Deduced a trap composed of 62 places in 87 ms
[2020-05-16 01:23:44] [INFO ] Deduced a trap composed of 55 places in 113 ms
[2020-05-16 01:23:44] [INFO ] Deduced a trap composed of 52 places in 93 ms
[2020-05-16 01:23:44] [INFO ] Deduced a trap composed of 9 places in 79 ms
[2020-05-16 01:23:44] [INFO ] Deduced a trap composed of 51 places in 81 ms
[2020-05-16 01:23:44] [INFO ] Deduced a trap composed of 52 places in 93 ms
[2020-05-16 01:23:45] [INFO ] Deduced a trap composed of 9 places in 264 ms
[2020-05-16 01:23:45] [INFO ] Deduced a trap composed of 53 places in 103 ms
[2020-05-16 01:23:45] [INFO ] Deduced a trap composed of 56 places in 80 ms
[2020-05-16 01:23:45] [INFO ] Deduced a trap composed of 49 places in 77 ms
[2020-05-16 01:23:45] [INFO ] Deduced a trap composed of 8 places in 95 ms
[2020-05-16 01:23:45] [INFO ] Deduced a trap composed of 60 places in 82 ms
[2020-05-16 01:23:45] [INFO ] Deduced a trap composed of 17 places in 102 ms
[2020-05-16 01:23:45] [INFO ] Deduced a trap composed of 54 places in 70 ms
[2020-05-16 01:23:45] [INFO ] Deduced a trap composed of 52 places in 103 ms
[2020-05-16 01:23:45] [INFO ] Deduced a trap composed of 54 places in 109 ms
[2020-05-16 01:23:46] [INFO ] Deduced a trap composed of 55 places in 104 ms
[2020-05-16 01:23:46] [INFO ] Deduced a trap composed of 46 places in 91 ms
[2020-05-16 01:23:46] [INFO ] Deduced a trap composed of 53 places in 95 ms
[2020-05-16 01:23:46] [INFO ] Deduced a trap composed of 52 places in 75 ms
[2020-05-16 01:23:46] [INFO ] Deduced a trap composed of 49 places in 93 ms
[2020-05-16 01:23:46] [INFO ] Deduced a trap composed of 57 places in 88 ms
[2020-05-16 01:23:46] [INFO ] Deduced a trap composed of 49 places in 87 ms
[2020-05-16 01:23:46] [INFO ] Deduced a trap composed of 55 places in 75 ms
[2020-05-16 01:23:46] [INFO ] Deduced a trap composed of 50 places in 80 ms
[2020-05-16 01:23:47] [INFO ] Deduced a trap composed of 57 places in 121 ms
[2020-05-16 01:23:47] [INFO ] Deduced a trap composed of 51 places in 83 ms
[2020-05-16 01:23:47] [INFO ] Deduced a trap composed of 9 places in 87 ms
[2020-05-16 01:23:47] [INFO ] Deduced a trap composed of 62 places in 87 ms
[2020-05-16 01:23:47] [INFO ] Deduced a trap composed of 59 places in 76 ms
[2020-05-16 01:23:47] [INFO ] Deduced a trap composed of 48 places in 110 ms
[2020-05-16 01:23:47] [INFO ] Deduced a trap composed of 49 places in 117 ms
[2020-05-16 01:23:47] [INFO ] Deduced a trap composed of 43 places in 88 ms
[2020-05-16 01:23:47] [INFO ] Deduced a trap composed of 14 places in 101 ms
[2020-05-16 01:23:48] [INFO ] Deduced a trap composed of 33 places in 79 ms
[2020-05-16 01:23:48] [INFO ] Deduced a trap composed of 33 places in 74 ms
[2020-05-16 01:23:48] [INFO ] Deduced a trap composed of 10 places in 93 ms
[2020-05-16 01:23:48] [INFO ] Deduced a trap composed of 62 places in 81 ms
[2020-05-16 01:23:48] [INFO ] Trap strengthening (SAT) tested/added 58/57 trap constraints in 6517 ms
[2020-05-16 01:23:48] [INFO ] Computed and/alt/rep : 576/5248/408 causal constraints in 24 ms.
[2020-05-16 01:23:52] [INFO ] Added : 371 causal constraints over 75 iterations in 3757 ms. Result :sat
[2020-05-16 01:23:52] [INFO ] Deduced a trap composed of 9 places in 90 ms
[2020-05-16 01:23:52] [INFO ] Deduced a trap composed of 36 places in 110 ms
[2020-05-16 01:23:52] [INFO ] Deduced a trap composed of 32 places in 87 ms
[2020-05-16 01:23:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 542 ms
Attempting to minimize the solution found.
Minimization took 50 ms.
[2020-05-16 01:23:52] [INFO ] [Real]Absence check using 82 positive place invariants in 33 ms returned sat
[2020-05-16 01:23:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:23:53] [INFO ] [Real]Absence check using state equation in 225 ms returned sat
[2020-05-16 01:23:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:23:53] [INFO ] [Nat]Absence check using 82 positive place invariants in 63 ms returned sat
[2020-05-16 01:23:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:23:53] [INFO ] [Nat]Absence check using state equation in 206 ms returned sat
[2020-05-16 01:23:53] [INFO ] [Nat]Added 128 Read/Feed constraints in 35 ms returned sat
[2020-05-16 01:23:53] [INFO ] Deduced a trap composed of 56 places in 102 ms
[2020-05-16 01:23:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2020-05-16 01:23:53] [INFO ] Computed and/alt/rep : 576/5248/408 causal constraints in 39 ms.
[2020-05-16 01:23:54] [INFO ] Added : 175 causal constraints over 36 iterations in 1277 ms. Result :sat
[2020-05-16 01:23:54] [INFO ] Deduced a trap composed of 20 places in 91 ms
[2020-05-16 01:23:54] [INFO ] Deduced a trap composed of 10 places in 27 ms
[2020-05-16 01:23:55] [INFO ] Deduced a trap composed of 9 places in 25 ms
[2020-05-16 01:23:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 290 ms
Attempting to minimize the solution found.
Minimization took 21 ms.
Incomplete Parikh walk after 31600 steps, including 895 resets, run finished after 84 ms. (steps per millisecond=376 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 143800 steps, including 1000 resets, run finished after 299 ms. (steps per millisecond=480 ) properties seen :[0, 0] could not realise parikh vector
Support contains 40 out of 266 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 15 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 266/266 places, 584/584 transitions.
Starting structural reductions, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 11 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2020-05-16 01:23:55] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2020-05-16 01:23:55] [INFO ] Computed 82 place invariants in 2 ms
[2020-05-16 01:23:55] [INFO ] Implicit Places using invariants in 324 ms returned []
[2020-05-16 01:23:55] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2020-05-16 01:23:55] [INFO ] Computed 82 place invariants in 2 ms
[2020-05-16 01:23:56] [INFO ] State equation strengthened by 128 read => feed constraints.
[2020-05-16 01:23:57] [INFO ] Implicit Places using invariants and state equation in 1219 ms returned []
Implicit Place search using SMT with State Equation took 1555 ms to find 0 implicit places.
[2020-05-16 01:23:57] [INFO ] Redundant transitions in 21 ms returned []
[2020-05-16 01:23:57] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2020-05-16 01:23:57] [INFO ] Computed 82 place invariants in 1 ms
[2020-05-16 01:23:57] [INFO ] Dead Transitions using invariants and state equation in 504 ms returned []
Finished structural reductions, in 1 iterations. Remains : 266/266 places, 584/584 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 213 ms. (steps per millisecond=469 ) properties seen :[0, 0]
[2020-05-16 01:23:57] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2020-05-16 01:23:57] [INFO ] Computed 82 place invariants in 1 ms
[2020-05-16 01:23:57] [INFO ] [Real]Absence check using 82 positive place invariants in 22 ms returned sat
[2020-05-16 01:23:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:23:58] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2020-05-16 01:23:58] [INFO ] State equation strengthened by 128 read => feed constraints.
[2020-05-16 01:23:58] [INFO ] [Real]Added 128 Read/Feed constraints in 32 ms returned sat
[2020-05-16 01:23:58] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:23:58] [INFO ] [Nat]Absence check using 82 positive place invariants in 26 ms returned sat
[2020-05-16 01:23:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:23:58] [INFO ] [Nat]Absence check using state equation in 201 ms returned sat
[2020-05-16 01:23:58] [INFO ] [Nat]Added 128 Read/Feed constraints in 39 ms returned sat
[2020-05-16 01:23:58] [INFO ] Deduced a trap composed of 51 places in 100 ms
[2020-05-16 01:23:58] [INFO ] Deduced a trap composed of 45 places in 75 ms
[2020-05-16 01:23:58] [INFO ] Deduced a trap composed of 52 places in 84 ms
[2020-05-16 01:23:58] [INFO ] Deduced a trap composed of 52 places in 110 ms
[2020-05-16 01:23:59] [INFO ] Deduced a trap composed of 48 places in 86 ms
[2020-05-16 01:23:59] [INFO ] Deduced a trap composed of 52 places in 76 ms
[2020-05-16 01:23:59] [INFO ] Deduced a trap composed of 52 places in 137 ms
[2020-05-16 01:23:59] [INFO ] Deduced a trap composed of 48 places in 77 ms
[2020-05-16 01:23:59] [INFO ] Deduced a trap composed of 48 places in 92 ms
[2020-05-16 01:23:59] [INFO ] Deduced a trap composed of 48 places in 72 ms
[2020-05-16 01:23:59] [INFO ] Deduced a trap composed of 44 places in 81 ms
[2020-05-16 01:23:59] [INFO ] Deduced a trap composed of 54 places in 107 ms
[2020-05-16 01:23:59] [INFO ] Deduced a trap composed of 55 places in 78 ms
[2020-05-16 01:23:59] [INFO ] Deduced a trap composed of 50 places in 96 ms
[2020-05-16 01:24:00] [INFO ] Deduced a trap composed of 9 places in 82 ms
[2020-05-16 01:24:00] [INFO ] Deduced a trap composed of 53 places in 84 ms
[2020-05-16 01:24:00] [INFO ] Deduced a trap composed of 17 places in 91 ms
[2020-05-16 01:24:00] [INFO ] Deduced a trap composed of 54 places in 78 ms
[2020-05-16 01:24:00] [INFO ] Deduced a trap composed of 66 places in 96 ms
[2020-05-16 01:24:00] [INFO ] Deduced a trap composed of 62 places in 71 ms
[2020-05-16 01:24:00] [INFO ] Deduced a trap composed of 55 places in 99 ms
[2020-05-16 01:24:00] [INFO ] Deduced a trap composed of 52 places in 73 ms
[2020-05-16 01:24:00] [INFO ] Deduced a trap composed of 9 places in 76 ms
[2020-05-16 01:24:00] [INFO ] Deduced a trap composed of 51 places in 81 ms
[2020-05-16 01:24:01] [INFO ] Deduced a trap composed of 52 places in 73 ms
[2020-05-16 01:24:01] [INFO ] Deduced a trap composed of 9 places in 86 ms
[2020-05-16 01:24:01] [INFO ] Deduced a trap composed of 53 places in 89 ms
[2020-05-16 01:24:01] [INFO ] Deduced a trap composed of 56 places in 77 ms
[2020-05-16 01:24:01] [INFO ] Deduced a trap composed of 49 places in 92 ms
[2020-05-16 01:24:01] [INFO ] Deduced a trap composed of 8 places in 79 ms
[2020-05-16 01:24:01] [INFO ] Deduced a trap composed of 60 places in 89 ms
[2020-05-16 01:24:01] [INFO ] Deduced a trap composed of 17 places in 79 ms
[2020-05-16 01:24:01] [INFO ] Deduced a trap composed of 54 places in 78 ms
[2020-05-16 01:24:01] [INFO ] Deduced a trap composed of 52 places in 85 ms
[2020-05-16 01:24:02] [INFO ] Deduced a trap composed of 54 places in 87 ms
[2020-05-16 01:24:02] [INFO ] Deduced a trap composed of 55 places in 78 ms
[2020-05-16 01:24:02] [INFO ] Deduced a trap composed of 46 places in 111 ms
[2020-05-16 01:24:02] [INFO ] Deduced a trap composed of 53 places in 78 ms
[2020-05-16 01:24:02] [INFO ] Deduced a trap composed of 52 places in 94 ms
[2020-05-16 01:24:02] [INFO ] Deduced a trap composed of 49 places in 84 ms
[2020-05-16 01:24:02] [INFO ] Deduced a trap composed of 57 places in 109 ms
[2020-05-16 01:24:02] [INFO ] Deduced a trap composed of 49 places in 84 ms
[2020-05-16 01:24:02] [INFO ] Deduced a trap composed of 55 places in 81 ms
[2020-05-16 01:24:02] [INFO ] Deduced a trap composed of 50 places in 79 ms
[2020-05-16 01:24:03] [INFO ] Deduced a trap composed of 57 places in 96 ms
[2020-05-16 01:24:03] [INFO ] Deduced a trap composed of 51 places in 81 ms
[2020-05-16 01:24:03] [INFO ] Deduced a trap composed of 9 places in 94 ms
[2020-05-16 01:24:03] [INFO ] Deduced a trap composed of 62 places in 100 ms
[2020-05-16 01:24:03] [INFO ] Deduced a trap composed of 59 places in 85 ms
[2020-05-16 01:24:03] [INFO ] Deduced a trap composed of 48 places in 96 ms
[2020-05-16 01:24:03] [INFO ] Deduced a trap composed of 49 places in 86 ms
[2020-05-16 01:24:03] [INFO ] Deduced a trap composed of 43 places in 82 ms
[2020-05-16 01:24:03] [INFO ] Deduced a trap composed of 14 places in 74 ms
[2020-05-16 01:24:04] [INFO ] Deduced a trap composed of 33 places in 84 ms
[2020-05-16 01:24:04] [INFO ] Deduced a trap composed of 33 places in 74 ms
[2020-05-16 01:24:04] [INFO ] Deduced a trap composed of 10 places in 79 ms
[2020-05-16 01:24:04] [INFO ] Deduced a trap composed of 62 places in 75 ms
[2020-05-16 01:24:04] [INFO ] Trap strengthening (SAT) tested/added 58/57 trap constraints in 5806 ms
[2020-05-16 01:24:04] [INFO ] Computed and/alt/rep : 576/5248/408 causal constraints in 20 ms.
[2020-05-16 01:24:08] [INFO ] Added : 371 causal constraints over 75 iterations in 3719 ms. Result :sat
[2020-05-16 01:24:08] [INFO ] Deduced a trap composed of 9 places in 105 ms
[2020-05-16 01:24:08] [INFO ] Deduced a trap composed of 36 places in 101 ms
[2020-05-16 01:24:08] [INFO ] Deduced a trap composed of 32 places in 97 ms
[2020-05-16 01:24:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 535 ms
[2020-05-16 01:24:08] [INFO ] [Real]Absence check using 82 positive place invariants in 22 ms returned sat
[2020-05-16 01:24:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:24:08] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2020-05-16 01:24:08] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:24:08] [INFO ] [Nat]Absence check using 82 positive place invariants in 72 ms returned sat
[2020-05-16 01:24:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:24:09] [INFO ] [Nat]Absence check using state equation in 203 ms returned sat
[2020-05-16 01:24:09] [INFO ] [Nat]Added 128 Read/Feed constraints in 15 ms returned sat
[2020-05-16 01:24:09] [INFO ] Deduced a trap composed of 56 places in 113 ms
[2020-05-16 01:24:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2020-05-16 01:24:09] [INFO ] Computed and/alt/rep : 576/5248/408 causal constraints in 18 ms.
[2020-05-16 01:24:10] [INFO ] Added : 175 causal constraints over 36 iterations in 1405 ms. Result :sat
[2020-05-16 01:24:10] [INFO ] Deduced a trap composed of 20 places in 55 ms
[2020-05-16 01:24:10] [INFO ] Deduced a trap composed of 10 places in 30 ms
[2020-05-16 01:24:10] [INFO ] Deduced a trap composed of 9 places in 24 ms
[2020-05-16 01:24:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 226 ms
Ensure Unique test removed 168 transitions
Reduce isomorphic transitions removed 168 transitions.
Iterating post reduction 0 with 168 rules applied. Total rules applied 168 place count 266 transition count 416
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 64 Pre rules applied. Total rules applied 168 place count 266 transition count 352
Deduced a syphon composed of 64 places in 0 ms
Ensure Unique test removed 64 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 1 with 192 rules applied. Total rules applied 360 place count 138 transition count 352
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -56
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 376 place count 130 transition count 408
Applied a total of 376 rules in 29 ms. Remains 130 /266 variables (removed 136) and now considering 408/584 (removed 176) transitions.
// Phase 1: matrix 408 rows 130 cols
[2020-05-16 01:24:11] [INFO ] Computed 18 place invariants in 1 ms
[2020-05-16 01:24:11] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2020-05-16 01:24:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:24:11] [INFO ] [Real]Absence check using state equation in 212 ms returned sat
[2020-05-16 01:24:11] [INFO ] Computed and/alt/rep : 392/4368/392 causal constraints in 36 ms.
[2020-05-16 01:24:11] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:24:11] [INFO ] [Nat]Absence check using 18 positive place invariants in 17 ms returned sat
[2020-05-16 01:24:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:24:11] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2020-05-16 01:24:11] [INFO ] Computed and/alt/rep : 392/4368/392 causal constraints in 42 ms.
[2020-05-16 01:24:15] [INFO ] Added : 330 causal constraints over 69 iterations in 4352 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 55 ms.
[2020-05-16 01:24:16] [INFO ] [Real]Absence check using 18 positive place invariants in 5 ms returned sat
[2020-05-16 01:24:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:24:16] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2020-05-16 01:24:16] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:24:16] [INFO ] [Nat]Absence check using 18 positive place invariants in 7 ms returned sat
[2020-05-16 01:24:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:24:16] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2020-05-16 01:24:16] [INFO ] Computed and/alt/rep : 392/4368/392 causal constraints in 16 ms.
[2020-05-16 01:24:20] [INFO ] Added : 336 causal constraints over 69 iterations in 4344 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 54 ms.
[2020-05-16 01:24:20] [INFO ] Flatten gal took : 120 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-16 01:24:21] [INFO ] Applying decomposition
[2020-05-16 01:24:21] [INFO ] Flatten gal took : 112 ms
[2020-05-16 01:24:21] [INFO ] Flatten gal took : 102 ms
[2020-05-16 01:24:21] [INFO ] Input system was already deterministic with 584 transitions.
[2020-05-16 01:24:21] [INFO ] Input system was already deterministic with 584 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph17427364423825539883.txt, -o, /tmp/graph17427364423825539883.bin, -w, /tmp/graph17427364423825539883.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/graph17427364423825539883.bin, -l, -1, -v, -w, /tmp/graph17427364423825539883.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-16 01:24:21] [INFO ] Decomposing Gal with order
[2020-05-16 01:24:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-16 01:24:21] [INFO ] Ran tautology test, simplified 0 / 2 in 646 ms.
[2020-05-16 01:24:21] [INFO ] BMC solution for property LamportFastMutEx-COL-8-ReachabilityCardinality-02(UNSAT) depth K=0 took 29 ms
[2020-05-16 01:24:21] [INFO ] BMC solution for property LamportFastMutEx-COL-8-ReachabilityCardinality-12(UNSAT) depth K=0 took 27 ms
[2020-05-16 01:24:22] [INFO ] BMC solution for property LamportFastMutEx-COL-8-ReachabilityCardinality-02(UNSAT) depth K=1 took 23 ms
[2020-05-16 01:24:22] [INFO ] BMC solution for property LamportFastMutEx-COL-8-ReachabilityCardinality-12(UNSAT) depth K=1 took 27 ms
[2020-05-16 01:24:22] [INFO ] Removed a total of 654 redundant transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 416 out of 584 initially.
// Phase 1: matrix 416 rows 266 cols
[2020-05-16 01:24:22] [INFO ] Computed 82 place invariants in 2 ms
inv : P_start_1_4 + P_setx_3_4 + P_setbi_5_4 + P_ify0_4_4 + P_sety_9_4 + P_ifxi_10_4 + P_setbi_11_4 + P_fordo_12_4 + wait_43 + done_43 + P_ifyi_15_4 + P_awaity_4 + P_CS_21_4 + P_setbi_24_4 = 1
inv : P_start_1_2 + P_setx_3_2 + P_setbi_5_2 + P_ify0_4_2 + P_sety_9_2 + P_ifxi_10_2 + P_setbi_11_2 + P_fordo_12_2 + wait_19 + done_19 + P_ifyi_15_2 + P_awaity_2 + P_CS_21_2 + P_setbi_24_2 = 1
inv : P_start_1_3 + P_setx_3_3 + P_setbi_5_3 + P_ify0_4_3 + P_sety_9_3 + P_ifxi_10_3 + P_setbi_11_3 + P_fordo_12_3 + wait_32 + done_32 + P_ifyi_15_3 + P_awaity_3 + P_CS_21_3 + P_setbi_24_3 = 1
inv : P_start_1_4 + P_setx_3_4 + P_setbi_5_4 + P_ify0_4_4 + P_sety_9_4 + P_ifxi_10_4 + P_setbi_11_4 + P_fordo_12_4 + wait_41 + done_41 + P_ifyi_15_4 + P_awaity_4 + P_CS_21_4 + P_setbi_24_4 = 1
inv : P_start_1_8 + P_setx_3_8 + P_setbi_5_8 + P_ify0_4_8 + P_sety_9_8 + P_ifxi_10_8 + P_setbi_11_8 + P_fordo_12_8 + wait_76 + done_76 + P_ifyi_15_8 + P_awaity_8 + P_CS_21_8 + P_setbi_24_8 = 1
inv : P_start_1_3 + P_setx_3_3 + P_setbi_5_3 + P_ify0_4_3 + P_sety_9_3 + P_ifxi_10_3 + P_setbi_11_3 + P_fordo_12_3 + wait_30 + done_30 + P_ifyi_15_3 + P_awaity_3 + P_CS_21_3 + P_setbi_24_3 = 1
inv : P_start_1_1 + P_setx_3_1 + P_setbi_5_1 + P_ify0_4_1 + P_sety_9_1 + P_ifxi_10_1 + P_setbi_11_1 + P_fordo_12_1 + wait_10 + done_10 + P_ifyi_15_1 + P_awaity_1 + P_CS_21_1 + P_setbi_24_1 = 1
inv : P_start_1_2 + P_setx_3_2 + P_setbi_5_2 + P_ify0_4_2 + P_sety_9_2 + P_ifxi_10_2 + P_setbi_11_2 + P_fordo_12_2 + wait_21 + done_21 + P_ifyi_15_2 + P_awaity_2 + P_CS_21_2 + P_setbi_24_2 = 1
inv : b_4 + b_5 = 1
inv : P_start_1_6 + P_setx_3_6 + P_setbi_5_6 + P_ify0_4_6 + P_sety_9_6 + P_ifxi_10_6 + P_setbi_11_6 + P_fordo_12_6 + wait_56 + done_56 + P_ifyi_15_6 + P_awaity_6 + P_CS_21_6 + P_setbi_24_6 = 1
inv : P_start_1_2 + P_setx_3_2 + P_setbi_5_2 + P_ify0_4_2 + P_sety_9_2 + P_ifxi_10_2 + P_setbi_11_2 + P_fordo_12_2 + wait_25 + done_25 + P_ifyi_15_2 + P_awaity_2 + P_CS_21_2 + P_setbi_24_2 = 1
inv : P_start_1_8 + P_setx_3_8 + P_setbi_5_8 + P_ify0_4_8 + P_sety_9_8 + P_ifxi_10_8 + P_setbi_11_8 + P_fordo_12_8 + wait_80 + done_80 + P_ifyi_15_8 + P_awaity_8 + P_CS_21_8 + P_setbi_24_8 = 1
inv : P_start_1_7 + P_setx_3_7 + P_setbi_5_7 + P_ify0_4_7 + P_sety_9_7 + P_ifxi_10_7 + P_setbi_11_7 + P_fordo_12_7 + wait_69 + done_69 + P_ifyi_15_7 + P_awaity_7 + P_CS_21_7 + P_setbi_24_7 = 1
inv : P_start_1_8 + P_setx_3_8 + P_setbi_5_8 + P_ify0_4_8 + P_sety_9_8 + P_ifxi_10_8 + P_setbi_11_8 + P_fordo_12_8 + wait_74 + done_74 + P_ifyi_15_8 + P_awaity_8 + P_CS_21_8 + P_setbi_24_8 = 1
inv : P_start_1_4 + P_setx_3_4 + P_setbi_5_4 + P_ify0_4_4 + P_sety_9_4 + P_ifxi_10_4 + P_setbi_11_4 + P_fordo_12_4 + wait_37 + done_37 + P_ifyi_15_4 + P_awaity_4 + P_CS_21_4 + P_setbi_24_4 = 1
inv : b_10 + b_11 = 1
inv : P_start_1_1 + P_setx_3_1 + P_setbi_5_1 + P_ify0_4_1 + P_sety_9_1 + P_ifxi_10_1 + P_setbi_11_1 + P_fordo_12_1 + wait_14 + done_14 + P_ifyi_15_1 + P_awaity_1 + P_CS_21_1 + P_setbi_24_1 = 1
inv : P_start_1_1 + P_setx_3_1 + P_setbi_5_1 + P_ify0_4_1 + P_sety_9_1 + P_ifxi_10_1 + P_setbi_11_1 + P_fordo_12_1 + wait_17 + done_17 + P_ifyi_15_1 + P_awaity_1 + P_CS_21_1 + P_setbi_24_1 = 1
inv : b_6 + b_7 = 1
inv : P_start_1_1 + P_setx_3_1 + P_setbi_5_1 + P_ify0_4_1 + P_sety_9_1 + P_ifxi_10_1 + P_setbi_11_1 + P_fordo_12_1 + wait_15 + done_15 + P_ifyi_15_1 + P_awaity_1 + P_CS_21_1 + P_setbi_24_1 = 1
inv : P_start_1_6 + P_setx_3_6 + P_setbi_5_6 + P_ify0_4_6 + P_sety_9_6 + P_ifxi_10_6 + P_setbi_11_6 + P_fordo_12_6 + wait_59 + done_59 + P_ifyi_15_6 + P_awaity_6 + P_CS_21_6 + P_setbi_24_6 = 1
inv : b_16 + b_17 = 1
inv : P_start_1_1 + P_setx_3_1 + P_setbi_5_1 + P_ify0_4_1 + P_sety_9_1 + P_ifxi_10_1 + P_setbi_11_1 + P_fordo_12_1 + wait_16 + done_16 + P_ifyi_15_1 + P_awaity_1 + P_CS_21_1 + P_setbi_24_1 = 1
inv : P_start_1_1 + P_setx_3_1 + P_setbi_5_1 + P_ify0_4_1 + P_sety_9_1 + P_ifxi_10_1 + P_setbi_11_1 + P_fordo_12_1 + P_await_13_1 + P_ifyi_15_1 + P_awaity_1 + P_CS_21_1 + P_setbi_24_1 = 1
inv : P_start_1_6 + P_setx_3_6 + P_setbi_5_6 + P_ify0_4_6 + P_sety_9_6 + P_ifxi_10_6 + P_setbi_11_6 + P_fordo_12_6 + wait_61 + done_61 + P_ifyi_15_6 + P_awaity_6 + P_CS_21_6 + P_setbi_24_6 = 1
inv : P_start_1_4 + P_setx_3_4 + P_setbi_5_4 + P_ify0_4_4 + P_sety_9_4 + P_ifxi_10_4 + P_setbi_11_4 + P_fordo_12_4 + wait_38 + done_38 + P_ifyi_15_4 + P_awaity_4 + P_CS_21_4 + P_setbi_24_4 = 1
inv : P_start_1_5 + P_setx_3_5 + P_setbi_5_5 + P_ify0_4_5 + P_sety_9_5 + P_ifxi_10_5 + P_setbi_11_5 + P_fordo_12_5 + wait_47 + done_47 + P_ifyi_15_5 + P_awaity_5 + P_CS_21_5 + P_setbi_24_5 = 1
inv : P_start_1_2 + P_setx_3_2 + P_setbi_5_2 + P_ify0_4_2 + P_sety_9_2 + P_ifxi_10_2 + P_setbi_11_2 + P_fordo_12_2 + wait_24 + done_24 + P_ifyi_15_2 + P_awaity_2 + P_CS_21_2 + P_setbi_24_2 = 1
inv : P_start_1_4 + P_setx_3_4 + P_setbi_5_4 + P_ify0_4_4 + P_sety_9_4 + P_ifxi_10_4 + P_setbi_11_4 + P_fordo_12_4 + P_await_13_4 + P_ifyi_15_4 + P_awaity_4 + P_CS_21_4 + P_setbi_24_4 = 1
inv : P_start_1_7 + P_setx_3_7 + P_setbi_5_7 + P_ify0_4_7 + P_sety_9_7 + P_ifxi_10_7 + P_setbi_11_7 + P_fordo_12_7 + wait_67 + done_67 + P_ifyi_15_7 + P_awaity_7 + P_CS_21_7 + P_setbi_24_7 = 1
inv : P_start_1_2 + P_setx_3_2 + P_setbi_5_2 + P_ify0_4_2 + P_sety_9_2 + P_ifxi_10_2 + P_setbi_11_2 + P_fordo_12_2 + wait_23 + done_23 + P_ifyi_15_2 + P_awaity_2 + P_CS_21_2 + P_setbi_24_2 = 1
inv : P_start_1_7 + P_setx_3_7 + P_setbi_5_7 + P_ify0_4_7 + P_sety_9_7 + P_ifxi_10_7 + P_setbi_11_7 + P_fordo_12_7 + wait_68 + done_68 + P_ifyi_15_7 + P_awaity_7 + P_CS_21_7 + P_setbi_24_7 = 1
inv : P_start_1_5 + P_setx_3_5 + P_setbi_5_5 + P_ify0_4_5 + P_sety_9_5 + P_ifxi_10_5 + P_setbi_11_5 + P_fordo_12_5 + wait_52 + done_52 + P_ifyi_15_5 + P_awaity_5 + P_CS_21_5 + P_setbi_24_5 = 1
inv : P_start_1_4 + P_setx_3_4 + P_setbi_5_4 + P_ify0_4_4 + P_sety_9_4 + P_ifxi_10_4 + P_setbi_11_4 + P_fordo_12_4 + wait_39 + done_39 + P_ifyi_15_4 + P_awaity_4 + P_CS_21_4 + P_setbi_24_4 = 1
inv : P_start_1_5 + P_setx_3_5 + P_setbi_5_5 + P_ify0_4_5 + P_sety_9_5 + P_ifxi_10_5 + P_setbi_11_5 + P_fordo_12_5 + wait_46 + done_46 + P_ifyi_15_5 + P_awaity_5 + P_CS_21_5 + P_setbi_24_5 = 1
inv : P_start_1_6 + P_setx_3_6 + P_setbi_5_6 + P_ify0_4_6 + P_sety_9_6 + P_ifxi_10_6 + P_setbi_11_6 + P_fordo_12_6 + wait_60 + done_60 + P_ifyi_15_6 + P_awaity_6 + P_CS_21_6 + P_setbi_24_6 = 1
inv : P_start_1_2 + P_setx_3_2 + P_setbi_5_2 + P_ify0_4_2 + P_sety_9_2 + P_ifxi_10_2 + P_setbi_11_2 + P_fordo_12_2 + wait_20 + done_20 + P_ifyi_15_2 + P_awaity_2 + P_CS_21_2 + P_setbi_24_2 = 1
inv : P_start_1_3 + P_setx_3_3 + P_setbi_5_3 + P_ify0_4_3 + P_sety_9_3 + P_ifxi_10_3 + P_setbi_11_3 + P_fordo_12_3 + wait_31 + done_31 + P_ifyi_15_3 + P_awaity_3 + P_CS_21_3 + P_setbi_24_3 = 1
inv : y_0 + y_1 + y_2 + y_3 + y_4 + y_5 + y_6 + y_7 + y_8 = 1
inv : P_start_1_8 + P_setx_3_8 + P_setbi_5_8 + P_ify0_4_8 + P_sety_9_8 + P_ifxi_10_8 + P_setbi_11_8 + P_fordo_12_8 + P_await_13_8 + P_ifyi_15_8 + P_awaity_8 + P_CS_21_8 + P_setbi_24_8 = 1
inv : P_start_1_4 + P_setx_3_4 + P_setbi_5_4 + P_ify0_4_4 + P_sety_9_4 + P_ifxi_10_4 + P_setbi_11_4 + P_fordo_12_4 + wait_42 + done_42 + P_ifyi_15_4 + P_awaity_4 + P_CS_21_4 + P_setbi_24_4 = 1
inv : P_start_1_7 + P_setx_3_7 + P_setbi_5_7 + P_ify0_4_7 + P_sety_9_7 + P_ifxi_10_7 + P_setbi_11_7 + P_fordo_12_7 + P_await_13_7 + P_ifyi_15_7 + P_awaity_7 + P_CS_21_7 + P_setbi_24_7 = 1
inv : P_start_1_8 + P_setx_3_8 + P_setbi_5_8 + P_ify0_4_8 + P_sety_9_8 + P_ifxi_10_8 + P_setbi_11_8 + P_fordo_12_8 + wait_75 + done_75 + P_ifyi_15_8 + P_awaity_8 + P_CS_21_8 + P_setbi_24_8 = 1
inv : P_start_1_6 + P_setx_3_6 + P_setbi_5_6 + P_ify0_4_6 + P_sety_9_6 + P_ifxi_10_6 + P_setbi_11_6 + P_fordo_12_6 + P_await_13_6 + P_ifyi_15_6 + P_awaity_6 + P_CS_21_6 + P_setbi_24_6 = 1
inv : P_start_1_8 + P_setx_3_8 + P_setbi_5_8 + P_ify0_4_8 + P_sety_9_8 + P_ifxi_10_8 + P_setbi_11_8 + P_fordo_12_8 + wait_73 + done_73 + P_ifyi_15_8 + P_awaity_8 + P_CS_21_8 + P_setbi_24_8 = 1
inv : P_start_1_3 + P_setx_3_3 + P_setbi_5_3 + P_ify0_4_3 + P_sety_9_3 + P_ifxi_10_3 + P_setbi_11_3 + P_fordo_12_3 + wait_33 + done_33 + P_ifyi_15_3 + P_awaity_3 + P_CS_21_3 + P_setbi_24_3 = 1
inv : P_start_1_4 + P_setx_3_4 + P_setbi_5_4 + P_ify0_4_4 + P_sety_9_4 + P_ifxi_10_4 + P_setbi_11_4 + P_fordo_12_4 + wait_44 + done_44 + P_ifyi_15_4 + P_awaity_4 + P_CS_21_4 + P_setbi_24_4 = 1
inv : b_12 + b_13 = 1
inv : P_start_1_7 + P_setx_3_7 + P_setbi_5_7 + P_ify0_4_7 + P_sety_9_7 + P_ifxi_10_7 + P_setbi_11_7 + P_fordo_12_7 + wait_64 + done_64 + P_ifyi_15_7 + P_awaity_7 + P_CS_21_7 + P_setbi_24_7 = 1
inv : b_2 + b_3 = 1
inv : P_start_1_5 + P_setx_3_5 + P_setbi_5_5 + P_ify0_4_5 + P_sety_9_5 + P_ifxi_10_5 + P_setbi_11_5 + P_fordo_12_5 + wait_53 + done_53 + P_ifyi_15_5 + P_awaity_5 + P_CS_21_5 + P_setbi_24_5 = 1
inv : P_start_1_6 + P_setx_3_6 + P_setbi_5_6 + P_ify0_4_6 + P_sety_9_6 + P_ifxi_10_6 + P_setbi_11_6 + P_fordo_12_6 + wait_62 + done_62 + P_ifyi_15_6 + P_awaity_6 + P_CS_21_6 + P_setbi_24_6 = 1
inv : P_start_1_6 + P_setx_3_6 + P_setbi_5_6 + P_ify0_4_6 + P_sety_9_6 + P_ifxi_10_6 + P_setbi_11_6 + P_fordo_12_6 + wait_55 + done_55 + P_ifyi_15_6 + P_awaity_6 + P_CS_21_6 + P_setbi_24_6 = 1
inv : P_start_1_5 + P_setx_3_5 + P_setbi_5_5 + P_ify0_4_5 + P_sety_9_5 + P_ifxi_10_5 + P_setbi_11_5 + P_fordo_12_5 + wait_51 + done_51 + P_ifyi_15_5 + P_awaity_5 + P_CS_21_5 + P_setbi_24_5 = 1
inv : P_start_1_7 + P_setx_3_7 + P_setbi_5_7 + P_ify0_4_7 + P_sety_9_7 + P_ifxi_10_7 + P_setbi_11_7 + P_fordo_12_7 + wait_66 + done_66 + P_ifyi_15_7 + P_awaity_7 + P_CS_21_7 + P_setbi_24_7 = 1
inv : P_start_1_2 + P_setx_3_2 + P_setbi_5_2 + P_ify0_4_2 + P_sety_9_2 + P_ifxi_10_2 + P_setbi_11_2 + P_fordo_12_2 + wait_22 + done_22 + P_ifyi_15_2 + P_awaity_2 + P_CS_21_2 + P_setbi_24_2 = 1
inv : P_start_1_3 + P_setx_3_3 + P_setbi_5_3 + P_ify0_4_3 + P_sety_9_3 + P_ifxi_10_3 + P_setbi_11_3 + P_fordo_12_3 + wait_35 + done_35 + P_ifyi_15_3 + P_awaity_3 + P_CS_21_3 + P_setbi_24_3 = 1
inv : P_start_1_3 + P_setx_3_3 + P_setbi_5_3 + P_ify0_4_3 + P_sety_9_3 + P_ifxi_10_3 + P_setbi_11_3 + P_fordo_12_3 + wait_29 + done_29 + P_ifyi_15_3 + P_awaity_3 + P_CS_21_3 + P_setbi_24_3 = 1
inv : P_start_1_3 + P_setx_3_3 + P_setbi_5_3 + P_ify0_4_3 + P_sety_9_3 + P_ifxi_10_3 + P_setbi_11_3 + P_fordo_12_3 + P_await_13_3 + P_ifyi_15_3 + P_awaity_3 + P_CS_21_3 + P_setbi_24_3 = 1
inv : P_start_1_4 + P_setx_3_4 + P_setbi_5_4 + P_ify0_4_4 + P_sety_9_4 + P_ifxi_10_4 + P_setbi_11_4 + P_fordo_12_4 + wait_40 + done_40 + P_ifyi_15_4 + P_awaity_4 + P_CS_21_4 + P_setbi_24_4 = 1
inv : P_start_1_8 + P_setx_3_8 + P_setbi_5_8 + P_ify0_4_8 + P_sety_9_8 + P_ifxi_10_8 + P_setbi_11_8 + P_fordo_12_8 + wait_77 + done_77 + P_ifyi_15_8 + P_awaity_8 + P_CS_21_8 + P_setbi_24_8 = 1
inv : P_start_1_1 + P_setx_3_1 + P_setbi_5_1 + P_ify0_4_1 + P_sety_9_1 + P_ifxi_10_1 + P_setbi_11_1 + P_fordo_12_1 + wait_11 + done_11 + P_ifyi_15_1 + P_awaity_1 + P_CS_21_1 + P_setbi_24_1 = 1
inv : x_0 + x_1 + x_2 + x_3 + x_4 + x_5 + x_6 + x_7 + x_8 = 1
inv : P_start_1_2 + P_setx_3_2 + P_setbi_5_2 + P_ify0_4_2 + P_sety_9_2 + P_ifxi_10_2 + P_setbi_11_2 + P_fordo_12_2 + P_await_13_2 + P_ifyi_15_2 + P_awaity_2 + P_CS_21_2 + P_setbi_24_2 = 1
inv : P_start_1_7 + P_setx_3_7 + P_setbi_5_7 + P_ify0_4_7 + P_sety_9_7 + P_ifxi_10_7 + P_setbi_11_7 + P_fordo_12_7 + wait_70 + done_70 + P_ifyi_15_7 + P_awaity_7 + P_CS_21_7 + P_setbi_24_7 = 1
inv : P_start_1_5 + P_setx_3_5 + P_setbi_5_5 + P_ify0_4_5 + P_sety_9_5 + P_ifxi_10_5 + P_setbi_11_5 + P_fordo_12_5 + wait_48 + done_48 + P_ifyi_15_5 + P_awaity_5 + P_CS_21_5 + P_setbi_24_5 = 1
inv : P_start_1_7 + P_setx_3_7 + P_setbi_5_7 + P_ify0_4_7 + P_sety_9_7 + P_ifxi_10_7 + P_setbi_11_7 + P_fordo_12_7 + wait_71 + done_71 + P_ifyi_15_7 + P_awaity_7 + P_CS_21_7 + P_setbi_24_7 = 1
inv : P_start_1_2 + P_setx_3_2 + P_setbi_5_2 + P_ify0_4_2 + P_sety_9_2 + P_ifxi_10_2 + P_setbi_11_2 + P_fordo_12_2 + wait_26 + done_26 + P_ifyi_15_2 + P_awaity_2 + P_CS_21_2 + P_setbi_24_2 = 1
inv : P_start_1_6 + P_setx_3_6 + P_setbi_5_6 + P_ify0_4_6 + P_sety_9_6 + P_ifxi_10_6 + P_setbi_11_6 + P_fordo_12_6 + wait_58 + done_58 + P_ifyi_15_6 + P_awaity_6 + P_CS_21_6 + P_setbi_24_6 = 1
inv : P_start_1_8 + P_setx_3_8 + P_setbi_5_8 + P_ify0_4_8 + P_sety_9_8 + P_ifxi_10_8 + P_setbi_11_8 + P_fordo_12_8 + wait_79 + done_79 + P_ifyi_15_8 + P_awaity_8 + P_CS_21_8 + P_setbi_24_8 = 1
inv : P_start_1_5 + P_setx_3_5 + P_setbi_5_5 + P_ify0_4_5 + P_sety_9_5 + P_ifxi_10_5 + P_setbi_11_5 + P_fordo_12_5 + wait_50 + done_50 + P_ifyi_15_5 + P_awaity_5 + P_CS_21_5 + P_setbi_24_5 = 1
inv : P_start_1_1 + P_setx_3_1 + P_setbi_5_1 + P_ify0_4_1 + P_sety_9_1 + P_ifxi_10_1 + P_setbi_11_1 + P_fordo_12_1 + wait_12 + done_12 + P_ifyi_15_1 + P_awaity_1 + P_CS_21_1 + P_setbi_24_1 = 1
inv : P_start_1_3 + P_setx_3_3 + P_setbi_5_3 + P_ify0_4_3 + P_sety_9_3 + P_ifxi_10_3 + P_setbi_11_3 + P_fordo_12_3 + wait_28 + done_28 + P_ifyi_15_3 + P_awaity_3 + P_CS_21_3 + P_setbi_24_3 = 1
inv : P_start_1_5 + P_setx_3_5 + P_setbi_5_5 + P_ify0_4_5 + P_sety_9_5 + P_ifxi_10_5 + P_setbi_11_5 + P_fordo_12_5 + P_await_13_5 + P_ifyi_15_5 + P_awaity_5 + P_CS_21_5 + P_setbi_24_5 = 1
inv : b_8 + b_9 = 1
inv : b_14 + b_15 = 1
inv : P_start_1_1 + P_setx_3_1 + P_setbi_5_1 + P_ify0_4_1 + P_sety_9_1 + P_ifxi_10_1 + P_setbi_11_1 + P_fordo_12_1 + wait_13 + done_13 + P_ifyi_15_1 + P_awaity_1 + P_CS_21_1 + P_setbi_24_1 = 1
inv : P_start_1_8 + P_setx_3_8 + P_setbi_5_8 + P_ify0_4_8 + P_sety_9_8 + P_ifxi_10_8 + P_setbi_11_8 + P_fordo_12_8 + wait_78 + done_78 + P_ifyi_15_8 + P_awaity_8 + P_CS_21_8 + P_setbi_24_8 = 1
inv : P_start_1_6 + P_setx_3_6 + P_setbi_5_6 + P_ify0_4_6 + P_sety_9_6 + P_ifxi_10_6 + P_setbi_11_6 + P_fordo_12_6 + wait_57 + done_57 + P_ifyi_15_6 + P_awaity_6 + P_CS_21_6 + P_setbi_24_6 = 1
inv : P_start_1_7 + P_setx_3_7 + P_setbi_5_7 + P_ify0_4_7 + P_sety_9_7 + P_ifxi_10_7 + P_setbi_11_7 + P_fordo_12_7 + wait_65 + done_65 + P_ifyi_15_7 + P_awaity_7 + P_CS_21_7 + P_setbi_24_7 = 1
inv : P_start_1_5 + P_setx_3_5 + P_setbi_5_5 + P_ify0_4_5 + P_sety_9_5 + P_ifxi_10_5 + P_setbi_11_5 + P_fordo_12_5 + wait_49 + done_49 + P_ifyi_15_5 + P_awaity_5 + P_CS_21_5 + P_setbi_24_5 = 1
inv : P_start_1_3 + P_setx_3_3 + P_setbi_5_3 + P_ify0_4_3 + P_sety_9_3 + P_ifxi_10_3 + P_setbi_11_3 + P_fordo_12_3 + wait_34 + done_34 + P_ifyi_15_3 + P_awaity_3 + P_CS_21_3 + P_setbi_24_3 = 1
Total of 82 invariants.
[2020-05-16 01:24:22] [INFO ] Computed 82 place invariants in 4 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 416 out of 584 initially.
// Phase 1: matrix 416 rows 266 cols
[2020-05-16 01:24:22] [INFO ] Computed 82 place invariants in 1 ms
inv : P_start_1_4 + P_setx_3_4 + P_setbi_5_4 + P_ify0_4_4 + P_sety_9_4 + P_ifxi_10_4 + P_setbi_11_4 + P_fordo_12_4 + wait_43 + done_43 + P_ifyi_15_4 + P_awaity_4 + P_CS_21_4 + P_setbi_24_4 = 1
inv : P_start_1_2 + P_setx_3_2 + P_setbi_5_2 + P_ify0_4_2 + P_sety_9_2 + P_ifxi_10_2 + P_setbi_11_2 + P_fordo_12_2 + wait_19 + done_19 + P_ifyi_15_2 + P_awaity_2 + P_CS_21_2 + P_setbi_24_2 = 1
inv : P_start_1_3 + P_setx_3_3 + P_setbi_5_3 + P_ify0_4_3 + P_sety_9_3 + P_ifxi_10_3 + P_setbi_11_3 + P_fordo_12_3 + wait_32 + done_32 + P_ifyi_15_3 + P_awaity_3 + P_CS_21_3 + P_setbi_24_3 = 1
inv : P_start_1_4 + P_setx_3_4 + P_setbi_5_4 + P_ify0_4_4 + P_sety_9_4 + P_ifxi_10_4 + P_setbi_11_4 + P_fordo_12_4 + wait_41 + done_41 + P_ifyi_15_4 + P_awaity_4 + P_CS_21_4 + P_setbi_24_4 = 1
inv : P_start_1_8 + P_setx_3_8 + P_setbi_5_8 + P_ify0_4_8 + P_sety_9_8 + P_ifxi_10_8 + P_setbi_11_8 + P_fordo_12_8 + wait_76 + done_76 + P_ifyi_15_8 + P_awaity_8 + P_CS_21_8 + P_setbi_24_8 = 1
inv : P_start_1_3 + P_setx_3_3 + P_setbi_5_3 + P_ify0_4_3 + P_sety_9_3 + P_ifxi_10_3 + P_setbi_11_3 + P_fordo_12_3 + wait_30 + done_30 + P_ifyi_15_3 + P_awaity_3 + P_CS_21_3 + P_setbi_24_3 = 1
inv : P_start_1_1 + P_setx_3_1 + P_setbi_5_1 + P_ify0_4_1 + P_sety_9_1 + P_ifxi_10_1 + P_setbi_11_1 + P_fordo_12_1 + wait_10 + done_10 + P_ifyi_15_1 + P_awaity_1 + P_CS_21_1 + P_setbi_24_1 = 1
inv : P_start_1_2 + P_setx_3_2 + P_setbi_5_2 + P_ify0_4_2 + P_sety_9_2 + P_ifxi_10_2 + P_setbi_11_2 + P_fordo_12_2 + wait_21 + done_21 + P_ifyi_15_2 + P_awaity_2 + P_CS_21_2 + P_setbi_24_2 = 1
inv : b_4 + b_5 = 1
inv : P_start_1_6 + P_setx_3_6 + P_setbi_5_6 + P_ify0_4_6 + P_sety_9_6 + P_ifxi_10_6 + P_setbi_11_6 + P_fordo_12_6 + wait_56 + done_56 + P_ifyi_15_6 + P_awaity_6 + P_CS_21_6 + P_setbi_24_6 = 1
inv : P_start_1_2 + P_setx_3_2 + P_setbi_5_2 + P_ify0_4_2 + P_sety_9_2 + P_ifxi_10_2 + P_setbi_11_2 + P_fordo_12_2 + wait_25 + done_25 + P_ifyi_15_2 + P_awaity_2 + P_CS_21_2 + P_setbi_24_2 = 1
inv : P_start_1_8 + P_setx_3_8 + P_setbi_5_8 + P_ify0_4_8 + P_sety_9_8 + P_ifxi_10_8 + P_setbi_11_8 + P_fordo_12_8 + wait_80 + done_80 + P_ifyi_15_8 + P_awaity_8 + P_CS_21_8 + P_setbi_24_8 = 1
inv : P_start_1_7 + P_setx_3_7 + P_setbi_5_7 + P_ify0_4_7 + P_sety_9_7 + P_ifxi_10_7 + P_setbi_11_7 + P_fordo_12_7 + wait_69 + done_69 + P_ifyi_15_7 + P_awaity_7 + P_CS_21_7 + P_setbi_24_7 = 1
inv : P_start_1_8 + P_setx_3_8 + P_setbi_5_8 + P_ify0_4_8 + P_sety_9_8 + P_ifxi_10_8 + P_setbi_11_8 + P_fordo_12_8 + wait_74 + done_74 + P_ifyi_15_8 + P_awaity_8 + P_CS_21_8 + P_setbi_24_8 = 1
inv : P_start_1_4 + P_setx_3_4 + P_setbi_5_4 + P_ify0_4_4 + P_sety_9_4 + P_ifxi_10_4 + P_setbi_11_4 + P_fordo_12_4 + wait_37 + done_37 + P_ifyi_15_4 + P_awaity_4 + P_CS_21_4 + P_setbi_24_4 = 1
inv : b_10 + b_11 = 1
inv : P_start_1_1 + P_setx_3_1 + P_setbi_5_1 + P_ify0_4_1 + P_sety_9_1 + P_ifxi_10_1 + P_setbi_11_1 + P_fordo_12_1 + wait_14 + done_14 + P_ifyi_15_1 + P_awaity_1 + P_CS_21_1 + P_setbi_24_1 = 1
inv : P_start_1_1 + P_setx_3_1 + P_setbi_5_1 + P_ify0_4_1 + P_sety_9_1 + P_ifxi_10_1 + P_setbi_11_1 + P_fordo_12_1 + wait_17 + done_17 + P_ifyi_15_1 + P_awaity_1 + P_CS_21_1 + P_setbi_24_1 = 1
inv : b_6 + b_7 = 1
inv : P_start_1_1 + P_setx_3_1 + P_setbi_5_1 + P_ify0_4_1 + P_sety_9_1 + P_ifxi_10_1 + P_setbi_11_1 + P_fordo_12_1 + wait_15 + done_15 + P_ifyi_15_1 + P_awaity_1 + P_CS_21_1 + P_setbi_24_1 = 1
inv : P_start_1_6 + P_setx_3_6 + P_setbi_5_6 + P_ify0_4_6 + P_sety_9_6 + P_ifxi_10_6 + P_setbi_11_6 + P_fordo_12_6 + wait_59 + done_59 + P_ifyi_15_6 + P_awaity_6 + P_CS_21_6 + P_setbi_24_6 = 1
inv : b_16 + b_17 = 1
inv : P_start_1_1 + P_setx_3_1 + P_setbi_5_1 + P_ify0_4_1 + P_sety_9_1 + P_ifxi_10_1 + P_setbi_11_1 + P_fordo_12_1 + wait_16 + done_16 + P_ifyi_15_1 + P_awaity_1 + P_CS_21_1 + P_setbi_24_1 = 1
inv : P_start_1_1 + P_setx_3_1 + P_setbi_5_1 + P_ify0_4_1 + P_sety_9_1 + P_ifxi_10_1 + P_setbi_11_1 + P_fordo_12_1 + P_await_13_1 + P_ifyi_15_1 + P_awaity_1 + P_CS_21_1 + P_setbi_24_1 = 1
inv : P_start_1_6 + P_setx_3_6 + P_setbi_5_6 + P_ify0_4_6 + P_sety_9_6 + P_ifxi_10_6 + P_setbi_11_6 + P_fordo_12_6 + wait_61 + done_61 + P_ifyi_15_6 + P_awaity_6 + P_CS_21_6 + P_setbi_24_6 = 1
inv : P_start_1_4 + P_setx_3_4 + P_setbi_5_4 + P_ify0_4_4 + P_sety_9_4 + P_ifxi_10_4 + P_setbi_11_4 + P_fordo_12_4 + wait_38 + done_38 + P_ifyi_15_4 + P_awaity_4 + P_CS_21_4 + P_setbi_24_4 = 1
inv : P_start_1_5 + P_setx_3_5 + P_setbi_5_5 + P_ify0_4_5 + P_sety_9_5 + P_ifxi_10_5 + P_setbi_11_5 + P_fordo_12_5 + wait_47 + done_47 + P_ifyi_15_5 + P_awaity_5 + P_CS_21_5 + P_setbi_24_5 = 1
inv : P_start_1_2 + P_setx_3_2 + P_setbi_5_2 + P_ify0_4_2 + P_sety_9_2 + P_ifxi_10_2 + P_setbi_11_2 + P_fordo_12_2 + wait_24 + done_24 + P_ifyi_15_2 + P_awaity_2 + P_CS_21_2 + P_setbi_24_2 = 1
inv : P_start_1_4 + P_setx_3_4 + P_setbi_5_4 + P_ify0_4_4 + P_sety_9_4 + P_ifxi_10_4 + P_setbi_11_4 + P_fordo_12_4 + P_await_13_4 + P_ifyi_15_4 + P_awaity_4 + P_CS_21_4 + P_setbi_24_4 = 1
inv : P_start_1_7 + P_setx_3_7 + P_setbi_5_7 + P_ify0_4_7 + P_sety_9_7 + P_ifxi_10_7 + P_setbi_11_7 + P_fordo_12_7 + wait_67 + done_67 + P_ifyi_15_7 + P_awaity_7 + P_CS_21_7 + P_setbi_24_7 = 1
inv : P_start_1_2 + P_setx_3_2 + P_setbi_5_2 + P_ify0_4_2 + P_sety_9_2 + P_ifxi_10_2 + P_setbi_11_2 + P_fordo_12_2 + wait_23 + done_23 + P_ifyi_15_2 + P_awaity_2 + P_CS_21_2 + P_setbi_24_2 = 1
inv : P_start_1_7 + P_setx_3_7 + P_setbi_5_7 + P_ify0_4_7 + P_sety_9_7 + P_ifxi_10_7 + P_setbi_11_7 + P_fordo_12_7 + wait_68 + done_68 + P_ifyi_15_7 + P_awaity_7 + P_CS_21_7 + P_setbi_24_7 = 1
inv : P_start_1_5 + P_setx_3_5 + P_setbi_5_5 + P_ify0_4_5 + P_sety_9_5 + P_ifxi_10_5 + P_setbi_11_5 + P_fordo_12_5 + wait_52 + done_52 + P_ifyi_15_5 + P_awaity_5 + P_CS_21_5 + P_setbi_24_5 = 1
inv : P_start_1_4 + P_setx_3_4 + P_setbi_5_4 + P_ify0_4_4 + P_sety_9_4 + P_ifxi_10_4 + P_setbi_11_4 + P_fordo_12_4 + wait_39 + done_39 + P_ifyi_15_4 + P_awaity_4 + P_CS_21_4 + P_setbi_24_4 = 1
inv : P_start_1_5 + P_setx_3_5 + P_setbi_5_5 + P_ify0_4_5 + P_sety_9_5 + P_ifxi_10_5 + P_setbi_11_5 + P_fordo_12_5 + wait_46 + done_46 + P_ifyi_15_5 + P_awaity_5 + P_CS_21_5 + P_setbi_24_5 = 1
inv : P_start_1_6 + P_setx_3_6 + P_setbi_5_6 + P_ify0_4_6 + P_sety_9_6 + P_ifxi_10_6 + P_setbi_11_6 + P_fordo_12_6 + wait_60 + done_60 + P_ifyi_15_6 + P_awaity_6 + P_CS_21_6 + P_setbi_24_6 = 1
inv : P_start_1_2 + P_setx_3_2 + P_setbi_5_2 + P_ify0_4_2 + P_sety_9_2 + P_ifxi_10_2 + P_setbi_11_2 + P_fordo_12_2 + wait_20 + done_20 + P_ifyi_15_2 + P_awaity_2 + P_CS_21_2 + P_setbi_24_2 = 1
inv : P_start_1_3 + P_setx_3_3 + P_setbi_5_3 + P_ify0_4_3 + P_sety_9_3 + P_ifxi_10_3 + P_setbi_11_3 + P_fordo_12_3 + wait_31 + done_31 + P_ifyi_15_3 + P_awaity_3 + P_CS_21_3 + P_setbi_24_3 = 1
inv : y_0 + y_1 + y_2 + y_3 + y_4 + y_5 + y_6 + y_7 + y_8 = 1
inv : P_start_1_8 + P_setx_3_8 + P_setbi_5_8 + P_ify0_4_8 + P_sety_9_8 + P_ifxi_10_8 + P_setbi_11_8 + P_fordo_12_8 + P_await_13_8 + P_ifyi_15_8 + P_awaity_8 + P_CS_21_8 + P_setbi_24_8 = 1
inv : P_start_1_4 + P_setx_3_4 + P_setbi_5_4 + P_ify0_4_4 + P_sety_9_4 + P_ifxi_10_4 + P_setbi_11_4 + P_fordo_12_4 + wait_42 + done_42 + P_ifyi_15_4 + P_awaity_4 + P_CS_21_4 + P_setbi_24_4 = 1
inv : P_start_1_7 + P_setx_3_7 + P_setbi_5_7 + P_ify0_4_7 + P_sety_9_7 + P_ifxi_10_7 + P_setbi_11_7 + P_fordo_12_7 + P_await_13_7 + P_ifyi_15_7 + P_awaity_7 + P_CS_21_7 + P_setbi_24_7 = 1
inv : P_start_1_8 + P_setx_3_8 + P_setbi_5_8 + P_ify0_4_8 + P_sety_9_8 + P_ifxi_10_8 + P_setbi_11_8 + P_fordo_12_8 + wait_75 + done_75 + P_ifyi_15_8 + P_awaity_8 + P_CS_21_8 + P_setbi_24_8 = 1
inv : P_start_1_6 + P_setx_3_6 + P_setbi_5_6 + P_ify0_4_6 + P_sety_9_6 + P_ifxi_10_6 + P_setbi_11_6 + P_fordo_12_6 + P_await_13_6 + P_ifyi_15_6 + P_awaity_6 + P_CS_21_6 + P_setbi_24_6 = 1
inv : P_start_1_8 + P_setx_3_8 + P_setbi_5_8 + P_ify0_4_8 + P_sety_9_8 + P_ifxi_10_8 + P_setbi_11_8 + P_fordo_12_8 + wait_73 + done_73 + P_ifyi_15_8 + P_awaity_8 + P_CS_21_8 + P_setbi_24_8 = 1
inv : P_start_1_3 + P_setx_3_3 + P_setbi_5_3 + P_ify0_4_3 + P_sety_9_3 + P_ifxi_10_3 + P_setbi_11_3 + P_fordo_12_3 + wait_33 + done_33 + P_ifyi_15_3 + P_awaity_3 + P_CS_21_3 + P_setbi_24_3 = 1
inv : P_start_1_4 + P_setx_3_4 + P_setbi_5_4 + P_ify0_4_4 + P_sety_9_4 + P_ifxi_10_4 + P_setbi_11_4 + P_fordo_12_4 + wait_44 + done_44 + P_ifyi_15_4 + P_awaity_4 + P_CS_21_4 + P_setbi_24_4 = 1
inv : b_12 + b_13 = 1
inv : P_start_1_7 + P_setx_3_7 + P_setbi_5_7 + P_ify0_4_7 + P_sety_9_7 + P_ifxi_10_7 + P_setbi_11_7 + P_fordo_12_7 + wait_64 + done_64 + P_ifyi_15_7 + P_awaity_7 + P_CS_21_7 + P_setbi_24_7 = 1
inv : b_2 + b_3 = 1
inv : P_start_1_5 + P_setx_3_5 + P_setbi_5_5 + P_ify0_4_5 + P_sety_9_5 + P_ifxi_10_5 + P_setbi_11_5 + P_fordo_12_5 + wait_53 + done_53 + P_ifyi_15_5 + P_awaity_5 + P_CS_21_5 + P_setbi_24_5 = 1
inv : P_start_1_6 + P_setx_3_6 + P_setbi_5_6 + P_ify0_4_6 + P_sety_9_6 + P_ifxi_10_6 + P_setbi_11_6 + P_fordo_12_6 + wait_62 + done_62 + P_ifyi_15_6 + P_awaity_6 + P_CS_21_6 + P_setbi_24_6 = 1
inv : P_start_1_6 + P_setx_3_6 + P_setbi_5_6 + P_ify0_4_6 + P_sety_9_6 + P_ifxi_10_6 + P_setbi_11_6 + P_fordo_12_6 + wait_55 + done_55 + P_ifyi_15_6 + P_awaity_6 + P_CS_21_6 + P_setbi_24_6 = 1
inv : P_start_1_5 + P_setx_3_5 + P_setbi_5_5 + P_ify0_4_5 + P_sety_9_5 + P_ifxi_10_5 + P_setbi_11_5 + P_fordo_12_5 + wait_51 + done_51 + P_ifyi_15_5 + P_awaity_5 + P_CS_21_5 + P_setbi_24_5 = 1
inv : P_start_1_7 + P_setx_3_7 + P_setbi_5_7 + P_ify0_4_7 + P_sety_9_7 + P_ifxi_10_7 + P_setbi_11_7 + P_fordo_12_7 + wait_66 + done_66 + P_ifyi_15_7 + P_awaity_7 + P_CS_21_7 + P_setbi_24_7 = 1
inv : P_start_1_2 + P_setx_3_2 + P_setbi_5_2 + P_ify0_4_2 + P_sety_9_2 + P_ifxi_10_2 + P_setbi_11_2 + P_fordo_12_2 + wait_22 + done_22 + P_ifyi_15_2 + P_awaity_2 + P_CS_21_2 + P_setbi_24_2 = 1
inv : P_start_1_3 + P_setx_3_3 + P_setbi_5_3 + P_ify0_4_3 + P_sety_9_3 + P_ifxi_10_3 + P_setbi_11_3 + P_fordo_12_3 + wait_35 + done_35 + P_ifyi_15_3 + P_awaity_3 + P_CS_21_3 + P_setbi_24_3 = 1
inv : P_start_1_3 + P_setx_3_3 + P_setbi_5_3 + P_ify0_4_3 + P_sety_9_3 + P_ifxi_10_3 + P_setbi_11_3 + P_fordo_12_3 + wait_29 + done_29 + P_ifyi_15_3 + P_awaity_3 + P_CS_21_3 + P_setbi_24_3 = 1
inv : P_start_1_3 + P_setx_3_3 + P_setbi_5_3 + P_ify0_4_3 + P_sety_9_3 + P_ifxi_10_3 + P_setbi_11_3 + P_fordo_12_3 + P_await_13_3 + P_ifyi_15_3 + P_awaity_3 + P_CS_21_3 + P_setbi_24_3 = 1
inv : P_start_1_4 + P_setx_3_4 + P_setbi_5_4 + P_ify0_4_4 + P_sety_9_4 + P_ifxi_10_4 + P_setbi_11_4 + P_fordo_12_4 + wait_40 + done_40 + P_ifyi_15_4 + P_awaity_4 + P_CS_21_4 + P_setbi_24_4 = 1
inv : P_start_1_8 + P_setx_3_8 + P_setbi_5_8 + P_ify0_4_8 + P_sety_9_8 + P_ifxi_10_8 + P_setbi_11_8 + P_fordo_12_8 + wait_77 + done_77 + P_ifyi_15_8 + P_awaity_8 + P_CS_21_8 + P_setbi_24_8 = 1
inv : P_start_1_1 + P_setx_3_1 + P_setbi_5_1 + P_ify0_4_1 + P_sety_9_1 + P_ifxi_10_1 + P_setbi_11_1 + P_fordo_12_1 + wait_11 + done_11 + P_ifyi_15_1 + P_awaity_1 + P_CS_21_1 + P_setbi_24_1 = 1
inv : x_0 + x_1 + x_2 + x_3 + x_4 + x_5 + x_6 + x_7 + x_8 = 1
inv : P_start_1_2 + P_setx_3_2 + P_setbi_5_2 + P_ify0_4_2 + P_sety_9_2 + P_ifxi_10_2 + P_setbi_11_2 + P_fordo_12_2 + P_await_13_2 + P_ifyi_15_2 + P_awaity_2 + P_CS_21_2 + P_setbi_24_2 = 1
inv : P_start_1_7 + P_setx_3_7 + P_setbi_5_7 + P_ify0_4_7 + P_sety_9_7 + P_ifxi_10_7 + P_setbi_11_7 + P_fordo_12_7 + wait_70 + done_70 + P_ifyi_15_7 + P_awaity_7 + P_CS_21_7 + P_setbi_24_7 = 1
inv : P_start_1_5 + P_setx_3_5 + P_setbi_5_5 + P_ify0_4_5 + P_sety_9_5 + P_ifxi_10_5 + P_setbi_11_5 + P_fordo_12_5 + wait_48 + done_48 + P_ifyi_15_5 + P_awaity_5 + P_CS_21_5 + P_setbi_24_5 = 1
inv : P_start_1_7 + P_setx_3_7 + P_setbi_5_7 + P_ify0_4_7 + P_sety_9_7 + P_ifxi_10_7 + P_setbi_11_7 + P_fordo_12_7 + wait_71 + done_71 + P_ifyi_15_7 + P_awaity_7 + P_CS_21_7 + P_setbi_24_7 = 1
inv : P_start_1_2 + P_setx_3_2 + P_setbi_5_2 + P_ify0_4_2 + P_sety_9_2 + P_ifxi_10_2 + P_setbi_11_2 + P_fordo_12_2 + wait_26 + done_26 + P_ifyi_15_2 + P_awaity_2 + P_CS_21_2 + P_setbi_24_2 = 1
inv : P_start_1_6 + P_setx_3_6 + P_setbi_5_6 + P_ify0_4_6 + P_sety_9_6 + P_ifxi_10_6 + P_setbi_11_6 + P_fordo_12_6 + wait_58 + done_58 + P_ifyi_15_6 + P_awaity_6 + P_CS_21_6 + P_setbi_24_6 = 1
inv : P_start_1_8 + P_setx_3_8 + P_setbi_5_8 + P_ify0_4_8 + P_sety_9_8 + P_ifxi_10_8 + P_setbi_11_8 + P_fordo_12_8 + wait_79 + done_79 + P_ifyi_15_8 + P_awaity_8 + P_CS_21_8 + P_setbi_24_8 = 1
inv : P_start_1_5 + P_setx_3_5 + P_setbi_5_5 + P_ify0_4_5 + P_sety_9_5 + P_ifxi_10_5 + P_setbi_11_5 + P_fordo_12_5 + wait_50 + done_50 + P_ifyi_15_5 + P_awaity_5 + P_CS_21_5 + P_setbi_24_5 = 1
inv : P_start_1_1 + P_setx_3_1 + P_setbi_5_1 + P_ify0_4_1 + P_sety_9_1 + P_ifxi_10_1 + P_setbi_11_1 + P_fordo_12_1 + wait_12 + done_12 + P_ifyi_15_1 + P_awaity_1 + P_CS_21_1 + P_setbi_24_1 = 1
inv : P_start_1_3 + P_setx_3_3 + P_setbi_5_3 + P_ify0_4_3 + P_sety_9_3 + P_ifxi_10_3 + P_setbi_11_3 + P_fordo_12_3 + wait_28 + done_28 + P_ifyi_15_3 + P_awaity_3 + P_CS_21_3 + P_setbi_24_3 = 1
inv : P_start_1_5 + P_setx_3_5 + P_setbi_5_5 + P_ify0_4_5 + P_sety_9_5 + P_ifxi_10_5 + P_setbi_11_5 + P_fordo_12_5 + P_await_13_5 + P_ifyi_15_5 + P_awaity_5 + P_CS_21_5 + P_setbi_24_5 = 1
inv : b_8 + b_9 = 1
inv : b_14 + b_15 = 1
inv : P_start_1_1 + P_setx_3_1 + P_setbi_5_1 + P_ify0_4_1 + P_sety_9_1 + P_ifxi_10_1 + P_setbi_11_1 + P_fordo_12_1 + wait_13 + done_13 + P_ifyi_15_1 + P_awaity_1 + P_CS_21_1 + P_setbi_24_1 = 1
inv : P_start_1_8 + P_setx_3_8 + P_setbi_5_8 + P_ify0_4_8 + P_sety_9_8 + P_ifxi_10_8 + P_setbi_11_8 + P_fordo_12_8 + wait_78 + done_78 + P_ifyi_15_8 + P_awaity_8 + P_CS_21_8 + P_setbi_24_8 = 1
inv : P_start_1_6 + P_setx_3_6 + P_setbi_5_6 + P_ify0_4_6 + P_sety_9_6 + P_ifxi_10_6 + P_setbi_11_6 + P_fordo_12_6 + wait_57 + done_57 + P_ifyi_15_6 + P_awaity_6 + P_CS_21_6 + P_setbi_24_6 = 1
inv : P_start_1_7 + P_setx_3_7 + P_setbi_5_7 + P_ify0_4_7 + P_sety_9_7 + P_ifxi_10_7 + P_setbi_11_7 + P_fordo_12_7 + wait_65 + done_65 + P_ifyi_15_7 + P_awaity_7 + P_CS_21_7 + P_setbi_24_7 = 1
inv : P_start_1_5 + P_setx_3_5 + P_setbi_5_5 + P_ify0_4_5 + P_sety_9_5 + P_ifxi_10_5 + P_setbi_11_5 + P_fordo_12_5 + wait_49 + done_49 + P_ifyi_15_5 + P_awaity_5 + P_CS_21_5 + P_setbi_24_5 = 1
inv : P_start_1_3 + P_setx_3_3 + P_setbi_5_3 + P_ify0_4_3 + P_sety_9_3 + P_ifxi_10_3 + P_setbi_11_3 + P_fordo_12_3 + wait_34 + done_34 + P_ifyi_15_3 + P_awaity_3 + P_CS_21_3 + P_setbi_24_3 = 1
Total of 82 invariants.
[2020-05-16 01:24:22] [INFO ] Computed 82 place invariants in 3 ms
[2020-05-16 01:24:22] [INFO ] Flatten gal took : 577 ms
[2020-05-16 01:24:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 529 labels/synchronizations in 69 ms.
[2020-05-16 01:24:22] [INFO ] BMC solution for property LamportFastMutEx-COL-8-ReachabilityCardinality-02(UNSAT) depth K=2 took 737 ms
[2020-05-16 01:24:22] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityCardinality.pnml.gal : 42 ms
[2020-05-16 01:24:23] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityCardinality.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/ReachabilityCardinality.pnml.gal, -t, CGAL, -reachable-file, ReachabilityCardinality.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/ReachabilityCardinality.pnml.gal -t CGAL -reachable-file ReachabilityCardinality.prop --nowitness --gen-order FOLLOW
Loading property file ReachabilityCardinality.prop.
Read [invariant] property : LamportFastMutEx-COL-8-ReachabilityCardinality-02 with value :((((((((((gu84.P_CS_21_1+gu84.P_CS_21_2)+gu84.P_CS_21_3)+gu84.P_CS_21_4)+gu84.P_CS_21_5)+gu84.P_CS_21_6)+gu84.P_CS_21_7)+gu84.P_CS_21_8)>(((((((gu84.P_await_13_1+gu84.P_await_13_2)+gu84.P_await_13_3)+gu84.P_await_13_4)+gu84.P_await_13_5)+gu84.P_await_13_6)+gu84.P_await_13_7)+gu84.P_await_13_8))||((((((((gi0.gi0.gi0.gu17.P_setbi_11_1+gi0.gi0.gi0.gu17.P_setbi_11_2)+gi0.gi0.gi0.gu17.P_setbi_11_3)+gi0.gi0.gi0.gu17.P_setbi_11_4)+gi0.gi0.gi0.gu17.P_setbi_11_5)+gi0.gi0.gi0.gu17.P_setbi_11_6)+gi0.gi0.gi0.gu17.P_setbi_11_7)+gi0.gi0.gi0.gu17.P_setbi_11_8)<2))||((((((((gu84.P_CS_21_1+gu84.P_CS_21_2)+gu84.P_CS_21_3)+gu84.P_CS_21_4)+gu84.P_CS_21_5)+gu84.P_CS_21_6)+gu84.P_CS_21_7)+gu84.P_CS_21_8)<3))
Read [invariant] property : LamportFastMutEx-COL-8-ReachabilityCardinality-12 with value :(((((((((gu83.P_start_1_1+gu83.P_start_1_2)+gu83.P_start_1_3)+gu83.P_start_1_4)+gu83.P_start_1_5)+gu83.P_start_1_6)+gu83.P_start_1_7)+gu83.P_start_1_8)<=(((((((gu83.P_awaity_1+gu83.P_awaity_2)+gu83.P_awaity_3)+gu83.P_awaity_4)+gu83.P_awaity_5)+gu83.P_awaity_6)+gu83.P_awaity_7)+gu83.P_awaity_8))||((((((((gu84.P_CS_21_1+gu84.P_CS_21_2)+gu84.P_CS_21_3)+gu84.P_CS_21_4)+gu84.P_CS_21_5)+gu84.P_CS_21_6)+gu84.P_CS_21_7)+gu84.P_CS_21_8)<2))
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
[2020-05-16 01:24:23] [INFO ] Proved 266 variables to be positive in 1195 ms
[2020-05-16 01:24:23] [INFO ] Computing symmetric may disable matrix : 584 transitions.
[2020-05-16 01:24:23] [INFO ] Computation of disable matrix completed :0/584 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
SDD proceeding with computation, new max is 1024
[2020-05-16 01:24:23] [INFO ] Computation of Complete disable matrix. took 99 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-16 01:24:23] [INFO ] Computing symmetric may enable matrix : 584 transitions.
[2020-05-16 01:24:23] [INFO ] Computation of Complete enable matrix. took 32 ms. Total solver calls (SAT/UNSAT): 0(0/0)
SDD proceeding with computation, new max is 2048
SDD proceeding with computation, new max is 4096
[2020-05-16 01:24:24] [INFO ] Proved 266 variables to be positive in 2157 ms
[2020-05-16 01:24:24] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesLamportFastMutEx-COL-8-ReachabilityCardinality-02
[2020-05-16 01:24:24] [INFO ] KInduction solution for property LamportFastMutEx-COL-8-ReachabilityCardinality-02(SAT) depth K=0 took 23 ms
[2020-05-16 01:24:24] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesLamportFastMutEx-COL-8-ReachabilityCardinality-12
[2020-05-16 01:24:24] [INFO ] KInduction solution for property LamportFastMutEx-COL-8-ReachabilityCardinality-12(SAT) depth K=0 took 8 ms
[2020-05-16 01:24:24] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesLamportFastMutEx-COL-8-ReachabilityCardinality-02
[2020-05-16 01:24:24] [INFO ] KInduction solution for property LamportFastMutEx-COL-8-ReachabilityCardinality-02(SAT) depth K=1 took 96 ms
[2020-05-16 01:24:24] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesLamportFastMutEx-COL-8-ReachabilityCardinality-12
[2020-05-16 01:24:24] [INFO ] KInduction solution for property LamportFastMutEx-COL-8-ReachabilityCardinality-12(SAT) depth K=1 took 53 ms
SDD proceeding with computation, new max is 8192
[2020-05-16 01:24:25] [INFO ] BMC solution for property LamportFastMutEx-COL-8-ReachabilityCardinality-12(UNSAT) depth K=2 took 2569 ms
[2020-05-16 01:24:26] [INFO ] Computing symmetric co enabling matrix : 584 transitions.
[2020-05-16 01:24:26] [INFO ] Computation of co-enabling matrix(1/584) took 137 ms. Total solver calls (SAT/UNSAT): 158(14/144)
SDD proceeding with computation, new max is 16384
[2020-05-16 01:24:29] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesLamportFastMutEx-COL-8-ReachabilityCardinality-02
[2020-05-16 01:24:29] [INFO ] KInduction solution for property LamportFastMutEx-COL-8-ReachabilityCardinality-02(SAT) depth K=2 took 4623 ms
[2020-05-16 01:24:29] [INFO ] Computation of co-enabling matrix(27/584) took 3168 ms. Total solver calls (SAT/UNSAT): 3542(190/3352)
[2020-05-16 01:24:31] [INFO ] BMC solution for property LamportFastMutEx-COL-8-ReachabilityCardinality-02(UNSAT) depth K=3 took 6017 ms
[2020-05-16 01:24:31] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesLamportFastMutEx-COL-8-ReachabilityCardinality-12
[2020-05-16 01:24:31] [INFO ] KInduction solution for property LamportFastMutEx-COL-8-ReachabilityCardinality-12(SAT) depth K=2 took 2601 ms
[2020-05-16 01:24:32] [INFO ] Computation of co-enabling matrix(44/584) took 6221 ms. Total solver calls (SAT/UNSAT): 6534(368/6166)
SDD proceeding with computation, new max is 32768
[2020-05-16 01:24:36] [INFO ] Computation of co-enabling matrix(59/584) took 9855 ms. Total solver calls (SAT/UNSAT): 8934(526/8408)
[2020-05-16 01:24:37] [INFO ] BMC solution for property LamportFastMutEx-COL-8-ReachabilityCardinality-12(UNSAT) depth K=3 took 6323 ms
[2020-05-16 01:24:39] [INFO ] Computation of co-enabling matrix(64/584) took 13228 ms. Total solver calls (SAT/UNSAT): 9684(574/9110)
SDD proceeding with computation, new max is 65536
[2020-05-16 01:24:42] [INFO ] Computation of co-enabling matrix(69/584) took 16350 ms. Total solver calls (SAT/UNSAT): 10409(629/9780)
[2020-05-16 01:24:45] [INFO ] Computation of co-enabling matrix(85/584) took 19463 ms. Total solver calls (SAT/UNSAT): 12561(797/11764)
[2020-05-16 01:24:49] [INFO ] Computation of co-enabling matrix(97/584) took 22677 ms. Total solver calls (SAT/UNSAT): 15967(1090/14877)
[2020-05-16 01:24:52] [INFO ] Computation of co-enabling matrix(104/584) took 26236 ms. Total solver calls (SAT/UNSAT): 18116(1278/16838)
[2020-05-16 01:24:56] [INFO ] Computation of co-enabling matrix(110/584) took 29490 ms. Total solver calls (SAT/UNSAT): 19919(1434/18485)
SDD proceeding with computation, new max is 131072
[2020-05-16 01:24:59] [INFO ] Computation of co-enabling matrix(121/584) took 33408 ms. Total solver calls (SAT/UNSAT): 23131(1708/21423)
[2020-05-16 01:25:03] [INFO ] Computation of co-enabling matrix(127/584) took 36553 ms. Total solver calls (SAT/UNSAT): 24832(1852/22980)
[2020-05-16 01:25:06] [INFO ] Computation of co-enabling matrix(131/584) took 39779 ms. Total solver calls (SAT/UNSAT): 25946(1944/24002)
[2020-05-16 01:25:09] [INFO ] Computation of co-enabling matrix(140/584) took 42821 ms. Total solver calls (SAT/UNSAT): 28394(2146/26248)
[2020-05-16 01:25:12] [INFO ] Computation of co-enabling matrix(146/584) took 45955 ms. Total solver calls (SAT/UNSAT): 29981(2275/27706)
[2020-05-16 01:25:15] [INFO ] Computation of co-enabling matrix(171/584) took 48974 ms. Total solver calls (SAT/UNSAT): 33238(2570/30668)
[2020-05-16 01:25:16] [INFO ] BMC solution for property LamportFastMutEx-COL-8-ReachabilityCardinality-02(UNSAT) depth K=4 took 38523 ms
[2020-05-16 01:25:18] [INFO ] Computation of co-enabling matrix(182/584) took 52168 ms. Total solver calls (SAT/UNSAT): 35933(2863/33070)
[2020-05-16 01:25:21] [INFO ] Computation of co-enabling matrix(207/584) took 55227 ms. Total solver calls (SAT/UNSAT): 41608(3367/38241)
[2020-05-16 01:25:25] [INFO ] Computation of co-enabling matrix(227/584) took 59000 ms. Total solver calls (SAT/UNSAT): 45698(3722/41976)
[2020-05-16 01:25:29] [INFO ] Computation of co-enabling matrix(231/584) took 62648 ms. Total solver calls (SAT/UNSAT): 46468(3787/42681)
[2020-05-16 01:25:32] [INFO ] Computation of co-enabling matrix(236/584) took 66248 ms. Total solver calls (SAT/UNSAT): 47408(3867/43541)
[2020-05-16 01:25:36] [INFO ] Computation of co-enabling matrix(241/584) took 69796 ms. Total solver calls (SAT/UNSAT): 48323(3943/44380)
[2020-05-16 01:25:39] [INFO ] Computation of co-enabling matrix(246/584) took 73264 ms. Total solver calls (SAT/UNSAT): 49213(4018/45195)
[2020-05-16 01:25:43] [INFO ] Computation of co-enabling matrix(251/584) took 76740 ms. Total solver calls (SAT/UNSAT): 50078(4088/45990)
[2020-05-16 01:25:46] [INFO ] Computation of co-enabling matrix(257/584) took 80232 ms. Total solver calls (SAT/UNSAT): 50957(4157/46800)
SDD proceeding with computation, new max is 262144
[2020-05-16 01:25:50] [INFO ] Computation of co-enabling matrix(268/584) took 83492 ms. Total solver calls (SAT/UNSAT): 52013(4197/47816)
[2020-05-16 01:25:53] [INFO ] Computation of co-enabling matrix(278/584) took 86628 ms. Total solver calls (SAT/UNSAT): 52868(4235/48633)
[2020-05-16 01:25:54] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesLamportFastMutEx-COL-8-ReachabilityCardinality-02
[2020-05-16 01:25:54] [INFO ] KInduction solution for property LamportFastMutEx-COL-8-ReachabilityCardinality-02(SAT) depth K=3 took 82489 ms
[2020-05-16 01:25:56] [INFO ] Computation of co-enabling matrix(287/584) took 89653 ms. Total solver calls (SAT/UNSAT): 53552(4274/49278)
[2020-05-16 01:25:59] [INFO ] Computation of co-enabling matrix(299/584) took 92764 ms. Total solver calls (SAT/UNSAT): 54338(4319/50019)
[2020-05-16 01:26:00] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesLamportFastMutEx-COL-8-ReachabilityCardinality-12
[2020-05-16 01:26:01] [INFO ] KInduction solution for property LamportFastMutEx-COL-8-ReachabilityCardinality-12(SAT) depth K=3 took 6669 ms
[2020-05-16 01:26:02] [INFO ] Computation of co-enabling matrix(312/584) took 95870 ms. Total solver calls (SAT/UNSAT): 55027(4368/50659)
[2020-05-16 01:26:05] [INFO ] Computation of co-enabling matrix(324/584) took 98952 ms. Total solver calls (SAT/UNSAT): 55523(4431/51092)
[2020-05-16 01:26:08] [INFO ] Computation of co-enabling matrix(337/584) took 102136 ms. Total solver calls (SAT/UNSAT): 56004(4452/51552)
[2020-05-16 01:26:09] [INFO ] BMC solution for property LamportFastMutEx-COL-8-ReachabilityCardinality-12(UNSAT) depth K=4 took 53074 ms
[2020-05-16 01:26:11] [INFO ] Computation of co-enabling matrix(379/584) took 105175 ms. Total solver calls (SAT/UNSAT): 57362(4806/52556)
[2020-05-16 01:26:14] [INFO ] Computation of co-enabling matrix(429/584) took 108294 ms. Total solver calls (SAT/UNSAT): 60273(5147/55126)
[2020-05-16 01:26:17] [INFO ] Computation of co-enabling matrix(448/584) took 111438 ms. Total solver calls (SAT/UNSAT): 62610(5372/57238)
[2020-05-16 01:26:21] [INFO ] Computation of co-enabling matrix(466/584) took 115048 ms. Total solver calls (SAT/UNSAT): 64491(5549/58942)
[2020-05-16 01:26:24] [INFO ] Computation of co-enabling matrix(499/584) took 118106 ms. Total solver calls (SAT/UNSAT): 66678(5740/60938)
[2020-05-16 01:26:27] [INFO ] Computation of co-enabling matrix(514/584) took 121116 ms. Total solver calls (SAT/UNSAT): 67608(5834/61774)
[2020-05-16 01:26:30] [INFO ] Computation of co-enabling matrix(525/584) took 124235 ms. Total solver calls (SAT/UNSAT): 68147(5886/62261)
[2020-05-16 01:26:33] [INFO ] Computation of co-enabling matrix(545/584) took 127307 ms. Total solver calls (SAT/UNSAT): 68817(5947/62870)
[2020-05-16 01:26:35] [INFO ] Computation of Finished co-enabling matrix. took 129221 ms. Total solver calls (SAT/UNSAT): 69100(5964/63136)
[2020-05-16 01:26:35] [INFO ] Computing Do-Not-Accords matrix : 584 transitions.
[2020-05-16 01:26:36] [INFO ] Computation of Completed DNA matrix. took 126 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-16 01:26:36] [INFO ] Built C files in 134751ms 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 10515 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 106 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, LamportFastMutExCOL8ReachabilityCardinality02==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, LamportFastMutExCOL8ReachabilityCardinality02==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, LamportFastMutExCOL8ReachabilityCardinality02==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 524288
[2020-05-16 01:28:04] [INFO ] BMC solution for property LamportFastMutEx-COL-8-ReachabilityCardinality-02(UNSAT) depth K=5 took 114944 ms
[2020-05-16 01:29:29] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesLamportFastMutEx-COL-8-ReachabilityCardinality-02
[2020-05-16 01:29:29] [INFO ] KInduction solution for property LamportFastMutEx-COL-8-ReachabilityCardinality-02(SAT) depth K=4 took 208529 ms
SDD proceeding with computation, new max is 1048576
[2020-05-16 01:30:50] [INFO ] BMC solution for property LamportFastMutEx-COL-8-ReachabilityCardinality-12(UNSAT) depth K=5 took 166173 ms
[2020-05-16 01:32:44] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesLamportFastMutEx-COL-8-ReachabilityCardinality-12
[2020-05-16 01:32:44] [INFO ] KInduction solution for property LamportFastMutEx-COL-8-ReachabilityCardinality-12(SAT) depth K=4 took 194687 ms
SDD proceeding with computation, new max is 2097152
[2020-05-16 01:36:03] [INFO ] BMC solution for property LamportFastMutEx-COL-8-ReachabilityCardinality-02(UNSAT) depth K=6 took 312805 ms
[2020-05-16 01:40:52] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesLamportFastMutEx-COL-8-ReachabilityCardinality-02
[2020-05-16 01:40:52] [INFO ] KInduction solution for property LamportFastMutEx-COL-8-ReachabilityCardinality-02(SAT) depth K=5 took 488036 ms
[2020-05-16 01:41:55] [INFO ] BMC solution for property LamportFastMutEx-COL-8-ReachabilityCardinality-12(UNSAT) depth K=6 took 351893 ms
Detected timeout of ITS tools.
[2020-05-16 01:44:52] [INFO ] Applying decomposition
[2020-05-16 01:44:52] [INFO ] Flatten gal took : 166 ms
[2020-05-16 01:44:52] [INFO ] Decomposing Gal with order
[2020-05-16 01:44:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-16 01:44:52] [INFO ] Removed a total of 947 redundant transitions.
[2020-05-16 01:44:52] [INFO ] Flatten gal took : 286 ms
[2020-05-16 01:44:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 9 ms.
[2020-05-16 01:44:53] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityCardinality.pnml.gal : 18 ms
[2020-05-16 01:44:53] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityCardinality.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/ReachabilityCardinality.pnml.gal, -t, CGAL, -reachable-file, ReachabilityCardinality.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/ReachabilityCardinality.pnml.gal -t CGAL -reachable-file ReachabilityCardinality.prop --nowitness --gen-order FOLLOW
Loading property file ReachabilityCardinality.prop.
Read [invariant] property : LamportFastMutEx-COL-8-ReachabilityCardinality-02 with value :((((((((((gpid1.P_CS_21_1+gpid2.P_CS_21_2)+gpid3.P_CS_21_3)+gpid4.P_CS_21_4)+gpid5.P_CS_21_5)+gpid6.P_CS_21_6)+gpid7.P_CS_21_7)+gpid8.P_CS_21_8)>(((((((gpid1.P_await_13_1+gpid2.P_await_13_2)+gpid3.P_await_13_3)+gpid4.P_await_13_4)+gpid5.P_await_13_5)+gpid6.P_await_13_6)+gpid7.P_await_13_7)+gpid8.P_await_13_8))||((((((((gpid1.P_setbi_11_1+gpid2.P_setbi_11_2)+gpid3.P_setbi_11_3)+gpid4.P_setbi_11_4)+gpid5.P_setbi_11_5)+gpid6.P_setbi_11_6)+gpid7.P_setbi_11_7)+gpid8.P_setbi_11_8)<2))||((((((((gpid1.P_CS_21_1+gpid2.P_CS_21_2)+gpid3.P_CS_21_3)+gpid4.P_CS_21_4)+gpid5.P_CS_21_5)+gpid6.P_CS_21_6)+gpid7.P_CS_21_7)+gpid8.P_CS_21_8)<3))
Read [invariant] property : LamportFastMutEx-COL-8-ReachabilityCardinality-12 with value :(((((((((gpid1.P_start_1_1+gpid2.P_start_1_2)+gpid3.P_start_1_3)+gpid4.P_start_1_4)+gpid5.P_start_1_5)+gpid6.P_start_1_6)+gpid7.P_start_1_7)+gpid8.P_start_1_8)<=(((((((gpid1.P_awaity_1+gpid2.P_awaity_2)+gpid3.P_awaity_3)+gpid4.P_awaity_4)+gpid5.P_awaity_5)+gpid6.P_awaity_6)+gpid7.P_awaity_7)+gpid8.P_awaity_8))||((((((((gpid1.P_CS_21_1+gpid2.P_CS_21_2)+gpid3.P_CS_21_3)+gpid4.P_CS_21_4)+gpid5.P_CS_21_5)+gpid6.P_CS_21_6)+gpid7.P_CS_21_7)+gpid8.P_CS_21_8)<2))
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-16 01:46:30] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesLamportFastMutEx-COL-8-ReachabilityCardinality-12
[2020-05-16 01:46:30] [INFO ] KInduction solution for property LamportFastMutEx-COL-8-ReachabilityCardinality-12(SAT) depth K=5 took 338648 ms
SDD proceeding with computation, new max is 262144
SDD proceeding with computation, new max is 524288
[2020-05-16 01:56:13] [INFO ] BMC solution for property LamportFastMutEx-COL-8-ReachabilityCardinality-02(UNSAT) depth K=7 took 858380 ms
SDD proceeding with computation, new max is 1048576
[2020-05-16 01:59:28] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesLamportFastMutEx-COL-8-ReachabilityCardinality-02
[2020-05-16 01:59:28] [INFO ] KInduction solution for property LamportFastMutEx-COL-8-ReachabilityCardinality-02(SAT) depth K=6 took 777857 ms
Detected timeout of ITS tools.
[2020-05-16 02:05:22] [INFO ] Flatten gal took : 56 ms
[2020-05-16 02:05:22] [INFO ] Input system was already deterministic with 584 transitions.
[2020-05-16 02:05:22] [INFO ] Transformed 266 places.
[2020-05-16 02:05:22] [INFO ] Transformed 584 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-16 02:05:22] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityCardinality.pnml.gal : 3 ms
[2020-05-16 02:05:22] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityCardinality.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/ReachabilityCardinality.pnml.gal, -t, CGAL, -reachable-file, ReachabilityCardinality.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/ReachabilityCardinality.pnml.gal -t CGAL -reachable-file ReachabilityCardinality.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 ReachabilityCardinality.prop.
Read [invariant] property : LamportFastMutEx-COL-8-ReachabilityCardinality-02 with value :((((((((((P_CS_21_1+P_CS_21_2)+P_CS_21_3)+P_CS_21_4)+P_CS_21_5)+P_CS_21_6)+P_CS_21_7)+P_CS_21_8)>(((((((P_await_13_1+P_await_13_2)+P_await_13_3)+P_await_13_4)+P_await_13_5)+P_await_13_6)+P_await_13_7)+P_await_13_8))||((((((((P_setbi_11_1+P_setbi_11_2)+P_setbi_11_3)+P_setbi_11_4)+P_setbi_11_5)+P_setbi_11_6)+P_setbi_11_7)+P_setbi_11_8)<2))||((((((((P_CS_21_1+P_CS_21_2)+P_CS_21_3)+P_CS_21_4)+P_CS_21_5)+P_CS_21_6)+P_CS_21_7)+P_CS_21_8)<3))
Read [invariant] property : LamportFastMutEx-COL-8-ReachabilityCardinality-12 with value :(((((((((P_start_1_1+P_start_1_2)+P_start_1_3)+P_start_1_4)+P_start_1_5)+P_start_1_6)+P_start_1_7)+P_start_1_8)<=(((((((P_awaity_1+P_awaity_2)+P_awaity_3)+P_awaity_4)+P_awaity_5)+P_awaity_6)+P_awaity_7)+P_awaity_8))||((((((((P_CS_21_1+P_CS_21_2)+P_CS_21_3)+P_CS_21_4)+P_CS_21_5)+P_CS_21_6)+P_CS_21_7)+P_CS_21_8)<2))
SDD proceeding with computation, new max is 4
SDD proceeding with computation, new max is 8
SDD proceeding with computation, new max is 16
SDD proceeding with computation, new max is 32
SDD proceeding with computation, new max is 64
SDD proceeding with computation, new max is 128
SDD proceeding with computation, new max is 256
SDD proceeding with computation, new max is 512
SDD proceeding with computation, new max is 1024
SDD proceeding with computation, new max is 2048
SDD proceeding with computation, new max is 4096
SDD proceeding with computation, new max is 8192
SDD proceeding with computation, new max is 16384
SDD proceeding with computation, new max is 32768
SDD proceeding with computation, new max is 65536
[2020-05-16 02:08:20] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesLamportFastMutEx-COL-8-ReachabilityCardinality-12
[2020-05-16 02:08:20] [INFO ] KInduction solution for property LamportFastMutEx-COL-8-ReachabilityCardinality-12(SAT) depth K=6 took 531420 ms
SDD proceeding with computation, new max is 131072
[2020-05-16 02:09:49] [INFO ] BMC solution for property LamportFastMutEx-COL-8-ReachabilityCardinality-12(UNSAT) depth K=7 took 815910 ms

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="LamportFastMutEx-COL-8"
export BK_EXAMINATION="ReachabilityCardinality"
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 LamportFastMutEx-COL-8, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r096-oct2-158940145400638"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-8.tgz
mv LamportFastMutEx-COL-8 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;