Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r193-csrt-159033389100623.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ResAllocation-PT-R100C002, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r193-csrt-159033389100623
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 3.2K May 14 00:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 14 00:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 17:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 13 17:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 12 20:53 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 12 20:53 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 14 10:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 14 10:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 14 10:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 13 13:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 13 13:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 13 07:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 13 07:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:53 equiv_col
-rw-r--r-- 1 mcc users 9 May 12 20:53 instance
-rw-r--r-- 1 mcc users 6 May 12 20:53 iscolored
-rw-r--r-- 1 mcc users 422K May 12 20:53 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 ResAllocation-PT-R100C002-ReachabilityFireability-00
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-01
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-02
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-03
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-04
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-05
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-06
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-07
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-08
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-09
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-10
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-11
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-12
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-13
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-14
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1590538646774

[2020-05-27 00:17:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-27 00:17:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 00:17:29] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2020-05-27 00:17:29] [INFO ] Transformed 400 places.
[2020-05-27 00:17:29] [INFO ] Transformed 202 transitions.
[2020-05-27 00:17:29] [INFO ] Parsed PT model containing 400 places and 202 transitions in 181 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 84 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 3 resets, run finished after 142 ms. (steps per millisecond=70 ) properties seen :[1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1]
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 51 ms. (steps per millisecond=196 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 53 ms. (steps per millisecond=188 ) properties seen :[1, 0, 0, 0, 0, 0]
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 49 ms. (steps per millisecond=204 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 1, 0, 0, 0]
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_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 45 ms. (steps per millisecond=222 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 202 rows 400 cols
[2020-05-27 00:17:30] [INFO ] Computed 200 place invariants in 12 ms
[2020-05-27 00:17:30] [INFO ] [Real]Absence check using 200 positive place invariants in 109 ms returned sat
[2020-05-27 00:17:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 00:17:30] [INFO ] [Real]Absence check using state equation in 486 ms returned sat
[2020-05-27 00:17:30] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints in 43 ms.
[2020-05-27 00:17:31] [INFO ] Added : 98 causal constraints over 20 iterations in 726 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
[2020-05-27 00:17:32] [INFO ] [Real]Absence check using 200 positive place invariants in 254 ms returned sat
[2020-05-27 00:17:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 00:17:32] [INFO ] [Real]Absence check using state equation in 520 ms returned sat
[2020-05-27 00:17:32] [INFO ] Deduced a trap composed of 5 places in 66 ms
[2020-05-27 00:17:32] [INFO ] Deduced a trap composed of 4 places in 72 ms
[2020-05-27 00:17:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 203 ms
[2020-05-27 00:17:32] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 00:17:33] [INFO ] [Nat]Absence check using 200 positive place invariants in 128 ms returned sat
[2020-05-27 00:17:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 00:17:33] [INFO ] [Nat]Absence check using state equation in 476 ms returned sat
[2020-05-27 00:17:33] [INFO ] Deduced a trap composed of 4 places in 144 ms
[2020-05-27 00:17:33] [INFO ] Deduced a trap composed of 4 places in 214 ms
[2020-05-27 00:17:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 452 ms
[2020-05-27 00:17:33] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints in 18 ms.
[2020-05-27 00:17:34] [INFO ] Added : 179 causal constraints over 36 iterations in 900 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 23 ms.
[2020-05-27 00:17:35] [INFO ] [Real]Absence check using 200 positive place invariants in 96 ms returned sat
[2020-05-27 00:17:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 00:17:35] [INFO ] [Real]Absence check using state equation in 414 ms returned sat
[2020-05-27 00:17:35] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints in 39 ms.
[2020-05-27 00:17:36] [INFO ] Added : 168 causal constraints over 34 iterations in 944 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2020-05-27 00:17:36] [INFO ] [Real]Absence check using 200 positive place invariants in 117 ms returned sat
[2020-05-27 00:17:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 00:17:37] [INFO ] [Real]Absence check using state equation in 736 ms returned sat
[2020-05-27 00:17:37] [INFO ] Deduced a trap composed of 4 places in 52 ms
[2020-05-27 00:17:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2020-05-27 00:17:37] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 00:17:37] [INFO ] [Nat]Absence check using 200 positive place invariants in 125 ms returned sat
[2020-05-27 00:17:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 00:17:38] [INFO ] [Nat]Absence check using state equation in 541 ms returned sat
[2020-05-27 00:17:38] [INFO ] Deduced a trap composed of 4 places in 27 ms
[2020-05-27 00:17:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2020-05-27 00:17:38] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints in 21 ms.
[2020-05-27 00:17:39] [INFO ] Added : 182 causal constraints over 37 iterations in 783 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
Incomplete Parikh walk after 233100 steps, including 146 resets, run finished after 999 ms. (steps per millisecond=233 ) properties seen :[1, 0, 0, 0] could not realise parikh vector
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 239000 steps, including 145 resets, run finished after 958 ms. (steps per millisecond=249 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 214400 steps, including 139 resets, run finished after 947 ms. (steps per millisecond=226 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 268800 steps, including 99 resets, run finished after 1250 ms. (steps per millisecond=215 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 16 out of 400 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 400/400 places, 202/202 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 397 transition count 200
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 397 transition count 199
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 395 transition count 199
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 11 place count 393 transition count 198
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 393 transition count 197
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 14 place count 391 transition count 197
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 17 place count 389 transition count 196
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 389 transition count 195
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 20 place count 387 transition count 195
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 23 place count 385 transition count 194
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 24 place count 385 transition count 193
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 26 place count 383 transition count 193
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 29 place count 381 transition count 192
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 30 place count 381 transition count 191
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 32 place count 379 transition count 191
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 35 place count 377 transition count 190
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 36 place count 377 transition count 189
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 38 place count 375 transition count 189
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 39 place count 375 transition count 188
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 42 place count 372 transition count 188
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 44 place count 371 transition count 187
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 45 place count 371 transition count 186
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 48 place count 368 transition count 186
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 50 place count 367 transition count 185
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 51 place count 367 transition count 184
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 54 place count 364 transition count 184
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 56 place count 363 transition count 183
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 57 place count 363 transition count 182
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 60 place count 360 transition count 182
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 62 place count 359 transition count 181
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 63 place count 359 transition count 180
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 66 place count 356 transition count 180
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 68 place count 355 transition count 179
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 69 place count 355 transition count 178
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 72 place count 352 transition count 178
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 74 place count 351 transition count 177
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 75 place count 351 transition count 176
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 78 place count 348 transition count 176
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 80 place count 347 transition count 175
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 81 place count 347 transition count 174
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 84 place count 344 transition count 174
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 86 place count 343 transition count 173
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 14 with 1 rules applied. Total rules applied 87 place count 343 transition count 172
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 90 place count 340 transition count 172
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 92 place count 339 transition count 171
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 15 with 1 rules applied. Total rules applied 93 place count 339 transition count 170
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 15 with 3 rules applied. Total rules applied 96 place count 336 transition count 170
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 98 place count 335 transition count 169
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 16 with 1 rules applied. Total rules applied 99 place count 335 transition count 168
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 16 with 3 rules applied. Total rules applied 102 place count 332 transition count 168
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 104 place count 331 transition count 167
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 17 with 1 rules applied. Total rules applied 105 place count 331 transition count 166
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 17 with 3 rules applied. Total rules applied 108 place count 328 transition count 166
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 110 place count 327 transition count 165
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 18 with 1 rules applied. Total rules applied 111 place count 327 transition count 164
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 18 with 3 rules applied. Total rules applied 114 place count 324 transition count 164
Applied a total of 114 rules in 729 ms. Remains 324 /400 variables (removed 76) and now considering 164/202 (removed 38) transitions.
Finished structural reductions, in 1 iterations. Remains : 324/400 places, 164/202 transitions.
Incomplete random walk after 1000000 steps, including 587 resets, run finished after 3452 ms. (steps per millisecond=289 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 72 resets, run finished after 1907 ms. (steps per millisecond=524 ) properties seen :[1, 0, 0]
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 106 resets, run finished after 1646 ms. (steps per millisecond=607 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 78 resets, run finished after 2136 ms. (steps per millisecond=468 ) properties seen :[0, 0]
// Phase 1: matrix 164 rows 324 cols
[2020-05-27 00:17:53] [INFO ] Computed 162 place invariants in 7 ms
[2020-05-27 00:17:53] [INFO ] [Real]Absence check using 162 positive place invariants in 54 ms returned sat
[2020-05-27 00:17:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 00:17:53] [INFO ] [Real]Absence check using state equation in 308 ms returned sat
[2020-05-27 00:17:53] [INFO ] Computed and/alt/rep : 162/162/162 causal constraints in 22 ms.
[2020-05-27 00:17:54] [INFO ] Added : 143 causal constraints over 29 iterations in 464 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
[2020-05-27 00:17:54] [INFO ] [Real]Absence check using 162 positive place invariants in 78 ms returned sat
[2020-05-27 00:17:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 00:17:54] [INFO ] [Real]Absence check using state equation in 280 ms returned sat
[2020-05-27 00:17:54] [INFO ] Computed and/alt/rep : 162/162/162 causal constraints in 14 ms.
[2020-05-27 00:17:55] [INFO ] Added : 158 causal constraints over 32 iterations in 597 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
Incomplete Parikh walk after 172900 steps, including 153 resets, run finished after 550 ms. (steps per millisecond=314 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 189200 steps, including 159 resets, run finished after 589 ms. (steps per millisecond=321 ) properties seen :[0, 0] could not realise parikh vector
Support contains 10 out of 324 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 324/324 places, 164/164 transitions.
Applied a total of 0 rules in 6 ms. Remains 324 /324 variables (removed 0) and now considering 164/164 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 324/324 places, 164/164 transitions.
Incomplete random walk after 1000000 steps, including 587 resets, run finished after 3315 ms. (steps per millisecond=301 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 107 resets, run finished after 1609 ms. (steps per millisecond=621 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 75 resets, run finished after 2272 ms. (steps per millisecond=440 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 12744825 steps, run timeout after 30001 ms. (steps per millisecond=424 ) properties seen :[0, 0]
Probabilistic random walk after 12744825 steps, saw 2625938 distinct states, run finished after 30001 ms. (steps per millisecond=424 ) properties seen :[0, 0]
// Phase 1: matrix 164 rows 324 cols
[2020-05-27 00:18:33] [INFO ] Computed 162 place invariants in 26 ms
[2020-05-27 00:18:33] [INFO ] [Real]Absence check using 162 positive place invariants in 64 ms returned sat
[2020-05-27 00:18:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 00:18:34] [INFO ] [Real]Absence check using state equation in 267 ms returned sat
[2020-05-27 00:18:34] [INFO ] Computed and/alt/rep : 162/162/162 causal constraints in 28 ms.
[2020-05-27 00:18:34] [INFO ] Added : 143 causal constraints over 29 iterations in 596 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2020-05-27 00:18:35] [INFO ] [Real]Absence check using 162 positive place invariants in 55 ms returned sat
[2020-05-27 00:18:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 00:18:35] [INFO ] [Real]Absence check using state equation in 267 ms returned sat
[2020-05-27 00:18:35] [INFO ] Computed and/alt/rep : 162/162/162 causal constraints in 31 ms.
[2020-05-27 00:18:35] [INFO ] Added : 158 causal constraints over 32 iterations in 617 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
Incomplete Parikh walk after 172900 steps, including 155 resets, run finished after 583 ms. (steps per millisecond=296 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 189200 steps, including 157 resets, run finished after 594 ms. (steps per millisecond=318 ) properties seen :[0, 0] could not realise parikh vector
Support contains 10 out of 324 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 324/324 places, 164/164 transitions.
Applied a total of 0 rules in 6 ms. Remains 324 /324 variables (removed 0) and now considering 164/164 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 324/324 places, 164/164 transitions.
Starting structural reductions, iteration 0 : 324/324 places, 164/164 transitions.
Applied a total of 0 rules in 5 ms. Remains 324 /324 variables (removed 0) and now considering 164/164 (removed 0) transitions.
// Phase 1: matrix 164 rows 324 cols
[2020-05-27 00:18:37] [INFO ] Computed 162 place invariants in 1 ms
[2020-05-27 00:18:37] [INFO ] Implicit Places using invariants in 600 ms returned [165, 167, 169, 171, 173, 175, 177, 179, 181, 183, 185, 187, 189, 191, 193, 195, 197, 199, 201, 203, 205, 207, 209, 211, 213, 215, 217, 219, 221, 223, 225, 227, 229, 231, 233, 235, 239, 241, 243, 245, 247, 249, 251, 253, 255, 257, 259, 261, 263, 265, 267, 269, 271, 273, 275, 277, 279, 281, 283, 285, 287, 289, 291, 293, 295, 297, 299, 301, 303, 305, 307, 309, 311, 313, 315, 317, 319, 321, 323]
Discarding 79 places :
Implicit Place search using SMT only with invariants took 603 ms to find 79 implicit places.
[2020-05-27 00:18:37] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 164 rows 245 cols
[2020-05-27 00:18:37] [INFO ] Computed 83 place invariants in 2 ms
[2020-05-27 00:18:38] [INFO ] Dead Transitions using invariants and state equation in 287 ms returned []
Starting structural reductions, iteration 1 : 245/324 places, 164/164 transitions.
Applied a total of 0 rules in 29 ms. Remains 245 /245 variables (removed 0) and now considering 164/164 (removed 0) transitions.
[2020-05-27 00:18:38] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 164 rows 245 cols
[2020-05-27 00:18:38] [INFO ] Computed 83 place invariants in 1 ms
[2020-05-27 00:18:38] [INFO ] Dead Transitions using invariants and state equation in 276 ms returned []
Finished structural reductions, in 2 iterations. Remains : 245/324 places, 164/164 transitions.
Incomplete random walk after 1000000 steps, including 587 resets, run finished after 2525 ms. (steps per millisecond=396 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000000 steps, including 107 resets, run finished after 1180 ms. (steps per millisecond=847 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 78 resets, run finished after 1256 ms. (steps per millisecond=796 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 12921650 steps, run timeout after 30001 ms. (steps per millisecond=430 ) properties seen :[0, 0]
Probabilistic random walk after 12921650 steps, saw 2661594 distinct states, run finished after 30001 ms. (steps per millisecond=430 ) properties seen :[0, 0]
// Phase 1: matrix 164 rows 245 cols
[2020-05-27 00:19:13] [INFO ] Computed 83 place invariants in 6 ms
[2020-05-27 00:19:13] [INFO ] [Real]Absence check using 83 positive place invariants in 45 ms returned sat
[2020-05-27 00:19:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 00:19:13] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2020-05-27 00:19:13] [INFO ] Computed and/alt/rep : 162/162/162 causal constraints in 20 ms.
[2020-05-27 00:19:14] [INFO ] Added : 143 causal constraints over 29 iterations in 465 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
[2020-05-27 00:19:14] [INFO ] [Real]Absence check using 83 positive place invariants in 27 ms returned sat
[2020-05-27 00:19:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 00:19:14] [INFO ] [Real]Absence check using state equation in 220 ms returned sat
[2020-05-27 00:19:14] [INFO ] Computed and/alt/rep : 162/162/162 causal constraints in 9 ms.
[2020-05-27 00:19:15] [INFO ] Added : 158 causal constraints over 32 iterations in 536 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
Incomplete Parikh walk after 228500 steps, including 172 resets, run finished after 508 ms. (steps per millisecond=449 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 212800 steps, including 165 resets, run finished after 429 ms. (steps per millisecond=496 ) properties seen :[0, 0] could not realise parikh vector
Support contains 10 out of 245 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 245/245 places, 164/164 transitions.
Applied a total of 0 rules in 4 ms. Remains 245 /245 variables (removed 0) and now considering 164/164 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 245/245 places, 164/164 transitions.
Starting structural reductions, iteration 0 : 245/245 places, 164/164 transitions.
Applied a total of 0 rules in 3 ms. Remains 245 /245 variables (removed 0) and now considering 164/164 (removed 0) transitions.
// Phase 1: matrix 164 rows 245 cols
[2020-05-27 00:19:16] [INFO ] Computed 83 place invariants in 0 ms
[2020-05-27 00:19:16] [INFO ] Implicit Places using invariants in 316 ms returned []
// Phase 1: matrix 164 rows 245 cols
[2020-05-27 00:19:16] [INFO ] Computed 83 place invariants in 2 ms
[2020-05-27 00:19:17] [INFO ] Implicit Places using invariants and state equation in 777 ms returned []
Implicit Place search using SMT with State Equation took 1115 ms to find 0 implicit places.
[2020-05-27 00:19:17] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 164 rows 245 cols
[2020-05-27 00:19:17] [INFO ] Computed 83 place invariants in 6 ms
[2020-05-27 00:19:17] [INFO ] Dead Transitions using invariants and state equation in 201 ms returned []
Finished structural reductions, in 1 iterations. Remains : 245/245 places, 164/164 transitions.
Incomplete random walk after 100000 steps, including 59 resets, run finished after 237 ms. (steps per millisecond=421 ) properties seen :[0, 0]
// Phase 1: matrix 164 rows 245 cols
[2020-05-27 00:19:17] [INFO ] Computed 83 place invariants in 0 ms
[2020-05-27 00:19:17] [INFO ] [Real]Absence check using 83 positive place invariants in 149 ms returned sat
[2020-05-27 00:19:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 00:19:18] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2020-05-27 00:19:18] [INFO ] Computed and/alt/rep : 162/162/162 causal constraints in 8 ms.
[2020-05-27 00:19:18] [INFO ] Added : 143 causal constraints over 29 iterations in 386 ms. Result :sat
[2020-05-27 00:19:18] [INFO ] [Real]Absence check using 83 positive place invariants in 312 ms returned sat
[2020-05-27 00:19:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 00:19:19] [INFO ] [Real]Absence check using state equation in 653 ms returned sat
[2020-05-27 00:19:19] [INFO ] Computed and/alt/rep : 162/162/162 causal constraints in 9 ms.
[2020-05-27 00:19:20] [INFO ] Added : 158 causal constraints over 32 iterations in 463 ms. Result :sat
Applied a total of 0 rules in 3 ms. Remains 245 /245 variables (removed 0) and now considering 164/164 (removed 0) transitions.
// Phase 1: matrix 164 rows 245 cols
[2020-05-27 00:19:20] [INFO ] Computed 83 place invariants in 12 ms
[2020-05-27 00:19:20] [INFO ] [Real]Absence check using 83 positive place invariants in 513 ms returned sat
[2020-05-27 00:19:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 00:19:21] [INFO ] [Real]Absence check using state equation in 657 ms returned sat
[2020-05-27 00:19:21] [INFO ] Computed and/alt/rep : 162/162/162 causal constraints in 12 ms.
[2020-05-27 00:19:21] [INFO ] Added : 143 causal constraints over 29 iterations in 432 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
[2020-05-27 00:19:21] [INFO ] [Real]Absence check using 83 positive place invariants in 26 ms returned sat
[2020-05-27 00:19:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 00:19:22] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2020-05-27 00:19:22] [INFO ] Computed and/alt/rep : 162/162/162 causal constraints in 16 ms.
[2020-05-27 00:19:22] [INFO ] Added : 158 causal constraints over 32 iterations in 482 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
[2020-05-27 00:19:22] [INFO ] Flatten gal took : 111 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-27 00:19:23] [INFO ] Applying decomposition
[2020-05-27 00:19:23] [INFO ] Flatten gal took : 33 ms
[2020-05-27 00:19:23] [INFO ] Flatten gal took : 35 ms
[2020-05-27 00:19:23] [INFO ] Input system was already deterministic with 164 transitions.
[2020-05-27 00:19:23] [INFO ] Input system was already deterministic with 164 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/graph10884855886350327367.txt, -o, /tmp/graph10884855886350327367.bin, -w, /tmp/graph10884855886350327367.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/graph10884855886350327367.bin, -l, -1, -v, -w, /tmp/graph10884855886350327367.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 00:19:23] [INFO ] Ran tautology test, simplified 0 / 2 in 548 ms.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 164 rows 245 cols
[2020-05-27 00:19:23] [INFO ] Computed 83 place invariants in 1 ms
inv : p_0_58 + r_0_58 + p_1_58 = 1
inv : p_0_83 + r_0_83 + p_1_83 = 1
inv : p_0_61 + r_0_61 + p_1_61 = 1
inv : p_0_77 + r_0_77 + p_1_77 = 1
inv : p_0_86 + r_0_86 + p_1_86 = 1
inv : p_0_80 + r_0_80 + p_1_80 = 1
inv : p_0_55 + r_0_55 + p_1_55 = 1
inv : p_0_52 + r_0_52 + p_1_52 = 1
inv : p_0_67 + r_0_67 + p_1_67 = 1
inv : p_0_15 + r_0_15 + p_1_15 = 1
inv : p_0_74 + r_0_74 + p_1_74 = 1
inv : p_0_11 + r_0_11 + p_1_11 = 1
inv : p_0_43 + r_0_43 + p_1_43 = 1
inv : p_0_33 + r_0_33 + p_1_33 = 1
inv : p_0_68 + r_0_68 + p_1_68 = 1
inv : p_0_21 + r_0_21 + p_1_21 = 1
inv : p_0_45 + r_0_45 + p_1_45 = 1
inv : p_0_27 + r_0_27 + p_1_27 = 1
inv : p_0_73 + r_0_73 + p_1_73 = 1
inv : p_0_42 + r_0_42 + p_1_42 = 1
inv : p_0_76 + r_0_76 + p_1_76 = 1
inv : p_0_20 + r_0_20 + p_1_20 = 1
inv : p_1_43 + r_1_43 = 1
inv : p_0_54 + r_0_54 + p_1_54 = 1
inv : p_0_23 + r_0_23 + p_1_23 = 1
inv : p_0_57 + r_0_57 + p_1_57 = 1
inv : p_0_25 + r_0_25 + p_1_25 = 1
inv : p_0_37 + r_0_37 + p_1_37 = 1
inv : p_0_28 + r_0_28 + p_1_28 = 1
inv : p_0_40 + r_0_40 + p_1_40 = 1
inv : p_0_6 + r_0_6 + p_1_6 = 1
inv : p_1_6 + r_1_6 = 1
inv : p_0_49 + r_0_49 + p_1_49 = 1
inv : p_0_81 + r_0_81 + p_1_81 = 1
inv : p_0_71 + r_0_71 + p_1_71 = 1
inv : p_0_8 + r_0_8 + p_1_8 = 1
inv : p_0_64 + r_0_64 + p_1_64 = 1
inv : p_0_30 + r_0_30 + p_1_30 = 1
inv : p_0_18 + r_0_18 + p_1_18 = 1
inv : p_0_35 + r_0_35 + p_1_35 = 1
inv : p_0_59 + r_0_59 + p_1_59 = 1
inv : p_0_13 + r_0_13 + p_1_13 = 1
inv : p_0_69 + r_0_69 + p_1_69 = 1
inv : p_0_72 + r_0_72 + p_1_72 = 1
inv : p_0_44 + r_0_44 + p_1_44 = 1
inv : p_0_47 + r_0_47 + p_1_47 = 1
inv : p_0_75 + r_0_75 + p_1_75 = 1
inv : p_0_63 + r_0_63 + p_1_63 = 1
inv : p_0_66 + r_0_66 + p_1_66 = 1
inv : p_0_85 + r_0_85 + p_1_85 = 1
inv : p_0_22 + r_0_22 + p_1_22 = 1
inv : p_0_56 + r_0_56 + p_1_56 = 1
inv : p_0_78 + r_0_78 + p_1_78 = 1
inv : p_0_26 + r_0_26 + p_1_26 = 1
inv : p_0_84 + r_0_84 + p_1_84 = 1
inv : p_0_50 + r_0_50 + p_1_50 = 1
inv : p_0_16 + r_0_16 + p_1_16 = 1
inv : p_0_79 + r_0_79 + p_1_79 = 1
inv : p_0_32 + r_0_32 + p_1_32 = 1
inv : p_0_10 + r_0_10 + p_1_10 = 1
inv : p_0_62 + r_0_62 + p_1_62 = 1
inv : p_0_38 + r_0_38 + p_1_38 = 1
inv : p_0_65 + r_0_65 + p_1_65 = 1
inv : p_0_51 + r_0_51 + p_1_51 = 1
inv : p_0_9 + r_0_9 + p_1_9 = 1
inv : p_0_14 + r_0_14 + p_1_14 = 1
inv : p_0_34 + r_0_34 + p_1_34 = 1
inv : p_0_46 + r_0_46 + p_1_46 = 1
inv : p_0_39 + r_0_39 + p_1_39 = 1
inv : p_0_17 + r_0_17 + p_1_17 = 1
inv : p_0_31 + r_0_31 + p_1_31 = 1
inv : p_0_60 + r_0_60 + p_1_60 = 1
inv : p_0_53 + r_0_53 + p_1_53 = 1
inv : p_0_36 + r_0_36 + p_1_36 = 1
inv : p_0_19 + r_0_19 + p_1_19 = 1
inv : p_0_12 + r_0_12 + p_1_12 = 1
inv : p_0_82 + r_0_82 + p_1_82 = 1
inv : p_0_29 + r_0_29 + p_1_29 = 1
inv : p_0_41 + r_0_41 + p_1_41 = 1
inv : p_0_48 + r_0_48 + p_1_48 = 1
inv : p_0_7 + r_0_7 + p_1_7 = 1
inv : p_0_70 + r_0_70 + p_1_70 = 1
inv : p_0_24 + r_0_24 + p_1_24 = 1
Total of 83 invariants.
[2020-05-27 00:19:23] [INFO ] Computed 83 place invariants in 5 ms
[2020-05-27 00:19:23] [INFO ] Decomposing Gal with order
[2020-05-27 00:19:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 00:19:23] [INFO ] BMC solution for property ResAllocation-PT-R100C002-ReachabilityFireability-12(UNSAT) depth K=0 took 65 ms
[2020-05-27 00:19:23] [INFO ] BMC solution for property ResAllocation-PT-R100C002-ReachabilityFireability-13(UNSAT) depth K=0 took 11 ms
[2020-05-27 00:19:23] [INFO ] BMC solution for property ResAllocation-PT-R100C002-ReachabilityFireability-12(UNSAT) depth K=1 took 1 ms
[2020-05-27 00:19:23] [INFO ] BMC solution for property ResAllocation-PT-R100C002-ReachabilityFireability-13(UNSAT) depth K=1 took 11 ms
[2020-05-27 00:19:23] [INFO ] BMC solution for property ResAllocation-PT-R100C002-ReachabilityFireability-12(UNSAT) depth K=2 took 41 ms
[2020-05-27 00:19:23] [INFO ] BMC solution for property ResAllocation-PT-R100C002-ReachabilityFireability-13(UNSAT) depth K=2 took 32 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 164 rows 245 cols
[2020-05-27 00:19:24] [INFO ] Computed 83 place invariants in 1 ms
inv : p_0_58 + r_0_58 + p_1_58 = 1
inv : p_0_83 + r_0_83 + p_1_83 = 1
inv : p_0_61 + r_0_61 + p_1_61 = 1
inv : p_0_77 + r_0_77 + p_1_77 = 1
inv : p_0_86 + r_0_86 + p_1_86 = 1
inv : p_0_80 + r_0_80 + p_1_80 = 1
inv : p_0_55 + r_0_55 + p_1_55 = 1
inv : p_0_52 + r_0_52 + p_1_52 = 1
inv : p_0_67 + r_0_67 + p_1_67 = 1
inv : p_0_15 + r_0_15 + p_1_15 = 1
inv : p_0_74 + r_0_74 + p_1_74 = 1
inv : p_0_11 + r_0_11 + p_1_11 = 1
inv : p_0_43 + r_0_43 + p_1_43 = 1
inv : p_0_33 + r_0_33 + p_1_33 = 1
inv : p_0_68 + r_0_68 + p_1_68 = 1
inv : p_0_21 + r_0_21 + p_1_21 = 1
inv : p_0_45 + r_0_45 + p_1_45 = 1
inv : p_0_27 + r_0_27 + p_1_27 = 1
inv : p_0_73 + r_0_73 + p_1_73 = 1
inv : p_0_42 + r_0_42 + p_1_42 = 1
inv : p_0_76 + r_0_76 + p_1_76 = 1
inv : p_0_20 + r_0_20 + p_1_20 = 1
inv : p_1_43 + r_1_43 = 1
inv : p_0_54 + r_0_54 + p_1_54 = 1
inv : p_0_23 + r_0_23 + p_1_23 = 1
inv : p_0_57 + r_0_57 + p_1_57 = 1
inv : p_0_25 + r_0_25 + p_1_25 = 1
inv : p_0_37 + r_0_37 + p_1_37 = 1
inv : p_0_28 + r_0_28 + p_1_28 = 1
inv : p_0_40 + r_0_40 + p_1_40 = 1
inv : p_0_6 + r_0_6 + p_1_6 = 1
inv : p_1_6 + r_1_6 = 1
inv : p_0_49 + r_0_49 + p_1_49 = 1
inv : p_0_81 + r_0_81 + p_1_81 = 1
inv : p_0_71 + r_0_71 + p_1_71 = 1
inv : p_0_8 + r_0_8 + p_1_8 = 1
inv : p_0_64 + r_0_64 + p_1_64 = 1
inv : p_0_30 + r_0_30 + p_1_30 = 1
inv : p_0_18 + r_0_18 + p_1_18 = 1
inv : p_0_35 + r_0_35 + p_1_35 = 1
inv : p_0_59 + r_0_59 + p_1_59 = 1
inv : p_0_13 + r_0_13 + p_1_13 = 1
inv : p_0_69 + r_0_69 + p_1_69 = 1
inv : p_0_72 + r_0_72 + p_1_72 = 1
inv : p_0_44 + r_0_44 + p_1_44 = 1
inv : p_0_47 + r_0_47 + p_1_47 = 1
inv : p_0_75 + r_0_75 + p_1_75 = 1
inv : p_0_63 + r_0_63 + p_1_63 = 1
inv : p_0_66 + r_0_66 + p_1_66 = 1
inv : p_0_85 + r_0_85 + p_1_85 = 1
inv : p_0_22 + r_0_22 + p_1_22 = 1
inv : p_0_56 + r_0_56 + p_1_56 = 1
inv : p_0_78 + r_0_78 + p_1_78 = 1
inv : p_0_26 + r_0_26 + p_1_26 = 1
inv : p_0_84 + r_0_84 + p_1_84 = 1
inv : p_0_50 + r_0_50 + p_1_50 = 1
inv : p_0_16 + r_0_16 + p_1_16 = 1
inv : p_0_79 + r_0_79 + p_1_79 = 1
inv : p_0_32 + r_0_32 + p_1_32 = 1
inv : p_0_10 + r_0_10 + p_1_10 = 1
inv : p_0_62 + r_0_62 + p_1_62 = 1
inv : p_0_38 + r_0_38 + p_1_38 = 1
inv : p_0_65 + r_0_65 + p_1_65 = 1
inv : p_0_51 + r_0_51 + p_1_51 = 1
inv : p_0_9 + r_0_9 + p_1_9 = 1
inv : p_0_14 + r_0_14 + p_1_14 = 1
inv : p_0_34 + r_0_34 + p_1_34 = 1
inv : p_0_46 + r_0_46 + p_1_46 = 1
inv : p_0_39 + r_0_39 + p_1_39 = 1
inv : p_0_17 + r_0_17 + p_1_17 = 1
inv : p_0_31 + r_0_31 + p_1_31 = 1
inv : p_0_60 + r_0_60 + p_1_60 = 1
inv : p_0_53 + r_0_53 + p_1_53 = 1
inv : p_0_36 + r_0_36 + p_1_36 = 1
inv : p_0_19 + r_0_19 + p_1_19 = 1
inv : p_0_12 + r_0_12 + p_1_12 = 1
inv : p_0_82 + r_0_82 + p_1_82 = 1
inv : p_0_29 + r_0_29 + p_1_29 = 1
inv : p_0_41 + r_0_41 + p_1_41 = 1
inv : p_0_48 + r_0_48 + p_1_48 = 1
inv : p_0_7 + r_0_7 + p_1_7 = 1
inv : p_0_70 + r_0_70 + p_1_70 = 1
inv : p_0_24 + r_0_24 + p_1_24 = 1
Total of 83 invariants.
[2020-05-27 00:19:24] [INFO ] Computed 83 place invariants in 7 ms
[2020-05-27 00:19:24] [INFO ] BMC solution for property ResAllocation-PT-R100C002-ReachabilityFireability-12(UNSAT) depth K=3 took 159 ms
[2020-05-27 00:19:24] [INFO ] Flatten gal took : 292 ms
[2020-05-27 00:19:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2020-05-27 00:19:24] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityFireability.pnml.gal : 22 ms
[2020-05-27 00:19:24] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityFireability.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/ReachabilityFireability.pnml.gal, -t, CGAL, -reachable-file, ReachabilityFireability.prop, --nowitness], workingDir=/home/mcc/execution]

[2020-05-27 00:19:24] [INFO ] BMC solution for property ResAllocation-PT-R100C002-ReachabilityFireability-13(UNSAT) depth K=3 took 161 ms
its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/ReachabilityFireability.pnml.gal -t CGAL -reachable-file ReachabilityFireability.prop --nowitness
Loading property file ReachabilityFireability.prop.
Read [reachable] property : ResAllocation-PT-R100C002-ReachabilityFireability-12 with value :(((((i11.u64.p_0_70>=1)&&(i11.u65.r_0_71>=1))&&(i0.u0.r_0_6>=1))&&(i0.u81.r_1_6>=1))&&(i0.u1.p_1_7>=1))
Read [invariant] property : ResAllocation-PT-R100C002-ReachabilityFireability-13 with value :(((((i13.u79.p_0_85<1)||(i13.u80.r_0_86<1))||(i7.u37.r_0_43<1))||(i7.u82.r_1_43<1))||(i7.u38.p_1_44<1))
built 13 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
SDD proceeding with computation, new max is 4
SDD proceeding with computation, new max is 8
SDD proceeding with computation, new max is 16
SDD proceeding with computation, new max is 32
SDD proceeding with computation, new max is 64
SDD proceeding with computation, new max is 128
SDD proceeding with computation, new max is 256
SDD proceeding with computation, new max is 512
SDD proceeding with computation, new max is 1024
SDD proceeding with computation, new max is 2048
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.00341e+26,0.591741,12188,99,11,22442,53,269,20635,23,76,0
Total reachable state count : 100340843028014221500612608

Verifying 2 reachability properties.
Reachability property ResAllocation-PT-R100C002-ReachabilityFireability-12 does not hold.
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
No reachable states exhibit your property : ResAllocation-PT-R100C002-ReachabilityFireability-12

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ResAllocation-PT-R100C002-ReachabilityFireability-12,0,0.592817,12188,1,0,22442,53,286,20635,26,76,37
Invariant property ResAllocation-PT-R100C002-ReachabilityFireability-13 is true.
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ResAllocation-PT-R100C002-ReachabilityFireability-13,0,0.593623,12188,1,0,22442,53,295,20635,29,76,103
[2020-05-27 00:19:24] [WARNING] Interrupting SMT solver.
Skipping mayMatrices nes/nds SMT assertion produced unexpected response (error "Failed to assert expression: java.io.IOException: Broken pipe (< (select (select s 1) 96) 0)")
java.lang.RuntimeException: SMT assertion produced unexpected response (error "Failed to assert expression: java.io.IOException: Broken pipe (< (select (select s 1) 96) 0)")
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:114)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.init(NecessaryEnablingsolver.java:71)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:471)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
Exception in thread "Thread-5" java.lang.RuntimeException: SMT push produced unexpected response (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:87)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:282)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$1(Gal2SMTFrontEnd.java:278)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:170)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-27 00:19:25] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:384)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$0(Gal2SMTFrontEnd.java:356)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:163)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-27 00:19:25] [WARNING] Unexpected error occurred while running SMT. Was verifying ResAllocation-PT-R100C002-ReachabilityFireability-12 SMT depth 4
java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:410)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$0(Gal2SMTFrontEnd.java:356)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:163)
at java.base/java.lang.Thread.run(Thread.java:834)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:384)
... 3 more
[2020-05-27 00:19:25] [INFO ] During BMC, SMT solver timed out at depth 4
[2020-05-27 00:19:25] [INFO ] BMC solving timed out (3600000 secs) at depth 4
[2020-05-27 00:19:25] [INFO ] Built C files in 1844ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
[2020-05-27 00:19:25] [INFO ] SMT solved 0/ 2 properties. Interrupting SMT analysis.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1590538765410

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ResAllocation-PT-R100C002"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ResAllocation-PT-R100C002, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r193-csrt-159033389100623"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ResAllocation-PT-R100C002.tgz
mv ResAllocation-PT-R100C002 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;