Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r024-tall-165251918500444.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BusinessProcesses-PT-16, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918500444
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 376K
-rw-r--r-- 1 mcc users 5.9K Apr 29 23:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 29 23:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 29 23:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 29 23:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 07:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 159K May 10 09:33 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-16-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652635205674

Running Version 202205111006
[2022-05-15 17:20:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 17:20:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 17:20:07] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2022-05-15 17:20:07] [INFO ] Transformed 638 places.
[2022-05-15 17:20:07] [INFO ] Transformed 578 transitions.
[2022-05-15 17:20:07] [INFO ] Found NUPN structural information;
[2022-05-15 17:20:07] [INFO ] Parsed PT model containing 638 places and 578 transitions in 219 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 8 places in 11 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-16-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 630 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 630/630 places, 570/570 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 625 transition count 570
Discarding 91 places :
Symmetric choice reduction at 1 with 91 rule applications. Total rules 96 place count 534 transition count 479
Iterating global reduction 1 with 91 rules applied. Total rules applied 187 place count 534 transition count 479
Discarding 49 places :
Symmetric choice reduction at 1 with 49 rule applications. Total rules 236 place count 485 transition count 430
Iterating global reduction 1 with 49 rules applied. Total rules applied 285 place count 485 transition count 430
Applied a total of 285 rules in 146 ms. Remains 485 /630 variables (removed 145) and now considering 430/570 (removed 140) transitions.
// Phase 1: matrix 430 rows 485 cols
[2022-05-15 17:20:07] [INFO ] Computed 95 place invariants in 31 ms
[2022-05-15 17:20:07] [INFO ] Implicit Places using invariants in 357 ms returned []
// Phase 1: matrix 430 rows 485 cols
[2022-05-15 17:20:07] [INFO ] Computed 95 place invariants in 10 ms
[2022-05-15 17:20:08] [INFO ] Implicit Places using invariants and state equation in 582 ms returned []
Implicit Place search using SMT with State Equation took 967 ms to find 0 implicit places.
// Phase 1: matrix 430 rows 485 cols
[2022-05-15 17:20:08] [INFO ] Computed 95 place invariants in 20 ms
[2022-05-15 17:20:08] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 485/630 places, 430/570 transitions.
Finished structural reductions, in 1 iterations. Remains : 485/630 places, 430/570 transitions.
Support contains 36 out of 485 places after structural reductions.
[2022-05-15 17:20:08] [INFO ] Flatten gal took : 66 ms
[2022-05-15 17:20:08] [INFO ] Flatten gal took : 36 ms
[2022-05-15 17:20:08] [INFO ] Input system was already deterministic with 430 transitions.
Incomplete random walk after 10000 steps, including 64 resets, run finished after 598 ms. (steps per millisecond=16 ) properties (out of 28) seen :9
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 19) 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 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) seen :0
Running SMT prover for 19 properties.
// Phase 1: matrix 430 rows 485 cols
[2022-05-15 17:20:09] [INFO ] Computed 95 place invariants in 5 ms
[2022-05-15 17:20:09] [INFO ] [Real]Absence check using 56 positive place invariants in 18 ms returned sat
[2022-05-15 17:20:09] [INFO ] [Real]Absence check using 56 positive and 39 generalized place invariants in 11 ms returned sat
[2022-05-15 17:20:10] [INFO ] After 394ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2022-05-15 17:20:10] [INFO ] [Nat]Absence check using 56 positive place invariants in 22 ms returned sat
[2022-05-15 17:20:10] [INFO ] [Nat]Absence check using 56 positive and 39 generalized place invariants in 11 ms returned sat
[2022-05-15 17:20:11] [INFO ] After 587ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2022-05-15 17:20:11] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 4 ms to minimize.
[2022-05-15 17:20:11] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 1 ms to minimize.
[2022-05-15 17:20:11] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 1 ms to minimize.
[2022-05-15 17:20:11] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 1 ms to minimize.
[2022-05-15 17:20:11] [INFO ] Deduced a trap composed of 46 places in 89 ms of which 1 ms to minimize.
[2022-05-15 17:20:11] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 1 ms to minimize.
[2022-05-15 17:20:11] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 686 ms
[2022-05-15 17:20:11] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 0 ms to minimize.
[2022-05-15 17:20:12] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 1 ms to minimize.
[2022-05-15 17:20:12] [INFO ] Deduced a trap composed of 66 places in 63 ms of which 0 ms to minimize.
[2022-05-15 17:20:12] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 0 ms to minimize.
[2022-05-15 17:20:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 398 ms
[2022-05-15 17:20:12] [INFO ] Deduced a trap composed of 49 places in 66 ms of which 0 ms to minimize.
[2022-05-15 17:20:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2022-05-15 17:20:12] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 1 ms to minimize.
[2022-05-15 17:20:12] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 0 ms to minimize.
[2022-05-15 17:20:12] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 0 ms to minimize.
[2022-05-15 17:20:12] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 0 ms to minimize.
[2022-05-15 17:20:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 366 ms
[2022-05-15 17:20:13] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 0 ms to minimize.
[2022-05-15 17:20:13] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 0 ms to minimize.
[2022-05-15 17:20:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 187 ms
[2022-05-15 17:20:13] [INFO ] Deduced a trap composed of 91 places in 106 ms of which 0 ms to minimize.
[2022-05-15 17:20:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2022-05-15 17:20:13] [INFO ] After 3087ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 530 ms.
[2022-05-15 17:20:14] [INFO ] After 4047ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Parikh walk visited 8 properties in 201 ms.
Support contains 15 out of 485 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 485/485 places, 430/430 transitions.
Graph (trivial) has 211 edges and 485 vertex of which 6 / 485 are part of one of the 1 SCC in 5 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1094 edges and 480 vertex of which 479 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output 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 49 place count 479 transition count 375
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 98 place count 432 transition count 373
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 100 place count 430 transition count 373
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 93 Pre rules applied. Total rules applied 100 place count 430 transition count 280
Deduced a syphon composed of 93 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 3 with 199 rules applied. Total rules applied 299 place count 324 transition count 280
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 305 place count 318 transition count 274
Iterating global reduction 3 with 6 rules applied. Total rules applied 311 place count 318 transition count 274
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 250 rules applied. Total rules applied 561 place count 191 transition count 151
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 3 with 2 rules applied. Total rules applied 563 place count 190 transition count 155
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 565 place count 190 transition count 153
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 567 place count 188 transition count 153
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 571 place count 188 transition count 153
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 572 place count 187 transition count 152
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 573 place count 186 transition count 152
Applied a total of 573 rules in 104 ms. Remains 186 /485 variables (removed 299) and now considering 152/430 (removed 278) transitions.
Finished structural reductions, in 1 iterations. Remains : 186/485 places, 152/430 transitions.
Incomplete random walk after 10000 steps, including 337 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 11) seen :9
Incomplete Best-First random walk after 10000 steps, including 87 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 154 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 152 rows 186 cols
[2022-05-15 17:20:14] [INFO ] Computed 77 place invariants in 1 ms
[2022-05-15 17:20:14] [INFO ] [Real]Absence check using 55 positive place invariants in 6 ms returned sat
[2022-05-15 17:20:14] [INFO ] [Real]Absence check using 55 positive and 22 generalized place invariants in 6 ms returned sat
[2022-05-15 17:20:14] [INFO ] After 52ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 17:20:14] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-15 17:20:14] [INFO ] After 21ms SMT Verify possible using 5 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 17:20:14] [INFO ] After 183ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 17:20:14] [INFO ] [Nat]Absence check using 55 positive place invariants in 6 ms returned sat
[2022-05-15 17:20:14] [INFO ] [Nat]Absence check using 55 positive and 22 generalized place invariants in 4 ms returned sat
[2022-05-15 17:20:14] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 17:20:14] [INFO ] After 7ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 17:20:14] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2022-05-15 17:20:14] [INFO ] After 157ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 37 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=37 )
Parikh walk visited 1 properties in 1 ms.
Computed a total of 133 stabilizing places and 126 stable transitions
Graph (complete) has 1101 edges and 485 vertex of which 484 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.17 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X((p0 U p1))||F((F(p2)||p0))))))'
Support contains 3 out of 485 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 485/485 places, 430/430 transitions.
Graph (trivial) has 227 edges and 485 vertex of which 6 / 485 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 1095 edges and 480 vertex of which 479 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 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 478 transition count 369
Reduce places removed 53 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 54 rules applied. Total rules applied 109 place count 425 transition count 368
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 110 place count 424 transition count 368
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 110 place count 424 transition count 268
Deduced a syphon composed of 100 places in 0 ms
Ensure Unique test removed 15 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 3 with 215 rules applied. Total rules applied 325 place count 309 transition count 268
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 334 place count 300 transition count 259
Iterating global reduction 3 with 9 rules applied. Total rules applied 343 place count 300 transition count 259
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 124
Deduced a syphon composed of 124 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 252 rules applied. Total rules applied 595 place count 172 transition count 135
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 3 with 2 rules applied. Total rules applied 597 place count 171 transition count 139
Applied a total of 597 rules in 59 ms. Remains 171 /485 variables (removed 314) and now considering 139/430 (removed 291) transitions.
// Phase 1: matrix 139 rows 171 cols
[2022-05-15 17:20:15] [INFO ] Computed 76 place invariants in 1 ms
[2022-05-15 17:20:15] [INFO ] Implicit Places using invariants in 172 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 15, 16, 20, 21, 22, 23, 24, 25, 26, 49, 52, 53, 54, 55, 144]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 174 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 148/485 places, 139/430 transitions.
Applied a total of 0 rules in 11 ms. Remains 148 /148 variables (removed 0) and now considering 139/139 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 148/485 places, 139/430 transitions.
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s103 1), p0:(EQ s33 1), p2:(EQ s113 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-00 finished in 517 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)&&p0)))'
Support contains 4 out of 485 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 430/430 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 476 transition count 421
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 476 transition count 421
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 473 transition count 418
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 473 transition count 418
Applied a total of 24 rules in 40 ms. Remains 473 /485 variables (removed 12) and now considering 418/430 (removed 12) transitions.
// Phase 1: matrix 418 rows 473 cols
[2022-05-15 17:20:15] [INFO ] Computed 95 place invariants in 6 ms
[2022-05-15 17:20:16] [INFO ] Implicit Places using invariants in 189 ms returned []
// Phase 1: matrix 418 rows 473 cols
[2022-05-15 17:20:16] [INFO ] Computed 95 place invariants in 3 ms
[2022-05-15 17:20:16] [INFO ] Implicit Places using invariants and state equation in 517 ms returned []
Implicit Place search using SMT with State Equation took 707 ms to find 0 implicit places.
// Phase 1: matrix 418 rows 473 cols
[2022-05-15 17:20:16] [INFO ] Computed 95 place invariants in 7 ms
[2022-05-15 17:20:16] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 473/485 places, 418/430 transitions.
Finished structural reductions, in 1 iterations. Remains : 473/485 places, 418/430 transitions.
Stuttering acceptance computed with spot in 138 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(EQ s368 0), p0:(AND (EQ s250 0) (EQ s199 0) (EQ s438 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 26 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-01 finished in 1116 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p1)||p0)))'
Support contains 5 out of 485 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 430/430 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 475 transition count 420
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 475 transition count 420
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 472 transition count 417
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 472 transition count 417
Applied a total of 26 rules in 28 ms. Remains 472 /485 variables (removed 13) and now considering 417/430 (removed 13) transitions.
// Phase 1: matrix 417 rows 472 cols
[2022-05-15 17:20:17] [INFO ] Computed 95 place invariants in 3 ms
[2022-05-15 17:20:17] [INFO ] Implicit Places using invariants in 155 ms returned []
// Phase 1: matrix 417 rows 472 cols
[2022-05-15 17:20:17] [INFO ] Computed 95 place invariants in 3 ms
[2022-05-15 17:20:17] [INFO ] Implicit Places using invariants and state equation in 538 ms returned []
Implicit Place search using SMT with State Equation took 696 ms to find 0 implicit places.
// Phase 1: matrix 417 rows 472 cols
[2022-05-15 17:20:17] [INFO ] Computed 95 place invariants in 8 ms
[2022-05-15 17:20:17] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 472/485 places, 417/430 transitions.
Finished structural reductions, in 1 iterations. Remains : 472/485 places, 417/430 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s142 1) (EQ s33 1) (EQ s253 1) (EQ s387 1)) (AND (EQ s33 1) (EQ s253 1) (EQ s387 1) (EQ s76 1))), p1:(EQ s76 0)], 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 372 ms.
Product exploration explored 100000 steps with 50000 reset in 336 ms.
Computed a total of 126 stabilizing places and 119 stable transitions
Graph (complete) has 1082 edges and 472 vertex of which 471 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 126 stabilizing places and 119 stable transitions
Detected a total of 126/472 stabilizing places and 119/417 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 4 factoid took 79 ms. Reduced automaton from 2 states, 2 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA BusinessProcesses-PT-16-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-16-LTLFireability-02 finished in 1828 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 485 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 430/430 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 474 transition count 419
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 474 transition count 419
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 471 transition count 416
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 471 transition count 416
Applied a total of 28 rules in 27 ms. Remains 471 /485 variables (removed 14) and now considering 416/430 (removed 14) transitions.
// Phase 1: matrix 416 rows 471 cols
[2022-05-15 17:20:18] [INFO ] Computed 95 place invariants in 6 ms
[2022-05-15 17:20:18] [INFO ] Implicit Places using invariants in 165 ms returned []
// Phase 1: matrix 416 rows 471 cols
[2022-05-15 17:20:18] [INFO ] Computed 95 place invariants in 2 ms
[2022-05-15 17:20:19] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 655 ms to find 0 implicit places.
// Phase 1: matrix 416 rows 471 cols
[2022-05-15 17:20:19] [INFO ] Computed 95 place invariants in 5 ms
[2022-05-15 17:20:19] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 471/485 places, 416/430 transitions.
Finished structural reductions, in 1 iterations. Remains : 471/485 places, 416/430 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s198 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 275 ms.
Product exploration explored 100000 steps with 50000 reset in 276 ms.
Computed a total of 125 stabilizing places and 118 stable transitions
Graph (complete) has 1081 edges and 471 vertex of which 470 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 125 stabilizing places and 118 stable transitions
Detected a total of 125/471 stabilizing places and 118/416 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 : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 126 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA BusinessProcesses-PT-16-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-16-LTLFireability-03 finished in 1675 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (G(p0)||p1)))))'
Support contains 2 out of 485 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 485/485 places, 430/430 transitions.
Graph (trivial) has 228 edges and 485 vertex of which 6 / 485 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 1095 edges and 480 vertex of which 479 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 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 478 transition count 370
Reduce places removed 52 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 53 rules applied. Total rules applied 107 place count 426 transition count 369
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 108 place count 425 transition count 369
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 108 place count 425 transition count 268
Deduced a syphon composed of 101 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 3 with 218 rules applied. Total rules applied 326 place count 308 transition count 268
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 336 place count 298 transition count 258
Iterating global reduction 3 with 10 rules applied. Total rules applied 346 place count 298 transition count 258
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 346 place count 298 transition count 257
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 348 place count 297 transition count 257
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 251 rules applied. Total rules applied 599 place count 169 transition count 134
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 3 with 2 rules applied. Total rules applied 601 place count 168 transition count 138
Applied a total of 601 rules in 60 ms. Remains 168 /485 variables (removed 317) and now considering 138/430 (removed 292) transitions.
// Phase 1: matrix 138 rows 168 cols
[2022-05-15 17:20:20] [INFO ] Computed 74 place invariants in 2 ms
[2022-05-15 17:20:20] [INFO ] Implicit Places using invariants in 128 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 17, 21, 22, 23, 24, 25, 26, 50, 51, 52, 53, 54, 130]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 130 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 147/485 places, 138/430 transitions.
Applied a total of 0 rules in 6 ms. Remains 147 /147 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 147/485 places, 138/430 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NEQ s8 1) (NEQ s13 1)), p0:(NEQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 21823 reset in 253 ms.
Product exploration explored 100000 steps with 21684 reset in 314 ms.
Computed a total of 12 stabilizing places and 10 stable transitions
Computed a total of 12 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 190 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2432 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 763 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 780 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Finished probabilistic random walk after 4477 steps, run visited all 2 properties in 31 ms. (steps per millisecond=144 )
Probabilistic random walk after 4477 steps, saw 1366 distinct states, run finished after 31 ms. (steps per millisecond=144 ) properties seen :2
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 228 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 138/138 transitions.
Applied a total of 0 rules in 5 ms. Remains 147 /147 variables (removed 0) and now considering 138/138 (removed 0) transitions.
// Phase 1: matrix 138 rows 147 cols
[2022-05-15 17:20:22] [INFO ] Computed 53 place invariants in 1 ms
[2022-05-15 17:20:22] [INFO ] Implicit Places using invariants in 81 ms returned []
// Phase 1: matrix 138 rows 147 cols
[2022-05-15 17:20:22] [INFO ] Computed 53 place invariants in 1 ms
[2022-05-15 17:20:22] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-15 17:20:22] [INFO ] Implicit Places using invariants and state equation in 195 ms returned [1, 3, 9, 12, 36, 38, 40, 42, 43, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 68, 70, 72, 74, 76, 78, 80, 82, 90, 92, 94, 96, 98]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 278 ms to find 33 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 114/147 places, 138/138 transitions.
Graph (complete) has 373 edges and 114 vertex of which 105 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 105 transition count 125
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 96 transition count 124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 95 transition count 124
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 34 place count 82 transition count 88
Iterating global reduction 3 with 13 rules applied. Total rules applied 47 place count 82 transition count 88
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 50 place count 82 transition count 85
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 53 place count 79 transition count 85
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 54 place count 78 transition count 84
Iterating global reduction 5 with 1 rules applied. Total rules applied 55 place count 78 transition count 84
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 15 rules applied. Total rules applied 70 place count 70 transition count 77
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 5 with 2 rules applied. Total rules applied 72 place count 69 transition count 76
Applied a total of 72 rules in 17 ms. Remains 69 /114 variables (removed 45) and now considering 76/138 (removed 62) transitions.
// Phase 1: matrix 76 rows 69 cols
[2022-05-15 17:20:22] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-15 17:20:22] [INFO ] Implicit Places using invariants in 52 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 53 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 68/147 places, 76/138 transitions.
Applied a total of 0 rules in 4 ms. Remains 68 /68 variables (removed 0) and now considering 76/76 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 68/147 places, 76/138 transitions.
Computed a total of 4 stabilizing places and 5 stable transitions
Graph (complete) has 238 edges and 68 vertex of which 65 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 4 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 200 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2560 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 772 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 749 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 2) seen :0
Finished probabilistic random walk after 771 steps, run visited all 2 properties in 9 ms. (steps per millisecond=85 )
Probabilistic random walk after 771 steps, saw 307 distinct states, run finished after 9 ms. (steps per millisecond=85 ) properties seen :2
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 295 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 22390 reset in 95 ms.
Product exploration explored 100000 steps with 22259 reset in 83 ms.
Built C files in :
/tmp/ltsmin12333951061039692368
[2022-05-15 17:20:23] [INFO ] Computing symmetric may disable matrix : 76 transitions.
[2022-05-15 17:20:23] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 17:20:23] [INFO ] Computing symmetric may enable matrix : 76 transitions.
[2022-05-15 17:20:23] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 17:20:23] [INFO ] Computing Do-Not-Accords matrix : 76 transitions.
[2022-05-15 17:20:23] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 17:20:23] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12333951061039692368
Running compilation step : cd /tmp/ltsmin12333951061039692368;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 295 ms.
Running link step : cd /tmp/ltsmin12333951061039692368;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin12333951061039692368;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3051464611739134424.hoa' '--buchi-type=spotba'
LTSmin run took 138 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-05 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-16-LTLFireability-05 finished in 3865 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(G(p1)))))'
Support contains 2 out of 485 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 430/430 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 475 transition count 420
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 475 transition count 420
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 473 transition count 418
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 473 transition count 418
Applied a total of 24 rules in 55 ms. Remains 473 /485 variables (removed 12) and now considering 418/430 (removed 12) transitions.
// Phase 1: matrix 418 rows 473 cols
[2022-05-15 17:20:24] [INFO ] Computed 95 place invariants in 3 ms
[2022-05-15 17:20:24] [INFO ] Implicit Places using invariants in 159 ms returned []
// Phase 1: matrix 418 rows 473 cols
[2022-05-15 17:20:24] [INFO ] Computed 95 place invariants in 5 ms
[2022-05-15 17:20:25] [INFO ] Implicit Places using invariants and state equation in 518 ms returned []
Implicit Place search using SMT with State Equation took 683 ms to find 0 implicit places.
// Phase 1: matrix 418 rows 473 cols
[2022-05-15 17:20:25] [INFO ] Computed 95 place invariants in 3 ms
[2022-05-15 17:20:25] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 473/485 places, 418/430 transitions.
Finished structural reductions, in 1 iterations. Remains : 473/485 places, 418/430 transitions.
Stuttering acceptance computed with spot in 356 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s409 1), p1:(EQ s160 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], 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-16-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-06 finished in 1317 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 485 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 485/485 places, 430/430 transitions.
Graph (trivial) has 229 edges and 485 vertex of which 6 / 485 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 1095 edges and 480 vertex of which 479 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
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 478 transition count 368
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 110 place count 424 transition count 368
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 110 place count 424 transition count 267
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 2 with 219 rules applied. Total rules applied 329 place count 306 transition count 267
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 338 place count 297 transition count 258
Iterating global reduction 2 with 9 rules applied. Total rules applied 347 place count 297 transition count 258
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 347 place count 297 transition count 257
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 349 place count 296 transition count 257
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 124
Deduced a syphon composed of 124 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 253 rules applied. Total rules applied 602 place count 167 transition count 133
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 604 place count 166 transition count 137
Applied a total of 604 rules in 45 ms. Remains 166 /485 variables (removed 319) and now considering 137/430 (removed 293) transitions.
// Phase 1: matrix 137 rows 166 cols
[2022-05-15 17:20:25] [INFO ] Computed 73 place invariants in 1 ms
[2022-05-15 17:20:25] [INFO ] Implicit Places using invariants in 105 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 47, 48, 49, 50, 51]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 106 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 146/485 places, 137/430 transitions.
Applied a total of 0 rules in 5 ms. Remains 146 /146 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 146/485 places, 137/430 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-07 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 s43 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 21837 reset in 196 ms.
Product exploration explored 100000 steps with 22013 reset in 207 ms.
Computed a total of 12 stabilizing places and 10 stable transitions
Computed a total of 12 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2492 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 764 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 6004 steps, run visited all 1 properties in 16 ms. (steps per millisecond=375 )
Probabilistic random walk after 6004 steps, saw 1833 distinct states, run finished after 16 ms. (steps per millisecond=375 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Support contains 1 out of 146 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 146/146 places, 137/137 transitions.
Applied a total of 0 rules in 7 ms. Remains 146 /146 variables (removed 0) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 146 cols
[2022-05-15 17:20:26] [INFO ] Computed 53 place invariants in 1 ms
[2022-05-15 17:20:26] [INFO ] Implicit Places using invariants in 85 ms returned []
// Phase 1: matrix 137 rows 146 cols
[2022-05-15 17:20:26] [INFO ] Computed 53 place invariants in 1 ms
[2022-05-15 17:20:26] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-15 17:20:26] [INFO ] Implicit Places using invariants and state equation in 189 ms returned [1, 3, 7, 10, 33, 35, 37, 39, 40, 41, 46, 48, 50, 52, 54, 56, 58, 60, 62, 66, 68, 70, 72, 74, 76, 78, 80, 88, 90, 92, 94, 96]
Discarding 32 places :
Implicit Place search using SMT with State Equation took 278 ms to find 32 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 114/146 places, 137/137 transitions.
Graph (complete) has 376 edges and 114 vertex of which 103 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 103 transition count 123
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 94 transition count 123
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 33 place count 80 transition count 80
Iterating global reduction 2 with 14 rules applied. Total rules applied 47 place count 80 transition count 80
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 49 place count 80 transition count 78
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 51 place count 78 transition count 78
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 52 place count 77 transition count 77
Iterating global reduction 4 with 1 rules applied. Total rules applied 53 place count 77 transition count 77
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 17 rules applied. Total rules applied 70 place count 68 transition count 69
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 4 with 2 rules applied. Total rules applied 72 place count 67 transition count 68
Applied a total of 72 rules in 10 ms. Remains 67 /114 variables (removed 47) and now considering 68/137 (removed 69) transitions.
// Phase 1: matrix 68 rows 67 cols
[2022-05-15 17:20:26] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-15 17:20:26] [INFO ] Implicit Places using invariants in 50 ms returned [5, 6, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 52 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 64/146 places, 68/137 transitions.
Applied a total of 0 rules in 1 ms. Remains 64 /64 variables (removed 0) and now considering 68/68 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 64/146 places, 68/137 transitions.
Computed a total of 4 stabilizing places and 5 stable transitions
Computed a total of 4 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2529 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 789 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 77 steps, run visited all 1 properties in 3 ms. (steps per millisecond=25 )
Probabilistic random walk after 77 steps, saw 47 distinct states, run finished after 3 ms. (steps per millisecond=25 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22413 reset in 90 ms.
Product exploration explored 100000 steps with 22432 reset in 93 ms.
Built C files in :
/tmp/ltsmin12540422318600920318
[2022-05-15 17:20:27] [INFO ] Computing symmetric may disable matrix : 68 transitions.
[2022-05-15 17:20:27] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 17:20:27] [INFO ] Computing symmetric may enable matrix : 68 transitions.
[2022-05-15 17:20:27] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 17:20:27] [INFO ] Computing Do-Not-Accords matrix : 68 transitions.
[2022-05-15 17:20:27] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 17:20:27] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12540422318600920318
Running compilation step : cd /tmp/ltsmin12540422318600920318;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 161 ms.
Running link step : cd /tmp/ltsmin12540422318600920318;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin12540422318600920318;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1036856061271797611.hoa' '--buchi-type=spotba'
LTSmin run took 61 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-16-LTLFireability-07 finished in 2194 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(((X(p1)||X(p2))&&p3))&&G(p4)&&p0)))'
Support contains 8 out of 485 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 485/485 places, 430/430 transitions.
Graph (complete) has 1101 edges and 485 vertex of which 484 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 50 place count 483 transition count 379
Reduce places removed 49 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 51 rules applied. Total rules applied 101 place count 434 transition count 377
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 103 place count 432 transition count 377
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 102 Pre rules applied. Total rules applied 103 place count 432 transition count 275
Deduced a syphon composed of 102 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 3 with 220 rules applied. Total rules applied 323 place count 314 transition count 275
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 332 place count 305 transition count 266
Iterating global reduction 3 with 9 rules applied. Total rules applied 341 place count 305 transition count 266
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 341 place count 305 transition count 265
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 343 place count 304 transition count 265
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 251 rules applied. Total rules applied 594 place count 176 transition count 142
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 595 place count 176 transition count 141
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 597 place count 175 transition count 145
Applied a total of 597 rules in 38 ms. Remains 175 /485 variables (removed 310) and now considering 145/430 (removed 285) transitions.
// Phase 1: matrix 145 rows 175 cols
[2022-05-15 17:20:27] [INFO ] Computed 74 place invariants in 2 ms
[2022-05-15 17:20:27] [INFO ] Implicit Places using invariants in 103 ms returned [6, 7, 8, 11, 18, 19, 23, 24, 28, 29, 30, 53, 54, 55, 56, 57]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 104 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 159/485 places, 145/430 transitions.
Applied a total of 0 rules in 3 ms. Remains 159 /159 variables (removed 0) and now considering 145/145 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 159/485 places, 145/430 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p4) (NOT p0) (NOT p3) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND p3 (NOT p0) p4 (NOT p1) (NOT p2)) (AND p1 (NOT p3)) (AND p1 (NOT p4)) (AND p2 (NOT p3)) (AND p2 (NOT p4)))]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p3) (NOT p0) (NOT p4)), acceptance={0} source=0 dest: 0}, { cond=(AND p3 p0 p4), acceptance={0} source=0 dest: 1}, { cond=(AND p3 p0 p4), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p3) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p4) (NOT p2))), acceptance={0} source=1 dest: 0}, { cond=(AND p3 p0 (NOT p1) p4 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p3 p0 (NOT p1) p4 (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p3) p1) (AND (NOT p3) p2) (AND p1 (NOT p4)) (AND (NOT p4) p2)), acceptance={0} source=2 dest: 0}, { cond=(OR (AND p3 (NOT p0) p4) (AND p3 p1 p4) (AND p3 p4 p2)), acceptance={0} source=2 dest: 1}, { cond=(OR (AND p3 (NOT p0) p4) (AND p3 p1 p4) (AND p3 p4 p2)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p3:(EQ s18 1), p0:(AND (EQ s6 1) (EQ s51 1) (EQ s118 1)), p4:(AND (EQ s6 1) (EQ s51 1) (EQ s118 1)), p1:(EQ s104 0), p2:(AND (EQ s4 1) (EQ s63 1) (EQ s136...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-08 finished in 327 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(p0)||p1))||G(p2)))'
Support contains 5 out of 485 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 430/430 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 474 transition count 419
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 474 transition count 419
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 471 transition count 416
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 471 transition count 416
Applied a total of 28 rules in 21 ms. Remains 471 /485 variables (removed 14) and now considering 416/430 (removed 14) transitions.
// Phase 1: matrix 416 rows 471 cols
[2022-05-15 17:20:28] [INFO ] Computed 95 place invariants in 7 ms
[2022-05-15 17:20:28] [INFO ] Implicit Places using invariants in 166 ms returned []
// Phase 1: matrix 416 rows 471 cols
[2022-05-15 17:20:28] [INFO ] Computed 95 place invariants in 7 ms
[2022-05-15 17:20:28] [INFO ] Implicit Places using invariants and state equation in 498 ms returned []
Implicit Place search using SMT with State Equation took 667 ms to find 0 implicit places.
// Phase 1: matrix 416 rows 471 cols
[2022-05-15 17:20:28] [INFO ] Computed 95 place invariants in 4 ms
[2022-05-15 17:20:29] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 471/485 places, 416/430 transitions.
Finished structural reductions, in 1 iterations. Remains : 471/485 places, 416/430 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(OR (EQ s130 0) (EQ s305 0) (EQ s436 0)), p1:(EQ s427 0), p2:(EQ s236 0)], 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, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 269 ms.
Product exploration explored 100000 steps with 50000 reset in 291 ms.
Computed a total of 125 stabilizing places and 118 stable transitions
Graph (complete) has 1081 edges and 471 vertex of which 470 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 125 stabilizing places and 118 stable transitions
Detected a total of 125/471 stabilizing places and 118/416 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (X p0)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 8 factoid took 138 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA BusinessProcesses-PT-16-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-16-LTLFireability-09 finished in 1804 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!((X(F(p0))||p1) U !p0)&&F(p1)))'
Support contains 2 out of 485 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 485/485 places, 430/430 transitions.
Graph (trivial) has 227 edges and 485 vertex of which 6 / 485 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 1095 edges and 480 vertex of which 479 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 478 transition count 369
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 1 with 53 rules applied. Total rules applied 108 place count 425 transition count 369
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 108 place count 425 transition count 268
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 2 with 219 rules applied. Total rules applied 327 place count 307 transition count 268
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 336 place count 298 transition count 259
Iterating global reduction 2 with 9 rules applied. Total rules applied 345 place count 298 transition count 259
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 345 place count 298 transition count 258
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 347 place count 297 transition count 258
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 251 rules applied. Total rules applied 598 place count 169 transition count 135
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 600 place count 168 transition count 139
Applied a total of 600 rules in 31 ms. Remains 168 /485 variables (removed 317) and now considering 139/430 (removed 291) transitions.
// Phase 1: matrix 139 rows 168 cols
[2022-05-15 17:20:30] [INFO ] Computed 73 place invariants in 1 ms
[2022-05-15 17:20:30] [INFO ] Implicit Places using invariants in 111 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 20, 21, 22, 23, 24, 25, 48, 49, 50, 51, 52]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 112 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 148/485 places, 139/430 transitions.
Applied a total of 0 rules in 4 ms. Remains 148 /148 variables (removed 0) and now considering 139/139 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 148/485 places, 139/430 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p0), (NOT p1), false, p0]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={} source=5 dest: 1}, { cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(NEQ s9 1), p1:(EQ s108 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-10 finished in 328 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 485 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 485/485 places, 430/430 transitions.
Graph (trivial) has 228 edges and 485 vertex of which 6 / 485 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 1095 edges and 480 vertex of which 479 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 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 478 transition count 369
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 1 with 53 rules applied. Total rules applied 108 place count 425 transition count 369
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 102 Pre rules applied. Total rules applied 108 place count 425 transition count 267
Deduced a syphon composed of 102 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 2 with 221 rules applied. Total rules applied 329 place count 306 transition count 267
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 338 place count 297 transition count 258
Iterating global reduction 2 with 9 rules applied. Total rules applied 347 place count 297 transition count 258
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 347 place count 297 transition count 257
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 349 place count 296 transition count 257
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 251 rules applied. Total rules applied 600 place count 168 transition count 134
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 602 place count 167 transition count 138
Applied a total of 602 rules in 31 ms. Remains 167 /485 variables (removed 318) and now considering 138/430 (removed 292) transitions.
// Phase 1: matrix 138 rows 167 cols
[2022-05-15 17:20:30] [INFO ] Computed 73 place invariants in 2 ms
[2022-05-15 17:20:30] [INFO ] Implicit Places using invariants in 114 ms returned [1, 2, 3, 4, 5, 9, 16, 17, 21, 22, 23, 24, 25, 26, 49, 50, 51, 52, 53]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 117 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 148/485 places, 138/430 transitions.
Applied a total of 0 rules in 2 ms. Remains 148 /148 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 148/485 places, 138/430 transitions.
Stuttering acceptance computed with spot in 280 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-11 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 s2 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-16-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-11 finished in 446 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U G(X((X(p1)&&!X(p0))))))'
Support contains 2 out of 485 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 430/430 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 475 transition count 420
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 475 transition count 420
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 472 transition count 417
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 472 transition count 417
Applied a total of 26 rules in 34 ms. Remains 472 /485 variables (removed 13) and now considering 417/430 (removed 13) transitions.
// Phase 1: matrix 417 rows 472 cols
[2022-05-15 17:20:30] [INFO ] Computed 95 place invariants in 8 ms
[2022-05-15 17:20:30] [INFO ] Implicit Places using invariants in 170 ms returned []
// Phase 1: matrix 417 rows 472 cols
[2022-05-15 17:20:30] [INFO ] Computed 95 place invariants in 3 ms
[2022-05-15 17:20:31] [INFO ] Implicit Places using invariants and state equation in 523 ms returned []
Implicit Place search using SMT with State Equation took 695 ms to find 0 implicit places.
// Phase 1: matrix 417 rows 472 cols
[2022-05-15 17:20:31] [INFO ] Computed 95 place invariants in 3 ms
[2022-05-15 17:20:31] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 472/485 places, 417/430 transitions.
Finished structural reductions, in 1 iterations. Remains : 472/485 places, 417/430 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p1) p0), true, (OR (NOT p1) p0), (OR (NOT p1) p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(OR p0 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s236 1), p1:(EQ s296 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 2 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-13 finished in 1098 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(!p0)&&p1)) U (G((G(p0)||!p1))||!p1)))'
Support contains 4 out of 485 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 485/485 places, 430/430 transitions.
Graph (complete) has 1101 edges and 485 vertex of which 484 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 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 483 transition count 377
Reduce places removed 51 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 53 rules applied. Total rules applied 105 place count 432 transition count 375
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 107 place count 430 transition count 375
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 104 Pre rules applied. Total rules applied 107 place count 430 transition count 271
Deduced a syphon composed of 104 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 3 with 224 rules applied. Total rules applied 331 place count 310 transition count 271
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 341 place count 300 transition count 261
Iterating global reduction 3 with 10 rules applied. Total rules applied 351 place count 300 transition count 261
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 351 place count 300 transition count 260
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 353 place count 299 transition count 260
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 251 rules applied. Total rules applied 604 place count 171 transition count 137
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 605 place count 171 transition count 136
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 607 place count 170 transition count 140
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 608 place count 169 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 609 place count 168 transition count 139
Applied a total of 609 rules in 42 ms. Remains 168 /485 variables (removed 317) and now considering 139/430 (removed 291) transitions.
// Phase 1: matrix 139 rows 168 cols
[2022-05-15 17:20:31] [INFO ] Computed 73 place invariants in 1 ms
[2022-05-15 17:20:32] [INFO ] Implicit Places using invariants in 103 ms returned [48, 51, 52]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 104 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 165/485 places, 139/430 transitions.
Applied a total of 0 rules in 3 ms. Remains 165 /165 variables (removed 0) and now considering 139/139 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 165/485 places, 139/430 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) p1), true, (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(NEQ s138 1), p0:(AND (EQ s48 1) (EQ s74 1) (EQ s142 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-14 finished in 250 ms.
All properties solved by simple procedures.
Total runtime 25259 ms.

BK_STOP 1652635232195

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-16"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-16, 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 r024-tall-165251918500444"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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