Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 224K
-rw-r--r-- 1 mcc users 3.6K Mar 26 02:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 26 02:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 22:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 22:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 11K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 25 14:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 25 14:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 59K Mar 24 05:37 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-02-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591156645102

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 03:57:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 03:57:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 03:57:26] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2020-06-03 03:57:26] [INFO ] Transformed 262 places.
[2020-06-03 03:57:26] [INFO ] Transformed 219 transitions.
[2020-06-03 03:57:26] [INFO ] Found NUPN structural information;
[2020-06-03 03:57:26] [INFO ] Parsed PT model containing 262 places and 219 transitions in 83 ms.
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 15 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 135 resets, run finished after 40 ms. (steps per millisecond=250 ) properties seen :[1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1]
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 204 rows 245 cols
[2020-06-03 03:57:26] [INFO ] Computed 43 place invariants in 9 ms
[2020-06-03 03:57:26] [INFO ] [Real]Absence check using 30 positive place invariants in 45 ms returned sat
[2020-06-03 03:57:26] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 9 ms returned sat
[2020-06-03 03:57:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:57:27] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2020-06-03 03:57:27] [INFO ] Deduced a trap composed of 17 places in 103 ms
[2020-06-03 03:57:27] [INFO ] Deduced a trap composed of 16 places in 164 ms
[2020-06-03 03:57:27] [INFO ] Deduced a trap composed of 14 places in 43 ms
[2020-06-03 03:57:27] [INFO ] Deduced a trap composed of 20 places in 79 ms
[2020-06-03 03:57:27] [INFO ] Deduced a trap composed of 8 places in 49 ms
[2020-06-03 03:57:27] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 511 ms
[2020-06-03 03:57:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:57:27] [INFO ] [Nat]Absence check using 30 positive place invariants in 22 ms returned sat
[2020-06-03 03:57:27] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-06-03 03:57:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:57:27] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2020-06-03 03:57:27] [INFO ] Deduced a trap composed of 17 places in 87 ms
[2020-06-03 03:57:28] [INFO ] Deduced a trap composed of 16 places in 52 ms
[2020-06-03 03:57:28] [INFO ] Deduced a trap composed of 20 places in 30 ms
[2020-06-03 03:57:28] [INFO ] Deduced a trap composed of 8 places in 52 ms
[2020-06-03 03:57:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 299 ms
[2020-06-03 03:57:28] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 11 ms.
[2020-06-03 03:57:28] [INFO ] Added : 146 causal constraints over 30 iterations in 533 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
[2020-06-03 03:57:28] [INFO ] [Real]Absence check using 30 positive place invariants in 31 ms returned sat
[2020-06-03 03:57:28] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 18 ms returned sat
[2020-06-03 03:57:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:57:28] [INFO ] [Real]Absence check using state equation in 106 ms returned unsat
[2020-06-03 03:57:28] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2020-06-03 03:57:29] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 7 ms returned sat
[2020-06-03 03:57:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:57:29] [INFO ] [Real]Absence check using state equation in 209 ms returned sat
[2020-06-03 03:57:29] [INFO ] Deduced a trap composed of 11 places in 60 ms
[2020-06-03 03:57:29] [INFO ] Deduced a trap composed of 11 places in 54 ms
[2020-06-03 03:57:29] [INFO ] Deduced a trap composed of 8 places in 48 ms
[2020-06-03 03:57:29] [INFO ] Deduced a trap composed of 19 places in 160 ms
[2020-06-03 03:57:29] [INFO ] Deduced a trap composed of 15 places in 48 ms
[2020-06-03 03:57:29] [INFO ] Deduced a trap composed of 19 places in 64 ms
[2020-06-03 03:57:29] [INFO ] Deduced a trap composed of 25 places in 46 ms
[2020-06-03 03:57:29] [INFO ] Deduced a trap composed of 57 places in 48 ms
[2020-06-03 03:57:29] [INFO ] Deduced a trap composed of 18 places in 34 ms
[2020-06-03 03:57:29] [INFO ] Deduced a trap composed of 54 places in 47 ms
[2020-06-03 03:57:29] [INFO ] Deduced a trap composed of 60 places in 44 ms
[2020-06-03 03:57:30] [INFO ] Deduced a trap composed of 28 places in 72 ms
[2020-06-03 03:57:30] [INFO ] Deduced a trap composed of 29 places in 35 ms
[2020-06-03 03:57:30] [INFO ] Deduced a trap composed of 30 places in 42 ms
[2020-06-03 03:57:30] [INFO ] Deduced a trap composed of 38 places in 36 ms
[2020-06-03 03:57:30] [INFO ] Deduced a trap composed of 39 places in 102 ms
[2020-06-03 03:57:30] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1150 ms
[2020-06-03 03:57:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:57:30] [INFO ] [Nat]Absence check using 30 positive place invariants in 28 ms returned sat
[2020-06-03 03:57:30] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2020-06-03 03:57:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:57:30] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2020-06-03 03:57:30] [INFO ] Deduced a trap composed of 11 places in 61 ms
[2020-06-03 03:57:30] [INFO ] Deduced a trap composed of 8 places in 51 ms
[2020-06-03 03:57:30] [INFO ] Deduced a trap composed of 19 places in 62 ms
[2020-06-03 03:57:30] [INFO ] Deduced a trap composed of 26 places in 54 ms
[2020-06-03 03:57:30] [INFO ] Deduced a trap composed of 61 places in 75 ms
[2020-06-03 03:57:31] [INFO ] Deduced a trap composed of 22 places in 100 ms
[2020-06-03 03:57:31] [INFO ] Deduced a trap composed of 11 places in 60 ms
[2020-06-03 03:57:31] [INFO ] Deduced a trap composed of 56 places in 63 ms
[2020-06-03 03:57:31] [INFO ] Deduced a trap composed of 22 places in 47 ms
[2020-06-03 03:57:31] [INFO ] Deduced a trap composed of 64 places in 50 ms
[2020-06-03 03:57:31] [INFO ] Deduced a trap composed of 66 places in 45 ms
[2020-06-03 03:57:31] [INFO ] Deduced a trap composed of 15 places in 44 ms
[2020-06-03 03:57:31] [INFO ] Deduced a trap composed of 38 places in 45 ms
[2020-06-03 03:57:31] [INFO ] Deduced a trap composed of 19 places in 44 ms
[2020-06-03 03:57:31] [INFO ] Deduced a trap composed of 17 places in 41 ms
[2020-06-03 03:57:31] [INFO ] Deduced a trap composed of 20 places in 40 ms
[2020-06-03 03:57:31] [INFO ] Deduced a trap composed of 29 places in 41 ms
[2020-06-03 03:57:31] [INFO ] Deduced a trap composed of 58 places in 48 ms
[2020-06-03 03:57:31] [INFO ] Deduced a trap composed of 60 places in 39 ms
[2020-06-03 03:57:31] [INFO ] Deduced a trap composed of 60 places in 65 ms
[2020-06-03 03:57:31] [INFO ] Deduced a trap composed of 60 places in 48 ms
[2020-06-03 03:57:32] [INFO ] Deduced a trap composed of 58 places in 45 ms
[2020-06-03 03:57:32] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 1427 ms
[2020-06-03 03:57:32] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 10 ms.
[2020-06-03 03:57:32] [INFO ] Added : 162 causal constraints over 33 iterations in 530 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
[2020-06-03 03:57:32] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2020-06-03 03:57:32] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2020-06-03 03:57:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:57:32] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2020-06-03 03:57:32] [INFO ] Deduced a trap composed of 8 places in 57 ms
[2020-06-03 03:57:32] [INFO ] Deduced a trap composed of 11 places in 51 ms
[2020-06-03 03:57:32] [INFO ] Deduced a trap composed of 20 places in 52 ms
[2020-06-03 03:57:33] [INFO ] Deduced a trap composed of 17 places in 52 ms
[2020-06-03 03:57:33] [INFO ] Deduced a trap composed of 42 places in 51 ms
[2020-06-03 03:57:33] [INFO ] Deduced a trap composed of 16 places in 48 ms
[2020-06-03 03:57:33] [INFO ] Deduced a trap composed of 19 places in 87 ms
[2020-06-03 03:57:34] [INFO ] Deduced a trap composed of 19 places in 1347 ms
[2020-06-03 03:57:34] [INFO ] Deduced a trap composed of 24 places in 46 ms
[2020-06-03 03:57:34] [INFO ] Deduced a trap composed of 26 places in 60 ms
[2020-06-03 03:57:34] [INFO ] Deduced a trap composed of 55 places in 66 ms
[2020-06-03 03:57:34] [INFO ] Deduced a trap composed of 21 places in 61 ms
[2020-06-03 03:57:35] [INFO ] Deduced a trap composed of 37 places in 181 ms
[2020-06-03 03:57:35] [INFO ] Deduced a trap composed of 28 places in 134 ms
[2020-06-03 03:57:35] [INFO ] Deduced a trap composed of 36 places in 88 ms
[2020-06-03 03:57:35] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2566 ms
[2020-06-03 03:57:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:57:35] [INFO ] [Nat]Absence check using 30 positive place invariants in 33 ms returned sat
[2020-06-03 03:57:35] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2020-06-03 03:57:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:57:35] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2020-06-03 03:57:35] [INFO ] Deduced a trap composed of 10 places in 141 ms
[2020-06-03 03:57:35] [INFO ] Deduced a trap composed of 15 places in 48 ms
[2020-06-03 03:57:35] [INFO ] Deduced a trap composed of 15 places in 44 ms
[2020-06-03 03:57:35] [INFO ] Deduced a trap composed of 17 places in 47 ms
[2020-06-03 03:57:36] [INFO ] Deduced a trap composed of 14 places in 42 ms
[2020-06-03 03:57:36] [INFO ] Deduced a trap composed of 8 places in 41 ms
[2020-06-03 03:57:36] [INFO ] Deduced a trap composed of 11 places in 45 ms
[2020-06-03 03:57:36] [INFO ] Deduced a trap composed of 19 places in 32 ms
[2020-06-03 03:57:36] [INFO ] Deduced a trap composed of 21 places in 42 ms
[2020-06-03 03:57:36] [INFO ] Deduced a trap composed of 26 places in 31 ms
[2020-06-03 03:57:36] [INFO ] Deduced a trap composed of 22 places in 35 ms
[2020-06-03 03:57:36] [INFO ] Deduced a trap composed of 28 places in 94 ms
[2020-06-03 03:57:36] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 762 ms
[2020-06-03 03:57:36] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 10 ms.
[2020-06-03 03:57:36] [INFO ] Added : 152 causal constraints over 31 iterations in 497 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
[2020-06-03 03:57:36] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned unsat
[2020-06-03 03:57:37] [INFO ] [Real]Absence check using 30 positive place invariants in 11 ms returned sat
[2020-06-03 03:57:37] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-06-03 03:57:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:57:37] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2020-06-03 03:57:37] [INFO ] Deduced a trap composed of 14 places in 33 ms
[2020-06-03 03:57:37] [INFO ] Deduced a trap composed of 12 places in 38 ms
[2020-06-03 03:57:37] [INFO ] Deduced a trap composed of 8 places in 30 ms
[2020-06-03 03:57:37] [INFO ] Deduced a trap composed of 26 places in 30 ms
[2020-06-03 03:57:37] [INFO ] Deduced a trap composed of 18 places in 30 ms
[2020-06-03 03:57:37] [INFO ] Deduced a trap composed of 30 places in 37 ms
[2020-06-03 03:57:37] [INFO ] Deduced a trap composed of 32 places in 40 ms
[2020-06-03 03:57:37] [INFO ] Deduced a trap composed of 30 places in 42 ms
[2020-06-03 03:57:37] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 382 ms
[2020-06-03 03:57:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:57:37] [INFO ] [Nat]Absence check using 30 positive place invariants in 17 ms returned sat
[2020-06-03 03:57:37] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 3 ms returned sat
[2020-06-03 03:57:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:57:37] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2020-06-03 03:57:37] [INFO ] Deduced a trap composed of 14 places in 38 ms
[2020-06-03 03:57:38] [INFO ] Deduced a trap composed of 17 places in 276 ms
[2020-06-03 03:57:38] [INFO ] Deduced a trap composed of 14 places in 37 ms
[2020-06-03 03:57:38] [INFO ] Deduced a trap composed of 16 places in 47 ms
[2020-06-03 03:57:38] [INFO ] Deduced a trap composed of 8 places in 43 ms
[2020-06-03 03:57:38] [INFO ] Deduced a trap composed of 19 places in 34 ms
[2020-06-03 03:57:38] [INFO ] Deduced a trap composed of 18 places in 27 ms
[2020-06-03 03:57:38] [INFO ] Deduced a trap composed of 28 places in 29 ms
[2020-06-03 03:57:38] [INFO ] Deduced a trap composed of 30 places in 26 ms
[2020-06-03 03:57:38] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 651 ms
[2020-06-03 03:57:38] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 10 ms.
[2020-06-03 03:57:38] [INFO ] Added : 147 causal constraints over 30 iterations in 515 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2020-06-03 03:57:38] [INFO ] [Real]Absence check using 30 positive place invariants in 12 ms returned unsat
[2020-06-03 03:57:39] [INFO ] [Real]Absence check using 30 positive place invariants in 19 ms returned sat
[2020-06-03 03:57:39] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2020-06-03 03:57:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:57:39] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2020-06-03 03:57:39] [INFO ] Deduced a trap composed of 11 places in 60 ms
[2020-06-03 03:57:39] [INFO ] Deduced a trap composed of 11 places in 49 ms
[2020-06-03 03:57:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 141 ms
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 14400 steps, including 221 resets, run finished after 35 ms. (steps per millisecond=411 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 14800 steps, including 227 resets, run finished after 48 ms. (steps per millisecond=308 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 14900 steps, including 245 resets, run finished after 46 ms. (steps per millisecond=323 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 13200 steps, including 207 resets, run finished after 34 ms. (steps per millisecond=388 ) properties seen :[1, 0, 1, 0] could not realise parikh vector
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 6 out of 245 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 245/245 places, 204/204 transitions.
Discarding 12 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Graph (complete) has 446 edges and 245 vertex of which 233 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.5 ms
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 233 transition count 158
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 80 place count 194 transition count 158
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 54 Pre rules applied. Total rules applied 80 place count 194 transition count 104
Deduced a syphon composed of 54 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 196 place count 132 transition count 104
Symmetric choice reduction at 2 with 30 rule applications. Total rules 226 place count 132 transition count 104
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 30 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 286 place count 102 transition count 74
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 356 place count 66 transition count 40
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 357 place count 66 transition count 39
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 358 place count 66 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 359 place count 65 transition count 38
Applied a total of 359 rules in 66 ms. Remains 65 /245 variables (removed 180) and now considering 38/204 (removed 166) transitions.
Finished structural reductions, in 1 iterations. Remains : 65/245 places, 38/204 transitions.
Finished random walk after 49904 steps, including 4534 resets, run visited all 2 properties in 79 ms. (steps per millisecond=631 )
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

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

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-02"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is BusinessProcesses-PT-02, 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 r182-oct2-158987913900463"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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