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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.6K Feb 25 16:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 25 16:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 16:48 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.6K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 16:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 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 141K 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-11-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678362487481

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-11
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202303021504
[2023-03-09 11:48:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 11:48:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 11:48:10] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2023-03-09 11:48:10] [INFO ] Transformed 567 places.
[2023-03-09 11:48:10] [INFO ] Transformed 508 transitions.
[2023-03-09 11:48:10] [INFO ] Found NUPN structural information;
[2023-03-09 11:48:10] [INFO ] Parsed PT model containing 567 places and 508 transitions and 1512 arcs in 288 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 7 places in 7 ms
Reduce places removed 7 places and 7 transitions.
Incomplete random walk after 10000 steps, including 74 resets, run finished after 672 ms. (steps per millisecond=14 ) properties (out of 16) seen :5
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 11) seen :0
[2023-03-09 11:48:11] [INFO ] Flatten gal took : 168 ms
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 11) seen :0
[2023-03-09 11:48:11] [INFO ] Flatten gal took : 92 ms
[2023-03-09 11:48:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15031584306205952933.gal : 42 ms
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 11) seen :0
[2023-03-09 11:48:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15973259703048934698.prop : 2 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/ReachabilityCardinality15031584306205952933.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15973259703048934698.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 ...330
Loading property file /tmp/ReachabilityCardinality15973259703048934698.prop.
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 11) seen :0
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :6 after 7
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :7 after 11
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :11 after 61
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :61 after 101
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :101 after 353
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :353 after 609
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 11) seen :0
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :609 after 1997
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :1997 after 41565
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 11) seen :0
SDD proceeding with computation,11 properties remain. new max is 4096
SDD size :1.99523e+06 after 1.64196e+07
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 501 rows 560 cols
[2023-03-09 11:48:13] [INFO ] Computed 95 place invariants in 44 ms
SDD proceeding with computation,11 properties remain. new max is 8192
SDD size :1.64196e+07 after 3.17094e+08
SDD proceeding with computation,11 properties remain. new max is 16384
SDD size :3.17094e+08 after 1.14665e+09
[2023-03-09 11:48:14] [INFO ] After 1022ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-09 11:48:14] [INFO ] [Nat]Absence check using 53 positive place invariants in 73 ms returned sat
[2023-03-09 11:48:14] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 11 ms returned sat
[2023-03-09 11:48:16] [INFO ] After 1153ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :7
[2023-03-09 11:48:16] [INFO ] Deduced a trap composed of 12 places in 386 ms of which 166 ms to minimize.
[2023-03-09 11:48:16] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 2 ms to minimize.
[2023-03-09 11:48:16] [INFO ] Deduced a trap composed of 22 places in 160 ms of which 2 ms to minimize.
[2023-03-09 11:48:17] [INFO ] Deduced a trap composed of 14 places in 266 ms of which 2 ms to minimize.
[2023-03-09 11:48:17] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 1 ms to minimize.
[2023-03-09 11:48:17] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 1 ms to minimize.
[2023-03-09 11:48:17] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 2 ms to minimize.
[2023-03-09 11:48:17] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 1 ms to minimize.
[2023-03-09 11:48:17] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 1 ms to minimize.
[2023-03-09 11:48:17] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 1 ms to minimize.
[2023-03-09 11:48:18] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 0 ms to minimize.
[2023-03-09 11:48:18] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 1 ms to minimize.
[2023-03-09 11:48:18] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 1 ms to minimize.
[2023-03-09 11:48:18] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 1 ms to minimize.
[2023-03-09 11:48:18] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 0 ms to minimize.
[2023-03-09 11:48:18] [INFO ] Deduced a trap composed of 42 places in 144 ms of which 0 ms to minimize.
[2023-03-09 11:48:19] [INFO ] Deduced a trap composed of 55 places in 105 ms of which 0 ms to minimize.
[2023-03-09 11:48:19] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 1 ms to minimize.
[2023-03-09 11:48:19] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 0 ms to minimize.
[2023-03-09 11:48:19] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 0 ms to minimize.
[2023-03-09 11:48:19] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
[2023-03-09 11:48:19] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 3270 ms
[2023-03-09 11:48:19] [INFO ] Deduced a trap composed of 26 places in 258 ms of which 1 ms to minimize.
[2023-03-09 11:48:19] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 1 ms to minimize.
[2023-03-09 11:48:20] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 0 ms to minimize.
[2023-03-09 11:48:20] [INFO ] Deduced a trap composed of 24 places in 176 ms of which 1 ms to minimize.
[2023-03-09 11:48:20] [INFO ] Deduced a trap composed of 33 places in 154 ms of which 0 ms to minimize.
[2023-03-09 11:48:20] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 2 ms to minimize.
[2023-03-09 11:48:20] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1098 ms
[2023-03-09 11:48:21] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 0 ms to minimize.
[2023-03-09 11:48:21] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 1 ms to minimize.
[2023-03-09 11:48:21] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 0 ms to minimize.
[2023-03-09 11:48:21] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 1 ms to minimize.
[2023-03-09 11:48:22] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 0 ms to minimize.
[2023-03-09 11:48:22] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 1 ms to minimize.
SDD proceeding with computation,11 properties remain. new max is 32768
SDD size :1.14665e+09 after 7.59996e+10
[2023-03-09 11:48:26] [INFO ] Deduced a trap composed of 45 places in 4582 ms of which 18 ms to minimize.
[2023-03-09 11:48:27] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 0 ms to minimize.
[2023-03-09 11:48:27] [INFO ] Deduced a trap composed of 36 places in 116 ms of which 1 ms to minimize.
[2023-03-09 11:48:27] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 1 ms to minimize.
[2023-03-09 11:48:27] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 6169 ms
SDD proceeding with computation,11 properties remain. new max is 65536
[2023-03-09 11:48:28] [INFO ] Deduced a trap composed of 112 places in 334 ms of which 1 ms to minimize.
SDD size :7.59996e+10 after 1.70204e+16
[2023-03-09 11:48:28] [INFO ] Deduced a trap composed of 26 places in 273 ms of which 1 ms to minimize.
[2023-03-09 11:48:28] [INFO ] Deduced a trap composed of 32 places in 283 ms of which 2 ms to minimize.
[2023-03-09 11:48:28] [INFO ] Deduced a trap composed of 39 places in 207 ms of which 1 ms to minimize.
[2023-03-09 11:48:29] [INFO ] Deduced a trap composed of 40 places in 184 ms of which 1 ms to minimize.
[2023-03-09 11:48:29] [INFO ] Deduced a trap composed of 114 places in 183 ms of which 1 ms to minimize.
[2023-03-09 11:48:29] [INFO ] Deduced a trap composed of 36 places in 191 ms of which 1 ms to minimize.
[2023-03-09 11:48:30] [INFO ] Deduced a trap composed of 52 places in 824 ms of which 1 ms to minimize.
[2023-03-09 11:48:30] [INFO ] Deduced a trap composed of 54 places in 127 ms of which 1 ms to minimize.
[2023-03-09 11:48:30] [INFO ] Deduced a trap composed of 100 places in 226 ms of which 1 ms to minimize.
[2023-03-09 11:48:30] [INFO ] Deduced a trap composed of 111 places in 139 ms of which 1 ms to minimize.
[2023-03-09 11:48:31] [INFO ] Deduced a trap composed of 119 places in 228 ms of which 1 ms to minimize.
[2023-03-09 11:48:31] [INFO ] Deduced a trap composed of 43 places in 190 ms of which 1 ms to minimize.
[2023-03-09 11:48:31] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 1 ms to minimize.
[2023-03-09 11:48:31] [INFO ] Deduced a trap composed of 86 places in 139 ms of which 1 ms to minimize.
[2023-03-09 11:48:31] [INFO ] Deduced a trap composed of 48 places in 169 ms of which 1 ms to minimize.
[2023-03-09 11:48:32] [INFO ] Deduced a trap composed of 53 places in 133 ms of which 0 ms to minimize.
[2023-03-09 11:48:32] [INFO ] Deduced a trap composed of 111 places in 187 ms of which 1 ms to minimize.
[2023-03-09 11:48:32] [INFO ] Deduced a trap composed of 37 places in 127 ms of which 10 ms to minimize.
[2023-03-09 11:48:32] [INFO ] Deduced a trap composed of 107 places in 112 ms of which 0 ms to minimize.
[2023-03-09 11:48:32] [INFO ] Deduced a trap composed of 43 places in 141 ms of which 0 ms to minimize.
[2023-03-09 11:48:32] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 0 ms to minimize.
[2023-03-09 11:48:33] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 0 ms to minimize.
[2023-03-09 11:48:33] [INFO ] Deduced a trap composed of 106 places in 110 ms of which 1 ms to minimize.
[2023-03-09 11:48:33] [INFO ] Deduced a trap composed of 126 places in 158 ms of which 1 ms to minimize.
[2023-03-09 11:48:33] [INFO ] Deduced a trap composed of 104 places in 162 ms of which 0 ms to minimize.
[2023-03-09 11:48:33] [INFO ] Deduced a trap composed of 115 places in 182 ms of which 2 ms to minimize.
[2023-03-09 11:48:33] [INFO ] Deduced a trap composed of 59 places in 157 ms of which 1 ms to minimize.
[2023-03-09 11:48:33] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 6304 ms
[2023-03-09 11:48:34] [INFO ] After 19169ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :7
Attempting to minimize the solution found.
Minimization took 971 ms.
[2023-03-09 11:48:35] [INFO ] After 20818ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :7
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 130 ms.
Support contains 81 out of 560 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 560/560 places, 501/501 transitions.
Graph (complete) has 1140 edges and 560 vertex of which 555 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 555 transition count 446
Reduce places removed 54 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 64 rules applied. Total rules applied 119 place count 501 transition count 436
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 129 place count 491 transition count 436
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 129 place count 491 transition count 340
Deduced a syphon composed of 96 places in 2 ms
Ensure Unique test removed 12 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 204 rules applied. Total rules applied 333 place count 383 transition count 340
Discarding 50 places :
Symmetric choice reduction at 3 with 50 rule applications. Total rules 383 place count 333 transition count 290
Iterating global reduction 3 with 50 rules applied. Total rules applied 433 place count 333 transition count 290
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 3 with 143 rules applied. Total rules applied 576 place count 260 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 577 place count 260 transition count 219
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 579 place count 259 transition count 223
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 583 place count 259 transition count 223
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 584 place count 258 transition count 222
Applied a total of 584 rules in 210 ms. Remains 258 /560 variables (removed 302) and now considering 222/501 (removed 279) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 211 ms. Remains : 258/560 places, 222/501 transitions.
Incomplete random walk after 10000 steps, including 213 resets, run finished after 377 ms. (steps per millisecond=26 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 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 37 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Finished probabilistic random walk after 110195 steps, run visited all 7 properties in 412 ms. (steps per millisecond=267 )
Probabilistic random walk after 110195 steps, saw 17440 distinct states, run finished after 424 ms. (steps per millisecond=259 ) properties seen :7
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_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 26339 ms.

BK_STOP 1678362517247

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 ReachabilityFireability -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-11"
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-5348"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-11, 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 r037-tajo-167813690500535"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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