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-162038143800367.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-06, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038143800367
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 130K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K 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.2K 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.1K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K 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-06-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620543445646

Running Version 0
[2021-05-09 06:57:27] [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:57:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 06:57:27] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2021-05-09 06:57:27] [INFO ] Transformed 376 places.
[2021-05-09 06:57:27] [INFO ] Transformed 297 transitions.
[2021-05-09 06:57:27] [INFO ] Found NUPN structural information;
[2021-05-09 06:57:27] [INFO ] Parsed PT model containing 376 places and 297 transitions in 121 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 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 107 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 16) seen :7
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :1
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :1
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 296 rows 375 cols
[2021-05-09 06:57:27] [INFO ] Computed 81 place invariants in 25 ms
[2021-05-09 06:57:27] [INFO ] [Real]Absence check using 42 positive place invariants in 15 ms returned sat
[2021-05-09 06:57:28] [INFO ] [Real]Absence check using 42 positive and 39 generalized place invariants in 10 ms returned sat
[2021-05-09 06:57:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:57:28] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2021-05-09 06:57:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:57:28] [INFO ] [Nat]Absence check using 42 positive place invariants in 35 ms returned sat
[2021-05-09 06:57:28] [INFO ] [Nat]Absence check using 42 positive and 39 generalized place invariants in 38 ms returned sat
[2021-05-09 06:57:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:57:28] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2021-05-09 06:57:28] [INFO ] Deduced a trap composed of 16 places in 174 ms of which 3 ms to minimize.
[2021-05-09 06:57:28] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 5 ms to minimize.
[2021-05-09 06:57:29] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 1 ms to minimize.
[2021-05-09 06:57:29] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 2 ms to minimize.
[2021-05-09 06:57:29] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2021-05-09 06:57:29] [INFO ] Deduced a trap composed of 22 places in 280 ms of which 0 ms to minimize.
[2021-05-09 06:57:29] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2021-05-09 06:57:29] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1063 ms
[2021-05-09 06:57:29] [INFO ] Computed and/alt/rep : 272/351/272 causal constraints (skipped 23 transitions) in 16 ms.
[2021-05-09 06:57:30] [INFO ] Deduced a trap composed of 79 places in 72 ms of which 1 ms to minimize.
[2021-05-09 06:57:30] [INFO ] Deduced a trap composed of 80 places in 54 ms of which 0 ms to minimize.
[2021-05-09 06:57:30] [INFO ] Deduced a trap composed of 82 places in 56 ms of which 0 ms to minimize.
[2021-05-09 06:57:31] [INFO ] Deduced a trap composed of 80 places in 78 ms of which 1 ms to minimize.
[2021-05-09 06:57:31] [INFO ] Deduced a trap composed of 81 places in 81 ms of which 0 ms to minimize.
[2021-05-09 06:57:31] [INFO ] Deduced a trap composed of 84 places in 72 ms of which 10 ms to minimize.
[2021-05-09 06:57:31] [INFO ] Deduced a trap composed of 83 places in 76 ms of which 1 ms to minimize.
[2021-05-09 06:57:31] [INFO ] Deduced a trap composed of 83 places in 68 ms of which 0 ms to minimize.
[2021-05-09 06:57:31] [INFO ] Deduced a trap composed of 83 places in 58 ms of which 0 ms to minimize.
[2021-05-09 06:57:31] [INFO ] Deduced a trap composed of 83 places in 60 ms of which 1 ms to minimize.
[2021-05-09 06:57:31] [INFO ] Deduced a trap composed of 81 places in 77 ms of which 1 ms to minimize.
[2021-05-09 06:57:31] [INFO ] Deduced a trap composed of 75 places in 80 ms of which 0 ms to minimize.
[2021-05-09 06:57:31] [INFO ] Deduced a trap composed of 82 places in 49 ms of which 0 ms to minimize.
[2021-05-09 06:57:31] [INFO ] Deduced a trap composed of 77 places in 48 ms of which 1 ms to minimize.
[2021-05-09 06:57:32] [INFO ] Deduced a trap composed of 83 places in 623 ms of which 1 ms to minimize.
[2021-05-09 06:57:32] [INFO ] Deduced a trap composed of 85 places in 61 ms of which 1 ms to minimize.
[2021-05-09 06:57:32] [INFO ] Deduced a trap composed of 84 places in 58 ms of which 1 ms to minimize.
[2021-05-09 06:57:32] [INFO ] Deduced a trap composed of 92 places in 85 ms of which 1 ms to minimize.
[2021-05-09 06:57:33] [INFO ] Deduced a trap composed of 79 places in 91 ms of which 1 ms to minimize.
[2021-05-09 06:57:33] [INFO ] Deduced a trap composed of 81 places in 93 ms of which 1 ms to minimize.
[2021-05-09 06:57:33] [INFO ] Deduced a trap composed of 83 places in 271 ms of which 0 ms to minimize.
[2021-05-09 06:57:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2021-05-09 06:57:33] [INFO ] [Real]Absence check using 42 positive place invariants in 18 ms returned unsat
[2021-05-09 06:57:33] [INFO ] [Real]Absence check using 42 positive place invariants in 11 ms returned unsat
[2021-05-09 06:57:33] [INFO ] [Real]Absence check using 42 positive place invariants in 17 ms returned sat
[2021-05-09 06:57:33] [INFO ] [Real]Absence check using 42 positive and 39 generalized place invariants in 15 ms returned sat
[2021-05-09 06:57:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:57:33] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2021-05-09 06:57:34] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2021-05-09 06:57:34] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2021-05-09 06:57:34] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2021-05-09 06:57:34] [INFO ] Deduced a trap composed of 89 places in 63 ms of which 1 ms to minimize.
[2021-05-09 06:57:34] [INFO ] Deduced a trap composed of 84 places in 60 ms of which 0 ms to minimize.
[2021-05-09 06:57:34] [INFO ] Deduced a trap composed of 86 places in 66 ms of which 1 ms to minimize.
[2021-05-09 06:57:34] [INFO ] Deduced a trap composed of 86 places in 123 ms of which 4 ms to minimize.
[2021-05-09 06:57:34] [INFO ] Deduced a trap composed of 85 places in 84 ms of which 1 ms to minimize.
[2021-05-09 06:57:34] [INFO ] Deduced a trap composed of 84 places in 75 ms of which 1 ms to minimize.
[2021-05-09 06:57:34] [INFO ] Deduced a trap composed of 86 places in 67 ms of which 0 ms to minimize.
[2021-05-09 06:57:34] [INFO ] Deduced a trap composed of 80 places in 74 ms of which 0 ms to minimize.
[2021-05-09 06:57:35] [INFO ] Deduced a trap composed of 85 places in 78 ms of which 0 ms to minimize.
[2021-05-09 06:57:35] [INFO ] Deduced a trap composed of 81 places in 62 ms of which 1 ms to minimize.
[2021-05-09 06:57:35] [INFO ] Deduced a trap composed of 80 places in 69 ms of which 1 ms to minimize.
[2021-05-09 06:57:35] [INFO ] Deduced a trap composed of 79 places in 62 ms of which 1 ms to minimize.
[2021-05-09 06:57:35] [INFO ] Deduced a trap composed of 89 places in 67 ms of which 1 ms to minimize.
[2021-05-09 06:57:35] [INFO ] Deduced a trap composed of 87 places in 76 ms of which 0 ms to minimize.
[2021-05-09 06:57:35] [INFO ] Deduced a trap composed of 83 places in 65 ms of which 0 ms to minimize.
[2021-05-09 06:57:35] [INFO ] Deduced a trap composed of 86 places in 70 ms of which 1 ms to minimize.
[2021-05-09 06:57:35] [INFO ] Deduced a trap composed of 83 places in 93 ms of which 1 ms to minimize.
[2021-05-09 06:57:35] [INFO ] Deduced a trap composed of 73 places in 63 ms of which 0 ms to minimize.
[2021-05-09 06:57:35] [INFO ] Deduced a trap composed of 80 places in 65 ms of which 1 ms to minimize.
[2021-05-09 06:57:35] [INFO ] Deduced a trap composed of 84 places in 59 ms of which 1 ms to minimize.
[2021-05-09 06:57:36] [INFO ] Deduced a trap composed of 78 places in 59 ms of which 1 ms to minimize.
[2021-05-09 06:57:36] [INFO ] Deduced a trap composed of 78 places in 59 ms of which 0 ms to minimize.
[2021-05-09 06:57:36] [INFO ] Deduced a trap composed of 79 places in 60 ms of which 1 ms to minimize.
[2021-05-09 06:57:36] [INFO ] Deduced a trap composed of 82 places in 59 ms of which 1 ms to minimize.
[2021-05-09 06:57:36] [INFO ] Deduced a trap composed of 82 places in 62 ms of which 0 ms to minimize.
[2021-05-09 06:57:36] [INFO ] Deduced a trap composed of 82 places in 72 ms of which 11 ms to minimize.
[2021-05-09 06:57:36] [INFO ] Deduced a trap composed of 84 places in 59 ms of which 0 ms to minimize.
[2021-05-09 06:57:36] [INFO ] Deduced a trap composed of 75 places in 58 ms of which 0 ms to minimize.
[2021-05-09 06:57:36] [INFO ] Deduced a trap composed of 78 places in 65 ms of which 0 ms to minimize.
[2021-05-09 06:57:36] [INFO ] Deduced a trap composed of 79 places in 56 ms of which 1 ms to minimize.
[2021-05-09 06:57:36] [INFO ] Deduced a trap composed of 80 places in 55 ms of which 0 ms to minimize.
[2021-05-09 06:57:36] [INFO ] Deduced a trap composed of 81 places in 74 ms of which 1 ms to minimize.
[2021-05-09 06:57:36] [INFO ] Deduced a trap composed of 79 places in 55 ms of which 1 ms to minimize.
[2021-05-09 06:57:37] [INFO ] Deduced a trap composed of 76 places in 75 ms of which 0 ms to minimize.
[2021-05-09 06:57:37] [INFO ] Deduced a trap composed of 78 places in 62 ms of which 0 ms to minimize.
[2021-05-09 06:57:37] [INFO ] Deduced a trap composed of 83 places in 67 ms of which 3 ms to minimize.
[2021-05-09 06:57:37] [INFO ] Deduced a trap composed of 82 places in 60 ms of which 2 ms to minimize.
[2021-05-09 06:57:37] [INFO ] Deduced a trap composed of 84 places in 50 ms of which 1 ms to minimize.
[2021-05-09 06:57:37] [INFO ] Deduced a trap composed of 81 places in 52 ms of which 1 ms to minimize.
[2021-05-09 06:57:37] [INFO ] Deduced a trap composed of 79 places in 49 ms of which 1 ms to minimize.
[2021-05-09 06:57:37] [INFO ] Deduced a trap composed of 79 places in 62 ms of which 1 ms to minimize.
[2021-05-09 06:57:37] [INFO ] Deduced a trap composed of 81 places in 65 ms of which 1 ms to minimize.
[2021-05-09 06:57:37] [INFO ] Deduced a trap composed of 83 places in 63 ms of which 0 ms to minimize.
[2021-05-09 06:57:37] [INFO ] Deduced a trap composed of 85 places in 57 ms of which 0 ms to minimize.
[2021-05-09 06:57:37] [INFO ] Deduced a trap composed of 83 places in 59 ms of which 0 ms to minimize.
[2021-05-09 06:57:37] [INFO ] Deduced a trap composed of 79 places in 73 ms of which 1 ms to minimize.
[2021-05-09 06:57:38] [INFO ] Deduced a trap composed of 79 places in 41 ms of which 0 ms to minimize.
[2021-05-09 06:57:38] [INFO ] Deduced a trap composed of 84 places in 75 ms of which 0 ms to minimize.
[2021-05-09 06:57:38] [INFO ] Deduced a trap composed of 84 places in 57 ms of which 0 ms to minimize.
[2021-05-09 06:57:38] [INFO ] Deduced a trap composed of 83 places in 65 ms of which 0 ms to minimize.
[2021-05-09 06:57:38] [INFO ] Deduced a trap composed of 78 places in 52 ms of which 0 ms to minimize.
[2021-05-09 06:57:38] [INFO ] Deduced a trap composed of 80 places in 44 ms of which 0 ms to minimize.
[2021-05-09 06:57:38] [INFO ] Deduced a trap composed of 81 places in 45 ms of which 0 ms to minimize.
[2021-05-09 06:57:38] [INFO ] Deduced a trap composed of 80 places in 42 ms of which 0 ms to minimize.
[2021-05-09 06:57:38] [INFO ] Deduced a trap composed of 81 places in 46 ms of which 1 ms to minimize.
[2021-05-09 06:57:38] [INFO ] Deduced a trap composed of 81 places in 57 ms of which 0 ms to minimize.
[2021-05-09 06:57:38] [INFO ] Deduced a trap composed of 79 places in 70 ms of which 0 ms to minimize.
[2021-05-09 06:57:38] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
[2021-05-09 06:57:38] [INFO ] [Real]Absence check using 42 positive place invariants in 10 ms returned unsat
[2021-05-09 06:57:38] [INFO ] [Real]Absence check using 42 positive place invariants in 16 ms returned sat
[2021-05-09 06:57:38] [INFO ] [Real]Absence check using 42 positive and 39 generalized place invariants in 12 ms returned sat
[2021-05-09 06:57:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:57:39] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2021-05-09 06:57:39] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 0 ms to minimize.
[2021-05-09 06:57:39] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2021-05-09 06:57:39] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 0 ms to minimize.
[2021-05-09 06:57:39] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 0 ms to minimize.
[2021-05-09 06:57:39] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 0 ms to minimize.
[2021-05-09 06:57:39] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 0 ms to minimize.
[2021-05-09 06:57:39] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 0 ms to minimize.
[2021-05-09 06:57:39] [INFO ] Deduced a trap composed of 77 places in 63 ms of which 0 ms to minimize.
[2021-05-09 06:57:39] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2021-05-09 06:57:39] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 0 ms to minimize.
[2021-05-09 06:57:39] [INFO ] Deduced a trap composed of 78 places in 68 ms of which 0 ms to minimize.
[2021-05-09 06:57:40] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2021-05-09 06:57:40] [INFO ] Deduced a trap composed of 75 places in 64 ms of which 0 ms to minimize.
[2021-05-09 06:57:40] [INFO ] Deduced a trap composed of 77 places in 64 ms of which 1 ms to minimize.
[2021-05-09 06:57:40] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1207 ms
[2021-05-09 06:57:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:57:40] [INFO ] [Nat]Absence check using 42 positive place invariants in 13 ms returned sat
[2021-05-09 06:57:40] [INFO ] [Nat]Absence check using 42 positive and 39 generalized place invariants in 9 ms returned sat
[2021-05-09 06:57:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:57:40] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2021-05-09 06:57:40] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 2 ms to minimize.
[2021-05-09 06:57:40] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 1 ms to minimize.
[2021-05-09 06:57:40] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 1 ms to minimize.
[2021-05-09 06:57:40] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 1 ms to minimize.
[2021-05-09 06:57:40] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 1 ms to minimize.
[2021-05-09 06:57:41] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 0 ms to minimize.
[2021-05-09 06:57:41] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 1 ms to minimize.
[2021-05-09 06:57:41] [INFO ] Deduced a trap composed of 77 places in 75 ms of which 1 ms to minimize.
[2021-05-09 06:57:41] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 0 ms to minimize.
[2021-05-09 06:57:41] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 0 ms to minimize.
[2021-05-09 06:57:41] [INFO ] Deduced a trap composed of 78 places in 65 ms of which 0 ms to minimize.
[2021-05-09 06:57:41] [INFO ] Deduced a trap composed of 74 places in 83 ms of which 1 ms to minimize.
[2021-05-09 06:57:41] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 0 ms to minimize.
[2021-05-09 06:57:41] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1244 ms
[2021-05-09 06:57:41] [INFO ] Computed and/alt/rep : 272/351/272 causal constraints (skipped 23 transitions) in 19 ms.
[2021-05-09 06:57:42] [INFO ] Deduced a trap composed of 75 places in 98 ms of which 1 ms to minimize.
[2021-05-09 06:57:42] [INFO ] Deduced a trap composed of 81 places in 95 ms of which 0 ms to minimize.
[2021-05-09 06:57:42] [INFO ] Deduced a trap composed of 83 places in 72 ms of which 1 ms to minimize.
[2021-05-09 06:57:43] [INFO ] Deduced a trap composed of 83 places in 66 ms of which 1 ms to minimize.
[2021-05-09 06:57:43] [INFO ] Deduced a trap composed of 93 places in 83 ms of which 0 ms to minimize.
[2021-05-09 06:57:43] [INFO ] Deduced a trap composed of 85 places in 77 ms of which 0 ms to minimize.
[2021-05-09 06:57:43] [INFO ] Deduced a trap composed of 78 places in 73 ms of which 0 ms to minimize.
[2021-05-09 06:57:43] [INFO ] Deduced a trap composed of 78 places in 94 ms of which 1 ms to minimize.
[2021-05-09 06:57:43] [INFO ] Deduced a trap composed of 87 places in 95 ms of which 1 ms to minimize.
[2021-05-09 06:57:43] [INFO ] Deduced a trap composed of 88 places in 91 ms of which 0 ms to minimize.
[2021-05-09 06:57:44] [INFO ] Deduced a trap composed of 81 places in 98 ms of which 1 ms to minimize.
[2021-05-09 06:57:44] [INFO ] Deduced a trap composed of 90 places in 95 ms of which 0 ms to minimize.
[2021-05-09 06:57:44] [INFO ] Deduced a trap composed of 80 places in 105 ms of which 0 ms to minimize.
[2021-05-09 06:57:44] [INFO ] Deduced a trap composed of 80 places in 91 ms of which 0 ms to minimize.
[2021-05-09 06:57:44] [INFO ] Deduced a trap composed of 83 places in 119 ms of which 0 ms to minimize.
[2021-05-09 06:57:44] [INFO ] Deduced a trap composed of 89 places in 101 ms of which 1 ms to minimize.
[2021-05-09 06:57:44] [INFO ] Deduced a trap composed of 81 places in 96 ms of which 1 ms to minimize.
[2021-05-09 06:57:45] [INFO ] Deduced a trap composed of 78 places in 106 ms of which 1 ms to minimize.
[2021-05-09 06:57:45] [INFO ] Deduced a trap composed of 75 places in 105 ms of which 0 ms to minimize.
[2021-05-09 06:57:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
[2021-05-09 06:57:45] [INFO ] [Real]Absence check using 42 positive place invariants in 16 ms returned sat
[2021-05-09 06:57:45] [INFO ] [Real]Absence check using 42 positive and 39 generalized place invariants in 16 ms returned sat
[2021-05-09 06:57:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:57:45] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2021-05-09 06:57:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:57:45] [INFO ] [Nat]Absence check using 42 positive place invariants in 17 ms returned sat
[2021-05-09 06:57:45] [INFO ] [Nat]Absence check using 42 positive and 39 generalized place invariants in 5 ms returned unsat
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 1 different solutions.
Support contains 7 out of 375 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 375/375 places, 296/296 transitions.
Graph (trivial) has 191 edges and 375 vertex of which 7 / 375 are part of one of the 1 SCC in 4 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 684 edges and 369 vertex of which 366 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 67 rules applied. Total rules applied 69 place count 366 transition count 220
Reduce places removed 66 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 67 rules applied. Total rules applied 136 place count 300 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 137 place count 299 transition count 219
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 61 Pre rules applied. Total rules applied 137 place count 299 transition count 158
Deduced a syphon composed of 61 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 131 rules applied. Total rules applied 268 place count 229 transition count 158
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 308 place count 189 transition count 118
Iterating global reduction 3 with 40 rules applied. Total rules applied 348 place count 189 transition count 118
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 478 place count 124 transition count 53
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 479 place count 124 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 480 place count 123 transition count 52
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 481 place count 123 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 482 place count 122 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 483 place count 121 transition count 51
Applied a total of 483 rules in 117 ms. Remains 121 /375 variables (removed 254) and now considering 51/296 (removed 245) transitions.
Finished structural reductions, in 1 iterations. Remains : 121/375 places, 51/296 transitions.
[2021-05-09 06:57:46] [INFO ] Flatten gal took : 44 ms
[2021-05-09 06:57:46] [INFO ] Flatten gal took : 13 ms
[2021-05-09 06:57:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12298033891288977638.gal : 8 ms
[2021-05-09 06:57:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18311751744153265900.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality12298033891288977638.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality18311751744153265900.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality12298033891288977638.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality18311751744153265900.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality18311751744153265900.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :3 after 9
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :9 after 15
Reachability property BusinessProcesses-PT-06-ReachabilityFireability-08 is true.
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1167 after 1171
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1171 after 1181
Reachability property BusinessProcesses-PT-06-ReachabilityFireability-10 is true.
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property BusinessProcesses-PT-06-ReachabilityFireability-00 is true.
FORMULA BusinessProcesses-PT-06-ReachabilityFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1208,0.087905,5772,2,3407,14,9451,6,0,535,3035,0
Total reachable state count : 1208

Verifying 3 reachability properties.
Reachability property BusinessProcesses-PT-06-ReachabilityFireability-00 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-06-ReachabilityFireability-00,1,0.089576,5772,2,122,14,9451,7,0,546,3035,0
Reachability property BusinessProcesses-PT-06-ReachabilityFireability-08 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-06-ReachabilityFireability-08,64,0.096547,6036,2,1439,14,9451,8,0,551,3035,0
Reachability property BusinessProcesses-PT-06-ReachabilityFireability-10 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-06-ReachabilityFireability-10,1,0.097798,6036,2,122,14,9451,9,0,553,3035,0
All properties solved without resorting to model-checking.

BK_STOP 1620543466509

--------------------
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-06"
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-06, 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-162038143800367"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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