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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 141K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 92K 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.6K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 17K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K 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.8K 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 100K 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-07-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620543549739

Running Version 0
[2021-05-09 06:59:11] [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:59:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 06:59:11] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2021-05-09 06:59:11] [INFO ] Transformed 386 places.
[2021-05-09 06:59:11] [INFO ] Transformed 360 transitions.
[2021-05-09 06:59:11] [INFO ] Found NUPN structural information;
[2021-05-09 06:59:11] [INFO ] Parsed PT model containing 386 places and 360 transitions in 108 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 108 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 16) seen :7
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 360 rows 386 cols
[2021-05-09 06:59:12] [INFO ] Computed 62 place invariants in 32 ms
[2021-05-09 06:59:12] [INFO ] [Real]Absence check using 33 positive place invariants in 24 ms returned sat
[2021-05-09 06:59:12] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 9 ms returned sat
[2021-05-09 06:59:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:59:12] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2021-05-09 06:59:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:59:12] [INFO ] [Nat]Absence check using 33 positive place invariants in 12 ms returned unsat
[2021-05-09 06:59:12] [INFO ] [Real]Absence check using 33 positive place invariants in 10 ms returned sat
[2021-05-09 06:59:12] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 8 ms returned sat
[2021-05-09 06:59:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:59:12] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2021-05-09 06:59:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:59:12] [INFO ] [Nat]Absence check using 33 positive place invariants in 13 ms returned sat
[2021-05-09 06:59:12] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 13 ms returned sat
[2021-05-09 06:59:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:59:12] [INFO ] [Nat]Absence check using state equation in 104 ms returned unsat
[2021-05-09 06:59:13] [INFO ] [Real]Absence check using 33 positive place invariants in 11 ms returned sat
[2021-05-09 06:59:13] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 8 ms returned sat
[2021-05-09 06:59:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:59:13] [INFO ] [Real]Absence check using state equation in 91 ms returned unsat
[2021-05-09 06:59:13] [INFO ] [Real]Absence check using 33 positive place invariants in 10 ms returned sat
[2021-05-09 06:59:13] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 7 ms returned sat
[2021-05-09 06:59:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:59:13] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2021-05-09 06:59:13] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 3 ms to minimize.
[2021-05-09 06:59:13] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2021-05-09 06:59:13] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
[2021-05-09 06:59:13] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2021-05-09 06:59:13] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 0 ms to minimize.
[2021-05-09 06:59:13] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2021-05-09 06:59:13] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 473 ms
[2021-05-09 06:59:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:59:13] [INFO ] [Nat]Absence check using 33 positive place invariants in 13 ms returned sat
[2021-05-09 06:59:13] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 8 ms returned sat
[2021-05-09 06:59:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:59:14] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2021-05-09 06:59:14] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 0 ms to minimize.
[2021-05-09 06:59:14] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2021-05-09 06:59:14] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2021-05-09 06:59:14] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2021-05-09 06:59:14] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2021-05-09 06:59:14] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2021-05-09 06:59:14] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 355 ms
[2021-05-09 06:59:14] [INFO ] Computed and/alt/rep : 339/625/339 causal constraints (skipped 20 transitions) in 25 ms.
[2021-05-09 06:59:15] [INFO ] Added : 198 causal constraints over 40 iterations in 880 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2021-05-09 06:59:15] [INFO ] [Real]Absence check using 33 positive place invariants in 21 ms returned sat
[2021-05-09 06:59:15] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 11 ms returned sat
[2021-05-09 06:59:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:59:15] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2021-05-09 06:59:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:59:15] [INFO ] [Nat]Absence check using 33 positive place invariants in 15 ms returned sat
[2021-05-09 06:59:15] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 9 ms returned sat
[2021-05-09 06:59:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:59:15] [INFO ] [Nat]Absence check using state equation in 102 ms returned unsat
[2021-05-09 06:59:15] [INFO ] [Real]Absence check using 33 positive place invariants in 16 ms returned sat
[2021-05-09 06:59:15] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 8 ms returned unsat
[2021-05-09 06:59:15] [INFO ] [Real]Absence check using 33 positive place invariants in 10 ms returned sat
[2021-05-09 06:59:15] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 7 ms returned sat
[2021-05-09 06:59:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:59:15] [INFO ] [Real]Absence check using state equation in 91 ms returned unsat
[2021-05-09 06:59:16] [INFO ] [Real]Absence check using 33 positive place invariants in 16 ms returned sat
[2021-05-09 06:59:16] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 11 ms returned sat
[2021-05-09 06:59:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:59:16] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2021-05-09 06:59:16] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 1 ms to minimize.
[2021-05-09 06:59:16] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 0 ms to minimize.
[2021-05-09 06:59:16] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 1 ms to minimize.
[2021-05-09 06:59:16] [INFO ] Deduced a trap composed of 104 places in 132 ms of which 0 ms to minimize.
[2021-05-09 06:59:16] [INFO ] Deduced a trap composed of 86 places in 90 ms of which 1 ms to minimize.
[2021-05-09 06:59:17] [INFO ] Deduced a trap composed of 101 places in 145 ms of which 1 ms to minimize.
[2021-05-09 06:59:17] [INFO ] Deduced a trap composed of 100 places in 133 ms of which 1 ms to minimize.
[2021-05-09 06:59:17] [INFO ] Deduced a trap composed of 103 places in 118 ms of which 1 ms to minimize.
[2021-05-09 06:59:17] [INFO ] Deduced a trap composed of 97 places in 109 ms of which 1 ms to minimize.
[2021-05-09 06:59:17] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 1 ms to minimize.
[2021-05-09 06:59:17] [INFO ] Deduced a trap composed of 98 places in 157 ms of which 0 ms to minimize.
[2021-05-09 06:59:18] [INFO ] Deduced a trap composed of 101 places in 90 ms of which 0 ms to minimize.
[2021-05-09 06:59:18] [INFO ] Deduced a trap composed of 95 places in 131 ms of which 1 ms to minimize.
[2021-05-09 06:59:18] [INFO ] Deduced a trap composed of 115 places in 176 ms of which 1 ms to minimize.
[2021-05-09 06:59:18] [INFO ] Deduced a trap composed of 111 places in 95 ms of which 1 ms to minimize.
[2021-05-09 06:59:18] [INFO ] Deduced a trap composed of 106 places in 94 ms of which 1 ms to minimize.
[2021-05-09 06:59:18] [INFO ] Deduced a trap composed of 94 places in 90 ms of which 1 ms to minimize.
[2021-05-09 06:59:18] [INFO ] Deduced a trap composed of 103 places in 105 ms of which 1 ms to minimize.
[2021-05-09 06:59:18] [INFO ] Deduced a trap composed of 100 places in 91 ms of which 0 ms to minimize.
[2021-05-09 06:59:18] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2670 ms
[2021-05-09 06:59:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:59:19] [INFO ] [Nat]Absence check using 33 positive place invariants in 15 ms returned sat
[2021-05-09 06:59:19] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 9 ms returned sat
[2021-05-09 06:59:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:59:19] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2021-05-09 06:59:19] [INFO ] Deduced a trap composed of 8 places in 124 ms of which 1 ms to minimize.
[2021-05-09 06:59:19] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 1 ms to minimize.
[2021-05-09 06:59:19] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 6 ms to minimize.
[2021-05-09 06:59:19] [INFO ] Deduced a trap composed of 104 places in 107 ms of which 1 ms to minimize.
[2021-05-09 06:59:19] [INFO ] Deduced a trap composed of 92 places in 154 ms of which 0 ms to minimize.
[2021-05-09 06:59:20] [INFO ] Deduced a trap composed of 101 places in 152 ms of which 1 ms to minimize.
[2021-05-09 06:59:21] [INFO ] Deduced a trap composed of 14 places in 1199 ms of which 0 ms to minimize.
[2021-05-09 06:59:21] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2159 ms
[2021-05-09 06:59:21] [INFO ] Computed and/alt/rep : 339/625/339 causal constraints (skipped 20 transitions) in 39 ms.
[2021-05-09 06:59:22] [INFO ] Added : 204 causal constraints over 41 iterations in 1510 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2021-05-09 06:59:23] [INFO ] [Real]Absence check using 33 positive place invariants in 23 ms returned sat
[2021-05-09 06:59:23] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 17 ms returned sat
[2021-05-09 06:59:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:59:23] [INFO ] [Real]Absence check using state equation in 166 ms returned unsat
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 30500 steps, including 384 resets, run finished after 82 ms. (steps per millisecond=371 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 17600 steps, including 210 resets, run finished after 43 ms. (steps per millisecond=409 ) properties (out of 2) seen :1 could not realise parikh vector
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 386 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 386/386 places, 360/360 transitions.
Graph (trivial) has 216 edges and 386 vertex of which 7 / 386 are part of one of the 1 SCC in 16 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 805 edges and 380 vertex of which 378 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 84 place count 378 transition count 269
Reduce places removed 82 places and 0 transitions.
Iterating post reduction 1 with 82 rules applied. Total rules applied 166 place count 296 transition count 269
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 59 Pre rules applied. Total rules applied 166 place count 296 transition count 210
Deduced a syphon composed of 59 places in 2 ms
Ensure Unique test removed 9 places
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 127 rules applied. Total rules applied 293 place count 228 transition count 210
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 337 place count 184 transition count 166
Iterating global reduction 2 with 44 rules applied. Total rules applied 381 place count 184 transition count 166
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 381 place count 184 transition count 161
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 391 place count 179 transition count 161
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 511 place count 118 transition count 102
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 513 place count 117 transition count 105
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 515 place count 117 transition count 103
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 517 place count 115 transition count 103
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 518 place count 115 transition count 103
Applied a total of 518 rules in 150 ms. Remains 115 /386 variables (removed 271) and now considering 103/360 (removed 257) transitions.
Finished structural reductions, in 1 iterations. Remains : 115/386 places, 103/360 transitions.
[2021-05-09 06:59:23] [INFO ] Flatten gal took : 97 ms
[2021-05-09 06:59:23] [INFO ] Flatten gal took : 36 ms
[2021-05-09 06:59:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8129528269940081319.gal : 19 ms
[2021-05-09 06:59:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5804550842465502986.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/ReachabilityCardinality8129528269940081319.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality5804550842465502986.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/ReachabilityCardinality8129528269940081319.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality5804550842465502986.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality5804550842465502986.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 17
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :17 after 41
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :41 after 137
Reachability property BusinessProcesses-PT-07-ReachabilityFireability-06 is true.
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-06 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 17 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,745,0.127109,6952,2,1022,9,13535,6,0,563,5903,0
Total reachable state count : 745

Verifying 1 reachability properties.
Reachability property BusinessProcesses-PT-07-ReachabilityFireability-06 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-07-ReachabilityFireability-06,1,0.129123,7216,2,116,9,13535,7,0,566,5903,0
All properties solved without resorting to model-checking.

BK_STOP 1620543564478

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

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