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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 272K
-rw-r--r-- 1 mcc users 6.8K Apr 29 23:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 29 23:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Apr 29 23:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 31K Apr 29 23:54 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.4K May 9 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:09 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 63K 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-03-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-03-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-03-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-03-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-03-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-03-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-03-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-03-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-03-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-03-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-03-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-03-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-03-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-03-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-03-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-03-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652623314779

Running Version 202205111006
[2022-05-15 14:01:55] [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 14:01:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 14:01:56] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2022-05-15 14:01:56] [INFO ] Transformed 274 places.
[2022-05-15 14:01:56] [INFO ] Transformed 237 transitions.
[2022-05-15 14:01:56] [INFO ] Found NUPN structural information;
[2022-05-15 14:01:56] [INFO ] Parsed PT model containing 274 places and 237 transitions in 190 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 1 places in 5 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-03-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 236/236 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 271 transition count 236
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 37 place count 236 transition count 201
Iterating global reduction 1 with 35 rules applied. Total rules applied 72 place count 236 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 73 place count 236 transition count 200
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 90 place count 219 transition count 183
Iterating global reduction 2 with 17 rules applied. Total rules applied 107 place count 219 transition count 183
Applied a total of 107 rules in 55 ms. Remains 219 /273 variables (removed 54) and now considering 183/236 (removed 53) transitions.
// Phase 1: matrix 183 rows 219 cols
[2022-05-15 14:01:56] [INFO ] Computed 41 place invariants in 11 ms
[2022-05-15 14:01:56] [INFO ] Implicit Places using invariants in 193 ms returned []
// Phase 1: matrix 183 rows 219 cols
[2022-05-15 14:01:56] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-15 14:01:56] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
// Phase 1: matrix 183 rows 219 cols
[2022-05-15 14:01:56] [INFO ] Computed 41 place invariants in 4 ms
[2022-05-15 14:01:56] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 219/273 places, 183/236 transitions.
Finished structural reductions, in 1 iterations. Remains : 219/273 places, 183/236 transitions.
Support contains 44 out of 219 places after structural reductions.
[2022-05-15 14:01:56] [INFO ] Flatten gal took : 39 ms
[2022-05-15 14:01:56] [INFO ] Flatten gal took : 19 ms
[2022-05-15 14:01:57] [INFO ] Input system was already deterministic with 183 transitions.
Support contains 43 out of 219 places (down from 44) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 115 resets, run finished after 455 ms. (steps per millisecond=21 ) properties (out of 38) seen :29
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) seen :1
Running SMT prover for 8 properties.
// Phase 1: matrix 183 rows 219 cols
[2022-05-15 14:01:57] [INFO ] Computed 41 place invariants in 5 ms
[2022-05-15 14:01:58] [INFO ] [Real]Absence check using 41 positive place invariants in 13 ms returned sat
[2022-05-15 14:01:58] [INFO ] After 70ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:6
[2022-05-15 14:01:58] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 4 ms to minimize.
[2022-05-15 14:01:58] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2022-05-15 14:01:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 114 ms
[2022-05-15 14:01:58] [INFO ] After 208ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-15 14:01:58] [INFO ] After 349ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-15 14:01:58] [INFO ] [Nat]Absence check using 41 positive place invariants in 11 ms returned sat
[2022-05-15 14:01:58] [INFO ] After 121ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :7
[2022-05-15 14:01:58] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 2 ms to minimize.
[2022-05-15 14:01:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2022-05-15 14:01:58] [INFO ] After 264ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :7
Attempting to minimize the solution found.
Minimization took 57 ms.
[2022-05-15 14:01:58] [INFO ] After 480ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :7
Fused 8 Parikh solutions to 4 different solutions.
Finished Parikh walk after 125 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=125 )
Parikh walk visited 7 properties in 11 ms.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
FORMULA BusinessProcesses-PT-03-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 213 stabilizing places and 175 stable transitions
Graph (complete) has 456 edges and 219 vertex of which 218 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(X(p0)))))'
Support contains 1 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 183/183 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 207 transition count 171
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 207 transition count 171
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 204 transition count 168
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 204 transition count 168
Applied a total of 30 rules in 23 ms. Remains 204 /219 variables (removed 15) and now considering 168/183 (removed 15) transitions.
// Phase 1: matrix 168 rows 204 cols
[2022-05-15 14:01:59] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-15 14:01:59] [INFO ] Implicit Places using invariants in 72 ms returned []
// Phase 1: matrix 168 rows 204 cols
[2022-05-15 14:01:59] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-15 14:01:59] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
// Phase 1: matrix 168 rows 204 cols
[2022-05-15 14:01:59] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-15 14:01:59] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 204/219 places, 168/183 transitions.
Finished structural reductions, in 1 iterations. Remains : 204/219 places, 168/183 transitions.
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-03-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s52 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 75 steps with 0 reset in 4 ms.
FORMULA BusinessProcesses-PT-03-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLFireability-00 finished in 580 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(G(p0) U (G(p1) U X(p0))))'
Support contains 5 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 183/183 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 207 transition count 171
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 207 transition count 171
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 203 transition count 167
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 203 transition count 167
Applied a total of 32 rules in 17 ms. Remains 203 /219 variables (removed 16) and now considering 167/183 (removed 16) transitions.
// Phase 1: matrix 167 rows 203 cols
[2022-05-15 14:01:59] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-15 14:01:59] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 167 rows 203 cols
[2022-05-15 14:01:59] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-15 14:01:59] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
// Phase 1: matrix 167 rows 203 cols
[2022-05-15 14:01:59] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-15 14:02:00] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 203/219 places, 167/183 transitions.
Finished structural reductions, in 1 iterations. Remains : 203/219 places, 167/183 transitions.
Stuttering acceptance computed with spot in 189 ms :[true, p0, p1, p0, p0, (AND p1 p0)]
Running random walk in product with property : BusinessProcesses-PT-03-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}], [{ cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(AND p1 p0), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 5}]], initial=3, aps=[p0:(AND (EQ s85 1) (EQ s109 1) (EQ s202 1)), p1:(AND (NEQ s22 1) (EQ s47 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 259 ms.
Product exploration explored 100000 steps with 50000 reset in 153 ms.
Computed a total of 197 stabilizing places and 159 stable transitions
Graph (complete) has 432 edges and 203 vertex of which 202 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 197 stabilizing places and 159 stable transitions
Detected a total of 197/203 stabilizing places and 159/167 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 7 factoid took 142 ms. Reduced automaton from 6 states, 9 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA BusinessProcesses-PT-03-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-03-LTLFireability-01 finished in 1067 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((!(F(X(p0)) U !p0)||p1)))'
Support contains 2 out of 219 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 183/183 transitions.
Graph (trivial) has 118 edges and 219 vertex of which 6 / 219 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 450 edges and 214 vertex of which 213 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 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 33 place count 212 transition count 144
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 65 place count 181 transition count 143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 180 transition count 143
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 66 place count 180 transition count 102
Deduced a syphon composed of 41 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 158 place count 129 transition count 102
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 169 place count 118 transition count 91
Ensure Unique test removed 1 places
Iterating global reduction 3 with 12 rules applied. Total rules applied 181 place count 117 transition count 91
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 106 rules applied. Total rules applied 287 place count 64 transition count 38
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 288 place count 63 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 289 place count 62 transition count 37
Applied a total of 289 rules in 35 ms. Remains 62 /219 variables (removed 157) and now considering 37/183 (removed 146) transitions.
// Phase 1: matrix 37 rows 62 cols
[2022-05-15 14:02:00] [INFO ] Computed 29 place invariants in 1 ms
[2022-05-15 14:02:00] [INFO ] Implicit Places using invariants in 37 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 39 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/219 places, 37/183 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 37/37 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 61/219 places, 37/183 transitions.
Stuttering acceptance computed with spot in 103 ms :[true, (OR (NOT p1) p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-03-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p1) p0), acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s50 1), p0:(NEQ s14 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-03-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLFireability-02 finished in 193 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(p0) U p1) U p2)))'
Support contains 3 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 183/183 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 208 transition count 172
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 208 transition count 172
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 205 transition count 169
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 205 transition count 169
Applied a total of 28 rules in 15 ms. Remains 205 /219 variables (removed 14) and now considering 169/183 (removed 14) transitions.
// Phase 1: matrix 169 rows 205 cols
[2022-05-15 14:02:01] [INFO ] Computed 41 place invariants in 0 ms
[2022-05-15 14:02:01] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 169 rows 205 cols
[2022-05-15 14:02:01] [INFO ] Computed 41 place invariants in 9 ms
[2022-05-15 14:02:01] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
// Phase 1: matrix 169 rows 205 cols
[2022-05-15 14:02:01] [INFO ] Computed 41 place invariants in 4 ms
[2022-05-15 14:02:01] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 205/219 places, 169/183 transitions.
Finished structural reductions, in 1 iterations. Remains : 205/219 places, 169/183 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p2), (NOT p2), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : BusinessProcesses-PT-03-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(NEQ s141 1), p1:(EQ s50 1), p0:(NEQ s204 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 139 ms.
Product exploration explored 100000 steps with 50000 reset in 173 ms.
Computed a total of 199 stabilizing places and 161 stable transitions
Graph (complete) has 434 edges and 205 vertex of which 204 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 199 stabilizing places and 161 stable transitions
Detected a total of 199/205 stabilizing places and 161/169 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Property proved to be true thanks to knowledge :(X p2)
Knowledge based reduction with 7 factoid took 169 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA BusinessProcesses-PT-03-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-03-LTLFireability-03 finished in 940 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(X(X(p0))))))'
Support contains 1 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 183/183 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 206 transition count 170
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 206 transition count 170
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 202 transition count 166
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 202 transition count 166
Applied a total of 34 rules in 11 ms. Remains 202 /219 variables (removed 17) and now considering 166/183 (removed 17) transitions.
// Phase 1: matrix 166 rows 202 cols
[2022-05-15 14:02:01] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-15 14:02:02] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 166 rows 202 cols
[2022-05-15 14:02:02] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-15 14:02:02] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
// Phase 1: matrix 166 rows 202 cols
[2022-05-15 14:02:02] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-15 14:02:02] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 202/219 places, 166/183 transitions.
Finished structural reductions, in 1 iterations. Remains : 202/219 places, 166/183 transitions.
Stuttering acceptance computed with spot in 177 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-03-LTLFireability-04 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}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(EQ s158 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, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-03-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLFireability-04 finished in 490 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((F(p0)||G(p1)||p2))))'
Support contains 3 out of 219 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 183/183 transitions.
Graph (trivial) has 114 edges and 219 vertex of which 4 / 219 are part of one of the 1 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 453 edges and 216 vertex of which 215 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 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 33 place count 214 transition count 147
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 65 place count 183 transition count 146
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 182 transition count 146
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 66 place count 182 transition count 106
Deduced a syphon composed of 40 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 89 rules applied. Total rules applied 155 place count 133 transition count 106
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 167 place count 121 transition count 94
Ensure Unique test removed 1 places
Iterating global reduction 3 with 13 rules applied. Total rules applied 180 place count 120 transition count 94
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 180 place count 120 transition count 93
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 182 place count 119 transition count 93
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 107 rules applied. Total rules applied 289 place count 65 transition count 40
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 290 place count 64 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 291 place count 63 transition count 39
Applied a total of 291 rules in 27 ms. Remains 63 /219 variables (removed 156) and now considering 39/183 (removed 144) transitions.
// Phase 1: matrix 39 rows 63 cols
[2022-05-15 14:02:02] [INFO ] Computed 29 place invariants in 0 ms
[2022-05-15 14:02:02] [INFO ] Implicit Places using invariants in 38 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 39 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/219 places, 39/183 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 62/219 places, 39/183 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-03-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s10 1), p1:(EQ s53 0), p2:(EQ s47 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 15188 reset in 165 ms.
Product exploration explored 100000 steps with 15405 reset in 169 ms.
Computed a total of 60 stabilizing places and 35 stable transitions
Computed a total of 60 stabilizing places and 35 stable transitions
Detected a total of 60/62 stabilizing places and 35/39 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
Knowledge based reduction with 5 factoid took 267 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 8110 steps, including 1512 resets, run visited all 2 properties in 30 ms. (steps per millisecond=270 )
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) p1 (NOT p2))))]
Knowledge based reduction with 5 factoid took 290 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 39/39 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 39/39 (removed 0) transitions.
// Phase 1: matrix 39 rows 62 cols
[2022-05-15 14:02:03] [INFO ] Computed 28 place invariants in 0 ms
[2022-05-15 14:02:03] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 39 rows 62 cols
[2022-05-15 14:02:03] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-15 14:02:04] [INFO ] Implicit Places using invariants and state equation in 60 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 12, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45]
Discarding 28 places :
Implicit Place search using SMT with State Equation took 103 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/62 places, 39/39 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 34 transition count 32
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 27 transition count 32
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 17 place count 24 transition count 29
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 24 transition count 29
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 22 place count 24 transition count 27
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 24 place count 22 transition count 27
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 25 place count 21 transition count 26
Iterating global reduction 4 with 1 rules applied. Total rules applied 26 place count 21 transition count 26
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 32 place count 18 transition count 23
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 33 place count 18 transition count 22
Applied a total of 33 rules in 11 ms. Remains 18 /34 variables (removed 16) and now considering 22/39 (removed 17) transitions.
// Phase 1: matrix 22 rows 18 cols
[2022-05-15 14:02:04] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 14:02:04] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 22 rows 18 cols
[2022-05-15 14:02:04] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 14:02:04] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/62 places, 22/39 transitions.
Finished structural reductions, in 2 iterations. Remains : 18/62 places, 22/39 transitions.
Computed a total of 16 stabilizing places and 18 stable transitions
Graph (complete) has 47 edges and 18 vertex of which 16 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 16 stabilizing places and 18 stable transitions
Detected a total of 16/18 stabilizing places and 18/22 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
Knowledge based reduction with 5 factoid took 265 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 1932 steps, including 373 resets, run visited all 2 properties in 3 ms. (steps per millisecond=644 )
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) p1 (NOT p2))))]
Knowledge based reduction with 5 factoid took 292 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 16426 reset in 68 ms.
Product exploration explored 100000 steps with 16597 reset in 180 ms.
Built C files in :
/tmp/ltsmin14175976258401850122
[2022-05-15 14:02:05] [INFO ] Computing symmetric may disable matrix : 22 transitions.
[2022-05-15 14:02:05] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 14:02:05] [INFO ] Computing symmetric may enable matrix : 22 transitions.
[2022-05-15 14:02:05] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 14:02:05] [INFO ] Computing Do-Not-Accords matrix : 22 transitions.
[2022-05-15 14:02:05] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 14:02:05] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14175976258401850122
Running compilation step : cd /tmp/ltsmin14175976258401850122;'/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 162 ms.
Running link step : cd /tmp/ltsmin14175976258401850122;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin14175976258401850122;'/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/stateBased13412507409877283814.hoa' '--buchi-type=spotba'
LTSmin run took 52 ms.
FORMULA BusinessProcesses-PT-03-LTLFireability-05 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-03-LTLFireability-05 finished in 3047 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(p0))||F(p0)||p1)))'
Support contains 2 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 183/183 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 206 transition count 170
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 206 transition count 170
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 202 transition count 166
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 202 transition count 166
Applied a total of 34 rules in 9 ms. Remains 202 /219 variables (removed 17) and now considering 166/183 (removed 17) transitions.
// Phase 1: matrix 166 rows 202 cols
[2022-05-15 14:02:05] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-15 14:02:05] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 166 rows 202 cols
[2022-05-15 14:02:05] [INFO ] Computed 41 place invariants in 0 ms
[2022-05-15 14:02:05] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
// Phase 1: matrix 166 rows 202 cols
[2022-05-15 14:02:05] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-15 14:02:05] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 202/219 places, 166/183 transitions.
Finished structural reductions, in 1 iterations. Remains : 202/219 places, 166/183 transitions.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-03-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p0:(EQ s91 1), p1:(EQ s82 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 24085 reset in 90 ms.
Stack based approach found an accepted trace after 149 steps with 39 reset with depth 6 and stack size 6 in 0 ms.
FORMULA BusinessProcesses-PT-03-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-03-LTLFireability-08 finished in 499 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(X(p0))) U (X(p1)||F(p2)))))'
Support contains 3 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 183/183 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 207 transition count 171
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 207 transition count 171
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 203 transition count 167
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 203 transition count 167
Applied a total of 32 rules in 17 ms. Remains 203 /219 variables (removed 16) and now considering 167/183 (removed 16) transitions.
// Phase 1: matrix 167 rows 203 cols
[2022-05-15 14:02:06] [INFO ] Computed 41 place invariants in 0 ms
[2022-05-15 14:02:06] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 167 rows 203 cols
[2022-05-15 14:02:06] [INFO ] Computed 41 place invariants in 3 ms
[2022-05-15 14:02:06] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
// Phase 1: matrix 167 rows 203 cols
[2022-05-15 14:02:06] [INFO ] Computed 41 place invariants in 0 ms
[2022-05-15 14:02:06] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 203/219 places, 167/183 transitions.
Finished structural reductions, in 1 iterations. Remains : 203/219 places, 167/183 transitions.
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-03-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s21 1), p1:(EQ s175 1), p0:(EQ s77 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 79 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-03-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLFireability-09 finished in 489 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G((G(p0)||G((X(p1)||F(p2))))))))'
Support contains 2 out of 219 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 183/183 transitions.
Graph (trivial) has 117 edges and 219 vertex of which 6 / 219 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 450 edges and 214 vertex of which 213 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
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 33 place count 213 transition count 145
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 64 place count 182 transition count 145
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 64 place count 182 transition count 104
Deduced a syphon composed of 41 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 156 place count 131 transition count 104
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 167 place count 120 transition count 93
Ensure Unique test removed 1 places
Iterating global reduction 2 with 12 rules applied. Total rules applied 179 place count 119 transition count 93
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 179 place count 119 transition count 92
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 181 place count 118 transition count 92
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 111 rules applied. Total rules applied 292 place count 62 transition count 37
Applied a total of 292 rules in 22 ms. Remains 62 /219 variables (removed 157) and now considering 37/183 (removed 146) transitions.
// Phase 1: matrix 37 rows 62 cols
[2022-05-15 14:02:06] [INFO ] Computed 29 place invariants in 0 ms
[2022-05-15 14:02:06] [INFO ] Implicit Places using invariants in 39 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/219 places, 37/183 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 37/37 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 61/219 places, 37/183 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-03-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s57 1), p2:(EQ s0 1), p0:(EQ s57 0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 16767 reset in 169 ms.
Product exploration explored 100000 steps with 16762 reset in 185 ms.
Computed a total of 61 stabilizing places and 36 stable transitions
Computed a total of 61 stabilizing places and 36 stable transitions
Detected a total of 61/61 stabilizing places and 36/37 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 442 ms. Reduced automaton from 2 states, 6 edges and 3 AP to 2 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 1969 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10000 steps, including 1088 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 1114 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 37 rows 61 cols
[2022-05-15 14:02:07] [INFO ] Computed 28 place invariants in 0 ms
[2022-05-15 14:02:07] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2022-05-15 14:02:07] [INFO ] [Nat]Absence check using 28 positive place invariants in 5 ms returned sat
[2022-05-15 14:02:07] [INFO ] After 38ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (G (NOT (AND p1 p0 (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p1) p0 (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (AND p1 (NOT p0) (NOT p2)))]
Property proved to be true thanks to knowledge :(F (OR (G p1) (G (NOT p1))))
Knowledge based reduction with 14 factoid took 468 ms. Reduced automaton from 2 states, 6 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA BusinessProcesses-PT-03-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-03-LTLFireability-10 finished in 1739 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((!G(p0) U (G(F(p0))||(p1 U p0)))&&F(p2))))'
Support contains 2 out of 219 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 183/183 transitions.
Graph (trivial) has 114 edges and 219 vertex of which 6 / 219 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 450 edges and 214 vertex of which 213 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 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 32 place count 212 transition count 145
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 62 place count 182 transition count 145
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 62 place count 182 transition count 105
Deduced a syphon composed of 40 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 152 place count 132 transition count 105
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 162 place count 122 transition count 95
Ensure Unique test removed 1 places
Iterating global reduction 2 with 11 rules applied. Total rules applied 173 place count 121 transition count 95
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 281 place count 67 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 282 place count 66 transition count 40
Applied a total of 282 rules in 23 ms. Remains 66 /219 variables (removed 153) and now considering 40/183 (removed 143) transitions.
// Phase 1: matrix 40 rows 66 cols
[2022-05-15 14:02:08] [INFO ] Computed 30 place invariants in 0 ms
[2022-05-15 14:02:08] [INFO ] Implicit Places using invariants in 37 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 65/219 places, 40/183 transitions.
Applied a total of 0 rules in 2 ms. Remains 65 /65 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 65/219 places, 40/183 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p2), (OR (NOT p2) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-03-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(EQ s53 1), p2:(EQ s6 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, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-03-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLFireability-11 finished in 150 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X((X(p0)&&p1))||(G(p3)&&p2))))'
Support contains 9 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 183/183 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 207 transition count 171
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 207 transition count 171
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 203 transition count 167
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 203 transition count 167
Applied a total of 32 rules in 12 ms. Remains 203 /219 variables (removed 16) and now considering 167/183 (removed 16) transitions.
// Phase 1: matrix 167 rows 203 cols
[2022-05-15 14:02:08] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-15 14:02:08] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 167 rows 203 cols
[2022-05-15 14:02:08] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-15 14:02:08] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
// Phase 1: matrix 167 rows 203 cols
[2022-05-15 14:02:08] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-15 14:02:08] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 203/219 places, 167/183 transitions.
Finished structural reductions, in 1 iterations. Remains : 203/219 places, 167/183 transitions.
Stuttering acceptance computed with spot in 304 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : BusinessProcesses-PT-03-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p2) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND p2 p3), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p3) (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p3 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p3) p1)), acceptance={0} source=1 dest: 3}, { cond=(AND p2 p3 p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p3 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) p1), acceptance={0} source=2 dest: 3}, { cond=(AND p3 p1), acceptance={} source=2 dest: 4}], [{ cond=(OR (AND (NOT p2) (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p1) (NOT p0))), acceptance={0} source=3 dest: 1}, { cond=(AND p2 p3 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(OR (AND (NOT p2) p1 (NOT p0)) (AND (NOT p3) p1 (NOT p0))), acceptance={0} source=3 dest: 3}, { cond=(AND p2 p3 p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 1}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p3) p1 (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND p3 p1 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s106 1) (EQ s15 1) (EQ s120 1) (EQ s202 1)), p3:(EQ s34 1), p1:(EQ s147 1), p0:(AND (EQ s24 1) (EQ s109 1) (EQ s179 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 67 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-03-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLFireability-12 finished in 638 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p0 U p1)) U G(X((F(p2) U G(p3)))))))'
Support contains 4 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 183/183 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 209 transition count 173
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 209 transition count 173
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 205 transition count 169
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 205 transition count 169
Applied a total of 28 rules in 11 ms. Remains 205 /219 variables (removed 14) and now considering 169/183 (removed 14) transitions.
// Phase 1: matrix 169 rows 205 cols
[2022-05-15 14:02:09] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-15 14:02:09] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 169 rows 205 cols
[2022-05-15 14:02:09] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-15 14:02:09] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
// Phase 1: matrix 169 rows 205 cols
[2022-05-15 14:02:09] [INFO ] Computed 41 place invariants in 0 ms
[2022-05-15 14:02:09] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 205/219 places, 169/183 transitions.
Finished structural reductions, in 1 iterations. Remains : 205/219 places, 169/183 transitions.
Stuttering acceptance computed with spot in 235 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-03-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (AND p3 p1) (AND p3 p0)), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p3) p1) (AND (NOT p3) p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=p3, acceptance={} source=4 dest: 4}, { cond=(NOT p3), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p3:(EQ s173 1), p1:(EQ s127 1), p0:(EQ s92 1), p2:(EQ s135 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1902 reset in 109 ms.
Stack based approach found an accepted trace after 136 steps with 2 reset with depth 35 and stack size 35 in 1 ms.
FORMULA BusinessProcesses-PT-03-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-03-LTLFireability-13 finished in 654 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((((X(p1) U p2)||p3)&&p0))))'
Support contains 5 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 183/183 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 206 transition count 170
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 206 transition count 170
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 202 transition count 166
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 202 transition count 166
Applied a total of 34 rules in 12 ms. Remains 202 /219 variables (removed 17) and now considering 166/183 (removed 17) transitions.
// Phase 1: matrix 166 rows 202 cols
[2022-05-15 14:02:09] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-15 14:02:09] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 166 rows 202 cols
[2022-05-15 14:02:09] [INFO ] Computed 41 place invariants in 0 ms
[2022-05-15 14:02:09] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
// Phase 1: matrix 166 rows 202 cols
[2022-05-15 14:02:09] [INFO ] Computed 41 place invariants in 0 ms
[2022-05-15 14:02:09] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 202/219 places, 166/183 transitions.
Finished structural reductions, in 1 iterations. Remains : 202/219 places, 166/183 transitions.
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (NOT p2)), (OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3))), true]
Running random walk in product with property : BusinessProcesses-PT-03-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p3) p0), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p2:(EQ s103 1), p3:(EQ s92 1), p0:(AND (EQ s78 1) (EQ s124 1) (EQ s201 1)), p1:(AND (EQ s78 1) (EQ s124 1) (EQ s201 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-03-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLFireability-14 finished in 471 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!F(p0) U (G(p1)||(F(p2)&&p2))))'
Support contains 3 out of 219 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 183/183 transitions.
Graph (trivial) has 116 edges and 219 vertex of which 6 / 219 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 450 edges and 214 vertex of which 213 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 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 33 place count 212 transition count 144
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 64 place count 181 transition count 144
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 64 place count 181 transition count 103
Deduced a syphon composed of 41 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 156 place count 130 transition count 103
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 167 place count 119 transition count 92
Ensure Unique test removed 1 places
Iterating global reduction 2 with 12 rules applied. Total rules applied 179 place count 118 transition count 92
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 179 place count 118 transition count 91
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 181 place count 117 transition count 91
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 101 rules applied. Total rules applied 282 place count 66 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 283 place count 65 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 284 place count 64 transition count 40
Applied a total of 284 rules in 20 ms. Remains 64 /219 variables (removed 155) and now considering 40/183 (removed 143) transitions.
// Phase 1: matrix 40 rows 64 cols
[2022-05-15 14:02:10] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-15 14:02:10] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 40 rows 64 cols
[2022-05-15 14:02:10] [INFO ] Computed 28 place invariants in 0 ms
[2022-05-15 14:02:10] [INFO ] Implicit Places using invariants and state equation in 51 ms returned [5, 6, 7, 8, 11, 12, 13, 14, 15, 43, 45, 47, 49]
Discarding 13 places :
Implicit Place search using SMT with State Equation took 96 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/219 places, 40/183 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 51 transition count 38
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 49 transition count 38
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 48 transition count 37
Applied a total of 6 rules in 2 ms. Remains 48 /51 variables (removed 3) and now considering 37/40 (removed 3) transitions.
// Phase 1: matrix 37 rows 48 cols
[2022-05-15 14:02:10] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-15 14:02:10] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 37 rows 48 cols
[2022-05-15 14:02:10] [INFO ] Computed 15 place invariants in 0 ms
[2022-05-15 14:02:10] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 48/219 places, 37/183 transitions.
Finished structural reductions, in 2 iterations. Remains : 48/219 places, 37/183 transitions.
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p1) (NOT p2)), true, p0, (NOT p1), (AND p0 (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-03-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p1 p0), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s31 1), p1:(EQ s1 1), p0:(EQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-03-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLFireability-15 finished in 341 ms.
All properties solved by simple procedures.
Total runtime 14633 ms.

BK_STOP 1652623330554

--------------------
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-03"
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-03, 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-165251918400340"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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