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-165251918500460.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-18, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918500460
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 7.1K Apr 30 00:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 30 00:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 30 00:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 30 00:04 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 4.1K May 9 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 07:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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.8K 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 177K 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-18-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652638167803

Running Version 202205111006
[2022-05-15 18:09:30] [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 18:09:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 18:09:30] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2022-05-15 18:09:30] [INFO ] Transformed 717 places.
[2022-05-15 18:09:30] [INFO ] Transformed 642 transitions.
[2022-05-15 18:09:30] [INFO ] Found NUPN structural information;
[2022-05-15 18:09:30] [INFO ] Parsed PT model containing 717 places and 642 transitions in 230 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 15 places in 15 ms
Reduce places removed 15 places and 15 transitions.
FORMULA BusinessProcesses-PT-18-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 52 out of 702 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 702/702 places, 627/627 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 694 transition count 627
Discarding 96 places :
Symmetric choice reduction at 1 with 96 rule applications. Total rules 104 place count 598 transition count 531
Iterating global reduction 1 with 96 rules applied. Total rules applied 200 place count 598 transition count 531
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 201 place count 598 transition count 530
Discarding 52 places :
Symmetric choice reduction at 2 with 52 rule applications. Total rules 253 place count 546 transition count 478
Iterating global reduction 2 with 52 rules applied. Total rules applied 305 place count 546 transition count 478
Applied a total of 305 rules in 137 ms. Remains 546 /702 variables (removed 156) and now considering 478/627 (removed 149) transitions.
// Phase 1: matrix 478 rows 546 cols
[2022-05-15 18:09:30] [INFO ] Computed 106 place invariants in 31 ms
[2022-05-15 18:09:30] [INFO ] Implicit Places using invariants in 357 ms returned []
// Phase 1: matrix 478 rows 546 cols
[2022-05-15 18:09:30] [INFO ] Computed 106 place invariants in 12 ms
[2022-05-15 18:09:31] [INFO ] Implicit Places using invariants and state equation in 523 ms returned []
Implicit Place search using SMT with State Equation took 907 ms to find 0 implicit places.
// Phase 1: matrix 478 rows 546 cols
[2022-05-15 18:09:31] [INFO ] Computed 106 place invariants in 20 ms
[2022-05-15 18:09:31] [INFO ] Dead Transitions using invariants and state equation in 273 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 546/702 places, 478/627 transitions.
Finished structural reductions, in 1 iterations. Remains : 546/702 places, 478/627 transitions.
Support contains 52 out of 546 places after structural reductions.
[2022-05-15 18:09:31] [INFO ] Flatten gal took : 66 ms
[2022-05-15 18:09:32] [INFO ] Flatten gal took : 31 ms
[2022-05-15 18:09:32] [INFO ] Input system was already deterministic with 478 transitions.
Support contains 47 out of 546 places (down from 52) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 53 resets, run finished after 504 ms. (steps per millisecond=19 ) properties (out of 31) seen :11
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 20) 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 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) 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 20) 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 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 20) 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 20) 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 20) 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 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
// Phase 1: matrix 478 rows 546 cols
[2022-05-15 18:09:32] [INFO ] Computed 106 place invariants in 9 ms
[2022-05-15 18:09:33] [INFO ] [Real]Absence check using 65 positive place invariants in 29 ms returned sat
[2022-05-15 18:09:33] [INFO ] [Real]Absence check using 65 positive and 41 generalized place invariants in 15 ms returned sat
[2022-05-15 18:09:33] [INFO ] After 362ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2022-05-15 18:09:33] [INFO ] [Nat]Absence check using 65 positive place invariants in 27 ms returned sat
[2022-05-15 18:09:33] [INFO ] [Nat]Absence check using 65 positive and 41 generalized place invariants in 14 ms returned sat
[2022-05-15 18:09:34] [INFO ] After 628ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :16
[2022-05-15 18:09:34] [INFO ] Deduced a trap composed of 82 places in 147 ms of which 5 ms to minimize.
[2022-05-15 18:09:34] [INFO ] Deduced a trap composed of 38 places in 141 ms of which 1 ms to minimize.
[2022-05-15 18:09:34] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 1 ms to minimize.
[2022-05-15 18:09:34] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 2 ms to minimize.
[2022-05-15 18:09:35] [INFO ] Deduced a trap composed of 85 places in 116 ms of which 1 ms to minimize.
[2022-05-15 18:09:35] [INFO ] Deduced a trap composed of 52 places in 124 ms of which 1 ms to minimize.
[2022-05-15 18:09:35] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 0 ms to minimize.
[2022-05-15 18:09:35] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 1 ms to minimize.
[2022-05-15 18:09:35] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 1 ms to minimize.
[2022-05-15 18:09:35] [INFO ] Deduced a trap composed of 52 places in 74 ms of which 0 ms to minimize.
[2022-05-15 18:09:35] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2022-05-15 18:09:35] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 0 ms to minimize.
[2022-05-15 18:09:35] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2022-05-15 18:09:35] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 0 ms to minimize.
[2022-05-15 18:09:36] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 1 ms to minimize.
[2022-05-15 18:09:36] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 0 ms to minimize.
[2022-05-15 18:09:36] [INFO ] Deduced a trap composed of 47 places in 66 ms of which 0 ms to minimize.
[2022-05-15 18:09:36] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 1 ms to minimize.
[2022-05-15 18:09:36] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 0 ms to minimize.
[2022-05-15 18:09:36] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2150 ms
[2022-05-15 18:09:36] [INFO ] Deduced a trap composed of 93 places in 102 ms of which 1 ms to minimize.
[2022-05-15 18:09:36] [INFO ] Deduced a trap composed of 98 places in 93 ms of which 1 ms to minimize.
[2022-05-15 18:09:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 264 ms
[2022-05-15 18:09:37] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 0 ms to minimize.
[2022-05-15 18:09:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2022-05-15 18:09:37] [INFO ] After 3739ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :15
Attempting to minimize the solution found.
Minimization took 399 ms.
[2022-05-15 18:09:37] [INFO ] After 4633ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :15
Fused 20 Parikh solutions to 15 different solutions.
Parikh walk visited 10 properties in 254 ms.
Support contains 9 out of 546 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 546/546 places, 478/478 transitions.
Graph (complete) has 1222 edges and 546 vertex of which 545 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 545 transition count 413
Reduce places removed 64 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 67 rules applied. Total rules applied 132 place count 481 transition count 410
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 135 place count 478 transition count 410
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 113 Pre rules applied. Total rules applied 135 place count 478 transition count 297
Deduced a syphon composed of 113 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 3 with 250 rules applied. Total rules applied 385 place count 341 transition count 297
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 392 place count 334 transition count 290
Iterating global reduction 3 with 7 rules applied. Total rules applied 399 place count 334 transition count 290
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 3 with 289 rules applied. Total rules applied 688 place count 188 transition count 147
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 689 place count 188 transition count 146
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 690 place count 188 transition count 145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 691 place count 187 transition count 145
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 695 place count 187 transition count 145
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 696 place count 186 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 697 place count 185 transition count 144
Applied a total of 697 rules in 111 ms. Remains 185 /546 variables (removed 361) and now considering 144/478 (removed 334) transitions.
Finished structural reductions, in 1 iterations. Remains : 185/546 places, 144/478 transitions.
Incomplete random walk after 10000 steps, including 538 resets, run finished after 289 ms. (steps per millisecond=34 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 198 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 284 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 196 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 179 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 144 rows 185 cols
[2022-05-15 18:09:38] [INFO ] Computed 78 place invariants in 2 ms
[2022-05-15 18:09:38] [INFO ] [Real]Absence check using 64 positive place invariants in 7 ms returned sat
[2022-05-15 18:09:38] [INFO ] [Real]Absence check using 64 positive and 14 generalized place invariants in 4 ms returned sat
[2022-05-15 18:09:38] [INFO ] After 148ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 18:09:38] [INFO ] [Nat]Absence check using 64 positive place invariants in 8 ms returned sat
[2022-05-15 18:09:38] [INFO ] [Nat]Absence check using 64 positive and 14 generalized place invariants in 3 ms returned sat
[2022-05-15 18:09:39] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 18:09:39] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 1 ms to minimize.
[2022-05-15 18:09:39] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 0 ms to minimize.
[2022-05-15 18:09:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 119 ms
[2022-05-15 18:09:39] [INFO ] After 247ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 35 ms.
[2022-05-15 18:09:39] [INFO ] After 336ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 185 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 185/185 places, 144/144 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 185 transition count 143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 184 transition count 143
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 184 transition count 140
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 9 place count 180 transition count 140
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 13 place count 178 transition count 138
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 177 transition count 137
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 177 transition count 137
Applied a total of 15 rules in 19 ms. Remains 177 /185 variables (removed 8) and now considering 137/144 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 177/185 places, 137/144 transitions.
Incomplete random walk after 10000 steps, including 550 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 377 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 221 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 2) seen :0
Finished probabilistic random walk after 112453 steps, run visited all 2 properties in 432 ms. (steps per millisecond=260 )
Probabilistic random walk after 112453 steps, saw 34460 distinct states, run finished after 433 ms. (steps per millisecond=259 ) properties seen :2
FORMULA BusinessProcesses-PT-18-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 5 atomic propositions for a total of 13 simplifications.
FORMULA BusinessProcesses-PT-18-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 491 stabilizing places and 433 stable transitions
Graph (complete) has 1222 edges and 546 vertex of which 545 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.19 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&(F(X(F(p0)))||!(X(p1) U !p1))))))'
Support contains 4 out of 546 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 546/546 places, 478/478 transitions.
Graph (trivial) has 264 edges and 546 vertex of which 6 / 546 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1215 edges and 541 vertex of which 540 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 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 539 transition count 402
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 138 place count 471 transition count 402
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 138 place count 471 transition count 288
Deduced a syphon composed of 114 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 2 with 253 rules applied. Total rules applied 391 place count 332 transition count 288
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 399 place count 324 transition count 280
Iterating global reduction 2 with 8 rules applied. Total rules applied 407 place count 324 transition count 280
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 408 place count 323 transition count 279
Iterating global reduction 2 with 1 rules applied. Total rules applied 409 place count 323 transition count 279
Performed 137 Post agglomeration using F-continuation condition.Transition count delta: 137
Deduced a syphon composed of 137 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 2 with 277 rules applied. Total rules applied 686 place count 183 transition count 142
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 690 place count 181 transition count 144
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 691 place count 180 transition count 143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 692 place count 179 transition count 143
Applied a total of 692 rules in 77 ms. Remains 179 /546 variables (removed 367) and now considering 143/478 (removed 335) transitions.
// Phase 1: matrix 143 rows 179 cols
[2022-05-15 18:09:40] [INFO ] Computed 77 place invariants in 4 ms
[2022-05-15 18:09:40] [INFO ] Implicit Places using invariants in 113 ms returned [42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 116 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 167/546 places, 143/478 transitions.
Applied a total of 0 rules in 8 ms. Remains 167 /167 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 167/546 places, 143/478 transitions.
Stuttering acceptance computed with spot in 501 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s1 0), p1:(AND (EQ s35 1) (EQ s76 1) (EQ s163 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 3 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-00 finished in 763 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(X(p1))&&G(X(p2))))'
Support contains 3 out of 546 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 546/546 places, 478/478 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 539 transition count 471
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 539 transition count 471
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 537 transition count 469
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 537 transition count 469
Applied a total of 18 rules in 76 ms. Remains 537 /546 variables (removed 9) and now considering 469/478 (removed 9) transitions.
// Phase 1: matrix 469 rows 537 cols
[2022-05-15 18:09:41] [INFO ] Computed 106 place invariants in 4 ms
[2022-05-15 18:09:41] [INFO ] Implicit Places using invariants in 171 ms returned []
// Phase 1: matrix 469 rows 537 cols
[2022-05-15 18:09:41] [INFO ] Computed 106 place invariants in 5 ms
[2022-05-15 18:09:41] [INFO ] Implicit Places using invariants and state equation in 566 ms returned []
Implicit Place search using SMT with State Equation took 744 ms to find 0 implicit places.
// Phase 1: matrix 469 rows 537 cols
[2022-05-15 18:09:41] [INFO ] Computed 106 place invariants in 3 ms
[2022-05-15 18:09:42] [INFO ] Dead Transitions using invariants and state equation in 245 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 537/546 places, 469/478 transitions.
Finished structural reductions, in 1 iterations. Remains : 537/546 places, 469/478 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p2) (NOT p1)), true, (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND p1 p2), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1 p2), acceptance={0} source=3 dest: 0}, { cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s434 1), p2:(EQ s215 1), p0:(EQ s49 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-01 finished in 1263 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 546 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 546/546 places, 478/478 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 537 transition count 469
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 537 transition count 469
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 534 transition count 466
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 534 transition count 466
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 533 transition count 465
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 533 transition count 465
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 532 transition count 464
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 532 transition count 464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 531 transition count 463
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 531 transition count 463
Applied a total of 30 rules in 77 ms. Remains 531 /546 variables (removed 15) and now considering 463/478 (removed 15) transitions.
// Phase 1: matrix 463 rows 531 cols
[2022-05-15 18:09:42] [INFO ] Computed 106 place invariants in 17 ms
[2022-05-15 18:09:42] [INFO ] Implicit Places using invariants in 177 ms returned []
// Phase 1: matrix 463 rows 531 cols
[2022-05-15 18:09:42] [INFO ] Computed 106 place invariants in 9 ms
[2022-05-15 18:09:43] [INFO ] Implicit Places using invariants and state equation in 562 ms returned []
Implicit Place search using SMT with State Equation took 741 ms to find 0 implicit places.
// Phase 1: matrix 463 rows 531 cols
[2022-05-15 18:09:43] [INFO ] Computed 106 place invariants in 7 ms
[2022-05-15 18:09:43] [INFO ] Dead Transitions using invariants and state equation in 222 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 531/546 places, 463/478 transitions.
Finished structural reductions, in 1 iterations. Remains : 531/546 places, 463/478 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s73 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 700 steps with 3 reset in 15 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-04 finished in 1161 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((F(p0) U p1)) U G((X(p2)||p3)))))'
Support contains 6 out of 546 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 546/546 places, 478/478 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 539 transition count 471
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 539 transition count 471
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 537 transition count 469
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 537 transition count 469
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 536 transition count 468
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 536 transition count 468
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 535 transition count 467
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 535 transition count 467
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 534 transition count 466
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 534 transition count 466
Applied a total of 24 rules in 99 ms. Remains 534 /546 variables (removed 12) and now considering 466/478 (removed 12) transitions.
// Phase 1: matrix 466 rows 534 cols
[2022-05-15 18:09:43] [INFO ] Computed 106 place invariants in 3 ms
[2022-05-15 18:09:43] [INFO ] Implicit Places using invariants in 177 ms returned []
// Phase 1: matrix 466 rows 534 cols
[2022-05-15 18:09:43] [INFO ] Computed 106 place invariants in 4 ms
[2022-05-15 18:09:44] [INFO ] Implicit Places using invariants and state equation in 548 ms returned []
Implicit Place search using SMT with State Equation took 743 ms to find 0 implicit places.
// Phase 1: matrix 466 rows 534 cols
[2022-05-15 18:09:44] [INFO ] Computed 106 place invariants in 10 ms
[2022-05-15 18:09:44] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 534/546 places, 466/478 transitions.
Finished structural reductions, in 1 iterations. Remains : 534/546 places, 466/478 transitions.
Stuttering acceptance computed with spot in 517 ms :[(AND (NOT p2) (NOT p3)), (AND p1 (NOT p0) (NOT p2)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p3) p1 (NOT p0) (NOT p2)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(NOT p2), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p3) p1 (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p3:(AND (EQ s68 1) (EQ s331 1) (EQ s505 1)), p1:(EQ s29 1), p0:(EQ s467 1), p2:(EQ s436 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 205 steps with 14 reset in 2 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-05 finished in 1629 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 546 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 546/546 places, 478/478 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 538 transition count 470
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 538 transition count 470
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 535 transition count 467
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 535 transition count 467
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 534 transition count 466
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 534 transition count 466
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 533 transition count 465
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 533 transition count 465
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 532 transition count 464
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 532 transition count 464
Applied a total of 28 rules in 73 ms. Remains 532 /546 variables (removed 14) and now considering 464/478 (removed 14) transitions.
// Phase 1: matrix 464 rows 532 cols
[2022-05-15 18:09:45] [INFO ] Computed 106 place invariants in 10 ms
[2022-05-15 18:09:45] [INFO ] Implicit Places using invariants in 177 ms returned []
// Phase 1: matrix 464 rows 532 cols
[2022-05-15 18:09:45] [INFO ] Computed 106 place invariants in 3 ms
[2022-05-15 18:09:45] [INFO ] Implicit Places using invariants and state equation in 570 ms returned []
Implicit Place search using SMT with State Equation took 758 ms to find 0 implicit places.
// Phase 1: matrix 464 rows 532 cols
[2022-05-15 18:09:45] [INFO ] Computed 106 place invariants in 3 ms
[2022-05-15 18:09:46] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 532/546 places, 464/478 transitions.
Finished structural reductions, in 1 iterations. Remains : 532/546 places, 464/478 transitions.
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s422 1)], 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 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-06 finished in 1173 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 546 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 546/546 places, 478/478 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 537 transition count 469
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 537 transition count 469
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 534 transition count 466
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 534 transition count 466
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 533 transition count 465
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 533 transition count 465
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 532 transition count 464
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 532 transition count 464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 531 transition count 463
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 531 transition count 463
Applied a total of 30 rules in 74 ms. Remains 531 /546 variables (removed 15) and now considering 463/478 (removed 15) transitions.
// Phase 1: matrix 463 rows 531 cols
[2022-05-15 18:09:46] [INFO ] Computed 106 place invariants in 9 ms
[2022-05-15 18:09:46] [INFO ] Implicit Places using invariants in 180 ms returned []
// Phase 1: matrix 463 rows 531 cols
[2022-05-15 18:09:46] [INFO ] Computed 106 place invariants in 3 ms
[2022-05-15 18:09:46] [INFO ] Implicit Places using invariants and state equation in 541 ms returned []
Implicit Place search using SMT with State Equation took 733 ms to find 0 implicit places.
// Phase 1: matrix 463 rows 531 cols
[2022-05-15 18:09:46] [INFO ] Computed 106 place invariants in 4 ms
[2022-05-15 18:09:47] [INFO ] Dead Transitions using invariants and state equation in 225 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 531/546 places, 463/478 transitions.
Finished structural reductions, in 1 iterations. Remains : 531/546 places, 463/478 transitions.
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s212 1)], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-08 finished in 1123 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(F(G((p0 U (p0 U p1))))))))'
Support contains 2 out of 546 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 546/546 places, 478/478 transitions.
Graph (trivial) has 264 edges and 546 vertex of which 6 / 546 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1215 edges and 541 vertex of which 540 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 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 539 transition count 402
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 138 place count 471 transition count 402
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 138 place count 471 transition count 288
Deduced a syphon composed of 114 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 2 with 253 rules applied. Total rules applied 391 place count 332 transition count 288
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 399 place count 324 transition count 280
Iterating global reduction 2 with 8 rules applied. Total rules applied 407 place count 324 transition count 280
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 408 place count 323 transition count 279
Iterating global reduction 2 with 1 rules applied. Total rules applied 409 place count 323 transition count 279
Performed 139 Post agglomeration using F-continuation condition.Transition count delta: 139
Deduced a syphon composed of 139 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 2 with 281 rules applied. Total rules applied 690 place count 181 transition count 140
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 694 place count 179 transition count 142
Applied a total of 694 rules in 54 ms. Remains 179 /546 variables (removed 367) and now considering 142/478 (removed 336) transitions.
// Phase 1: matrix 142 rows 179 cols
[2022-05-15 18:09:47] [INFO ] Computed 78 place invariants in 2 ms
[2022-05-15 18:09:47] [INFO ] Implicit Places using invariants in 105 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 108 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 151/546 places, 142/478 transitions.
Applied a total of 0 rules in 5 ms. Remains 151 /151 variables (removed 0) and now considering 142/142 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 151/546 places, 142/478 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s28 1), p0:(EQ s25 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 0 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-10 finished in 242 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((F(X(p0))||p1)))))'
Support contains 2 out of 546 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 546/546 places, 478/478 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 538 transition count 470
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 538 transition count 470
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 535 transition count 467
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 535 transition count 467
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 534 transition count 466
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 534 transition count 466
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 533 transition count 465
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 533 transition count 465
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 532 transition count 464
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 532 transition count 464
Applied a total of 28 rules in 71 ms. Remains 532 /546 variables (removed 14) and now considering 464/478 (removed 14) transitions.
// Phase 1: matrix 464 rows 532 cols
[2022-05-15 18:09:47] [INFO ] Computed 106 place invariants in 10 ms
[2022-05-15 18:09:47] [INFO ] Implicit Places using invariants in 171 ms returned []
// Phase 1: matrix 464 rows 532 cols
[2022-05-15 18:09:47] [INFO ] Computed 106 place invariants in 4 ms
[2022-05-15 18:09:48] [INFO ] Implicit Places using invariants and state equation in 533 ms returned []
Implicit Place search using SMT with State Equation took 711 ms to find 0 implicit places.
// Phase 1: matrix 464 rows 532 cols
[2022-05-15 18:09:48] [INFO ] Computed 106 place invariants in 9 ms
[2022-05-15 18:09:48] [INFO ] Dead Transitions using invariants and state equation in 250 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 532/546 places, 464/478 transitions.
Finished structural reductions, in 1 iterations. Remains : 532/546 places, 464/478 transitions.
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p1:(EQ s402 1), p0:(EQ s159 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][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 307 ms.
Product exploration explored 100000 steps with 25000 reset in 303 ms.
Computed a total of 477 stabilizing places and 419 stable transitions
Graph (complete) has 1201 edges and 532 vertex of which 531 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 477 stabilizing places and 419 stable transitions
Detected a total of 477/532 stabilizing places and 419/464 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 1245 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 4 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 51 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 856636 steps, run timeout after 3001 ms. (steps per millisecond=285 ) properties seen :{}
Probabilistic random walk after 856636 steps, saw 127004 distinct states, run finished after 3001 ms. (steps per millisecond=285 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 464 rows 532 cols
[2022-05-15 18:09:53] [INFO ] Computed 106 place invariants in 13 ms
[2022-05-15 18:09:53] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 18:09:53] [INFO ] [Nat]Absence check using 65 positive place invariants in 17 ms returned sat
[2022-05-15 18:09:53] [INFO ] [Nat]Absence check using 65 positive and 41 generalized place invariants in 9 ms returned sat
[2022-05-15 18:09:54] [INFO ] After 212ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 18:09:54] [INFO ] Deduced a trap composed of 8 places in 156 ms of which 1 ms to minimize.
[2022-05-15 18:09:54] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 0 ms to minimize.
[2022-05-15 18:09:54] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 1 ms to minimize.
[2022-05-15 18:09:54] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 0 ms to minimize.
[2022-05-15 18:09:54] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 1 ms to minimize.
[2022-05-15 18:09:54] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 0 ms to minimize.
[2022-05-15 18:09:54] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2022-05-15 18:09:54] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 0 ms to minimize.
[2022-05-15 18:09:55] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 0 ms to minimize.
[2022-05-15 18:09:55] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2022-05-15 18:09:55] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 960 ms
[2022-05-15 18:09:55] [INFO ] After 1188ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2022-05-15 18:09:55] [INFO ] After 1313ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 532 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 532/532 places, 464/464 transitions.
Graph (trivial) has 249 edges and 532 vertex of which 6 / 532 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1186 edges and 527 vertex of which 526 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 62 place count 526 transition count 396
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 122 place count 466 transition count 396
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 113 Pre rules applied. Total rules applied 122 place count 466 transition count 283
Deduced a syphon composed of 113 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 2 with 251 rules applied. Total rules applied 373 place count 328 transition count 283
Performed 145 Post agglomeration using F-continuation condition.Transition count delta: 145
Deduced a syphon composed of 145 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 2 with 293 rules applied. Total rules applied 666 place count 180 transition count 138
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 668 place count 179 transition count 141
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 669 place count 179 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 670 place count 178 transition count 140
Applied a total of 670 rules in 32 ms. Remains 178 /532 variables (removed 354) and now considering 140/464 (removed 324) transitions.
Finished structural reductions, in 1 iterations. Remains : 178/532 places, 140/464 transitions.
Finished random walk after 28 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 4 factoid took 505 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 4 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 532 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 532/532 places, 464/464 transitions.
Applied a total of 0 rules in 15 ms. Remains 532 /532 variables (removed 0) and now considering 464/464 (removed 0) transitions.
// Phase 1: matrix 464 rows 532 cols
[2022-05-15 18:09:55] [INFO ] Computed 106 place invariants in 6 ms
[2022-05-15 18:09:56] [INFO ] Implicit Places using invariants in 165 ms returned []
// Phase 1: matrix 464 rows 532 cols
[2022-05-15 18:09:56] [INFO ] Computed 106 place invariants in 3 ms
[2022-05-15 18:09:56] [INFO ] Implicit Places using invariants and state equation in 529 ms returned []
Implicit Place search using SMT with State Equation took 699 ms to find 0 implicit places.
// Phase 1: matrix 464 rows 532 cols
[2022-05-15 18:09:56] [INFO ] Computed 106 place invariants in 3 ms
[2022-05-15 18:09:56] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 532/532 places, 464/464 transitions.
Computed a total of 477 stabilizing places and 419 stable transitions
Graph (complete) has 1201 edges and 532 vertex of which 531 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Computed a total of 477 stabilizing places and 419 stable transitions
Detected a total of 477/532 stabilizing places and 419/464 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 137 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 4 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 53 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 828495 steps, run timeout after 3001 ms. (steps per millisecond=276 ) properties seen :{}
Probabilistic random walk after 828495 steps, saw 123374 distinct states, run finished after 3001 ms. (steps per millisecond=276 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 464 rows 532 cols
[2022-05-15 18:10:00] [INFO ] Computed 106 place invariants in 5 ms
[2022-05-15 18:10:00] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 18:10:00] [INFO ] [Nat]Absence check using 65 positive place invariants in 21 ms returned sat
[2022-05-15 18:10:00] [INFO ] [Nat]Absence check using 65 positive and 41 generalized place invariants in 10 ms returned sat
[2022-05-15 18:10:00] [INFO ] After 178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 18:10:00] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 0 ms to minimize.
[2022-05-15 18:10:00] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 0 ms to minimize.
[2022-05-15 18:10:00] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2022-05-15 18:10:01] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 0 ms to minimize.
[2022-05-15 18:10:01] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 1 ms to minimize.
[2022-05-15 18:10:01] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2022-05-15 18:10:01] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2022-05-15 18:10:01] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 0 ms to minimize.
[2022-05-15 18:10:01] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 0 ms to minimize.
[2022-05-15 18:10:01] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 0 ms to minimize.
[2022-05-15 18:10:01] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 907 ms
[2022-05-15 18:10:01] [INFO ] After 1105ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2022-05-15 18:10:01] [INFO ] After 1244ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 532 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 532/532 places, 464/464 transitions.
Graph (trivial) has 249 edges and 532 vertex of which 6 / 532 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1186 edges and 527 vertex of which 526 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 62 place count 526 transition count 396
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 122 place count 466 transition count 396
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 113 Pre rules applied. Total rules applied 122 place count 466 transition count 283
Deduced a syphon composed of 113 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 2 with 251 rules applied. Total rules applied 373 place count 328 transition count 283
Performed 145 Post agglomeration using F-continuation condition.Transition count delta: 145
Deduced a syphon composed of 145 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 2 with 293 rules applied. Total rules applied 666 place count 180 transition count 138
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 668 place count 179 transition count 141
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 669 place count 179 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 670 place count 178 transition count 140
Applied a total of 670 rules in 50 ms. Remains 178 /532 variables (removed 354) and now considering 140/464 (removed 324) transitions.
Finished structural reductions, in 1 iterations. Remains : 178/532 places, 140/464 transitions.
Finished random walk after 64 steps, including 3 resets, run visited all 1 properties in 2 ms. (steps per millisecond=32 )
Knowledge obtained : [(AND (NOT p1) p0), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 4 factoid took 154 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 4 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 234 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 25000 reset in 267 ms.
Product exploration explored 100000 steps with 25000 reset in 258 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 532 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 532/532 places, 464/464 transitions.
Graph (trivial) has 249 edges and 532 vertex of which 6 / 532 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 1194 edges and 527 vertex of which 526 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
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 59 rules applied. Total rules applied 61 place count 526 transition count 457
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 79 Pre rules applied. Total rules applied 61 place count 526 transition count 521
Deduced a syphon composed of 138 places in 1 ms
Iterating global reduction 1 with 79 rules applied. Total rules applied 140 place count 526 transition count 521
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 162 place count 504 transition count 480
Deduced a syphon composed of 116 places in 1 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 184 place count 504 transition count 480
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 295 places in 0 ms
Iterating global reduction 1 with 179 rules applied. Total rules applied 363 place count 504 transition count 480
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 405 place count 462 transition count 438
Deduced a syphon composed of 253 places in 2 ms
Iterating global reduction 1 with 42 rules applied. Total rules applied 447 place count 462 transition count 438
Deduced a syphon composed of 253 places in 1 ms
Applied a total of 447 rules in 92 ms. Remains 462 /532 variables (removed 70) and now considering 438/464 (removed 26) transitions.
[2022-05-15 18:10:03] [INFO ] Redundant transitions in 27 ms returned []
// Phase 1: matrix 438 rows 462 cols
[2022-05-15 18:10:03] [INFO ] Computed 106 place invariants in 5 ms
[2022-05-15 18:10:03] [INFO ] Dead Transitions using invariants and state equation in 205 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 462/532 places, 438/464 transitions.
Finished structural reductions, in 1 iterations. Remains : 462/532 places, 438/464 transitions.
Product exploration explored 100000 steps with 25000 reset in 920 ms.
Product exploration explored 100000 steps with 25000 reset in 901 ms.
Built C files in :
/tmp/ltsmin16395901708510894973
[2022-05-15 18:10:05] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16395901708510894973
Running compilation step : cd /tmp/ltsmin16395901708510894973;'/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 799 ms.
Running link step : cd /tmp/ltsmin16395901708510894973;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin16395901708510894973;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4054431984346825869.hoa' '--buchi-type=spotba'
LTSmin run took 180 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-18-LTLFireability-14 finished in 18902 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(G(G(F(p0))))||p0))||X(p0)))'
Support contains 1 out of 546 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 546/546 places, 478/478 transitions.
Graph (trivial) has 263 edges and 546 vertex of which 6 / 546 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 1215 edges and 541 vertex of which 540 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 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 69 place count 539 transition count 403
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 136 place count 472 transition count 403
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 136 place count 472 transition count 289
Deduced a syphon composed of 114 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 2 with 253 rules applied. Total rules applied 389 place count 333 transition count 289
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 397 place count 325 transition count 281
Iterating global reduction 2 with 8 rules applied. Total rules applied 405 place count 325 transition count 281
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 406 place count 324 transition count 280
Iterating global reduction 2 with 1 rules applied. Total rules applied 407 place count 324 transition count 280
Performed 141 Post agglomeration using F-continuation condition.Transition count delta: 141
Deduced a syphon composed of 141 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 2 with 285 rules applied. Total rules applied 692 place count 180 transition count 139
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 696 place count 178 transition count 141
Applied a total of 696 rules in 45 ms. Remains 178 /546 variables (removed 368) and now considering 141/478 (removed 337) transitions.
// Phase 1: matrix 141 rows 178 cols
[2022-05-15 18:10:06] [INFO ] Computed 78 place invariants in 1 ms
[2022-05-15 18:10:06] [INFO ] Implicit Places using invariants in 226 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 227 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 150/546 places, 141/478 transitions.
Applied a total of 0 rules in 9 ms. Remains 150 /150 variables (removed 0) and now considering 141/141 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 150/546 places, 141/478 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s35 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-15 finished in 325 ms.
All properties solved by simple procedures.
Total runtime 36699 ms.

BK_STOP 1652638206968

--------------------
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//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ 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-18"
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-18, 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-165251918500460"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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