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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.6K Feb 25 16:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 25 16:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 16:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 16:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 141K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678643406473

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-11
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 17:50:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 17:50:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 17:50:08] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2023-03-12 17:50:08] [INFO ] Transformed 567 places.
[2023-03-12 17:50:08] [INFO ] Transformed 508 transitions.
[2023-03-12 17:50:08] [INFO ] Found NUPN structural information;
[2023-03-12 17:50:08] [INFO ] Parsed PT model containing 567 places and 508 transitions and 1512 arcs in 147 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 7 places in 7 ms
Reduce places removed 7 places and 7 transitions.
FORMULA BusinessProcesses-PT-11-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 560/560 places, 501/501 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 556 transition count 501
Discarding 72 places :
Symmetric choice reduction at 1 with 72 rule applications. Total rules 76 place count 484 transition count 429
Iterating global reduction 1 with 72 rules applied. Total rules applied 148 place count 484 transition count 429
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 183 place count 449 transition count 394
Iterating global reduction 1 with 35 rules applied. Total rules applied 218 place count 449 transition count 394
Applied a total of 218 rules in 100 ms. Remains 449 /560 variables (removed 111) and now considering 394/501 (removed 107) transitions.
// Phase 1: matrix 394 rows 449 cols
[2023-03-12 17:50:08] [INFO ] Computed 91 place invariants in 27 ms
[2023-03-12 17:50:08] [INFO ] Implicit Places using invariants in 322 ms returned []
[2023-03-12 17:50:08] [INFO ] Invariant cache hit.
[2023-03-12 17:50:09] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 830 ms to find 0 implicit places.
[2023-03-12 17:50:09] [INFO ] Invariant cache hit.
[2023-03-12 17:50:09] [INFO ] Dead Transitions using invariants and state equation in 229 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 449/560 places, 394/501 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1163 ms. Remains : 449/560 places, 394/501 transitions.
Support contains 36 out of 449 places after structural reductions.
[2023-03-12 17:50:09] [INFO ] Flatten gal took : 69 ms
[2023-03-12 17:50:09] [INFO ] Flatten gal took : 30 ms
[2023-03-12 17:50:09] [INFO ] Input system was already deterministic with 394 transitions.
Support contains 35 out of 449 places (down from 36) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 76 resets, run finished after 513 ms. (steps per millisecond=19 ) properties (out of 27) seen :12
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) 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 15) 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 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) 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 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) 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 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2023-03-12 17:50:10] [INFO ] Invariant cache hit.
[2023-03-12 17:50:10] [INFO ] [Real]Absence check using 49 positive place invariants in 16 ms returned sat
[2023-03-12 17:50:10] [INFO ] [Real]Absence check using 49 positive and 42 generalized place invariants in 12 ms returned sat
[2023-03-12 17:50:11] [INFO ] After 356ms SMT Verify possible using state equation in real domain returned unsat :2 sat :2 real:11
[2023-03-12 17:50:11] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 5 ms to minimize.
[2023-03-12 17:50:11] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 0 ms to minimize.
[2023-03-12 17:50:11] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 2 ms to minimize.
[2023-03-12 17:50:11] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2023-03-12 17:50:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 363 ms
[2023-03-12 17:50:11] [INFO ] After 765ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :0 real:13
[2023-03-12 17:50:11] [INFO ] After 1080ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:13
[2023-03-12 17:50:11] [INFO ] [Nat]Absence check using 49 positive place invariants in 12 ms returned sat
[2023-03-12 17:50:11] [INFO ] [Nat]Absence check using 49 positive and 42 generalized place invariants in 12 ms returned sat
[2023-03-12 17:50:12] [INFO ] After 354ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :13
[2023-03-12 17:50:12] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 1 ms to minimize.
[2023-03-12 17:50:12] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 1 ms to minimize.
[2023-03-12 17:50:12] [INFO ] Deduced a trap composed of 78 places in 126 ms of which 0 ms to minimize.
[2023-03-12 17:50:12] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 14 ms to minimize.
[2023-03-12 17:50:12] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 0 ms to minimize.
[2023-03-12 17:50:12] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2023-03-12 17:50:12] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 0 ms to minimize.
[2023-03-12 17:50:12] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 1 ms to minimize.
[2023-03-12 17:50:13] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 0 ms to minimize.
[2023-03-12 17:50:13] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 939 ms
[2023-03-12 17:50:13] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 1 ms to minimize.
[2023-03-12 17:50:13] [INFO ] Deduced a trap composed of 21 places in 229 ms of which 3 ms to minimize.
[2023-03-12 17:50:13] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2023-03-12 17:50:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 523 ms
[2023-03-12 17:50:13] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 1 ms to minimize.
[2023-03-12 17:50:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2023-03-12 17:50:14] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 1 ms to minimize.
[2023-03-12 17:50:14] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 1 ms to minimize.
[2023-03-12 17:50:14] [INFO ] Deduced a trap composed of 91 places in 191 ms of which 1 ms to minimize.
[2023-03-12 17:50:14] [INFO ] Deduced a trap composed of 15 places in 173 ms of which 0 ms to minimize.
[2023-03-12 17:50:15] [INFO ] Deduced a trap composed of 85 places in 113 ms of which 1 ms to minimize.
[2023-03-12 17:50:15] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 914 ms
[2023-03-12 17:50:15] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 0 ms to minimize.
[2023-03-12 17:50:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2023-03-12 17:50:15] [INFO ] After 3483ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :13
Attempting to minimize the solution found.
Minimization took 254 ms.
[2023-03-12 17:50:15] [INFO ] After 3984ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :13
Fused 15 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 196 ms.
Support contains 18 out of 449 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 449/449 places, 394/394 transitions.
Graph (complete) has 1009 edges and 449 vertex of which 448 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 448 transition count 352
Reduce places removed 41 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 45 rules applied. Total rules applied 87 place count 407 transition count 348
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 91 place count 403 transition count 348
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 92 Pre rules applied. Total rules applied 91 place count 403 transition count 256
Deduced a syphon composed of 92 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 291 place count 295 transition count 256
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 297 place count 289 transition count 250
Iterating global reduction 3 with 6 rules applied. Total rules applied 303 place count 289 transition count 250
Performed 107 Post agglomeration using F-continuation condition.Transition count delta: 107
Deduced a syphon composed of 107 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 217 rules applied. Total rules applied 520 place count 179 transition count 143
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 521 place count 179 transition count 142
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 523 place count 178 transition count 146
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 528 place count 178 transition count 146
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 529 place count 177 transition count 145
Applied a total of 529 rules in 123 ms. Remains 177 /449 variables (removed 272) and now considering 145/394 (removed 249) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 177/449 places, 145/394 transitions.
Incomplete random walk after 10000 steps, including 1070 resets, run finished after 424 ms. (steps per millisecond=23 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 301 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 291 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 256 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 307 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 316 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 314 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 301 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 316 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 321 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 314 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 240 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 315 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 297 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 13) seen :0
Finished probabilistic random walk after 59451 steps, run visited all 13 properties in 164 ms. (steps per millisecond=362 )
Probabilistic random walk after 59451 steps, saw 15138 distinct states, run finished after 164 ms. (steps per millisecond=362 ) properties seen :13
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
Computed a total of 434 stabilizing places and 379 stable transitions
Graph (complete) has 1009 edges and 449 vertex of which 448 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.12 ms
FORMULA BusinessProcesses-PT-11-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||(p1 U (p2||G(p1))))))'
Support contains 3 out of 449 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 449/449 places, 394/394 transitions.
Graph (trivial) has 205 edges and 449 vertex of which 6 / 449 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1003 edges and 444 vertex of which 443 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 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 50 place count 442 transition count 338
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 98 place count 394 transition count 338
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 94 Pre rules applied. Total rules applied 98 place count 394 transition count 244
Deduced a syphon composed of 94 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 2 with 204 rules applied. Total rules applied 302 place count 284 transition count 244
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 310 place count 276 transition count 236
Iterating global reduction 2 with 8 rules applied. Total rules applied 318 place count 276 transition count 236
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 109
Deduced a syphon composed of 109 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 221 rules applied. Total rules applied 539 place count 164 transition count 127
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 541 place count 163 transition count 131
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 542 place count 162 transition count 130
Applied a total of 542 rules in 53 ms. Remains 162 /449 variables (removed 287) and now considering 130/394 (removed 264) transitions.
// Phase 1: matrix 130 rows 162 cols
[2023-03-12 17:50:17] [INFO ] Computed 72 place invariants in 3 ms
[2023-03-12 17:50:18] [INFO ] Implicit Places using invariants in 184 ms returned [129, 135]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 187 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 160/449 places, 130/394 transitions.
Applied a total of 0 rules in 8 ms. Remains 160 /160 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 248 ms. Remains : 160/449 places, 130/394 transitions.
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s43 1), p2:(AND (NEQ s56 1) (NEQ s1 1)), p1:(NEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 18212 reset in 311 ms.
Product exploration explored 100000 steps with 18300 reset in 235 ms.
Computed a total of 160 stabilizing places and 129 stable transitions
Computed a total of 160 stabilizing places and 129 stable transitions
Detected a total of 160/160 stabilizing places and 129/130 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 p1), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 323 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 2039 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 551 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 727 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Probably explored full state space saw : 8745 states, properties seen :1
Probabilistic random walk after 28806 steps, saw 8745 distinct states, run finished after 70 ms. (steps per millisecond=411 ) properties seen :1
Explored full state space saw : 8745 states, properties seen :0
Exhaustive walk after 28806 steps, saw 8745 distinct states, run finished after 63 ms. (steps per millisecond=457 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p2) (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p2) (NOT p1) (NOT p0))))
Knowledge based reduction with 7 factoid took 303 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-11-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-11-LTLFireability-01 finished in 2238 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||X((p1||F(G(p1))))))))'
Support contains 4 out of 449 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 449/449 places, 394/394 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 440 transition count 385
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 440 transition count 385
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 438 transition count 383
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 438 transition count 383
Applied a total of 22 rules in 29 ms. Remains 438 /449 variables (removed 11) and now considering 383/394 (removed 11) transitions.
// Phase 1: matrix 383 rows 438 cols
[2023-03-12 17:50:20] [INFO ] Computed 91 place invariants in 4 ms
[2023-03-12 17:50:20] [INFO ] Implicit Places using invariants in 229 ms returned []
[2023-03-12 17:50:20] [INFO ] Invariant cache hit.
[2023-03-12 17:50:20] [INFO ] Implicit Places using invariants and state equation in 436 ms returned []
Implicit Place search using SMT with State Equation took 670 ms to find 0 implicit places.
[2023-03-12 17:50:20] [INFO ] Invariant cache hit.
[2023-03-12 17:50:20] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 438/449 places, 383/394 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 937 ms. Remains : 438/449 places, 383/394 transitions.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(EQ s382 1), p1:(AND (EQ s201 1) (EQ s264 1) (EQ s399 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 124 steps with 0 reset in 7 ms.
FORMULA BusinessProcesses-PT-11-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-LTLFireability-02 finished in 1070 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&F(p1))))'
Support contains 2 out of 449 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 449/449 places, 394/394 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 440 transition count 385
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 440 transition count 385
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 438 transition count 383
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 438 transition count 383
Applied a total of 22 rules in 21 ms. Remains 438 /449 variables (removed 11) and now considering 383/394 (removed 11) transitions.
[2023-03-12 17:50:21] [INFO ] Invariant cache hit.
[2023-03-12 17:50:21] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-12 17:50:21] [INFO ] Invariant cache hit.
[2023-03-12 17:50:21] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 581 ms to find 0 implicit places.
[2023-03-12 17:50:21] [INFO ] Invariant cache hit.
[2023-03-12 17:50:21] [INFO ] Dead Transitions using invariants and state equation in 223 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 438/449 places, 383/394 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 827 ms. Remains : 438/449 places, 383/394 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s99 1), p1:(EQ s135 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-11-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-LTLFireability-04 finished in 998 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((((p0 U p1)||X(G(p2))) U !p3)))'
Support contains 3 out of 449 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 449/449 places, 394/394 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 442 transition count 387
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 442 transition count 387
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 440 transition count 385
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 440 transition count 385
Applied a total of 18 rules in 29 ms. Remains 440 /449 variables (removed 9) and now considering 385/394 (removed 9) transitions.
// Phase 1: matrix 385 rows 440 cols
[2023-03-12 17:50:22] [INFO ] Computed 91 place invariants in 7 ms
[2023-03-12 17:50:22] [INFO ] Implicit Places using invariants in 160 ms returned []
[2023-03-12 17:50:22] [INFO ] Invariant cache hit.
[2023-03-12 17:50:22] [INFO ] Implicit Places using invariants and state equation in 467 ms returned []
Implicit Place search using SMT with State Equation took 632 ms to find 0 implicit places.
[2023-03-12 17:50:22] [INFO ] Invariant cache hit.
[2023-03-12 17:50:22] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 440/449 places, 385/394 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 916 ms. Remains : 440/449 places, 385/394 transitions.
Stuttering acceptance computed with spot in 241 ms :[p3, p3, (NOT p2), (AND (NOT p1) (NOT p2)), true, (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p3, acceptance={0} source=1 dest: 1}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND p3 (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p3:(AND (EQ s96 1) (EQ s304 1)), p1:(EQ s193 1), p0:(EQ s96 1), p2:(EQ s304 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 451 ms.
Product exploration explored 100000 steps with 50000 reset in 328 ms.
Computed a total of 425 stabilizing places and 370 stable transitions
Graph (complete) has 996 edges and 440 vertex of which 439 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 425 stabilizing places and 370 stable transitions
Detected a total of 425/440 stabilizing places and 370/385 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge obtained : [(AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), (X (NOT p3)), (X (NOT (AND p3 (NOT p1) p0))), (X (NOT (AND p3 (NOT p1) (NOT p0)))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p3 (NOT p1) p0)))), (X (X (NOT (AND p3 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p3))
Knowledge based reduction with 16 factoid took 204 ms. Reduced automaton from 6 states, 13 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-11-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-11-LTLFireability-07 finished in 2178 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (p1||G(p0)))))'
Support contains 2 out of 449 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 449/449 places, 394/394 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 442 transition count 387
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 442 transition count 387
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 441 transition count 386
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 441 transition count 386
Applied a total of 16 rules in 20 ms. Remains 441 /449 variables (removed 8) and now considering 386/394 (removed 8) transitions.
// Phase 1: matrix 386 rows 441 cols
[2023-03-12 17:50:24] [INFO ] Computed 91 place invariants in 7 ms
[2023-03-12 17:50:24] [INFO ] Implicit Places using invariants in 153 ms returned []
[2023-03-12 17:50:24] [INFO ] Invariant cache hit.
[2023-03-12 17:50:24] [INFO ] Implicit Places using invariants and state equation in 460 ms returned []
Implicit Place search using SMT with State Equation took 618 ms to find 0 implicit places.
[2023-03-12 17:50:24] [INFO ] Invariant cache hit.
[2023-03-12 17:50:25] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 441/449 places, 386/394 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 846 ms. Remains : 441/449 places, 386/394 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (EQ s388 1) (NEQ s338 1)), p0:(NEQ s338 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1868 steps with 13 reset in 5 ms.
FORMULA BusinessProcesses-PT-11-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-LTLFireability-08 finished in 958 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0||X((p0&&X(!p0)))) U (G((p0||X((p0&&X(!p0)))))||(p1&&(p0||X((p0&&X(!p0)))))))))'
Support contains 2 out of 449 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 449/449 places, 394/394 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 442 transition count 387
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 442 transition count 387
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 440 transition count 385
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 440 transition count 385
Applied a total of 18 rules in 22 ms. Remains 440 /449 variables (removed 9) and now considering 385/394 (removed 9) transitions.
// Phase 1: matrix 385 rows 440 cols
[2023-03-12 17:50:25] [INFO ] Computed 91 place invariants in 16 ms
[2023-03-12 17:50:25] [INFO ] Implicit Places using invariants in 179 ms returned []
[2023-03-12 17:50:25] [INFO ] Invariant cache hit.
[2023-03-12 17:50:25] [INFO ] Implicit Places using invariants and state equation in 578 ms returned []
Implicit Place search using SMT with State Equation took 759 ms to find 0 implicit places.
[2023-03-12 17:50:25] [INFO ] Invariant cache hit.
[2023-03-12 17:50:26] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 440/449 places, 385/394 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 983 ms. Remains : 440/449 places, 385/394 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), true, true, p0]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 3}]], initial=0, aps=[p1:(NEQ s342 1), p0:(NEQ s396 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 310 ms.
Product exploration explored 100000 steps with 50000 reset in 312 ms.
Computed a total of 425 stabilizing places and 370 stable transitions
Graph (complete) has 996 edges and 440 vertex of which 439 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 425 stabilizing places and 370 stable transitions
Detected a total of 425/440 stabilizing places and 370/385 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p0)
Knowledge based reduction with 7 factoid took 255 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-11-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-11-LTLFireability-09 finished in 2041 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&(p1 U p2)))))'
Support contains 4 out of 449 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 449/449 places, 394/394 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 440 transition count 385
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 440 transition count 385
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 438 transition count 383
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 438 transition count 383
Applied a total of 22 rules in 20 ms. Remains 438 /449 variables (removed 11) and now considering 383/394 (removed 11) transitions.
// Phase 1: matrix 383 rows 438 cols
[2023-03-12 17:50:27] [INFO ] Computed 91 place invariants in 4 ms
[2023-03-12 17:50:27] [INFO ] Implicit Places using invariants in 160 ms returned []
[2023-03-12 17:50:27] [INFO ] Invariant cache hit.
[2023-03-12 17:50:27] [INFO ] Implicit Places using invariants and state equation in 428 ms returned []
Implicit Place search using SMT with State Equation took 591 ms to find 0 implicit places.
[2023-03-12 17:50:27] [INFO ] Invariant cache hit.
[2023-03-12 17:50:28] [INFO ] Dead Transitions using invariants and state equation in 213 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 438/449 places, 383/394 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 825 ms. Remains : 438/449 places, 383/394 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p2) p1), acceptance={0} source=2 dest: 1}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s73 1) (EQ s238 1) (EQ s410 1)), p1:(EQ s337 1), p0:(EQ s337 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 132 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-11-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-LTLFireability-10 finished in 966 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)||F(p0))))'
Support contains 5 out of 449 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 449/449 places, 394/394 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 440 transition count 385
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 440 transition count 385
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 438 transition count 383
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 438 transition count 383
Applied a total of 22 rules in 24 ms. Remains 438 /449 variables (removed 11) and now considering 383/394 (removed 11) transitions.
[2023-03-12 17:50:28] [INFO ] Invariant cache hit.
[2023-03-12 17:50:28] [INFO ] Implicit Places using invariants in 161 ms returned []
[2023-03-12 17:50:28] [INFO ] Invariant cache hit.
[2023-03-12 17:50:28] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 550 ms to find 0 implicit places.
[2023-03-12 17:50:28] [INFO ] Invariant cache hit.
[2023-03-12 17:50:28] [INFO ] Dead Transitions using invariants and state equation in 225 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 438/449 places, 383/394 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 800 ms. Remains : 438/449 places, 383/394 transitions.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p0:(AND (EQ s411 1) (EQ s414 1)), p1:(AND (EQ s51 1) (EQ s268 1) (EQ s399 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 121 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-11-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-LTLFireability-11 finished in 917 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 449 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 449/449 places, 394/394 transitions.
Graph (trivial) has 206 edges and 449 vertex of which 6 / 449 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1003 edges and 444 vertex of which 443 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 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 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 50 place count 442 transition count 338
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 98 place count 394 transition count 338
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 98 place count 394 transition count 242
Deduced a syphon composed of 96 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 210 rules applied. Total rules applied 308 place count 280 transition count 242
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 315 place count 273 transition count 235
Iterating global reduction 2 with 7 rules applied. Total rules applied 322 place count 273 transition count 235
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 225 rules applied. Total rules applied 547 place count 159 transition count 124
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 549 place count 158 transition count 128
Applied a total of 549 rules in 40 ms. Remains 158 /449 variables (removed 291) and now considering 128/394 (removed 266) transitions.
// Phase 1: matrix 128 rows 158 cols
[2023-03-12 17:50:29] [INFO ] Computed 70 place invariants in 3 ms
[2023-03-12 17:50:29] [INFO ] Implicit Places using invariants in 96 ms returned [1, 4, 5, 28, 29, 30, 31, 38, 39, 40, 45, 46, 47, 48, 49, 50, 51, 52]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 110 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 140/449 places, 128/394 transitions.
Applied a total of 0 rules in 5 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 155 ms. Remains : 140/449 places, 128/394 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s111 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-11-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-LTLFireability-12 finished in 204 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 449 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 449/449 places, 394/394 transitions.
Graph (trivial) has 207 edges and 449 vertex of which 6 / 449 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1003 edges and 444 vertex of which 443 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 442 transition count 337
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 100 place count 393 transition count 337
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 100 place count 393 transition count 241
Deduced a syphon composed of 96 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 210 rules applied. Total rules applied 310 place count 279 transition count 241
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 317 place count 272 transition count 234
Iterating global reduction 2 with 7 rules applied. Total rules applied 324 place count 272 transition count 234
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 225 rules applied. Total rules applied 549 place count 158 transition count 123
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 551 place count 157 transition count 127
Applied a total of 551 rules in 34 ms. Remains 157 /449 variables (removed 292) and now considering 127/394 (removed 267) transitions.
// Phase 1: matrix 127 rows 157 cols
[2023-03-12 17:50:29] [INFO ] Computed 70 place invariants in 2 ms
[2023-03-12 17:50:29] [INFO ] Implicit Places using invariants in 145 ms returned [1, 4, 5, 28, 29, 30, 31, 38, 39, 40, 45, 46, 47, 48, 49, 50, 51, 52]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 147 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 139/449 places, 127/394 transitions.
Applied a total of 0 rules in 6 ms. Remains 139 /139 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 188 ms. Remains : 139/449 places, 127/394 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s94 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-11-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-LTLFireability-14 finished in 288 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 449 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 449/449 places, 394/394 transitions.
Graph (trivial) has 207 edges and 449 vertex of which 6 / 449 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1003 edges and 444 vertex of which 443 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 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 50 place count 442 transition count 338
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 98 place count 394 transition count 338
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 98 place count 394 transition count 242
Deduced a syphon composed of 96 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 210 rules applied. Total rules applied 308 place count 280 transition count 242
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 316 place count 272 transition count 234
Iterating global reduction 2 with 8 rules applied. Total rules applied 324 place count 272 transition count 234
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 225 rules applied. Total rules applied 549 place count 158 transition count 123
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 551 place count 157 transition count 127
Applied a total of 551 rules in 38 ms. Remains 157 /449 variables (removed 292) and now considering 127/394 (removed 267) transitions.
// Phase 1: matrix 127 rows 157 cols
[2023-03-12 17:50:29] [INFO ] Computed 70 place invariants in 1 ms
[2023-03-12 17:50:29] [INFO ] Implicit Places using invariants in 139 ms returned [1, 4, 5, 29, 30, 31, 32, 39, 40, 41, 46, 47, 48, 49, 50, 51, 52, 53]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 153 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 139/449 places, 127/394 transitions.
Applied a total of 0 rules in 10 ms. Remains 139 /139 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 202 ms. Remains : 139/449 places, 127/394 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 21731 reset in 320 ms.
Product exploration explored 100000 steps with 21747 reset in 220 ms.
Computed a total of 130 stabilizing places and 119 stable transitions
Computed a total of 130 stabilizing places and 119 stable transitions
Detected a total of 130/139 stabilizing places and 119/127 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 150 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2452 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 774 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Finished probabilistic random walk after 314 steps, run visited all 1 properties in 5 ms. (steps per millisecond=62 )
Probabilistic random walk after 314 steps, saw 161 distinct states, run finished after 6 ms. (steps per millisecond=52 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 157 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Support contains 1 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 127/127 transitions.
Applied a total of 0 rules in 5 ms. Remains 139 /139 variables (removed 0) and now considering 127/127 (removed 0) transitions.
// Phase 1: matrix 127 rows 139 cols
[2023-03-12 17:50:30] [INFO ] Computed 52 place invariants in 2 ms
[2023-03-12 17:50:30] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-12 17:50:30] [INFO ] Invariant cache hit.
[2023-03-12 17:50:31] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-12 17:50:31] [INFO ] Implicit Places using invariants and state equation in 191 ms returned [3, 26, 28, 30, 32, 42, 44, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 76, 78, 79, 81, 83, 85, 87, 89]
Discarding 28 places :
Implicit Place search using SMT with State Equation took 314 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 111/139 places, 127/127 transitions.
Graph (complete) has 370 edges and 111 vertex of which 101 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 101 transition count 111
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 89 transition count 111
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 34 place count 80 transition count 80
Iterating global reduction 2 with 9 rules applied. Total rules applied 43 place count 80 transition count 80
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 79 transition count 79
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 79 transition count 79
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 59 place count 71 transition count 73
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 61 place count 70 transition count 72
Applied a total of 61 rules in 9 ms. Remains 70 /111 variables (removed 41) and now considering 72/127 (removed 55) transitions.
// Phase 1: matrix 72 rows 70 cols
[2023-03-12 17:50:31] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-12 17:50:31] [INFO ] Implicit Places using invariants in 56 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 57 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 69/139 places, 72/127 transitions.
Applied a total of 0 rules in 2 ms. Remains 69 /69 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 387 ms. Remains : 69/139 places, 72/127 transitions.
Computed a total of 60 stabilizing places and 64 stable transitions
Graph (complete) has 240 edges and 69 vertex of which 66 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Computed a total of 60 stabilizing places and 64 stable transitions
Detected a total of 60/69 stabilizing places and 64/72 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 138 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2548 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 784 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 190 steps, run visited all 1 properties in 7 ms. (steps per millisecond=27 )
Probabilistic random walk after 190 steps, saw 106 distinct states, run finished after 7 ms. (steps per millisecond=27 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 145 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22082 reset in 94 ms.
Product exploration explored 100000 steps with 22185 reset in 101 ms.
Support contains 1 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 72/72 transitions.
Applied a total of 0 rules in 3 ms. Remains 69 /69 variables (removed 0) and now considering 72/72 (removed 0) transitions.
// Phase 1: matrix 72 rows 69 cols
[2023-03-12 17:50:31] [INFO ] Computed 16 place invariants in 0 ms
[2023-03-12 17:50:31] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-12 17:50:31] [INFO ] Invariant cache hit.
[2023-03-12 17:50:32] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-12 17:50:32] [INFO ] Implicit Places using invariants and state equation in 84 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 158 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 68/69 places, 72/72 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 68 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 67 transition count 71
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 66 transition count 69
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 66 transition count 69
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 63 transition count 66
Applied a total of 10 rules in 4 ms. Remains 63 /68 variables (removed 5) and now considering 66/72 (removed 6) transitions.
// Phase 1: matrix 66 rows 63 cols
[2023-03-12 17:50:32] [INFO ] Computed 15 place invariants in 0 ms
[2023-03-12 17:50:32] [INFO ] Implicit Places using invariants in 40 ms returned [48, 53, 56]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 41 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 60/69 places, 66/72 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 59 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 59 transition count 65
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 0 with 2 rules applied. Total rules applied 4 place count 58 transition count 64
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 56 transition count 60
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 56 transition count 60
Applied a total of 8 rules in 6 ms. Remains 56 /60 variables (removed 4) and now considering 60/66 (removed 6) transitions.
// Phase 1: matrix 60 rows 56 cols
[2023-03-12 17:50:32] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-12 17:50:32] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-12 17:50:32] [INFO ] Invariant cache hit.
[2023-03-12 17:50:32] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-12 17:50:32] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 56/69 places, 60/72 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 318 ms. Remains : 56/69 places, 60/72 transitions.
Treatment of property BusinessProcesses-PT-11-LTLFireability-15 finished in 2690 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2023-03-12 17:50:32] [INFO ] Flatten gal took : 21 ms
[2023-03-12 17:50:32] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-12 17:50:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 449 places, 394 transitions and 1280 arcs took 5 ms.
Total runtime 24639 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1015/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : BusinessProcesses-PT-11-LTLFireability-15

BK_STOP 1678643433152

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name BusinessProcesses-PT-11-LTLFireability-15
ltl formula formula --ltl=/tmp/1015/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 449 places, 394 transitions and 1280 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.000 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1015/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1015/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1015/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1015/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x5611df4e53f4]
1: pnml2lts-mc(+0xa2496) [0x5611df4e5496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f673417f140]
3: pnml2lts-mc(+0x405be5) [0x5611df848be5]
4: pnml2lts-mc(+0x16b3f9) [0x5611df5ae3f9]
5: pnml2lts-mc(+0x164ac4) [0x5611df5a7ac4]
6: pnml2lts-mc(+0x272e0a) [0x5611df6b5e0a]
7: pnml2lts-mc(+0xb61f0) [0x5611df4f91f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f6733fd24d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f6733fd267a]
10: pnml2lts-mc(+0xa1581) [0x5611df4e4581]
11: pnml2lts-mc(+0xa1910) [0x5611df4e4910]
12: pnml2lts-mc(+0xa32a2) [0x5611df4e62a2]
13: pnml2lts-mc(+0xa50f4) [0x5611df4e80f4]
14: pnml2lts-mc(+0xa516b) [0x5611df4e816b]
15: pnml2lts-mc(+0x3f34b3) [0x5611df8364b3]
16: pnml2lts-mc(+0x7c63d) [0x5611df4bf63d]
17: pnml2lts-mc(+0x67d86) [0x5611df4aad86]
18: pnml2lts-mc(+0x60a8a) [0x5611df4a3a8a]
19: pnml2lts-mc(+0x5eb15) [0x5611df4a1b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f6733fbad0a]
21: pnml2lts-mc(+0x6075e) [0x5611df4a375e]

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-11"
export BK_EXAMINATION="LTLFireability"
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-11, examination is LTLFireability"
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-167813694800532"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-11.tgz
mv BusinessProcesses-PT-11 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;