Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r007-tall-162037989400013.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ASLink-PT-01a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-tall-162037989400013
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 142K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 125K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 23 01:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 23 01:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 09:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 22 09:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 201K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ASLink-PT-01a-UpperBounds-00
FORMULA_NAME ASLink-PT-01a-UpperBounds-01
FORMULA_NAME ASLink-PT-01a-UpperBounds-02
FORMULA_NAME ASLink-PT-01a-UpperBounds-03
FORMULA_NAME ASLink-PT-01a-UpperBounds-04
FORMULA_NAME ASLink-PT-01a-UpperBounds-05
FORMULA_NAME ASLink-PT-01a-UpperBounds-06
FORMULA_NAME ASLink-PT-01a-UpperBounds-07
FORMULA_NAME ASLink-PT-01a-UpperBounds-08
FORMULA_NAME ASLink-PT-01a-UpperBounds-09
FORMULA_NAME ASLink-PT-01a-UpperBounds-10
FORMULA_NAME ASLink-PT-01a-UpperBounds-11
FORMULA_NAME ASLink-PT-01a-UpperBounds-12
FORMULA_NAME ASLink-PT-01a-UpperBounds-13
FORMULA_NAME ASLink-PT-01a-UpperBounds-14
FORMULA_NAME ASLink-PT-01a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1620391750107

Running Version 0
[2021-05-07 12:49:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-07 12:49:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-07 12:49:11] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2021-05-07 12:49:11] [INFO ] Transformed 431 places.
[2021-05-07 12:49:11] [INFO ] Transformed 735 transitions.
[2021-05-07 12:49:11] [INFO ] Found NUPN structural information;
[2021-05-07 12:49:11] [INFO ] Parsed PT model containing 431 places and 735 transitions in 123 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 7 transitions
Reduce redundant transitions removed 7 transitions.
// Phase 1: matrix 728 rows 431 cols
[2021-05-07 12:49:11] [INFO ] Computed 80 place invariants in 45 ms
Incomplete random walk after 10000 steps, including 202 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 16) seen :11
FORMULA ASLink-PT-01a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 68 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
// Phase 1: matrix 728 rows 431 cols
[2021-05-07 12:49:12] [INFO ] Computed 80 place invariants in 31 ms
[2021-05-07 12:49:12] [INFO ] [Real]Absence check using 19 positive place invariants in 12 ms returned sat
[2021-05-07 12:49:12] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 13 ms returned sat
[2021-05-07 12:49:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:12] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2021-05-07 12:49:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:49:12] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2021-05-07 12:49:12] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 13 ms returned sat
[2021-05-07 12:49:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:12] [INFO ] [Nat]Absence check using state equation in 297 ms returned sat
[2021-05-07 12:49:13] [INFO ] Computed and/alt/rep : 238/958/238 causal constraints (skipped 489 transitions) in 77 ms.
[2021-05-07 12:49:17] [INFO ] Added : 130 causal constraints over 26 iterations in 4532 ms. Result :unknown
[2021-05-07 12:49:17] [INFO ] [Real]Absence check using 19 positive place invariants in 40 ms returned sat
[2021-05-07 12:49:17] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 14 ms returned sat
[2021-05-07 12:49:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:17] [INFO ] [Real]Absence check using state equation in 225 ms returned sat
[2021-05-07 12:49:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:49:18] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2021-05-07 12:49:18] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 13 ms returned sat
[2021-05-07 12:49:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:18] [INFO ] [Nat]Absence check using state equation in 285 ms returned sat
[2021-05-07 12:49:18] [INFO ] Computed and/alt/rep : 238/958/238 causal constraints (skipped 489 transitions) in 63 ms.
[2021-05-07 12:49:21] [INFO ] Added : 213 causal constraints over 43 iterations in 3021 ms. Result :sat
Minimization took 337 ms.
[2021-05-07 12:49:21] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2021-05-07 12:49:21] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 12 ms returned sat
[2021-05-07 12:49:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:22] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2021-05-07 12:49:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:49:22] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2021-05-07 12:49:22] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 12 ms returned sat
[2021-05-07 12:49:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:22] [INFO ] [Nat]Absence check using state equation in 248 ms returned sat
[2021-05-07 12:49:22] [INFO ] Deduced a trap composed of 34 places in 149 ms of which 4 ms to minimize.
[2021-05-07 12:49:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
[2021-05-07 12:49:22] [INFO ] Computed and/alt/rep : 238/958/238 causal constraints (skipped 489 transitions) in 50 ms.
[2021-05-07 12:49:25] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2021-05-07 12:49:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 514 ms
[2021-05-07 12:49:25] [INFO ] Added : 174 causal constraints over 36 iterations in 3287 ms. Result :sat
Minimization took 1180 ms.
[2021-05-07 12:49:27] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2021-05-07 12:49:27] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 12 ms returned sat
[2021-05-07 12:49:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:27] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2021-05-07 12:49:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:49:27] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2021-05-07 12:49:27] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 12 ms returned sat
[2021-05-07 12:49:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:27] [INFO ] [Nat]Absence check using state equation in 297 ms returned sat
[2021-05-07 12:49:27] [INFO ] Computed and/alt/rep : 238/958/238 causal constraints (skipped 489 transitions) in 41 ms.
[2021-05-07 12:49:30] [INFO ] Added : 175 causal constraints over 35 iterations in 2489 ms. Result :sat
Minimization took 388 ms.
[2021-05-07 12:49:30] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2021-05-07 12:49:30] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 23 ms returned sat
[2021-05-07 12:49:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:30] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2021-05-07 12:49:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:49:31] [INFO ] [Nat]Absence check using 19 positive place invariants in 76 ms returned sat
[2021-05-07 12:49:31] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 16 ms returned sat
[2021-05-07 12:49:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:31] [INFO ] [Nat]Absence check using state equation in 263 ms returned sat
[2021-05-07 12:49:31] [INFO ] Computed and/alt/rep : 238/958/238 causal constraints (skipped 489 transitions) in 86 ms.
[2021-05-07 12:49:34] [INFO ] Added : 213 causal constraints over 43 iterations in 3123 ms. Result :sat
Minimization took 339 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Incomplete Parikh walk after 316800 steps, including 5220 resets, run finished after 1026 ms. (steps per millisecond=308 ) properties (out of 5) seen :2 could not realise parikh vector
FORMULA ASLink-PT-01a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-01a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 67100 steps, including 1985 resets, run finished after 216 ms. (steps per millisecond=310 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 316800 steps, including 5183 resets, run finished after 926 ms. (steps per millisecond=342 ) properties (out of 3) seen :1 could not realise parikh vector
FORMULA ASLink-PT-01a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 764100 steps, including 12715 resets, run finished after 2196 ms. (steps per millisecond=347 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 2 out of 431 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 431/431 places, 728/728 transitions.
Ensure Unique test removed 4 places
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 425 transition count 697
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 68 place count 394 transition count 697
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 68 place count 394 transition count 668
Deduced a syphon composed of 29 places in 2 ms
Ensure Unique test removed 11 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 69 rules applied. Total rules applied 137 place count 354 transition count 668
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 138 place count 354 transition count 667
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 139 place count 353 transition count 667
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 143 place count 349 transition count 650
Ensure Unique test removed 1 places
Iterating global reduction 4 with 5 rules applied. Total rules applied 148 place count 348 transition count 650
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 6 rules applied. Total rules applied 154 place count 347 transition count 645
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 157 place count 344 transition count 645
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 158 place count 343 transition count 637
Iterating global reduction 6 with 1 rules applied. Total rules applied 159 place count 343 transition count 637
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 160 place count 342 transition count 629
Iterating global reduction 6 with 1 rules applied. Total rules applied 161 place count 342 transition count 629
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 162 place count 341 transition count 621
Iterating global reduction 6 with 1 rules applied. Total rules applied 163 place count 341 transition count 621
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 164 place count 340 transition count 613
Iterating global reduction 6 with 1 rules applied. Total rules applied 165 place count 340 transition count 613
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 166 place count 339 transition count 605
Iterating global reduction 6 with 1 rules applied. Total rules applied 167 place count 339 transition count 605
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 168 place count 338 transition count 597
Iterating global reduction 6 with 1 rules applied. Total rules applied 169 place count 338 transition count 597
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 170 place count 337 transition count 589
Iterating global reduction 6 with 1 rules applied. Total rules applied 171 place count 337 transition count 589
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 172 place count 336 transition count 581
Iterating global reduction 6 with 1 rules applied. Total rules applied 173 place count 336 transition count 581
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 174 place count 335 transition count 573
Iterating global reduction 6 with 1 rules applied. Total rules applied 175 place count 335 transition count 573
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 176 place count 334 transition count 565
Iterating global reduction 6 with 1 rules applied. Total rules applied 177 place count 334 transition count 565
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 178 place count 333 transition count 557
Iterating global reduction 6 with 1 rules applied. Total rules applied 179 place count 333 transition count 557
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 180 place count 332 transition count 549
Iterating global reduction 6 with 1 rules applied. Total rules applied 181 place count 332 transition count 549
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 182 place count 331 transition count 541
Iterating global reduction 6 with 1 rules applied. Total rules applied 183 place count 331 transition count 541
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 184 place count 330 transition count 533
Iterating global reduction 6 with 1 rules applied. Total rules applied 185 place count 330 transition count 533
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 186 place count 329 transition count 525
Iterating global reduction 6 with 1 rules applied. Total rules applied 187 place count 329 transition count 525
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 188 place count 328 transition count 517
Iterating global reduction 6 with 1 rules applied. Total rules applied 189 place count 328 transition count 517
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 203 place count 321 transition count 510
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 204 place count 321 transition count 509
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 205 place count 320 transition count 509
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 207 place count 320 transition count 509
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 208 place count 319 transition count 508
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 210 place count 317 transition count 508
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 3 Pre rules applied. Total rules applied 210 place count 317 transition count 505
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 216 place count 314 transition count 505
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 8 with 1 rules applied. Total rules applied 217 place count 313 transition count 505
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 9 with 2 rules applied. Total rules applied 219 place count 312 transition count 504
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 220 place count 311 transition count 503
Iterating global reduction 9 with 1 rules applied. Total rules applied 221 place count 311 transition count 503
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 222 place count 311 transition count 502
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 223 place count 310 transition count 502
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 224 place count 310 transition count 502
Applied a total of 224 rules in 382 ms. Remains 310 /431 variables (removed 121) and now considering 502/728 (removed 226) transitions.
Finished structural reductions, in 1 iterations. Remains : 310/431 places, 502/728 transitions.
// Phase 1: matrix 502 rows 310 cols
[2021-05-07 12:49:39] [INFO ] Computed 58 place invariants in 16 ms
Incomplete random walk after 1000000 steps, including 21387 resets, run finished after 2123 ms. (steps per millisecond=471 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9316 resets, run finished after 1201 ms. (steps per millisecond=832 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9269 resets, run finished after 1059 ms. (steps per millisecond=944 ) properties (out of 2) seen :0
// Phase 1: matrix 502 rows 310 cols
[2021-05-07 12:49:44] [INFO ] Computed 58 place invariants in 5 ms
[2021-05-07 12:49:44] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2021-05-07 12:49:44] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 7 ms returned sat
[2021-05-07 12:49:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:44] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2021-05-07 12:49:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:49:44] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2021-05-07 12:49:44] [INFO ] [Nat]Absence check using 16 positive and 42 generalized place invariants in 11 ms returned sat
[2021-05-07 12:49:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:44] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2021-05-07 12:49:44] [INFO ] Computed and/alt/rep : 182/746/182 causal constraints (skipped 307 transitions) in 25 ms.
[2021-05-07 12:49:44] [INFO ] Added : 80 causal constraints over 16 iterations in 482 ms. Result :sat
Minimization took 127 ms.
[2021-05-07 12:49:45] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2021-05-07 12:49:45] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 8 ms returned sat
[2021-05-07 12:49:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:45] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2021-05-07 12:49:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:49:45] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2021-05-07 12:49:45] [INFO ] [Nat]Absence check using 16 positive and 42 generalized place invariants in 7 ms returned sat
[2021-05-07 12:49:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:45] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2021-05-07 12:49:45] [INFO ] Computed and/alt/rep : 182/746/182 causal constraints (skipped 307 transitions) in 20 ms.
[2021-05-07 12:49:46] [INFO ] Added : 117 causal constraints over 24 iterations in 743 ms. Result :sat
Minimization took 113 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Incomplete Parikh walk after 34800 steps, including 1369 resets, run finished after 78 ms. (steps per millisecond=446 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 49400 steps, including 1306 resets, run finished after 110 ms. (steps per millisecond=449 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 2 out of 310 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 310/310 places, 502/502 transitions.
Applied a total of 0 rules in 19 ms. Remains 310 /310 variables (removed 0) and now considering 502/502 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 310/310 places, 502/502 transitions.
Starting structural reductions, iteration 0 : 310/310 places, 502/502 transitions.
Applied a total of 0 rules in 11 ms. Remains 310 /310 variables (removed 0) and now considering 502/502 (removed 0) transitions.
// Phase 1: matrix 502 rows 310 cols
[2021-05-07 12:49:46] [INFO ] Computed 58 place invariants in 5 ms
[2021-05-07 12:49:46] [INFO ] Implicit Places using invariants in 203 ms returned [0, 18, 19, 21, 31, 49, 67, 136, 140, 156, 157, 158, 176, 178, 181, 199, 200, 201, 202, 214, 220, 226, 232, 238, 244, 250, 256, 262, 268, 274]
Discarding 30 places :
Implicit Place search using SMT only with invariants took 204 ms to find 30 implicit places.
[2021-05-07 12:49:46] [INFO ] Redundant transitions in 29 ms returned []
// Phase 1: matrix 502 rows 280 cols
[2021-05-07 12:49:46] [INFO ] Computed 28 place invariants in 29 ms
[2021-05-07 12:49:46] [INFO ] Dead Transitions using invariants and state equation in 232 ms returned []
Starting structural reductions, iteration 1 : 280/310 places, 502/502 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 280 transition count 455
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 94 place count 233 transition count 455
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 94 place count 233 transition count 444
Deduced a syphon composed of 11 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 23 rules applied. Total rules applied 117 place count 221 transition count 444
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 129 place count 217 transition count 436
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 137 place count 209 transition count 436
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 152 place count 194 transition count 421
Iterating global reduction 4 with 15 rules applied. Total rules applied 167 place count 194 transition count 421
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 170 place count 194 transition count 418
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 170 place count 194 transition count 417
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 172 place count 193 transition count 417
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 175 place count 190 transition count 414
Iterating global reduction 5 with 3 rules applied. Total rules applied 178 place count 190 transition count 414
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 179 place count 189 transition count 413
Iterating global reduction 5 with 1 rules applied. Total rules applied 180 place count 189 transition count 413
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 181 place count 188 transition count 412
Iterating global reduction 5 with 1 rules applied. Total rules applied 182 place count 188 transition count 412
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 218 place count 170 transition count 394
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 219 place count 170 transition count 393
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 220 place count 169 transition count 392
Iterating global reduction 6 with 1 rules applied. Total rules applied 221 place count 169 transition count 392
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 222 place count 169 transition count 391
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 223 place count 169 transition count 390
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 225 place count 167 transition count 390
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 228 place count 167 transition count 390
Applied a total of 228 rules in 68 ms. Remains 167 /280 variables (removed 113) and now considering 390/502 (removed 112) transitions.
// Phase 1: matrix 390 rows 167 cols
[2021-05-07 12:49:47] [INFO ] Computed 22 place invariants in 3 ms
[2021-05-07 12:49:47] [INFO ] Implicit Places using invariants in 103 ms returned [71, 88, 94, 97, 99]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 104 ms to find 5 implicit places.
Starting structural reductions, iteration 2 : 162/310 places, 390/502 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 159 transition count 387
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 159 transition count 387
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 158 transition count 386
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 158 transition count 386
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 156 transition count 384
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 15 place count 156 transition count 381
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 18 place count 153 transition count 381
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 153 transition count 380
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 152 transition count 380
Applied a total of 20 rules in 39 ms. Remains 152 /162 variables (removed 10) and now considering 380/390 (removed 10) transitions.
// Phase 1: matrix 380 rows 152 cols
[2021-05-07 12:49:47] [INFO ] Computed 17 place invariants in 2 ms
[2021-05-07 12:49:47] [INFO ] Implicit Places using invariants in 91 ms returned []
// Phase 1: matrix 380 rows 152 cols
[2021-05-07 12:49:47] [INFO ] Computed 17 place invariants in 2 ms
[2021-05-07 12:49:47] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 152/310 places, 380/502 transitions.
Successfully produced net in file /tmp/petri1000_4173958877823096453.dot
Drop transitions removed 1 transitions
Dominated transitions for bounds rules discarded 1 transitions
// Phase 1: matrix 379 rows 152 cols
[2021-05-07 12:49:47] [INFO ] Computed 17 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 29076 resets, run finished after 1796 ms. (steps per millisecond=556 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 15449 resets, run finished after 1049 ms. (steps per millisecond=953 ) properties (out of 2) seen :2
FORMULA ASLink-PT-01a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-01a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.

BK_STOP 1620391791263

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="ASLink-PT-01a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 ASLink-PT-01a, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r007-tall-162037989400013"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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