About the Execution of LTSMin+red for BusinessProcesses-PT-05
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
16219.703 | 3557408.00 | 13916872.00 | 59043.10 | ????T?????TT???F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2023-input.r041-tajo-167813694700482.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is BusinessProcesses-PT-05, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694700482
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 16:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 16:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Feb 25 16:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 25 16:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 25 16:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 25 16:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 85K Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1678640017824
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-05
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 16:53:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 16:53:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:53:39] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2023-03-12 16:53:39] [INFO ] Transformed 368 places.
[2023-03-12 16:53:39] [INFO ] Transformed 319 transitions.
[2023-03-12 16:53:39] [INFO ] Found NUPN structural information;
[2023-03-12 16:53:39] [INFO ] Parsed PT model containing 368 places and 319 transitions and 854 arcs in 132 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 1 transitions.
Support contains 106 out of 367 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 367/367 places, 318/318 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 365 transition count 318
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 37 place count 330 transition count 283
Iterating global reduction 1 with 35 rules applied. Total rules applied 72 place count 330 transition count 283
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 90 place count 312 transition count 265
Iterating global reduction 1 with 18 rules applied. Total rules applied 108 place count 312 transition count 265
Applied a total of 108 rules in 65 ms. Remains 312 /367 variables (removed 55) and now considering 265/318 (removed 53) transitions.
// Phase 1: matrix 265 rows 312 cols
[2023-03-12 16:53:39] [INFO ] Computed 55 place invariants in 10 ms
[2023-03-12 16:53:40] [INFO ] Implicit Places using invariants in 264 ms returned []
[2023-03-12 16:53:40] [INFO ] Invariant cache hit.
[2023-03-12 16:53:40] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
[2023-03-12 16:53:40] [INFO ] Invariant cache hit.
[2023-03-12 16:53:40] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 312/367 places, 265/318 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 772 ms. Remains : 312/367 places, 265/318 transitions.
Support contains 106 out of 312 places after structural reductions.
[2023-03-12 16:53:40] [INFO ] Flatten gal took : 40 ms
[2023-03-12 16:53:40] [INFO ] Flatten gal took : 18 ms
[2023-03-12 16:53:40] [INFO ] Input system was already deterministic with 265 transitions.
Support contains 104 out of 312 places (down from 106) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 92 resets, run finished after 565 ms. (steps per millisecond=17 ) properties (out of 72) seen :48
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Running SMT prover for 24 properties.
[2023-03-12 16:53:41] [INFO ] Invariant cache hit.
[2023-03-12 16:53:41] [INFO ] [Real]Absence check using 55 positive place invariants in 12 ms returned sat
[2023-03-12 16:53:41] [INFO ] After 245ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2023-03-12 16:53:42] [INFO ] [Nat]Absence check using 55 positive place invariants in 12 ms returned sat
[2023-03-12 16:53:42] [INFO ] After 284ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :20
[2023-03-12 16:53:42] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 5 ms to minimize.
[2023-03-12 16:53:42] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 1 ms to minimize.
[2023-03-12 16:53:42] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 1 ms to minimize.
[2023-03-12 16:53:42] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 1 ms to minimize.
[2023-03-12 16:53:43] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 2 ms to minimize.
[2023-03-12 16:53:43] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 536 ms
[2023-03-12 16:53:43] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 0 ms to minimize.
[2023-03-12 16:53:44] [INFO ] Deduced a trap composed of 24 places in 869 ms of which 1 ms to minimize.
[2023-03-12 16:53:44] [INFO ] Deduced a trap composed of 51 places in 51 ms of which 1 ms to minimize.
[2023-03-12 16:53:44] [INFO ] Deduced a trap composed of 45 places in 82 ms of which 1 ms to minimize.
[2023-03-12 16:53:44] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 1 ms to minimize.
[2023-03-12 16:53:44] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1233 ms
[2023-03-12 16:53:44] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 0 ms to minimize.
[2023-03-12 16:53:44] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 1 ms to minimize.
[2023-03-12 16:53:44] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2023-03-12 16:53:44] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
[2023-03-12 16:53:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 400 ms
[2023-03-12 16:53:44] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2023-03-12 16:53:44] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2023-03-12 16:53:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 105 ms
[2023-03-12 16:53:45] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2023-03-12 16:53:45] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 0 ms to minimize.
[2023-03-12 16:53:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 149 ms
[2023-03-12 16:53:45] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2023-03-12 16:53:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2023-03-12 16:53:45] [INFO ] After 3113ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :18
Attempting to minimize the solution found.
Minimization took 290 ms.
[2023-03-12 16:53:45] [INFO ] After 3679ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :18
Fused 24 Parikh solutions to 17 different solutions.
Parikh walk visited 2 properties in 68 ms.
Support contains 21 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 265/265 transitions.
Graph (complete) has 638 edges and 312 vertex of which 311 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 311 transition count 220
Reduce places removed 43 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 268 transition count 218
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 92 place count 266 transition count 218
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 50 Pre rules applied. Total rules applied 92 place count 266 transition count 168
Deduced a syphon composed of 50 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 111 rules applied. Total rules applied 203 place count 205 transition count 168
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 225 place count 183 transition count 146
Iterating global reduction 3 with 22 rules applied. Total rules applied 247 place count 183 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 249 place count 183 transition count 144
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 251 place count 182 transition count 143
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 5 with 144 rules applied. Total rules applied 395 place count 109 transition count 72
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 396 place count 108 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 397 place count 107 transition count 71
Applied a total of 397 rules in 50 ms. Remains 107 /312 variables (removed 205) and now considering 71/265 (removed 194) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 107/312 places, 71/265 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 16) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 71 rows 107 cols
[2023-03-12 16:53:46] [INFO ] Computed 42 place invariants in 10 ms
[2023-03-12 16:53:46] [INFO ] [Real]Absence check using 39 positive place invariants in 5 ms returned sat
[2023-03-12 16:53:46] [INFO ] [Real]Absence check using 39 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-12 16:53:46] [INFO ] After 34ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-12 16:53:46] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2023-03-12 16:53:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2023-03-12 16:53:46] [INFO ] After 88ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-12 16:53:46] [INFO ] After 158ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2023-03-12 16:53:46] [INFO ] [Nat]Absence check using 39 positive place invariants in 5 ms returned sat
[2023-03-12 16:53:46] [INFO ] [Nat]Absence check using 39 positive and 3 generalized place invariants in 0 ms returned sat
[2023-03-12 16:53:46] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 16:53:46] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 0 ms to minimize.
[2023-03-12 16:53:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-03-12 16:53:46] [INFO ] After 90ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-12 16:53:46] [INFO ] After 138ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 71/71 transitions.
Graph (trivial) has 22 edges and 107 vertex of which 2 / 107 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 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 106 transition count 64
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 101 transition count 64
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 11 place count 101 transition count 60
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 21 place count 95 transition count 60
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 94 transition count 59
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 94 transition count 59
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 43 place count 84 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 83 transition count 48
Applied a total of 44 rules in 17 ms. Remains 83 /107 variables (removed 24) and now considering 48/71 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 83/107 places, 48/71 transitions.
Incomplete random walk after 10000 steps, including 370 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :1
Finished Best-First random walk after 111 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=111 )
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
FORMULA BusinessProcesses-PT-05-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 16:53:46] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-12 16:53:46] [INFO ] Flatten gal took : 14 ms
FORMULA BusinessProcesses-PT-05-CTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 16:53:46] [INFO ] Flatten gal took : 12 ms
[2023-03-12 16:53:46] [INFO ] Input system was already deterministic with 265 transitions.
Computed a total of 304 stabilizing places and 254 stable transitions
Graph (complete) has 638 edges and 312 vertex of which 311 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 312/312 places, 265/265 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 311 transition count 217
Reduce places removed 47 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 49 rules applied. Total rules applied 96 place count 264 transition count 215
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 98 place count 262 transition count 215
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 59 Pre rules applied. Total rules applied 98 place count 262 transition count 156
Deduced a syphon composed of 59 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 131 rules applied. Total rules applied 229 place count 190 transition count 156
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 261 place count 158 transition count 124
Iterating global reduction 3 with 32 rules applied. Total rules applied 293 place count 158 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 295 place count 158 transition count 122
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 296 place count 157 transition count 122
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 296 place count 157 transition count 120
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 301 place count 154 transition count 120
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 5 with 136 rules applied. Total rules applied 437 place count 85 transition count 53
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 438 place count 85 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 439 place count 84 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 440 place count 83 transition count 51
Applied a total of 440 rules in 39 ms. Remains 83 /312 variables (removed 229) and now considering 51/265 (removed 214) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39 ms. Remains : 83/312 places, 51/265 transitions.
[2023-03-12 16:53:46] [INFO ] Flatten gal took : 3 ms
[2023-03-12 16:53:46] [INFO ] Flatten gal took : 4 ms
[2023-03-12 16:53:46] [INFO ] Input system was already deterministic with 51 transitions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 265/265 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 287 transition count 240
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 287 transition count 240
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 287 transition count 239
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 61 place count 277 transition count 229
Iterating global reduction 1 with 10 rules applied. Total rules applied 71 place count 277 transition count 229
Applied a total of 71 rules in 20 ms. Remains 277 /312 variables (removed 35) and now considering 229/265 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 277/312 places, 229/265 transitions.
[2023-03-12 16:53:46] [INFO ] Flatten gal took : 10 ms
[2023-03-12 16:53:46] [INFO ] Flatten gal took : 11 ms
[2023-03-12 16:53:46] [INFO ] Input system was already deterministic with 229 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 312/312 places, 265/265 transitions.
Graph (complete) has 638 edges and 312 vertex of which 311 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 310 transition count 219
Reduce places removed 44 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 47 rules applied. Total rules applied 92 place count 266 transition count 216
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 95 place count 263 transition count 216
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 95 place count 263 transition count 156
Deduced a syphon composed of 60 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 3 with 133 rules applied. Total rules applied 228 place count 190 transition count 156
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 259 place count 159 transition count 125
Iterating global reduction 3 with 31 rules applied. Total rules applied 290 place count 159 transition count 125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 292 place count 159 transition count 123
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 293 place count 158 transition count 123
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 293 place count 158 transition count 121
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 298 place count 155 transition count 121
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 5 with 128 rules applied. Total rules applied 426 place count 90 transition count 58
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 427 place count 90 transition count 57
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 428 place count 89 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 429 place count 88 transition count 56
Applied a total of 429 rules in 39 ms. Remains 88 /312 variables (removed 224) and now considering 56/265 (removed 209) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 40 ms. Remains : 88/312 places, 56/265 transitions.
[2023-03-12 16:53:46] [INFO ] Flatten gal took : 4 ms
[2023-03-12 16:53:46] [INFO ] Flatten gal took : 4 ms
[2023-03-12 16:53:46] [INFO ] Input system was already deterministic with 56 transitions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 265/265 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 279 transition count 232
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 279 transition count 232
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 67 place count 279 transition count 231
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 79 place count 267 transition count 219
Iterating global reduction 1 with 12 rules applied. Total rules applied 91 place count 267 transition count 219
Applied a total of 91 rules in 26 ms. Remains 267 /312 variables (removed 45) and now considering 219/265 (removed 46) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 267/312 places, 219/265 transitions.
[2023-03-12 16:53:46] [INFO ] Flatten gal took : 8 ms
[2023-03-12 16:53:46] [INFO ] Flatten gal took : 8 ms
[2023-03-12 16:53:46] [INFO ] Input system was already deterministic with 219 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 312/312 places, 265/265 transitions.
Graph (trivial) has 178 edges and 312 vertex of which 8 / 312 are part of one of the 1 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 629 edges and 305 vertex of which 304 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 55 place count 303 transition count 201
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 1 with 53 rules applied. Total rules applied 108 place count 250 transition count 201
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 53 Pre rules applied. Total rules applied 108 place count 250 transition count 148
Deduced a syphon composed of 53 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 119 rules applied. Total rules applied 227 place count 184 transition count 148
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 257 place count 154 transition count 118
Iterating global reduction 2 with 30 rules applied. Total rules applied 287 place count 154 transition count 118
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 287 place count 154 transition count 116
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 292 place count 151 transition count 116
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 136 rules applied. Total rules applied 428 place count 82 transition count 49
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 430 place count 81 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 431 place count 80 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 432 place count 79 transition count 47
Applied a total of 432 rules in 34 ms. Remains 79 /312 variables (removed 233) and now considering 47/265 (removed 218) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34 ms. Remains : 79/312 places, 47/265 transitions.
[2023-03-12 16:53:46] [INFO ] Flatten gal took : 3 ms
[2023-03-12 16:53:46] [INFO ] Flatten gal took : 4 ms
[2023-03-12 16:53:46] [INFO ] Input system was already deterministic with 47 transitions.
Finished random walk after 188 steps, including 52 resets, run visited all 1 properties in 3 ms. (steps per millisecond=62 )
FORMULA BusinessProcesses-PT-05-CTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 265/265 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 287 transition count 240
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 287 transition count 240
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 287 transition count 239
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 60 place count 278 transition count 230
Iterating global reduction 1 with 9 rules applied. Total rules applied 69 place count 278 transition count 230
Applied a total of 69 rules in 20 ms. Remains 278 /312 variables (removed 34) and now considering 230/265 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 278/312 places, 230/265 transitions.
[2023-03-12 16:53:46] [INFO ] Flatten gal took : 9 ms
[2023-03-12 16:53:46] [INFO ] Flatten gal took : 10 ms
[2023-03-12 16:53:46] [INFO ] Input system was already deterministic with 230 transitions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 265/265 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 285 transition count 238
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 285 transition count 238
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 55 place count 285 transition count 237
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 65 place count 275 transition count 227
Iterating global reduction 1 with 10 rules applied. Total rules applied 75 place count 275 transition count 227
Applied a total of 75 rules in 26 ms. Remains 275 /312 variables (removed 37) and now considering 227/265 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 275/312 places, 227/265 transitions.
[2023-03-12 16:53:47] [INFO ] Flatten gal took : 9 ms
[2023-03-12 16:53:47] [INFO ] Flatten gal took : 10 ms
[2023-03-12 16:53:47] [INFO ] Input system was already deterministic with 227 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 312/312 places, 265/265 transitions.
Graph (trivial) has 172 edges and 312 vertex of which 8 / 312 are part of one of the 1 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 629 edges and 305 vertex of which 304 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 303 transition count 205
Reduce places removed 49 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 52 rules applied. Total rules applied 103 place count 254 transition count 202
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 106 place count 251 transition count 202
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 106 place count 251 transition count 151
Deduced a syphon composed of 51 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 113 rules applied. Total rules applied 219 place count 189 transition count 151
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 249 place count 159 transition count 121
Iterating global reduction 3 with 30 rules applied. Total rules applied 279 place count 159 transition count 121
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 279 place count 159 transition count 119
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 284 place count 156 transition count 119
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 127 rules applied. Total rules applied 411 place count 92 transition count 56
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 3 with 2 rules applied. Total rules applied 413 place count 91 transition count 55
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 414 place count 90 transition count 54
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 415 place count 89 transition count 54
Applied a total of 415 rules in 29 ms. Remains 89 /312 variables (removed 223) and now considering 54/265 (removed 211) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29 ms. Remains : 89/312 places, 54/265 transitions.
[2023-03-12 16:53:47] [INFO ] Flatten gal took : 4 ms
[2023-03-12 16:53:47] [INFO ] Flatten gal took : 4 ms
[2023-03-12 16:53:47] [INFO ] Input system was already deterministic with 54 transitions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 265/265 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 282 transition count 235
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 282 transition count 235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 61 place count 282 transition count 234
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 72 place count 271 transition count 223
Iterating global reduction 1 with 11 rules applied. Total rules applied 83 place count 271 transition count 223
Applied a total of 83 rules in 26 ms. Remains 271 /312 variables (removed 41) and now considering 223/265 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 271/312 places, 223/265 transitions.
[2023-03-12 16:53:47] [INFO ] Flatten gal took : 8 ms
[2023-03-12 16:53:47] [INFO ] Flatten gal took : 8 ms
[2023-03-12 16:53:47] [INFO ] Input system was already deterministic with 223 transitions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 265/265 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 280 transition count 233
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 280 transition count 233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 65 place count 280 transition count 232
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 76 place count 269 transition count 221
Iterating global reduction 1 with 11 rules applied. Total rules applied 87 place count 269 transition count 221
Applied a total of 87 rules in 21 ms. Remains 269 /312 variables (removed 43) and now considering 221/265 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 269/312 places, 221/265 transitions.
[2023-03-12 16:53:47] [INFO ] Flatten gal took : 8 ms
[2023-03-12 16:53:47] [INFO ] Flatten gal took : 8 ms
[2023-03-12 16:53:47] [INFO ] Input system was already deterministic with 221 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 312/312 places, 265/265 transitions.
Graph (trivial) has 176 edges and 312 vertex of which 8 / 312 are part of one of the 1 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 629 edges and 305 vertex of which 304 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 54 place count 303 transition count 202
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 106 place count 251 transition count 202
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 106 place count 251 transition count 150
Deduced a syphon composed of 52 places in 1 ms
Ensure Unique test removed 12 places
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 222 place count 187 transition count 150
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 253 place count 156 transition count 119
Iterating global reduction 2 with 31 rules applied. Total rules applied 284 place count 156 transition count 119
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 284 place count 156 transition count 117
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 289 place count 153 transition count 117
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 423 place count 85 transition count 51
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 2 with 2 rules applied. Total rules applied 425 place count 84 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 426 place count 83 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 427 place count 82 transition count 49
Applied a total of 427 rules in 27 ms. Remains 82 /312 variables (removed 230) and now considering 49/265 (removed 216) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 82/312 places, 49/265 transitions.
[2023-03-12 16:53:47] [INFO ] Flatten gal took : 3 ms
[2023-03-12 16:53:47] [INFO ] Flatten gal took : 3 ms
[2023-03-12 16:53:47] [INFO ] Input system was already deterministic with 49 transitions.
Finished random walk after 932 steps, including 201 resets, run visited all 1 properties in 4 ms. (steps per millisecond=233 )
FORMULA BusinessProcesses-PT-05-CTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 265/265 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 279 transition count 232
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 279 transition count 232
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 67 place count 279 transition count 231
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 79 place count 267 transition count 219
Iterating global reduction 1 with 12 rules applied. Total rules applied 91 place count 267 transition count 219
Applied a total of 91 rules in 20 ms. Remains 267 /312 variables (removed 45) and now considering 219/265 (removed 46) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 267/312 places, 219/265 transitions.
[2023-03-12 16:53:47] [INFO ] Flatten gal took : 7 ms
[2023-03-12 16:53:47] [INFO ] Flatten gal took : 12 ms
[2023-03-12 16:53:47] [INFO ] Input system was already deterministic with 219 transitions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 265/265 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 280 transition count 233
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 280 transition count 233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 65 place count 280 transition count 232
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 76 place count 269 transition count 221
Iterating global reduction 1 with 11 rules applied. Total rules applied 87 place count 269 transition count 221
Applied a total of 87 rules in 18 ms. Remains 269 /312 variables (removed 43) and now considering 221/265 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 269/312 places, 221/265 transitions.
[2023-03-12 16:53:47] [INFO ] Flatten gal took : 7 ms
[2023-03-12 16:53:47] [INFO ] Flatten gal took : 8 ms
[2023-03-12 16:53:47] [INFO ] Input system was already deterministic with 221 transitions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 265/265 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 280 transition count 233
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 280 transition count 233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 65 place count 280 transition count 232
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 77 place count 268 transition count 220
Iterating global reduction 1 with 12 rules applied. Total rules applied 89 place count 268 transition count 220
Applied a total of 89 rules in 18 ms. Remains 268 /312 variables (removed 44) and now considering 220/265 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 268/312 places, 220/265 transitions.
[2023-03-12 16:53:47] [INFO ] Flatten gal took : 8 ms
[2023-03-12 16:53:47] [INFO ] Flatten gal took : 7 ms
[2023-03-12 16:53:47] [INFO ] Input system was already deterministic with 220 transitions.
[2023-03-12 16:53:47] [INFO ] Flatten gal took : 9 ms
[2023-03-12 16:53:47] [INFO ] Flatten gal took : 8 ms
[2023-03-12 16:53:47] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-12 16:53:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 312 places, 265 transitions and 744 arcs took 1 ms.
Total runtime 7772 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/555/ctl_0_ --ctl=/tmp/555/ctl_1_ --ctl=/tmp/555/ctl_2_ --ctl=/tmp/555/ctl_3_ --ctl=/tmp/555/ctl_4_ --ctl=/tmp/555/ctl_5_ --ctl=/tmp/555/ctl_6_ --ctl=/tmp/555/ctl_7_ --ctl=/tmp/555/ctl_8_ --ctl=/tmp/555/ctl_9_ --ctl=/tmp/555/ctl_10_ --ctl=/tmp/555/ctl_11_ --mu-par --mu-opt
Could not compute solution for formula : BusinessProcesses-PT-05-CTLFireability-00
Could not compute solution for formula : BusinessProcesses-PT-05-CTLFireability-01
Could not compute solution for formula : BusinessProcesses-PT-05-CTLFireability-02
Could not compute solution for formula : BusinessProcesses-PT-05-CTLFireability-03
Could not compute solution for formula : BusinessProcesses-PT-05-CTLFireability-05
Could not compute solution for formula : BusinessProcesses-PT-05-CTLFireability-06
Could not compute solution for formula : BusinessProcesses-PT-05-CTLFireability-07
Could not compute solution for formula : BusinessProcesses-PT-05-CTLFireability-08
Could not compute solution for formula : BusinessProcesses-PT-05-CTLFireability-09
Could not compute solution for formula : BusinessProcesses-PT-05-CTLFireability-12
Could not compute solution for formula : BusinessProcesses-PT-05-CTLFireability-13
Could not compute solution for formula : BusinessProcesses-PT-05-CTLFireability-14
BK_STOP 1678643575232
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2023
ctl formula name BusinessProcesses-PT-05-CTLFireability-00
ctl formula formula --ctl=/tmp/555/ctl_0_
ctl formula name BusinessProcesses-PT-05-CTLFireability-01
ctl formula formula --ctl=/tmp/555/ctl_1_
ctl formula name BusinessProcesses-PT-05-CTLFireability-02
ctl formula formula --ctl=/tmp/555/ctl_2_
ctl formula name BusinessProcesses-PT-05-CTLFireability-03
ctl formula formula --ctl=/tmp/555/ctl_3_
ctl formula name BusinessProcesses-PT-05-CTLFireability-05
ctl formula formula --ctl=/tmp/555/ctl_4_
ctl formula name BusinessProcesses-PT-05-CTLFireability-06
ctl formula formula --ctl=/tmp/555/ctl_5_
ctl formula name BusinessProcesses-PT-05-CTLFireability-07
ctl formula formula --ctl=/tmp/555/ctl_6_
ctl formula name BusinessProcesses-PT-05-CTLFireability-08
ctl formula formula --ctl=/tmp/555/ctl_7_
ctl formula name BusinessProcesses-PT-05-CTLFireability-09
ctl formula formula --ctl=/tmp/555/ctl_8_
ctl formula name BusinessProcesses-PT-05-CTLFireability-12
ctl formula formula --ctl=/tmp/555/ctl_9_
ctl formula name BusinessProcesses-PT-05-CTLFireability-13
ctl formula formula --ctl=/tmp/555/ctl_10_
ctl formula name BusinessProcesses-PT-05-CTLFireability-14
ctl formula formula --ctl=/tmp/555/ctl_11_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 312 places, 265 transitions and 744 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.000 user 0.010 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 265->263 groups
pnml2lts-sym: Regrouping took 0.040 real 0.050 user 0.000 sys
pnml2lts-sym: state vector length is 312; there are 263 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Exploration took 148833842 group checks and 0 next state calls
pnml2lts-sym: reachability took 2228.340 real 8903.660 user 1.940 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 1.440 real 5.770 user 0.000 sys
pnml2lts-sym: state space has 2.20268039728894e+17 states, 5716661 nodes
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
double free or corruption (out)
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-05"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is BusinessProcesses-PT-05, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r041-tajo-167813694700482"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-05.tgz
mv BusinessProcesses-PT-05 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;