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.r043-tajo-167813697000526.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 smartxred
Input is BusinessProcesses-PT-10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-tajo-167813697000526
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 25 16:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:50 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.3K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 16:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Feb 25 16:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 16:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 16:52 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 131K 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-10-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678791514359

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=smartxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-10
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 10:58:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 10:58:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 10:58:36] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2023-03-14 10:58:36] [INFO ] Transformed 518 places.
[2023-03-14 10:58:36] [INFO ] Transformed 471 transitions.
[2023-03-14 10:58:36] [INFO ] Found NUPN structural information;
[2023-03-14 10:58:36] [INFO ] Parsed PT model containing 518 places and 471 transitions and 1415 arcs in 123 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 79 resets, run finished after 394 ms. (steps per millisecond=25 ) properties (out of 11) seen :6
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :1
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 471 rows 518 cols
[2023-03-14 10:58:37] [INFO ] Computed 85 place invariants in 28 ms
[2023-03-14 10:58:37] [INFO ] After 310ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-14 10:58:37] [INFO ] [Nat]Absence check using 48 positive place invariants in 14 ms returned sat
[2023-03-14 10:58:37] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 10 ms returned sat
[2023-03-14 10:58:37] [INFO ] After 240ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-14 10:58:38] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 7 ms to minimize.
[2023-03-14 10:58:38] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 0 ms to minimize.
[2023-03-14 10:58:38] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2023-03-14 10:58:38] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2023-03-14 10:58:38] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2023-03-14 10:58:38] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 0 ms to minimize.
[2023-03-14 10:58:38] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2023-03-14 10:58:38] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2023-03-14 10:58:38] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2023-03-14 10:58:38] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 0 ms to minimize.
[2023-03-14 10:58:38] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 1 ms to minimize.
[2023-03-14 10:58:39] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 0 ms to minimize.
[2023-03-14 10:58:39] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2023-03-14 10:58:39] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2023-03-14 10:58:39] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2023-03-14 10:58:39] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1365 ms
[2023-03-14 10:58:39] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2023-03-14 10:58:39] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
[2023-03-14 10:58:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 205 ms
[2023-03-14 10:58:39] [INFO ] After 1968ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 167 ms.
[2023-03-14 10:58:39] [INFO ] After 2335ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 48 ms.
Support contains 37 out of 518 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 518/518 places, 471/471 transitions.
Graph (trivial) has 269 edges and 518 vertex of which 7 / 518 are part of one of the 1 SCC in 6 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 93 transitions
Trivial Post-agglo rules discarded 93 transitions
Performed 93 trivial Post agglomeration. Transition count delta: 93
Iterating post reduction 0 with 93 rules applied. Total rules applied 94 place count 512 transition count 370
Reduce places removed 93 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 105 rules applied. Total rules applied 199 place count 419 transition count 358
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 211 place count 407 transition count 358
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 211 place count 407 transition count 290
Deduced a syphon composed of 68 places in 2 ms
Ensure Unique test removed 10 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 146 rules applied. Total rules applied 357 place count 329 transition count 290
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 415 place count 271 transition count 232
Iterating global reduction 3 with 58 rules applied. Total rules applied 473 place count 271 transition count 232
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 473 place count 271 transition count 226
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 13 rules applied. Total rules applied 486 place count 264 transition count 226
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 614 place count 200 transition count 162
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 616 place count 199 transition count 165
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 618 place count 199 transition count 163
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 620 place count 197 transition count 163
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 623 place count 197 transition count 163
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 624 place count 196 transition count 162
Applied a total of 624 rules in 142 ms. Remains 196 /518 variables (removed 322) and now considering 162/471 (removed 309) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 196/518 places, 162/471 transitions.
Incomplete random walk after 10000 steps, including 192 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 3) seen :1
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 162 rows 196 cols
[2023-03-14 10:58:40] [INFO ] Computed 74 place invariants in 15 ms
[2023-03-14 10:58:40] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 10:58:40] [INFO ] [Nat]Absence check using 48 positive place invariants in 14 ms returned sat
[2023-03-14 10:58:40] [INFO ] [Nat]Absence check using 48 positive and 26 generalized place invariants in 6 ms returned sat
[2023-03-14 10:58:40] [INFO ] After 126ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 10:58:40] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-14 10:58:40] [INFO ] After 79ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-14 10:58:40] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2023-03-14 10:58:40] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2023-03-14 10:58:40] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2023-03-14 10:58:40] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2023-03-14 10:58:40] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2023-03-14 10:58:40] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2023-03-14 10:58:40] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 381 ms
[2023-03-14 10:58:41] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 1 ms to minimize.
[2023-03-14 10:58:41] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 0 ms to minimize.
[2023-03-14 10:58:41] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 1 ms to minimize.
[2023-03-14 10:58:41] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 0 ms to minimize.
[2023-03-14 10:58:41] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2023-03-14 10:58:41] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 0 ms to minimize.
[2023-03-14 10:58:41] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 0 ms to minimize.
[2023-03-14 10:58:41] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 674 ms
[2023-03-14 10:58:41] [INFO ] After 1236ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 84 ms.
[2023-03-14 10:58:41] [INFO ] After 1528ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 ms.
Support contains 36 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 162/162 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 196 transition count 161
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 195 transition count 161
Applied a total of 2 rules in 24 ms. Remains 195 /196 variables (removed 1) and now considering 161/162 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 195/196 places, 161/162 transitions.
Incomplete random walk after 10000 steps, including 196 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 2) seen :1
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 161 rows 195 cols
[2023-03-14 10:58:41] [INFO ] Computed 74 place invariants in 7 ms
[2023-03-14 10:58:42] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 10:58:42] [INFO ] [Nat]Absence check using 46 positive place invariants in 8 ms returned sat
[2023-03-14 10:58:42] [INFO ] [Nat]Absence check using 46 positive and 28 generalized place invariants in 6 ms returned sat
[2023-03-14 10:58:42] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 10:58:42] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-14 10:58:42] [INFO ] After 19ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 10:58:42] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2023-03-14 10:58:42] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2023-03-14 10:58:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 101 ms
[2023-03-14 10:58:42] [INFO ] After 139ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-14 10:58:42] [INFO ] After 304ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 8 out of 195 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 195/195 places, 161/161 transitions.
Graph (complete) has 656 edges and 195 vertex of which 193 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 193 transition count 155
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 188 transition count 155
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 11 place count 188 transition count 147
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 19 rules applied. Total rules applied 30 place count 177 transition count 147
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 32 place count 175 transition count 145
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 175 transition count 145
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 71 place count 155 transition count 128
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 73 place count 154 transition count 145
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 154 transition count 145
Applied a total of 74 rules in 52 ms. Remains 154 /195 variables (removed 41) and now considering 145/161 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 154/195 places, 145/161 transitions.
Incomplete random walk after 10000 steps, including 342 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 129 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1297112 steps, run timeout after 3001 ms. (steps per millisecond=432 ) properties seen :{}
Probabilistic random walk after 1297112 steps, saw 350443 distinct states, run finished after 3005 ms. (steps per millisecond=431 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 145 rows 154 cols
[2023-03-14 10:58:45] [INFO ] Computed 67 place invariants in 4 ms
[2023-03-14 10:58:45] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 10:58:45] [INFO ] [Nat]Absence check using 46 positive place invariants in 11 ms returned sat
[2023-03-14 10:58:45] [INFO ] [Nat]Absence check using 46 positive and 21 generalized place invariants in 10 ms returned sat
[2023-03-14 10:58:45] [INFO ] After 91ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 10:58:45] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-14 10:58:45] [INFO ] After 58ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 10:58:45] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 1 ms to minimize.
[2023-03-14 10:58:45] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2023-03-14 10:58:46] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 0 ms to minimize.
[2023-03-14 10:58:46] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2023-03-14 10:58:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 332 ms
[2023-03-14 10:58:46] [INFO ] After 432ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-14 10:58:46] [INFO ] After 634ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 8 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 145/145 transitions.
Applied a total of 0 rules in 9 ms. Remains 154 /154 variables (removed 0) and now considering 145/145 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 154/154 places, 145/145 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 145/145 transitions.
Applied a total of 0 rules in 8 ms. Remains 154 /154 variables (removed 0) and now considering 145/145 (removed 0) transitions.
[2023-03-14 10:58:46] [INFO ] Invariant cache hit.
[2023-03-14 10:58:46] [INFO ] Implicit Places using invariants in 157 ms returned [12, 20, 21, 22, 37, 39, 41, 47, 49, 51, 53]
Discarding 11 places :
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Implicit Place search using SMT only with invariants took 160 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 143/154 places, 131/145 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 139 transition count 115
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 139 transition count 115
Applied a total of 8 rules in 11 ms. Remains 139 /143 variables (removed 4) and now considering 115/131 (removed 16) transitions.
// Phase 1: matrix 115 rows 139 cols
[2023-03-14 10:58:46] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-14 10:58:46] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-14 10:58:46] [INFO ] Invariant cache hit.
[2023-03-14 10:58:46] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-14 10:58:46] [INFO ] Implicit Places using invariants and state equation in 189 ms returned [79, 85, 91, 93]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 305 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 135/154 places, 115/145 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 133 transition count 113
Applied a total of 4 rules in 12 ms. Remains 133 /135 variables (removed 2) and now considering 113/115 (removed 2) transitions.
// Phase 1: matrix 113 rows 133 cols
[2023-03-14 10:58:46] [INFO ] Computed 54 place invariants in 5 ms
[2023-03-14 10:58:46] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-14 10:58:46] [INFO ] Invariant cache hit.
[2023-03-14 10:58:46] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-14 10:58:46] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 133/154 places, 113/145 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 800 ms. Remains : 133/154 places, 113/145 transitions.
Incomplete random walk after 10000 steps, including 369 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1525934 steps, run timeout after 3001 ms. (steps per millisecond=508 ) properties seen :{}
Probabilistic random walk after 1525934 steps, saw 357948 distinct states, run finished after 3001 ms. (steps per millisecond=508 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-14 10:58:50] [INFO ] Invariant cache hit.
[2023-03-14 10:58:50] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 10:58:50] [INFO ] [Nat]Absence check using 40 positive place invariants in 7 ms returned sat
[2023-03-14 10:58:50] [INFO ] [Nat]Absence check using 40 positive and 14 generalized place invariants in 5 ms returned sat
[2023-03-14 10:58:50] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 10:58:50] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-14 10:58:50] [INFO ] After 31ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 10:58:50] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2023-03-14 10:58:50] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2023-03-14 10:58:50] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2023-03-14 10:58:50] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2023-03-14 10:58:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 207 ms
[2023-03-14 10:58:50] [INFO ] After 261ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-14 10:58:50] [INFO ] After 423ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 8 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 113/113 transitions.
Applied a total of 0 rules in 11 ms. Remains 133 /133 variables (removed 0) and now considering 113/113 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 133/133 places, 113/113 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 113/113 transitions.
Applied a total of 0 rules in 8 ms. Remains 133 /133 variables (removed 0) and now considering 113/113 (removed 0) transitions.
[2023-03-14 10:58:50] [INFO ] Invariant cache hit.
[2023-03-14 10:58:50] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-14 10:58:50] [INFO ] Invariant cache hit.
[2023-03-14 10:58:50] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-14 10:58:50] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
[2023-03-14 10:58:50] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-14 10:58:50] [INFO ] Invariant cache hit.
[2023-03-14 10:58:50] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 416 ms. Remains : 133/133 places, 113/113 transitions.
Graph (complete) has 470 edges and 133 vertex of which 130 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 130 transition count 112
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 130 transition count 111
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 129 transition count 111
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 10 place count 126 transition count 108
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 126 transition count 108
Applied a total of 11 rules in 15 ms. Remains 126 /133 variables (removed 7) and now considering 108/113 (removed 5) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 108 rows 126 cols
[2023-03-14 10:58:50] [INFO ] Computed 51 place invariants in 1 ms
[2023-03-14 10:58:50] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 10:58:50] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-14 10:58:50] [INFO ] [Nat]Absence check using 37 positive and 14 generalized place invariants in 2 ms returned sat
[2023-03-14 10:58:51] [INFO ] After 60ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 10:58:51] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-14 10:58:51] [INFO ] After 17ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 10:58:51] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2023-03-14 10:58:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2023-03-14 10:58:51] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-14 10:58:51] [INFO ] After 186ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-14 10:58:51] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2023-03-14 10:58:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 133 places, 113 transitions and 621 arcs took 3 ms.
[2023-03-14 10:58:51] [INFO ] Flatten gal took : 47 ms
Total runtime 15243 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running BusinessProcesses (PT), instance 10
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 133 places, 113 transitions, 621 arcs.
Final Score: 2135.953
Took : 8 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: BusinessProcesses-PT-10-ReachabilityCardinality-00 (reachable &!potential( ( ( ( ( ( (tk(P63)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P63)) ) ) | ( ( (tk(P2)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P2)) ) ) ) | ( ( ( (tk(P40)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P40)) ) ) | ( ( (tk(P100)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P100)) ) ) ) ) | ( ( ( ( (tk(P49)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P49)) ) ) | ( ( (tk(P5)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P5)) ) ) ) | ( ( ( (tk(P21)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P21)) ) ) | ( ( (tk(P90)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P90)) ) ) ) ) )))
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1678791540843

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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

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-10"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is BusinessProcesses-PT-10, 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 r043-tajo-167813697000526"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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