Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r065-tajo-171620415000375.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is BusinessProcesses-PT-19, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r065-tajo-171620415000375
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 11 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Apr 11 16:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 189K May 18 16:42 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-19-ReachabilityFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-2024-12
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-2024-13
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-2024-14
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716651598573

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=gold2023
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-19
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-25 15:40:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-25 15:40:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:40:00] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2024-05-25 15:40:00] [INFO ] Transformed 772 places.
[2024-05-25 15:40:00] [INFO ] Transformed 685 transitions.
[2024-05-25 15:40:00] [INFO ] Found NUPN structural information;
[2024-05-25 15:40:00] [INFO ] Parsed PT model containing 772 places and 685 transitions and 1981 arcs in 162 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 15 places in 14 ms
Reduce places removed 15 places and 15 transitions.
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 55 resets, run finished after 447 ms. (steps per millisecond=22 ) properties (out of 15) seen :5
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 10) seen :1
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 670 rows 757 cols
[2024-05-25 15:40:01] [INFO ] Computed 125 invariants in 34 ms
[2024-05-25 15:40:02] [INFO ] After 493ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-25 15:40:02] [INFO ] [Nat]Absence check using 78 positive place invariants in 29 ms returned sat
[2024-05-25 15:40:02] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 17 ms returned sat
[2024-05-25 15:40:04] [INFO ] After 1424ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :5
[2024-05-25 15:40:04] [INFO ] Deduced a trap composed of 25 places in 266 ms of which 10 ms to minimize.
[2024-05-25 15:40:04] [INFO ] Deduced a trap composed of 12 places in 171 ms of which 1 ms to minimize.
[2024-05-25 15:40:05] [INFO ] Deduced a trap composed of 8 places in 168 ms of which 1 ms to minimize.
[2024-05-25 15:40:05] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 0 ms to minimize.
[2024-05-25 15:40:05] [INFO ] Deduced a trap composed of 20 places in 146 ms of which 2 ms to minimize.
[2024-05-25 15:40:05] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 1 ms to minimize.
[2024-05-25 15:40:05] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 1 ms to minimize.
[2024-05-25 15:40:05] [INFO ] Deduced a trap composed of 18 places in 142 ms of which 0 ms to minimize.
[2024-05-25 15:40:06] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 1 ms to minimize.
[2024-05-25 15:40:06] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 1 ms to minimize.
[2024-05-25 15:40:06] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 1 ms to minimize.
[2024-05-25 15:40:06] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 3 ms to minimize.
[2024-05-25 15:40:06] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 0 ms to minimize.
[2024-05-25 15:40:06] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 1 ms to minimize.
[2024-05-25 15:40:06] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 1 ms to minimize.
[2024-05-25 15:40:07] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 1 ms to minimize.
[2024-05-25 15:40:07] [INFO ] Deduced a trap composed of 39 places in 124 ms of which 1 ms to minimize.
[2024-05-25 15:40:07] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 0 ms to minimize.
[2024-05-25 15:40:07] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 1 ms to minimize.
[2024-05-25 15:40:07] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 1 ms to minimize.
[2024-05-25 15:40:07] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 1 ms to minimize.
[2024-05-25 15:40:07] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 0 ms to minimize.
[2024-05-25 15:40:08] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 1 ms to minimize.
[2024-05-25 15:40:08] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 3824 ms
[2024-05-25 15:40:08] [INFO ] Deduced a trap composed of 30 places in 148 ms of which 0 ms to minimize.
[2024-05-25 15:40:09] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 0 ms to minimize.
[2024-05-25 15:40:09] [INFO ] Deduced a trap composed of 32 places in 146 ms of which 1 ms to minimize.
[2024-05-25 15:40:09] [INFO ] Deduced a trap composed of 42 places in 148 ms of which 1 ms to minimize.
[2024-05-25 15:40:09] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 876 ms
[2024-05-25 15:40:09] [INFO ] Deduced a trap composed of 26 places in 154 ms of which 0 ms to minimize.
[2024-05-25 15:40:09] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 1 ms to minimize.
[2024-05-25 15:40:10] [INFO ] Deduced a trap composed of 49 places in 128 ms of which 1 ms to minimize.
[2024-05-25 15:40:10] [INFO ] Deduced a trap composed of 56 places in 140 ms of which 1 ms to minimize.
[2024-05-25 15:40:10] [INFO ] Deduced a trap composed of 43 places in 137 ms of which 1 ms to minimize.
[2024-05-25 15:40:10] [INFO ] Deduced a trap composed of 49 places in 121 ms of which 0 ms to minimize.
[2024-05-25 15:40:10] [INFO ] Deduced a trap composed of 45 places in 114 ms of which 1 ms to minimize.
[2024-05-25 15:40:10] [INFO ] Deduced a trap composed of 50 places in 116 ms of which 2 ms to minimize.
[2024-05-25 15:40:10] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1350 ms
[2024-05-25 15:40:11] [INFO ] Deduced a trap composed of 78 places in 212 ms of which 1 ms to minimize.
[2024-05-25 15:40:11] [INFO ] Deduced a trap composed of 16 places in 207 ms of which 1 ms to minimize.
[2024-05-25 15:40:12] [INFO ] Deduced a trap composed of 27 places in 187 ms of which 1 ms to minimize.
[2024-05-25 15:40:12] [INFO ] Deduced a trap composed of 35 places in 195 ms of which 1 ms to minimize.
[2024-05-25 15:40:12] [INFO ] Deduced a trap composed of 172 places in 200 ms of which 1 ms to minimize.
[2024-05-25 15:40:12] [INFO ] Deduced a trap composed of 174 places in 200 ms of which 1 ms to minimize.
[2024-05-25 15:40:13] [INFO ] Deduced a trap composed of 164 places in 189 ms of which 1 ms to minimize.
[2024-05-25 15:40:13] [INFO ] Deduced a trap composed of 23 places in 199 ms of which 1 ms to minimize.
[2024-05-25 15:40:13] [INFO ] Deduced a trap composed of 42 places in 113 ms of which 1 ms to minimize.
[2024-05-25 15:40:13] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 0 ms to minimize.
[2024-05-25 15:40:13] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2374 ms
[2024-05-25 15:40:13] [INFO ] After 10968ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :5
Attempting to minimize the solution found.
Minimization took 1365 ms.
[2024-05-25 15:40:15] [INFO ] After 12699ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :5
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-2024-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-2024-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-2024-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-2024-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 95 ms.
Support contains 138 out of 757 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 757/757 places, 670/670 transitions.
Graph (complete) has 1520 edges and 757 vertex of which 748 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 68 place count 748 transition count 602
Reduce places removed 67 places and 0 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 1 with 89 rules applied. Total rules applied 157 place count 681 transition count 580
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 179 place count 659 transition count 580
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 121 Pre rules applied. Total rules applied 179 place count 659 transition count 459
Deduced a syphon composed of 121 places in 2 ms
Ensure Unique test removed 12 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 433 place count 526 transition count 459
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 497 place count 462 transition count 395
Iterating global reduction 3 with 64 rules applied. Total rules applied 561 place count 462 transition count 395
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 1 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 3 with 162 rules applied. Total rules applied 723 place count 381 transition count 314
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 725 place count 380 transition count 317
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 726 place count 380 transition count 316
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 727 place count 379 transition count 316
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 728 place count 379 transition count 316
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 729 place count 378 transition count 315
Applied a total of 729 rules in 205 ms. Remains 378 /757 variables (removed 379) and now considering 315/670 (removed 355) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 206 ms. Remains : 378/757 places, 315/670 transitions.
Incomplete random walk after 10000 steps, including 108 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 5) seen :2
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 315 rows 378 cols
[2024-05-25 15:40:15] [INFO ] Computed 105 invariants in 10 ms
[2024-05-25 15:40:15] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 15:40:15] [INFO ] [Nat]Absence check using 70 positive place invariants in 18 ms returned sat
[2024-05-25 15:40:15] [INFO ] [Nat]Absence check using 70 positive and 35 generalized place invariants in 18 ms returned sat
[2024-05-25 15:40:16] [INFO ] After 682ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 15:40:16] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-25 15:40:17] [INFO ] After 464ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-25 15:40:17] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 1 ms to minimize.
[2024-05-25 15:40:17] [INFO ] Deduced a trap composed of 62 places in 115 ms of which 0 ms to minimize.
[2024-05-25 15:40:17] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 1 ms to minimize.
[2024-05-25 15:40:17] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 1 ms to minimize.
[2024-05-25 15:40:18] [INFO ] Deduced a trap composed of 57 places in 106 ms of which 2 ms to minimize.
[2024-05-25 15:40:18] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 1 ms to minimize.
[2024-05-25 15:40:18] [INFO ] Deduced a trap composed of 65 places in 97 ms of which 1 ms to minimize.
[2024-05-25 15:40:18] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 1 ms to minimize.
[2024-05-25 15:40:18] [INFO ] Deduced a trap composed of 62 places in 112 ms of which 1 ms to minimize.
[2024-05-25 15:40:18] [INFO ] Deduced a trap composed of 66 places in 127 ms of which 4 ms to minimize.
[2024-05-25 15:40:18] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 1 ms to minimize.
[2024-05-25 15:40:18] [INFO ] Deduced a trap composed of 62 places in 136 ms of which 1 ms to minimize.
[2024-05-25 15:40:19] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 1 ms to minimize.
[2024-05-25 15:40:19] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 0 ms to minimize.
[2024-05-25 15:40:19] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 0 ms to minimize.
[2024-05-25 15:40:19] [INFO ] Deduced a trap composed of 59 places in 143 ms of which 0 ms to minimize.
[2024-05-25 15:40:19] [INFO ] Deduced a trap composed of 62 places in 118 ms of which 0 ms to minimize.
[2024-05-25 15:40:19] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 1 ms to minimize.
[2024-05-25 15:40:20] [INFO ] Deduced a trap composed of 73 places in 106 ms of which 0 ms to minimize.
[2024-05-25 15:40:20] [INFO ] Deduced a trap composed of 70 places in 116 ms of which 0 ms to minimize.
[2024-05-25 15:40:20] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2957 ms
[2024-05-25 15:40:20] [INFO ] Deduced a trap composed of 10 places in 162 ms of which 1 ms to minimize.
[2024-05-25 15:40:20] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 1 ms to minimize.
[2024-05-25 15:40:20] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 1 ms to minimize.
[2024-05-25 15:40:21] [INFO ] Deduced a trap composed of 87 places in 123 ms of which 1 ms to minimize.
[2024-05-25 15:40:21] [INFO ] Deduced a trap composed of 84 places in 102 ms of which 1 ms to minimize.
[2024-05-25 15:40:21] [INFO ] Deduced a trap composed of 85 places in 138 ms of which 0 ms to minimize.
[2024-05-25 15:40:21] [INFO ] Deduced a trap composed of 80 places in 126 ms of which 1 ms to minimize.
[2024-05-25 15:40:21] [INFO ] Deduced a trap composed of 80 places in 108 ms of which 1 ms to minimize.
[2024-05-25 15:40:21] [INFO ] Deduced a trap composed of 80 places in 101 ms of which 0 ms to minimize.
[2024-05-25 15:40:22] [INFO ] Deduced a trap composed of 87 places in 104 ms of which 0 ms to minimize.
[2024-05-25 15:40:22] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 1 ms to minimize.
[2024-05-25 15:40:22] [INFO ] Deduced a trap composed of 79 places in 114 ms of which 1 ms to minimize.
[2024-05-25 15:40:22] [INFO ] Deduced a trap composed of 64 places in 117 ms of which 0 ms to minimize.
[2024-05-25 15:40:22] [INFO ] Deduced a trap composed of 83 places in 122 ms of which 1 ms to minimize.
[2024-05-25 15:40:22] [INFO ] Deduced a trap composed of 76 places in 124 ms of which 1 ms to minimize.
[2024-05-25 15:40:23] [INFO ] Deduced a trap composed of 90 places in 138 ms of which 2 ms to minimize.
[2024-05-25 15:40:23] [INFO ] Deduced a trap composed of 87 places in 86 ms of which 0 ms to minimize.
[2024-05-25 15:40:23] [INFO ] Deduced a trap composed of 90 places in 93 ms of which 0 ms to minimize.
[2024-05-25 15:40:23] [INFO ] Deduced a trap composed of 90 places in 89 ms of which 0 ms to minimize.
[2024-05-25 15:40:23] [INFO ] Deduced a trap composed of 35 places in 126 ms of which 0 ms to minimize.
[2024-05-25 15:40:24] [INFO ] Deduced a trap composed of 86 places in 133 ms of which 0 ms to minimize.
[2024-05-25 15:40:24] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 0 ms to minimize.
[2024-05-25 15:40:24] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 0 ms to minimize.
[2024-05-25 15:40:24] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-25 15:40:24] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 4105 ms
[2024-05-25 15:40:24] [INFO ] After 7860ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 505 ms.
[2024-05-25 15:40:25] [INFO ] After 9204ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 33 ms.
Support contains 55 out of 378 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 315/315 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 378 transition count 306
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 19 place count 369 transition count 305
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 368 transition count 305
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 20 place count 368 transition count 279
Deduced a syphon composed of 26 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 61 rules applied. Total rules applied 81 place count 333 transition count 279
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 95 place count 319 transition count 265
Ensure Unique test removed 1 places
Iterating global reduction 3 with 15 rules applied. Total rules applied 110 place count 318 transition count 265
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 110 place count 318 transition count 264
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 112 place count 317 transition count 264
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 83 rules applied. Total rules applied 195 place count 274 transition count 224
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 196 place count 273 transition count 223
Iterating global reduction 3 with 1 rules applied. Total rules applied 197 place count 273 transition count 223
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 198 place count 272 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 199 place count 271 transition count 222
Applied a total of 199 rules in 80 ms. Remains 271 /378 variables (removed 107) and now considering 222/315 (removed 93) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 271/378 places, 222/315 transitions.
Incomplete random walk after 10000 steps, including 173 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :1
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 222 rows 271 cols
[2024-05-25 15:40:25] [INFO ] Computed 91 invariants in 9 ms
[2024-05-25 15:40:25] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 15:40:25] [INFO ] [Nat]Absence check using 69 positive place invariants in 17 ms returned sat
[2024-05-25 15:40:25] [INFO ] [Nat]Absence check using 69 positive and 22 generalized place invariants in 11 ms returned sat
[2024-05-25 15:40:26] [INFO ] After 327ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 15:40:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-25 15:40:26] [INFO ] After 264ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-25 15:40:26] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2024-05-25 15:40:26] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:40:26] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-25 15:40:26] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:40:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 298 ms
[2024-05-25 15:40:27] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 0 ms to minimize.
[2024-05-25 15:40:27] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 0 ms to minimize.
[2024-05-25 15:40:27] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 0 ms to minimize.
[2024-05-25 15:40:27] [INFO ] Deduced a trap composed of 61 places in 78 ms of which 0 ms to minimize.
[2024-05-25 15:40:27] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 0 ms to minimize.
[2024-05-25 15:40:27] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 1 ms to minimize.
[2024-05-25 15:40:27] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 1 ms to minimize.
[2024-05-25 15:40:27] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 1 ms to minimize.
[2024-05-25 15:40:27] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 0 ms to minimize.
[2024-05-25 15:40:28] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 0 ms to minimize.
[2024-05-25 15:40:28] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 0 ms to minimize.
[2024-05-25 15:40:28] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 0 ms to minimize.
[2024-05-25 15:40:28] [INFO ] Deduced a trap composed of 59 places in 82 ms of which 1 ms to minimize.
[2024-05-25 15:40:28] [INFO ] Deduced a trap composed of 62 places in 86 ms of which 0 ms to minimize.
[2024-05-25 15:40:28] [INFO ] Deduced a trap composed of 63 places in 113 ms of which 0 ms to minimize.
[2024-05-25 15:40:28] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:40:28] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1892 ms
[2024-05-25 15:40:28] [INFO ] After 2709ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 267 ms.
[2024-05-25 15:40:29] [INFO ] After 3407ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 15 ms.
Support contains 54 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 222/222 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 271 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 270 transition count 221
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 5 place count 268 transition count 220
Applied a total of 5 rules in 33 ms. Remains 268 /271 variables (removed 3) and now considering 220/222 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 268/271 places, 220/222 transitions.
Incomplete random walk after 10000 steps, including 165 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 32 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 796352 steps, run timeout after 3001 ms. (steps per millisecond=265 ) properties seen :{}
Probabilistic random walk after 796352 steps, saw 132945 distinct states, run finished after 3002 ms. (steps per millisecond=265 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 220 rows 268 cols
[2024-05-25 15:40:32] [INFO ] Computed 90 invariants in 8 ms
[2024-05-25 15:40:32] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 15:40:32] [INFO ] [Nat]Absence check using 69 positive place invariants in 11 ms returned sat
[2024-05-25 15:40:32] [INFO ] [Nat]Absence check using 69 positive and 21 generalized place invariants in 8 ms returned sat
[2024-05-25 15:40:32] [INFO ] After 249ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 15:40:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-25 15:40:33] [INFO ] After 154ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-25 15:40:33] [INFO ] Deduced a trap composed of 54 places in 121 ms of which 1 ms to minimize.
[2024-05-25 15:40:33] [INFO ] Deduced a trap composed of 58 places in 101 ms of which 0 ms to minimize.
[2024-05-25 15:40:33] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 1 ms to minimize.
[2024-05-25 15:40:33] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 0 ms to minimize.
[2024-05-25 15:40:33] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:40:33] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2024-05-25 15:40:33] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-05-25 15:40:33] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-05-25 15:40:33] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-25 15:40:33] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:40:33] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 699 ms
[2024-05-25 15:40:33] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 1 ms to minimize.
[2024-05-25 15:40:34] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 1 ms to minimize.
[2024-05-25 15:40:34] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-05-25 15:40:34] [INFO ] Deduced a trap composed of 68 places in 81 ms of which 1 ms to minimize.
[2024-05-25 15:40:34] [INFO ] Deduced a trap composed of 55 places in 85 ms of which 0 ms to minimize.
[2024-05-25 15:40:34] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 0 ms to minimize.
[2024-05-25 15:40:34] [INFO ] Deduced a trap composed of 50 places in 71 ms of which 1 ms to minimize.
[2024-05-25 15:40:34] [INFO ] Deduced a trap composed of 59 places in 71 ms of which 0 ms to minimize.
[2024-05-25 15:40:34] [INFO ] Deduced a trap composed of 62 places in 69 ms of which 1 ms to minimize.
[2024-05-25 15:40:34] [INFO ] Deduced a trap composed of 58 places in 68 ms of which 1 ms to minimize.
[2024-05-25 15:40:34] [INFO ] Deduced a trap composed of 57 places in 65 ms of which 0 ms to minimize.
[2024-05-25 15:40:35] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-25 15:40:35] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1171 ms
[2024-05-25 15:40:35] [INFO ] After 2205ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 134 ms.
[2024-05-25 15:40:35] [INFO ] After 2678ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 14 ms.
Support contains 54 out of 268 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 268/268 places, 220/220 transitions.
Applied a total of 0 rules in 13 ms. Remains 268 /268 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 268/268 places, 220/220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 268/268 places, 220/220 transitions.
Applied a total of 0 rules in 13 ms. Remains 268 /268 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2024-05-25 15:40:35] [INFO ] Invariant cache hit.
[2024-05-25 15:40:35] [INFO ] Implicit Places using invariants in 265 ms returned [19, 20, 49, 81, 82, 85, 242]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 268 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 261/268 places, 220/220 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 260 transition count 219
Applied a total of 2 rules in 21 ms. Remains 260 /261 variables (removed 1) and now considering 219/220 (removed 1) transitions.
// Phase 1: matrix 219 rows 260 cols
[2024-05-25 15:40:35] [INFO ] Computed 83 invariants in 3 ms
[2024-05-25 15:40:35] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-25 15:40:35] [INFO ] Invariant cache hit.
[2024-05-25 15:40:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-25 15:40:35] [INFO ] Implicit Places using invariants and state equation in 309 ms returned [187]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 446 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 259/268 places, 219/220 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 258 transition count 218
Applied a total of 2 rules in 11 ms. Remains 258 /259 variables (removed 1) and now considering 218/219 (removed 1) transitions.
// Phase 1: matrix 218 rows 258 cols
[2024-05-25 15:40:35] [INFO ] Computed 82 invariants in 2 ms
[2024-05-25 15:40:36] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-25 15:40:36] [INFO ] Invariant cache hit.
[2024-05-25 15:40:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-25 15:40:36] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 258/268 places, 218/220 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1147 ms. Remains : 258/268 places, 218/220 transitions.
Incomplete random walk after 10000 steps, including 161 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) 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 2) seen :0
Interrupted probabilistic random walk after 730245 steps, run timeout after 3001 ms. (steps per millisecond=243 ) properties seen :{}
Probabilistic random walk after 730245 steps, saw 125212 distinct states, run finished after 3001 ms. (steps per millisecond=243 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-25 15:40:39] [INFO ] Invariant cache hit.
[2024-05-25 15:40:39] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 15:40:39] [INFO ] [Nat]Absence check using 65 positive place invariants in 11 ms returned sat
[2024-05-25 15:40:39] [INFO ] [Nat]Absence check using 65 positive and 17 generalized place invariants in 3 ms returned sat
[2024-05-25 15:40:39] [INFO ] After 183ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 15:40:39] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-25 15:40:40] [INFO ] After 145ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-25 15:40:40] [INFO ] Deduced a trap composed of 59 places in 84 ms of which 0 ms to minimize.
[2024-05-25 15:40:40] [INFO ] Deduced a trap composed of 55 places in 65 ms of which 0 ms to minimize.
[2024-05-25 15:40:40] [INFO ] Deduced a trap composed of 50 places in 71 ms of which 0 ms to minimize.
[2024-05-25 15:40:40] [INFO ] Deduced a trap composed of 52 places in 81 ms of which 0 ms to minimize.
[2024-05-25 15:40:40] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 1 ms to minimize.
[2024-05-25 15:40:40] [INFO ] Deduced a trap composed of 55 places in 63 ms of which 0 ms to minimize.
[2024-05-25 15:40:40] [INFO ] Deduced a trap composed of 57 places in 60 ms of which 0 ms to minimize.
[2024-05-25 15:40:40] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:40:40] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 686 ms
[2024-05-25 15:40:41] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 0 ms to minimize.
[2024-05-25 15:40:41] [INFO ] Deduced a trap composed of 55 places in 84 ms of which 0 ms to minimize.
[2024-05-25 15:40:41] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:40:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 323 ms
[2024-05-25 15:40:41] [INFO ] After 1395ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 273 ms.
[2024-05-25 15:40:41] [INFO ] After 1927ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 10 ms.
Support contains 54 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 218/218 transitions.
Applied a total of 0 rules in 18 ms. Remains 258 /258 variables (removed 0) and now considering 218/218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 258/258 places, 218/218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 218/218 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 218/218 (removed 0) transitions.
[2024-05-25 15:40:41] [INFO ] Invariant cache hit.
[2024-05-25 15:40:41] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-25 15:40:41] [INFO ] Invariant cache hit.
[2024-05-25 15:40:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-25 15:40:42] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 444 ms to find 0 implicit places.
[2024-05-25 15:40:42] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-25 15:40:42] [INFO ] Invariant cache hit.
[2024-05-25 15:40:42] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 621 ms. Remains : 258/258 places, 218/218 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 218/218 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-25 15:40:42] [INFO ] Invariant cache hit.
[2024-05-25 15:40:42] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 15:40:42] [INFO ] [Nat]Absence check using 65 positive place invariants in 14 ms returned sat
[2024-05-25 15:40:42] [INFO ] [Nat]Absence check using 65 positive and 17 generalized place invariants in 4 ms returned sat
[2024-05-25 15:40:42] [INFO ] After 257ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 15:40:42] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-25 15:40:42] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:40:42] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-05-25 15:40:42] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-25 15:40:42] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-25 15:40:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 242 ms
[2024-05-25 15:40:43] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 0 ms to minimize.
[2024-05-25 15:40:43] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 1 ms to minimize.
[2024-05-25 15:40:43] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 0 ms to minimize.
[2024-05-25 15:40:43] [INFO ] Deduced a trap composed of 56 places in 56 ms of which 0 ms to minimize.
[2024-05-25 15:40:43] [INFO ] Deduced a trap composed of 54 places in 59 ms of which 0 ms to minimize.
[2024-05-25 15:40:43] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 0 ms to minimize.
[2024-05-25 15:40:43] [INFO ] Deduced a trap composed of 58 places in 72 ms of which 0 ms to minimize.
[2024-05-25 15:40:43] [INFO ] Deduced a trap composed of 60 places in 62 ms of which 0 ms to minimize.
[2024-05-25 15:40:43] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-25 15:40:43] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 815 ms
[2024-05-25 15:40:43] [INFO ] After 1535ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 247 ms.
[2024-05-25 15:40:44] [INFO ] After 1872ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2024-05-25 15:40:44] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2024-05-25 15:40:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 258 places, 218 transitions and 963 arcs took 2 ms.
[2024-05-25 15:40:44] [INFO ] Flatten gal took : 65 ms
Total runtime 44267 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT BusinessProcesses-PT-19
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/372
ReachabilityFireability

FORMULA BusinessProcesses-PT-19-ReachabilityFireability-2024-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-19-ReachabilityFireability-2024-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1716651644841

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/372/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/372/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/372/ReachabilityFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 11 (type EXCL) for 3 BusinessProcesses-PT-19-ReachabilityFireability-2024-13
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 7 (type FNDP) for 3 BusinessProcesses-PT-19-ReachabilityFireability-2024-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 8 (type EQUN) for 3 BusinessProcesses-PT-19-ReachabilityFireability-2024-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 10 (type SRCH) for 3 BusinessProcesses-PT-19-ReachabilityFireability-2024-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 11 (type EXCL) for BusinessProcesses-PT-19-ReachabilityFireability-2024-13
lola: result : true
lola: markings : 104
lola: fired transitions : 122
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 7 (type FNDP) for BusinessProcesses-PT-19-ReachabilityFireability-2024-13 (obsolete)
lola: CANCELED task # 8 (type EQUN) for BusinessProcesses-PT-19-ReachabilityFireability-2024-13 (obsolete)
lola: CANCELED task # 10 (type SRCH) for BusinessProcesses-PT-19-ReachabilityFireability-2024-13 (obsolete)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 17 (type EXCL) for 0 BusinessProcesses-PT-19-ReachabilityFireability-2024-01
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 13 (type FNDP) for 0 BusinessProcesses-PT-19-ReachabilityFireability-2024-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 14 (type EQUN) for 0 BusinessProcesses-PT-19-ReachabilityFireability-2024-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 16 (type SRCH) for 0 BusinessProcesses-PT-19-ReachabilityFireability-2024-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 16 (type SRCH) for BusinessProcesses-PT-19-ReachabilityFireability-2024-01
lola: result : true
lola: markings : 86
lola: fired transitions : 86
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 13 (type FNDP) for BusinessProcesses-PT-19-ReachabilityFireability-2024-01 (obsolete)
lola: CANCELED task # 14 (type EQUN) for BusinessProcesses-PT-19-ReachabilityFireability-2024-01 (obsolete)
lola: CANCELED task # 17 (type EXCL) for BusinessProcesses-PT-19-ReachabilityFireability-2024-01 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-19-ReachabilityFireability-2024-01: EF true tandem / insertion
BusinessProcesses-PT-19-ReachabilityFireability-2024-13: AG false tandem / relaxed


Time elapsed: 0 secs. Pages in use: 2

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-19"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is BusinessProcesses-PT-19, 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 r065-tajo-171620415000375"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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