Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r037-tajo-167813690400486.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is BusinessProcesses-PT-05, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813690400486
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 16:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 16:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Feb 25 16:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 25 16:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 25 16:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 25 16:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 85K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678360233107

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-05
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202303021504
[2023-03-09 11:10:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 11:10:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 11:10:35] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2023-03-09 11:10:35] [INFO ] Transformed 368 places.
[2023-03-09 11:10:35] [INFO ] Transformed 319 transitions.
[2023-03-09 11:10:35] [INFO ] Found NUPN structural information;
[2023-03-09 11:10:35] [INFO ] Parsed PT model containing 368 places and 319 transitions and 854 arcs in 289 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1 places in 14 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-09 11:10:36] [INFO ] Flatten gal took : 99 ms
[2023-03-09 11:10:36] [INFO ] Flatten gal took : 33 ms
[2023-03-09 11:10:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6081936983489543856.gal : 17 ms
[2023-03-09 11:10:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1253172611527292966.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6081936983489543856.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1253172611527292966.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality1253172611527292966.prop.
SDD proceeding with computation,13 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,13 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,13 properties remain. new max is 16
SDD size :10 after 19
Invariant property BusinessProcesses-PT-05-ReachabilityCardinality-11 does not hold.
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :19 after 20
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :20 after 37
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :37 after 1752
Incomplete random walk after 10000 steps, including 90 resets, run finished after 971 ms. (steps per millisecond=10 ) properties (out of 13) seen :6
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 7) seen :1
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 318 rows 367 cols
[2023-03-09 11:10:37] [INFO ] Computed 57 place invariants in 25 ms
[2023-03-09 11:10:38] [INFO ] After 583ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 11:10:38] [INFO ] [Nat]Absence check using 41 positive place invariants in 27 ms returned sat
[2023-03-09 11:10:38] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 17 ms returned sat
[2023-03-09 11:10:39] [INFO ] After 660ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-09 11:10:39] [INFO ] Deduced a trap composed of 8 places in 260 ms of which 9 ms to minimize.
[2023-03-09 11:10:40] [INFO ] Deduced a trap composed of 11 places in 288 ms of which 2 ms to minimize.
[2023-03-09 11:10:40] [INFO ] Deduced a trap composed of 12 places in 250 ms of which 3 ms to minimize.
[2023-03-09 11:10:40] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 2 ms to minimize.
[2023-03-09 11:10:40] [INFO ] Deduced a trap composed of 8 places in 190 ms of which 14 ms to minimize.
[2023-03-09 11:10:41] [INFO ] Deduced a trap composed of 16 places in 159 ms of which 3 ms to minimize.
[2023-03-09 11:10:41] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 2 ms to minimize.
[2023-03-09 11:10:41] [INFO ] Deduced a trap composed of 16 places in 179 ms of which 0 ms to minimize.
[2023-03-09 11:10:43] [INFO ] Deduced a trap composed of 14 places in 1700 ms of which 1 ms to minimize.
[2023-03-09 11:10:43] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 1 ms to minimize.
[2023-03-09 11:10:43] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 1 ms to minimize.
[2023-03-09 11:10:43] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 1 ms to minimize.
[2023-03-09 11:10:43] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 0 ms to minimize.
[2023-03-09 11:10:43] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 1 ms to minimize.
[2023-03-09 11:10:43] [INFO ] Deduced a trap composed of 87 places in 83 ms of which 0 ms to minimize.
[2023-03-09 11:10:43] [INFO ] Deduced a trap composed of 89 places in 79 ms of which 0 ms to minimize.
[2023-03-09 11:10:43] [INFO ] Deduced a trap composed of 90 places in 73 ms of which 1 ms to minimize.
[2023-03-09 11:10:44] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 0 ms to minimize.
[2023-03-09 11:10:44] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 0 ms to minimize.
[2023-03-09 11:10:44] [INFO ] Deduced a trap composed of 87 places in 60 ms of which 1 ms to minimize.
[2023-03-09 11:10:44] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 0 ms to minimize.
[2023-03-09 11:10:44] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 0 ms to minimize.
[2023-03-09 11:10:44] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 0 ms to minimize.
[2023-03-09 11:10:44] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2023-03-09 11:10:44] [INFO ] Deduced a trap composed of 88 places in 62 ms of which 0 ms to minimize.
[2023-03-09 11:10:44] [INFO ] Deduced a trap composed of 88 places in 57 ms of which 1 ms to minimize.
[2023-03-09 11:10:44] [INFO ] Deduced a trap composed of 89 places in 56 ms of which 0 ms to minimize.
[2023-03-09 11:10:44] [INFO ] Deduced a trap composed of 88 places in 60 ms of which 0 ms to minimize.
[2023-03-09 11:10:44] [INFO ] Deduced a trap composed of 86 places in 56 ms of which 1 ms to minimize.
[2023-03-09 11:10:44] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2023-03-09 11:10:45] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 0 ms to minimize.
[2023-03-09 11:10:45] [INFO ] Deduced a trap composed of 81 places in 61 ms of which 0 ms to minimize.
[2023-03-09 11:10:45] [INFO ] Deduced a trap composed of 83 places in 56 ms of which 0 ms to minimize.
[2023-03-09 11:10:45] [INFO ] Deduced a trap composed of 85 places in 63 ms of which 1 ms to minimize.
[2023-03-09 11:10:45] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2023-03-09 11:10:45] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 5614 ms
[2023-03-09 11:10:45] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2023-03-09 11:10:45] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2023-03-09 11:10:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 99 ms
[2023-03-09 11:10:45] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 1 ms to minimize.
[2023-03-09 11:10:45] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 1 ms to minimize.
[2023-03-09 11:10:45] [INFO ] Deduced a trap composed of 95 places in 93 ms of which 1 ms to minimize.
[2023-03-09 11:10:46] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 0 ms to minimize.
[2023-03-09 11:10:46] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 0 ms to minimize.
[2023-03-09 11:10:46] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 1 ms to minimize.
[2023-03-09 11:10:46] [INFO ] Deduced a trap composed of 84 places in 115 ms of which 1 ms to minimize.
[2023-03-09 11:10:46] [INFO ] Deduced a trap composed of 90 places in 86 ms of which 1 ms to minimize.
[2023-03-09 11:10:46] [INFO ] Deduced a trap composed of 89 places in 71 ms of which 0 ms to minimize.
[2023-03-09 11:10:46] [INFO ] Deduced a trap composed of 89 places in 204 ms of which 1 ms to minimize.
[2023-03-09 11:10:46] [INFO ] Deduced a trap composed of 30 places in 153 ms of which 1 ms to minimize.
[2023-03-09 11:10:47] [INFO ] Deduced a trap composed of 86 places in 152 ms of which 1 ms to minimize.
[2023-03-09 11:10:47] [INFO ] Deduced a trap composed of 18 places in 152 ms of which 0 ms to minimize.
[2023-03-09 11:10:47] [INFO ] Deduced a trap composed of 89 places in 146 ms of which 1 ms to minimize.
[2023-03-09 11:10:47] [INFO ] Deduced a trap composed of 94 places in 140 ms of which 0 ms to minimize.
[2023-03-09 11:10:47] [INFO ] Deduced a trap composed of 98 places in 118 ms of which 0 ms to minimize.
[2023-03-09 11:10:47] [INFO ] Deduced a trap composed of 97 places in 119 ms of which 1 ms to minimize.
[2023-03-09 11:10:48] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 3 ms to minimize.
[2023-03-09 11:10:48] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2573 ms
[2023-03-09 11:10:48] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 0 ms to minimize.
[2023-03-09 11:10:48] [INFO ] Deduced a trap composed of 27 places in 182 ms of which 8 ms to minimize.
[2023-03-09 11:10:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 341 ms
[2023-03-09 11:10:48] [INFO ] Deduced a trap composed of 45 places in 84 ms of which 1 ms to minimize.
[2023-03-09 11:10:48] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 1 ms to minimize.
[2023-03-09 11:10:48] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 1 ms to minimize.
[2023-03-09 11:10:49] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 1 ms to minimize.
[2023-03-09 11:10:49] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 0 ms to minimize.
[2023-03-09 11:10:49] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2023-03-09 11:10:49] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2023-03-09 11:10:49] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 1 ms to minimize.
[2023-03-09 11:10:49] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 1 ms to minimize.
[2023-03-09 11:10:49] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 946 ms
[2023-03-09 11:10:49] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 0 ms to minimize.
[2023-03-09 11:10:49] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 3 ms to minimize.
[2023-03-09 11:10:49] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 10 ms to minimize.
[2023-03-09 11:10:50] [INFO ] Deduced a trap composed of 54 places in 52 ms of which 2 ms to minimize.
[2023-03-09 11:10:50] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 0 ms to minimize.
[2023-03-09 11:10:50] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 0 ms to minimize.
[2023-03-09 11:10:50] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2023-03-09 11:10:50] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 597 ms
[2023-03-09 11:10:50] [INFO ] After 11219ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 345 ms.
[2023-03-09 11:10:50] [INFO ] After 12109ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 4 properties in 97 ms.
Support contains 36 out of 367 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 367/367 places, 318/318 transitions.
Graph (trivial) has 200 edges and 367 vertex of which 8 / 367 are part of one of the 1 SCC in 6 ms
Free SCC test removed 7 places
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 700 edges and 360 vertex of which 357 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 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 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 69 rules applied. Total rules applied 71 place count 357 transition count 238
Reduce places removed 68 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 77 rules applied. Total rules applied 148 place count 289 transition count 229
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 157 place count 280 transition count 229
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 157 place count 280 transition count 187
Deduced a syphon composed of 42 places in 5 ms
Ensure Unique test removed 12 places
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 253 place count 226 transition count 187
Discarding 46 places :
Symmetric choice reduction at 3 with 46 rule applications. Total rules 299 place count 180 transition count 141
Iterating global reduction 3 with 46 rules applied. Total rules applied 345 place count 180 transition count 141
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 345 place count 180 transition count 138
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 351 place count 177 transition count 138
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 2 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 441 place count 132 transition count 93
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 442 place count 131 transition count 92
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 443 place count 130 transition count 92
Applied a total of 443 rules in 185 ms. Remains 130 /367 variables (removed 237) and now considering 92/318 (removed 226) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 193 ms. Remains : 130/367 places, 92/318 transitions.
Incomplete random walk after 10000 steps, including 165 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :1
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 1013 steps, including 4 resets, run visited all 1 properties in 15 ms. (steps per millisecond=67 )
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
All properties solved without resorting to model-checking.
Total runtime 15532 ms.

BK_STOP 1678360251765

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-05"
export BK_EXAMINATION="ReachabilityCardinality"
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-5348"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-05, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r037-tajo-167813690400486"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-05.tgz
mv BusinessProcesses-PT-05 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;