Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r026-tajo-162038143800359.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 BusinessProcesses-PT-05, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038143800359
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K 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 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 22 12:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 85K 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 booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620543165729

Running Version 0
[2021-05-09 06:52:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -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-09 06:52:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 06:52:47] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2021-05-09 06:52:47] [INFO ] Transformed 368 places.
[2021-05-09 06:52:47] [INFO ] Transformed 319 transitions.
[2021-05-09 06:52:47] [INFO ] Found NUPN structural information;
[2021-05-09 06:52:47] [INFO ] Parsed PT model containing 368 places and 319 transitions in 100 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 1 transitions.
Incomplete random walk after 10000 steps, including 96 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 16) seen :3
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 13) seen :3
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 318 rows 367 cols
[2021-05-09 06:52:48] [INFO ] Computed 57 place invariants in 28 ms
[2021-05-09 06:52:48] [INFO ] [Real]Absence check using 41 positive place invariants in 29 ms returned sat
[2021-05-09 06:52:48] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 5 ms returned sat
[2021-05-09 06:52:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:52:48] [INFO ] [Real]Absence check using state equation in 413 ms returned sat
[2021-05-09 06:52:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:52:48] [INFO ] [Nat]Absence check using 41 positive place invariants in 19 ms returned sat
[2021-05-09 06:52:48] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 9 ms returned sat
[2021-05-09 06:52:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:52:49] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2021-05-09 06:52:49] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 3 ms to minimize.
[2021-05-09 06:52:49] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 1 ms to minimize.
[2021-05-09 06:52:49] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 1 ms to minimize.
[2021-05-09 06:52:49] [INFO ] Deduced a trap composed of 98 places in 82 ms of which 2 ms to minimize.
[2021-05-09 06:52:49] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 2 ms to minimize.
[2021-05-09 06:52:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 686 ms
[2021-05-09 06:52:49] [INFO ] [Real]Absence check using 41 positive place invariants in 17 ms returned sat
[2021-05-09 06:52:49] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 3 ms returned sat
[2021-05-09 06:52:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:52:49] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2021-05-09 06:52:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:52:49] [INFO ] [Nat]Absence check using 41 positive place invariants in 13 ms returned sat
[2021-05-09 06:52:49] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 3 ms returned sat
[2021-05-09 06:52:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:52:50] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2021-05-09 06:52:50] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2021-05-09 06:52:50] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2021-05-09 06:52:50] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 1 ms to minimize.
[2021-05-09 06:52:50] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 0 ms to minimize.
[2021-05-09 06:52:50] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 0 ms to minimize.
[2021-05-09 06:52:50] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 1 ms to minimize.
[2021-05-09 06:52:50] [INFO ] Deduced a trap composed of 92 places in 77 ms of which 1 ms to minimize.
[2021-05-09 06:52:50] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 1 ms to minimize.
[2021-05-09 06:52:50] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 0 ms to minimize.
[2021-05-09 06:52:51] [INFO ] Deduced a trap composed of 90 places in 98 ms of which 0 ms to minimize.
[2021-05-09 06:52:51] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 0 ms to minimize.
[2021-05-09 06:52:51] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 0 ms to minimize.
[2021-05-09 06:52:51] [INFO ] Deduced a trap composed of 92 places in 105 ms of which 0 ms to minimize.
[2021-05-09 06:52:51] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 1 ms to minimize.
[2021-05-09 06:52:51] [INFO ] Deduced a trap composed of 94 places in 72 ms of which 1 ms to minimize.
[2021-05-09 06:52:51] [INFO ] Deduced a trap composed of 100 places in 82 ms of which 1 ms to minimize.
[2021-05-09 06:52:51] [INFO ] Deduced a trap composed of 93 places in 87 ms of which 1 ms to minimize.
[2021-05-09 06:52:52] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 1 ms to minimize.
[2021-05-09 06:52:52] [INFO ] Deduced a trap composed of 90 places in 99 ms of which 1 ms to minimize.
[2021-05-09 06:52:52] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 1 ms to minimize.
[2021-05-09 06:52:52] [INFO ] Deduced a trap composed of 88 places in 76 ms of which 0 ms to minimize.
[2021-05-09 06:52:52] [INFO ] Deduced a trap composed of 92 places in 72 ms of which 1 ms to minimize.
[2021-05-09 06:52:52] [INFO ] Deduced a trap composed of 97 places in 99 ms of which 1 ms to minimize.
[2021-05-09 06:52:52] [INFO ] Deduced a trap composed of 92 places in 99 ms of which 0 ms to minimize.
[2021-05-09 06:52:52] [INFO ] Deduced a trap composed of 86 places in 105 ms of which 1 ms to minimize.
[2021-05-09 06:52:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 25 trap constraints in 2905 ms
[2021-05-09 06:52:53] [INFO ] [Real]Absence check using 41 positive place invariants in 25 ms returned sat
[2021-05-09 06:52:53] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 5 ms returned sat
[2021-05-09 06:52:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:52:53] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2021-05-09 06:52:53] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 1 ms to minimize.
[2021-05-09 06:52:53] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 1 ms to minimize.
[2021-05-09 06:52:55] [INFO ] Deduced a trap composed of 13 places in 1345 ms of which 2 ms to minimize.
[2021-05-09 06:52:55] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 1 ms to minimize.
[2021-05-09 06:52:55] [INFO ] Deduced a trap composed of 12 places in 429 ms of which 6 ms to minimize.
[2021-05-09 06:52:56] [INFO ] Deduced a trap composed of 26 places in 972 ms of which 0 ms to minimize.
[2021-05-09 06:52:56] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 1 ms to minimize.
[2021-05-09 06:52:56] [INFO ] Deduced a trap composed of 92 places in 93 ms of which 0 ms to minimize.
[2021-05-09 06:52:56] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 0 ms to minimize.
[2021-05-09 06:52:56] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2021-05-09 06:52:57] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 0 ms to minimize.
[2021-05-09 06:52:57] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3744 ms
[2021-05-09 06:52:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:52:57] [INFO ] [Nat]Absence check using 41 positive place invariants in 48 ms returned sat
[2021-05-09 06:52:57] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 19 ms returned sat
[2021-05-09 06:52:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:52:57] [INFO ] [Nat]Absence check using state equation in 333 ms returned sat
[2021-05-09 06:52:57] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 0 ms to minimize.
[2021-05-09 06:52:57] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
[2021-05-09 06:52:57] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 0 ms to minimize.
[2021-05-09 06:52:57] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2021-05-09 06:52:58] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2021-05-09 06:52:58] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 0 ms to minimize.
[2021-05-09 06:52:58] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 0 ms to minimize.
[2021-05-09 06:52:58] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 618 ms
[2021-05-09 06:52:58] [INFO ] Computed and/alt/rep : 291/355/291 causal constraints (skipped 26 transitions) in 29 ms.
[2021-05-09 06:52:58] [INFO ] Added : 115 causal constraints over 24 iterations in 677 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2021-05-09 06:52:59] [INFO ] [Real]Absence check using 41 positive place invariants in 16 ms returned sat
[2021-05-09 06:52:59] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 4 ms returned sat
[2021-05-09 06:52:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:52:59] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2021-05-09 06:52:59] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 0 ms to minimize.
[2021-05-09 06:52:59] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 1 ms to minimize.
[2021-05-09 06:52:59] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 1 ms to minimize.
[2021-05-09 06:52:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 353 ms
[2021-05-09 06:52:59] [INFO ] [Real]Absence check using 41 positive place invariants in 13 ms returned unsat
[2021-05-09 06:52:59] [INFO ] [Real]Absence check using 41 positive place invariants in 10 ms returned sat
[2021-05-09 06:52:59] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 2 ms returned sat
[2021-05-09 06:52:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:52:59] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2021-05-09 06:52:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:52:59] [INFO ] [Nat]Absence check using 41 positive place invariants in 19 ms returned sat
[2021-05-09 06:52:59] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 4 ms returned sat
[2021-05-09 06:52:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:53:00] [INFO ] [Nat]Absence check using state equation in 96 ms returned unsat
[2021-05-09 06:53:00] [INFO ] [Real]Absence check using 41 positive place invariants in 16 ms returned sat
[2021-05-09 06:53:00] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 3 ms returned sat
[2021-05-09 06:53:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:53:00] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2021-05-09 06:53:00] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2021-05-09 06:53:00] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
[2021-05-09 06:53:00] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 0 ms to minimize.
[2021-05-09 06:53:00] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 8 ms to minimize.
[2021-05-09 06:53:00] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 1 ms to minimize.
[2021-05-09 06:53:00] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2021-05-09 06:53:00] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
[2021-05-09 06:53:00] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2021-05-09 06:53:00] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 586 ms
[2021-05-09 06:53:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:53:00] [INFO ] [Nat]Absence check using 41 positive place invariants in 17 ms returned sat
[2021-05-09 06:53:01] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 4 ms returned sat
[2021-05-09 06:53:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:53:01] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2021-05-09 06:53:01] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 0 ms to minimize.
[2021-05-09 06:53:01] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 0 ms to minimize.
[2021-05-09 06:53:01] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2021-05-09 06:53:01] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2021-05-09 06:53:01] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
[2021-05-09 06:53:01] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 0 ms to minimize.
[2021-05-09 06:53:01] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 0 ms to minimize.
[2021-05-09 06:53:01] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
[2021-05-09 06:53:01] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 484 ms
[2021-05-09 06:53:01] [INFO ] Computed and/alt/rep : 291/355/291 causal constraints (skipped 26 transitions) in 21 ms.
[2021-05-09 06:53:02] [INFO ] Added : 143 causal constraints over 29 iterations in 598 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
[2021-05-09 06:53:02] [INFO ] [Real]Absence check using 41 positive place invariants in 15 ms returned sat
[2021-05-09 06:53:02] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 3 ms returned sat
[2021-05-09 06:53:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:53:02] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2021-05-09 06:53:02] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 0 ms to minimize.
[2021-05-09 06:53:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 99 ms
[2021-05-09 06:53:02] [INFO ] [Real]Absence check using 41 positive place invariants in 14 ms returned sat
[2021-05-09 06:53:02] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 4 ms returned sat
[2021-05-09 06:53:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:53:02] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2021-05-09 06:53:02] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2021-05-09 06:53:02] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 0 ms to minimize.
[2021-05-09 06:53:02] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2021-05-09 06:53:02] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2021-05-09 06:53:02] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 0 ms to minimize.
[2021-05-09 06:53:02] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 273 ms
[2021-05-09 06:53:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:53:03] [INFO ] [Nat]Absence check using 41 positive place invariants in 11 ms returned sat
[2021-05-09 06:53:03] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 2 ms returned sat
[2021-05-09 06:53:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:53:03] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2021-05-09 06:53:03] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2021-05-09 06:53:03] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 0 ms to minimize.
[2021-05-09 06:53:03] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2021-05-09 06:53:03] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2021-05-09 06:53:03] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 0 ms to minimize.
[2021-05-09 06:53:03] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 266 ms
[2021-05-09 06:53:03] [INFO ] Computed and/alt/rep : 291/355/291 causal constraints (skipped 26 transitions) in 20 ms.
[2021-05-09 06:53:03] [INFO ] Added : 144 causal constraints over 30 iterations in 565 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
[2021-05-09 06:53:04] [INFO ] [Real]Absence check using 41 positive place invariants in 13 ms returned sat
[2021-05-09 06:53:04] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 10 ms returned sat
[2021-05-09 06:53:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:53:04] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2021-05-09 06:53:04] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 10 ms to minimize.
[2021-05-09 06:53:04] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 0 ms to minimize.
[2021-05-09 06:53:04] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 0 ms to minimize.
[2021-05-09 06:53:04] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 1 ms to minimize.
[2021-05-09 06:53:04] [INFO ] Deduced a trap composed of 94 places in 80 ms of which 0 ms to minimize.
[2021-05-09 06:53:04] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2021-05-09 06:53:04] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 0 ms to minimize.
[2021-05-09 06:53:04] [INFO ] Deduced a trap composed of 86 places in 89 ms of which 0 ms to minimize.
[2021-05-09 06:53:05] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 0 ms to minimize.
[2021-05-09 06:53:05] [INFO ] Deduced a trap composed of 87 places in 113 ms of which 1 ms to minimize.
[2021-05-09 06:53:05] [INFO ] Deduced a trap composed of 93 places in 119 ms of which 1 ms to minimize.
[2021-05-09 06:53:05] [INFO ] Deduced a trap composed of 91 places in 104 ms of which 1 ms to minimize.
[2021-05-09 06:53:05] [INFO ] Deduced a trap composed of 44 places in 114 ms of which 1 ms to minimize.
[2021-05-09 06:53:05] [INFO ] Deduced a trap composed of 101 places in 120 ms of which 0 ms to minimize.
[2021-05-09 06:53:05] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 0 ms to minimize.
[2021-05-09 06:53:05] [INFO ] Deduced a trap composed of 98 places in 85 ms of which 0 ms to minimize.
[2021-05-09 06:53:06] [INFO ] Deduced a trap composed of 93 places in 79 ms of which 0 ms to minimize.
[2021-05-09 06:53:06] [INFO ] Deduced a trap composed of 93 places in 85 ms of which 0 ms to minimize.
[2021-05-09 06:53:06] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
[2021-05-09 06:53:06] [INFO ] Deduced a trap composed of 90 places in 71 ms of which 1 ms to minimize.
[2021-05-09 06:53:06] [INFO ] Deduced a trap composed of 93 places in 72 ms of which 1 ms to minimize.
[2021-05-09 06:53:06] [INFO ] Deduced a trap composed of 94 places in 66 ms of which 1 ms to minimize.
[2021-05-09 06:53:06] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 0 ms to minimize.
[2021-05-09 06:53:06] [INFO ] Deduced a trap composed of 87 places in 100 ms of which 1 ms to minimize.
[2021-05-09 06:53:06] [INFO ] Deduced a trap composed of 93 places in 77 ms of which 0 ms to minimize.
[2021-05-09 06:53:07] [INFO ] Deduced a trap composed of 90 places in 91 ms of which 1 ms to minimize.
[2021-05-09 06:53:07] [INFO ] Deduced a trap composed of 96 places in 87 ms of which 1 ms to minimize.
[2021-05-09 06:53:07] [INFO ] Deduced a trap composed of 97 places in 83 ms of which 1 ms to minimize.
[2021-05-09 06:53:07] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2021-05-09 06:53:07] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2021-05-09 06:53:07] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 0 ms to minimize.
[2021-05-09 06:53:07] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 3222 ms
[2021-05-09 06:53:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:53:07] [INFO ] [Nat]Absence check using 41 positive place invariants in 14 ms returned sat
[2021-05-09 06:53:07] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 3 ms returned sat
[2021-05-09 06:53:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:53:07] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2021-05-09 06:53:07] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 0 ms to minimize.
[2021-05-09 06:53:07] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
[2021-05-09 06:53:07] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 0 ms to minimize.
[2021-05-09 06:53:08] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 1 ms to minimize.
[2021-05-09 06:53:08] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 0 ms to minimize.
[2021-05-09 06:53:08] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2021-05-09 06:53:08] [INFO ] Deduced a trap composed of 91 places in 70 ms of which 0 ms to minimize.
[2021-05-09 06:53:08] [INFO ] Deduced a trap composed of 96 places in 70 ms of which 1 ms to minimize.
[2021-05-09 06:53:08] [INFO ] Deduced a trap composed of 87 places in 72 ms of which 0 ms to minimize.
[2021-05-09 06:53:08] [INFO ] Deduced a trap composed of 92 places in 72 ms of which 1 ms to minimize.
[2021-05-09 06:53:08] [INFO ] Deduced a trap composed of 98 places in 65 ms of which 1 ms to minimize.
[2021-05-09 06:53:08] [INFO ] Deduced a trap composed of 94 places in 65 ms of which 0 ms to minimize.
[2021-05-09 06:53:08] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1059 ms
[2021-05-09 06:53:08] [INFO ] Computed and/alt/rep : 291/355/291 causal constraints (skipped 26 transitions) in 14 ms.
[2021-05-09 06:53:09] [INFO ] Added : 175 causal constraints over 36 iterations in 693 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 4 different solutions.
Incomplete Parikh walk after 12100 steps, including 101 resets, run finished after 29 ms. (steps per millisecond=417 ) properties (out of 4) seen :1 could not realise parikh vector
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 12600 steps, including 102 resets, run finished after 27 ms. (steps per millisecond=466 ) properties (out of 3) seen :2 could not realise parikh vector
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 13000 steps, including 106 resets, run finished after 23 ms. (steps per millisecond=565 ) properties (out of 1) seen :0 could not realise parikh vector
Finished Parikh walk after 156 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=156 )
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1620543189931

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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="BusinessProcesses-PT-05"
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"
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 BusinessProcesses-PT-05, 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 r026-tajo-162038143800359"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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