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.r041-tajo-167813694800510.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 ltsminxred
Input is BusinessProcesses-PT-08, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694800510
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.9K Feb 25 16:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 16:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 16:42 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.7K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K 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 9.7K Feb 25 16:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Feb 25 16:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 25 16:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 25 16:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 91K 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-08-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678641261608

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=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-08
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 17:14:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 17:14:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 17:14:23] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2023-03-12 17:14:23] [INFO ] Transformed 393 places.
[2023-03-12 17:14:23] [INFO ] Transformed 344 transitions.
[2023-03-12 17:14:23] [INFO ] Found NUPN structural information;
[2023-03-12 17:14:23] [INFO ] Parsed PT model containing 393 places and 344 transitions and 911 arcs in 136 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 13 places in 5 ms
Reduce places removed 13 places and 13 transitions.
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 82 resets, run finished after 440 ms. (steps per millisecond=22 ) properties (out of 12) seen :5
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :1
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 331 rows 380 cols
[2023-03-12 17:14:24] [INFO ] Computed 58 place invariants in 15 ms
[2023-03-12 17:14:24] [INFO ] After 314ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 17:14:24] [INFO ] [Nat]Absence check using 44 positive place invariants in 19 ms returned sat
[2023-03-12 17:14:24] [INFO ] [Nat]Absence check using 44 positive and 14 generalized place invariants in 4 ms returned sat
[2023-03-12 17:14:24] [INFO ] After 218ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2023-03-12 17:14:24] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 6 ms to minimize.
[2023-03-12 17:14:25] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 1 ms to minimize.
[2023-03-12 17:14:25] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2023-03-12 17:14:25] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 2 ms to minimize.
[2023-03-12 17:14:25] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 2 ms to minimize.
[2023-03-12 17:14:25] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 1 ms to minimize.
[2023-03-12 17:14:25] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2023-03-12 17:14:25] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 0 ms to minimize.
[2023-03-12 17:14:25] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 0 ms to minimize.
[2023-03-12 17:14:25] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 1 ms to minimize.
[2023-03-12 17:14:25] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 2 ms to minimize.
[2023-03-12 17:14:25] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 918 ms
[2023-03-12 17:14:25] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 1 ms to minimize.
[2023-03-12 17:14:26] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 0 ms to minimize.
[2023-03-12 17:14:26] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 2 ms to minimize.
[2023-03-12 17:14:26] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 0 ms to minimize.
[2023-03-12 17:14:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 514 ms
[2023-03-12 17:14:26] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 1 ms to minimize.
[2023-03-12 17:14:26] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 1 ms to minimize.
[2023-03-12 17:14:26] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 0 ms to minimize.
[2023-03-12 17:14:26] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 0 ms to minimize.
[2023-03-12 17:14:26] [INFO ] Deduced a trap composed of 89 places in 89 ms of which 0 ms to minimize.
[2023-03-12 17:14:27] [INFO ] Deduced a trap composed of 87 places in 81 ms of which 1 ms to minimize.
[2023-03-12 17:14:27] [INFO ] Deduced a trap composed of 88 places in 85 ms of which 1 ms to minimize.
[2023-03-12 17:14:27] [INFO ] Deduced a trap composed of 90 places in 79 ms of which 0 ms to minimize.
[2023-03-12 17:14:27] [INFO ] Deduced a trap composed of 83 places in 83 ms of which 1 ms to minimize.
[2023-03-12 17:14:27] [INFO ] Deduced a trap composed of 90 places in 84 ms of which 0 ms to minimize.
[2023-03-12 17:14:27] [INFO ] Deduced a trap composed of 86 places in 87 ms of which 1 ms to minimize.
[2023-03-12 17:14:27] [INFO ] Deduced a trap composed of 93 places in 82 ms of which 0 ms to minimize.
[2023-03-12 17:14:27] [INFO ] Deduced a trap composed of 88 places in 78 ms of which 1 ms to minimize.
[2023-03-12 17:14:27] [INFO ] Deduced a trap composed of 90 places in 79 ms of which 0 ms to minimize.
[2023-03-12 17:14:28] [INFO ] Deduced a trap composed of 85 places in 94 ms of which 0 ms to minimize.
[2023-03-12 17:14:28] [INFO ] Deduced a trap composed of 85 places in 77 ms of which 0 ms to minimize.
[2023-03-12 17:14:28] [INFO ] Deduced a trap composed of 96 places in 82 ms of which 1 ms to minimize.
[2023-03-12 17:14:28] [INFO ] Deduced a trap composed of 91 places in 76 ms of which 0 ms to minimize.
[2023-03-12 17:14:28] [INFO ] Deduced a trap composed of 90 places in 81 ms of which 1 ms to minimize.
[2023-03-12 17:14:28] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2083 ms
[2023-03-12 17:14:28] [INFO ] After 3864ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 168 ms.
[2023-03-12 17:14:28] [INFO ] After 4205ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 4 different solutions.
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 41 ms.
Support contains 32 out of 380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 331/331 transitions.
Graph (trivial) has 196 edges and 380 vertex of which 8 / 380 are part of one of the 1 SCC in 4 ms
Free SCC test removed 7 places
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 724 edges and 373 vertex of which 364 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 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 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 71 rules applied. Total rules applied 73 place count 364 transition count 249
Reduce places removed 70 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 77 rules applied. Total rules applied 150 place count 294 transition count 242
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 157 place count 287 transition count 242
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 157 place count 287 transition count 198
Deduced a syphon composed of 44 places in 2 ms
Ensure Unique test removed 9 places
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 97 rules applied. Total rules applied 254 place count 234 transition count 198
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 306 place count 182 transition count 146
Iterating global reduction 3 with 52 rules applied. Total rules applied 358 place count 182 transition count 146
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 358 place count 182 transition count 143
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 366 place count 177 transition count 143
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 462 place count 129 transition count 95
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 463 place count 128 transition count 94
Applied a total of 463 rules in 78 ms. Remains 128 /380 variables (removed 252) and now considering 94/331 (removed 237) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 128/380 places, 94/331 transitions.
Incomplete random walk after 10000 steps, including 191 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 3) seen :1
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 94 rows 128 cols
[2023-03-12 17:14:28] [INFO ] Computed 40 place invariants in 11 ms
[2023-03-12 17:14:29] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 17:14:29] [INFO ] [Nat]Absence check using 37 positive place invariants in 5 ms returned sat
[2023-03-12 17:14:29] [INFO ] [Nat]Absence check using 37 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-12 17:14:29] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 17:14:29] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2023-03-12 17:14:29] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2023-03-12 17:14:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 77 ms
[2023-03-12 17:14:29] [INFO ] After 152ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-12 17:14:29] [INFO ] After 218ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 30 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 94/94 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 128 transition count 93
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 127 transition count 93
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 125 transition count 91
Applied a total of 6 rules in 11 ms. Remains 125 /128 variables (removed 3) and now considering 91/94 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 125/128 places, 91/94 transitions.
Incomplete random walk after 10000 steps, including 194 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 52 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 981983 steps, run timeout after 3001 ms. (steps per millisecond=327 ) properties seen :{}
Probabilistic random walk after 981983 steps, saw 132254 distinct states, run finished after 3002 ms. (steps per millisecond=327 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 91 rows 125 cols
[2023-03-12 17:14:32] [INFO ] Computed 40 place invariants in 2 ms
[2023-03-12 17:14:32] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 17:14:32] [INFO ] [Nat]Absence check using 37 positive place invariants in 5 ms returned sat
[2023-03-12 17:14:32] [INFO ] [Nat]Absence check using 37 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-12 17:14:32] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 17:14:32] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2023-03-12 17:14:32] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2023-03-12 17:14:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 66 ms
[2023-03-12 17:14:32] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2023-03-12 17:14:32] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2023-03-12 17:14:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 124 ms
[2023-03-12 17:14:32] [INFO ] After 280ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-12 17:14:32] [INFO ] After 348ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 30 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 91/91 transitions.
Applied a total of 0 rules in 4 ms. Remains 125 /125 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 125/125 places, 91/91 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 91/91 transitions.
Applied a total of 0 rules in 5 ms. Remains 125 /125 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2023-03-12 17:14:32] [INFO ] Invariant cache hit.
[2023-03-12 17:14:32] [INFO ] Implicit Places using invariants in 79 ms returned [9, 31, 32, 33, 116]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 81 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 120/125 places, 91/91 transitions.
Applied a total of 0 rules in 4 ms. Remains 120 /120 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 90 ms. Remains : 120/125 places, 91/91 transitions.
Incomplete random walk after 10000 steps, including 192 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1088043 steps, run timeout after 3001 ms. (steps per millisecond=362 ) properties seen :{}
Probabilistic random walk after 1088043 steps, saw 143916 distinct states, run finished after 3001 ms. (steps per millisecond=362 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 91 rows 120 cols
[2023-03-12 17:14:36] [INFO ] Computed 35 place invariants in 4 ms
[2023-03-12 17:14:36] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 17:14:36] [INFO ] [Nat]Absence check using 34 positive place invariants in 5 ms returned sat
[2023-03-12 17:14:36] [INFO ] [Nat]Absence check using 34 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 17:14:36] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 17:14:36] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2023-03-12 17:14:36] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2023-03-12 17:14:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 59 ms
[2023-03-12 17:14:36] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2023-03-12 17:14:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2023-03-12 17:14:36] [INFO ] After 156ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-12 17:14:36] [INFO ] After 224ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 3 ms.
Support contains 2 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 91/91 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 120 transition count 83
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 112 transition count 83
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 16 place count 112 transition count 74
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 34 place count 103 transition count 74
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 38 place count 99 transition count 70
Iterating global reduction 2 with 4 rules applied. Total rules applied 42 place count 99 transition count 70
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 82 place count 78 transition count 51
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 76 transition count 49
Applied a total of 84 rules in 29 ms. Remains 76 /120 variables (removed 44) and now considering 49/91 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 76/120 places, 49/91 transitions.
Incomplete random walk after 10000 steps, including 436 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 212 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Probably explored full state space saw : 116 states, properties seen :0
Probabilistic random walk after 319 steps, saw 116 distinct states, run finished after 7 ms. (steps per millisecond=45 ) properties seen :0
Explored full state space saw : 116 states, properties seen :0
Exhaustive walk after 319 steps, saw 116 distinct states, run finished after 2 ms. (steps per millisecond=159 ) properties seen :0
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
All properties solved without resorting to model-checking.
Total runtime 13289 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/625/inv_0_ --invariant=/tmp/625/inv_1_ --invariant=/tmp/625/inv_2_ --invariant=/tmp/625/inv_3_ --invariant=/tmp/625/inv_4_ --invariant=/tmp/625/inv_5_ --invariant=/tmp/625/inv_6_ --invariant=/tmp/625/inv_7_ --invariant=/tmp/625/inv_8_ --invariant=/tmp/625/inv_9_ --invariant=/tmp/625/inv_10_ --invariant=/tmp/625/inv_11_ --invariant=/tmp/625/inv_12_ --invariant=/tmp/625/inv_13_ --invariant=/tmp/625/inv_14_ --invariant=/tmp/625/inv_15_ --inv-par
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678641540556

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023
rfs formula name BusinessProcesses-PT-08-ReachabilityCardinality-00
rfs formula type AG
rfs formula formula --invariant=/tmp/625/inv_0_
rfs formula name BusinessProcesses-PT-08-ReachabilityCardinality-01
rfs formula type AG
rfs formula formula --invariant=/tmp/625/inv_1_
rfs formula name BusinessProcesses-PT-08-ReachabilityCardinality-02
rfs formula type AG
rfs formula formula --invariant=/tmp/625/inv_2_
rfs formula name BusinessProcesses-PT-08-ReachabilityCardinality-03
rfs formula type EF
rfs formula formula --invariant=/tmp/625/inv_3_
rfs formula name BusinessProcesses-PT-08-ReachabilityCardinality-04
rfs formula type AG
rfs formula formula --invariant=/tmp/625/inv_4_
rfs formula name BusinessProcesses-PT-08-ReachabilityCardinality-05
rfs formula type EF
rfs formula formula --invariant=/tmp/625/inv_5_
rfs formula name BusinessProcesses-PT-08-ReachabilityCardinality-06
rfs formula type AG
rfs formula formula --invariant=/tmp/625/inv_6_
rfs formula name BusinessProcesses-PT-08-ReachabilityCardinality-07
rfs formula type AG
rfs formula formula --invariant=/tmp/625/inv_7_
rfs formula name BusinessProcesses-PT-08-ReachabilityCardinality-08
rfs formula type AG
rfs formula formula --invariant=/tmp/625/inv_8_
rfs formula name BusinessProcesses-PT-08-ReachabilityCardinality-09
rfs formula type AG
rfs formula formula --invariant=/tmp/625/inv_9_
rfs formula name BusinessProcesses-PT-08-ReachabilityCardinality-10
rfs formula type EF
rfs formula formula --invariant=/tmp/625/inv_10_
rfs formula name BusinessProcesses-PT-08-ReachabilityCardinality-11
rfs formula type AG
rfs formula formula --invariant=/tmp/625/inv_11_
rfs formula name BusinessProcesses-PT-08-ReachabilityCardinality-12
rfs formula type AG
rfs formula formula --invariant=/tmp/625/inv_12_
rfs formula name BusinessProcesses-PT-08-ReachabilityCardinality-13
rfs formula type EF
rfs formula formula --invariant=/tmp/625/inv_13_
rfs formula name BusinessProcesses-PT-08-ReachabilityCardinality-14
rfs formula type AG
rfs formula formula --invariant=/tmp/625/inv_14_
rfs formula name BusinessProcesses-PT-08-ReachabilityCardinality-15
rfs formula type AG
rfs formula formula --invariant=/tmp/625/inv_15_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 393 places, 344 transitions and 911 arcs
pnml2lts-sym: Petri net BusinessProcesses-PT-08 analyzed
pnml2lts-sym: There are safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 344->344 groups
pnml2lts-sym: Regrouping took 0.090 real 0.090 user 0.000 sys
pnml2lts-sym: state vector length is 393; there are 344 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/625/inv_4_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/625/inv_8_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/625/inv_11_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/625/inv_12_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/625/inv_3_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/625/inv_13_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/625/inv_9_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/625/inv_7_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/625/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: Exploration took 20887100 group checks and 0 next state calls
pnml2lts-sym: reachability took 261.880 real 1037.810 user 8.570 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 1.460 real 5.870 user 0.000 sys
pnml2lts-sym: state space has 4.94000312906449e+17 states, 5899714 nodes
pnml2lts-sym: group_next: 1637 nodes total
pnml2lts-sym: group_explored: 858 nodes, 929 short vectors total
pnml2lts-sym: max token count: 1

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-08"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is BusinessProcesses-PT-08, 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 r041-tajo-167813694800510"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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