Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r006-tajo-165245689300429.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-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 AutoFlight-PT-04b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-tajo-165245689300429
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 312K
-rw-r--r-- 1 mcc users 6.2K Apr 30 01:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 30 01:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 30 01:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 30 01:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 9 07:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 91K May 10 09:33 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 AutoFlight-PT-04b-UpperBounds-00
FORMULA_NAME AutoFlight-PT-04b-UpperBounds-01
FORMULA_NAME AutoFlight-PT-04b-UpperBounds-02
FORMULA_NAME AutoFlight-PT-04b-UpperBounds-03
FORMULA_NAME AutoFlight-PT-04b-UpperBounds-04
FORMULA_NAME AutoFlight-PT-04b-UpperBounds-05
FORMULA_NAME AutoFlight-PT-04b-UpperBounds-06
FORMULA_NAME AutoFlight-PT-04b-UpperBounds-07
FORMULA_NAME AutoFlight-PT-04b-UpperBounds-08
FORMULA_NAME AutoFlight-PT-04b-UpperBounds-09
FORMULA_NAME AutoFlight-PT-04b-UpperBounds-10
FORMULA_NAME AutoFlight-PT-04b-UpperBounds-11
FORMULA_NAME AutoFlight-PT-04b-UpperBounds-12
FORMULA_NAME AutoFlight-PT-04b-UpperBounds-13
FORMULA_NAME AutoFlight-PT-04b-UpperBounds-14
FORMULA_NAME AutoFlight-PT-04b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652661048673

Running Version 202205111006
[2022-05-16 00:30:49] [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]
[2022-05-16 00:30:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 00:30:50] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2022-05-16 00:30:50] [INFO ] Transformed 390 places.
[2022-05-16 00:30:50] [INFO ] Transformed 388 transitions.
[2022-05-16 00:30:50] [INFO ] Found NUPN structural information;
[2022-05-16 00:30:50] [INFO ] Parsed PT model containing 390 places and 388 transitions in 179 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 388 rows 390 cols
[2022-05-16 00:30:50] [INFO ] Computed 28 place invariants in 15 ms
Incomplete random walk after 10000 steps, including 49 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 16) seen :12
FORMULA AutoFlight-PT-04b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 4) seen :0
// Phase 1: matrix 388 rows 390 cols
[2022-05-16 00:30:50] [INFO ] Computed 28 place invariants in 5 ms
[2022-05-16 00:30:50] [INFO ] [Real]Absence check using 27 positive place invariants in 10 ms returned sat
[2022-05-16 00:30:50] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-16 00:30:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:30:50] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2022-05-16 00:30:50] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 8 ms to minimize.
[2022-05-16 00:30:50] [INFO ] Deduced a trap composed of 55 places in 82 ms of which 1 ms to minimize.
[2022-05-16 00:30:50] [INFO ] Deduced a trap composed of 63 places in 72 ms of which 1 ms to minimize.
[2022-05-16 00:30:50] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 1 ms to minimize.
[2022-05-16 00:30:50] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 0 ms to minimize.
[2022-05-16 00:30:51] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 0 ms to minimize.
[2022-05-16 00:30:51] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 582 ms
[2022-05-16 00:30:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 00:30:51] [INFO ] [Nat]Absence check using 27 positive place invariants in 9 ms returned sat
[2022-05-16 00:30:51] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 00:30:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 00:30:51] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2022-05-16 00:30:51] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 0 ms to minimize.
[2022-05-16 00:30:51] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 1 ms to minimize.
[2022-05-16 00:30:51] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 0 ms to minimize.
[2022-05-16 00:30:51] [INFO ] Deduced a trap composed of 70 places in 89 ms of which 1 ms to minimize.
[2022-05-16 00:30:51] [INFO ] Deduced a trap composed of 63 places in 69 ms of which 1 ms to minimize.
[2022-05-16 00:30:51] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 1 ms to minimize.
[2022-05-16 00:30:51] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 1 ms to minimize.
[2022-05-16 00:30:51] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 0 ms to minimize.
[2022-05-16 00:30:51] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 1 ms to minimize.
[2022-05-16 00:30:52] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 0 ms to minimize.
[2022-05-16 00:30:52] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 0 ms to minimize.
[2022-05-16 00:30:52] [INFO ] Deduced a trap composed of 58 places in 58 ms of which 0 ms to minimize.
[2022-05-16 00:30:52] [INFO ] Deduced a trap composed of 57 places in 59 ms of which 1 ms to minimize.
[2022-05-16 00:30:52] [INFO ] Deduced a trap composed of 87 places in 71 ms of which 1 ms to minimize.
[2022-05-16 00:30:52] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 0 ms to minimize.
[2022-05-16 00:30:52] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 1 ms to minimize.
[2022-05-16 00:30:52] [INFO ] Deduced a trap composed of 60 places in 67 ms of which 0 ms to minimize.
[2022-05-16 00:30:52] [INFO ] Deduced a trap composed of 53 places in 64 ms of which 0 ms to minimize.
[2022-05-16 00:30:52] [INFO ] Deduced a trap composed of 66 places in 108 ms of which 0 ms to minimize.
[2022-05-16 00:30:52] [INFO ] Deduced a trap composed of 58 places in 90 ms of which 0 ms to minimize.
[2022-05-16 00:30:53] [INFO ] Deduced a trap composed of 43 places in 73 ms of which 1 ms to minimize.
[2022-05-16 00:30:53] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 0 ms to minimize.
[2022-05-16 00:30:53] [INFO ] Deduced a trap composed of 54 places in 98 ms of which 1 ms to minimize.
[2022-05-16 00:30:53] [INFO ] Deduced a trap composed of 58 places in 95 ms of which 0 ms to minimize.
[2022-05-16 00:30:53] [INFO ] Deduced a trap composed of 70 places in 88 ms of which 1 ms to minimize.
[2022-05-16 00:30:53] [INFO ] Deduced a trap composed of 71 places in 71 ms of which 0 ms to minimize.
[2022-05-16 00:30:53] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 2369 ms
[2022-05-16 00:30:53] [INFO ] Computed and/alt/rep : 387/521/387 causal constraints (skipped 0 transitions) in 39 ms.
[2022-05-16 00:30:55] [INFO ] Added : 374 causal constraints over 75 iterations in 1755 ms. Result :sat
Minimization took 141 ms.
[2022-05-16 00:30:55] [INFO ] [Real]Absence check using 27 positive place invariants in 14 ms returned sat
[2022-05-16 00:30:55] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 6 ms returned sat
[2022-05-16 00:30:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:30:55] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2022-05-16 00:30:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 00:30:55] [INFO ] [Nat]Absence check using 27 positive place invariants in 13 ms returned sat
[2022-05-16 00:30:55] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 00:30:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 00:30:55] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2022-05-16 00:30:56] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 1 ms to minimize.
[2022-05-16 00:30:56] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 1 ms to minimize.
[2022-05-16 00:30:56] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 1 ms to minimize.
[2022-05-16 00:30:56] [INFO ] Deduced a trap composed of 57 places in 82 ms of which 1 ms to minimize.
[2022-05-16 00:30:56] [INFO ] Deduced a trap composed of 65 places in 77 ms of which 1 ms to minimize.
[2022-05-16 00:30:56] [INFO ] Deduced a trap composed of 42 places in 78 ms of which 1 ms to minimize.
[2022-05-16 00:30:56] [INFO ] Deduced a trap composed of 52 places in 74 ms of which 0 ms to minimize.
[2022-05-16 00:30:56] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 749 ms
[2022-05-16 00:30:56] [INFO ] Computed and/alt/rep : 387/521/387 causal constraints (skipped 0 transitions) in 27 ms.
[2022-05-16 00:30:58] [INFO ] Deduced a trap composed of 51 places in 82 ms of which 1 ms to minimize.
[2022-05-16 00:30:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2022-05-16 00:30:58] [INFO ] Added : 386 causal constraints over 78 iterations in 2149 ms. Result :sat
Minimization took 133 ms.
[2022-05-16 00:30:59] [INFO ] [Real]Absence check using 27 positive place invariants in 12 ms returned sat
[2022-05-16 00:30:59] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-16 00:30:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:30:59] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2022-05-16 00:30:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 00:30:59] [INFO ] [Nat]Absence check using 27 positive place invariants in 13 ms returned sat
[2022-05-16 00:30:59] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 00:30:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 00:30:59] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2022-05-16 00:30:59] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 0 ms to minimize.
[2022-05-16 00:30:59] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 0 ms to minimize.
[2022-05-16 00:30:59] [INFO ] Deduced a trap composed of 67 places in 74 ms of which 1 ms to minimize.
[2022-05-16 00:30:59] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 0 ms to minimize.
[2022-05-16 00:31:00] [INFO ] Deduced a trap composed of 81 places in 85 ms of which 0 ms to minimize.
[2022-05-16 00:31:00] [INFO ] Deduced a trap composed of 52 places in 89 ms of which 0 ms to minimize.
[2022-05-16 00:31:00] [INFO ] Deduced a trap composed of 61 places in 85 ms of which 1 ms to minimize.
[2022-05-16 00:31:00] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 733 ms
[2022-05-16 00:31:00] [INFO ] Computed and/alt/rep : 387/521/387 causal constraints (skipped 0 transitions) in 28 ms.
[2022-05-16 00:31:01] [INFO ] Added : 361 causal constraints over 73 iterations in 1511 ms. Result :sat
Minimization took 132 ms.
[2022-05-16 00:31:01] [INFO ] [Real]Absence check using 27 positive place invariants in 11 ms returned sat
[2022-05-16 00:31:01] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 00:31:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:31:02] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2022-05-16 00:31:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 00:31:02] [INFO ] [Nat]Absence check using 27 positive place invariants in 12 ms returned sat
[2022-05-16 00:31:02] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-16 00:31:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 00:31:02] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2022-05-16 00:31:02] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 0 ms to minimize.
[2022-05-16 00:31:02] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 0 ms to minimize.
[2022-05-16 00:31:02] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 0 ms to minimize.
[2022-05-16 00:31:02] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 1 ms to minimize.
[2022-05-16 00:31:02] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 1 ms to minimize.
[2022-05-16 00:31:02] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 0 ms to minimize.
[2022-05-16 00:31:02] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 521 ms
[2022-05-16 00:31:02] [INFO ] Computed and/alt/rep : 387/521/387 causal constraints (skipped 0 transitions) in 19 ms.
[2022-05-16 00:31:04] [INFO ] Added : 374 causal constraints over 75 iterations in 1837 ms. Result :sat
Minimization took 95 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
FORMULA AutoFlight-PT-04b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 390 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions in SAFETY mode, iteration 0 : 390/390 places, 387/387 transitions.
Reduce places removed 2 places and 2 transitions.
Drop transitions removed 151 transitions
Trivial Post-agglo rules discarded 151 transitions
Performed 151 trivial Post agglomeration. Transition count delta: 151
Iterating post reduction 0 with 153 rules applied. Total rules applied 153 place count 388 transition count 234
Reduce places removed 154 places and 3 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 182 rules applied. Total rules applied 335 place count 234 transition count 203
Reduce places removed 10 places and 2 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 345 place count 224 transition count 201
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 346 place count 223 transition count 200
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 347 place count 222 transition count 199
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 54 Pre rules applied. Total rules applied 347 place count 222 transition count 145
Deduced a syphon composed of 54 places in 2 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 5 with 108 rules applied. Total rules applied 455 place count 168 transition count 145
Discarding 34 places :
Symmetric choice reduction at 5 with 34 rule applications. Total rules 489 place count 134 transition count 111
Iterating global reduction 5 with 34 rules applied. Total rules applied 523 place count 134 transition count 111
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 12 Pre rules applied. Total rules applied 523 place count 134 transition count 99
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 547 place count 122 transition count 99
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 5 with 60 rules applied. Total rules applied 607 place count 92 transition count 69
Free-agglomeration rule applied 16 times.
Iterating global reduction 5 with 16 rules applied. Total rules applied 623 place count 92 transition count 53
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 639 place count 76 transition count 53
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 640 place count 75 transition count 52
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 6 with 38 rules applied. Total rules applied 678 place count 59 transition count 30
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 7 with 22 rules applied. Total rules applied 700 place count 37 transition count 30
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 10 Pre rules applied. Total rules applied 700 place count 37 transition count 20
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 8 with 20 rules applied. Total rules applied 720 place count 27 transition count 20
Applied a total of 720 rules in 82 ms. Remains 27 /390 variables (removed 363) and now considering 20/387 (removed 367) transitions.
Finished structural reductions, in 1 iterations. Remains : 27/390 places, 20/387 transitions.
// Phase 1: matrix 20 rows 27 cols
[2022-05-16 00:31:05] [INFO ] Computed 12 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 58683 resets, run finished after 876 ms. (steps per millisecond=1141 ) properties (out of 1) seen :1
FORMULA AutoFlight-PT-04b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 16233 ms.

BK_STOP 1652661066112

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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="AutoFlight-PT-04b"
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 AutoFlight-PT-04b, 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 r006-tajo-165245689300429"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-04b.tgz
mv AutoFlight-PT-04b 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 ;