Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r039-tajo-167813692600468.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
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 r039-tajo-167813692600468
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 16:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Feb 25 16:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 16:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 16:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 63K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-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 1678501214861

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-03
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 02:20:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 02:20:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 02:20:16] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2023-03-11 02:20:16] [INFO ] Transformed 274 places.
[2023-03-11 02:20:16] [INFO ] Transformed 237 transitions.
[2023-03-11 02:20:16] [INFO ] Found NUPN structural information;
[2023-03-11 02:20:16] [INFO ] Parsed PT model containing 274 places and 237 transitions and 632 arcs in 208 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-03-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 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 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 43 place count 230 transition count 195
Iterating global reduction 1 with 41 rules applied. Total rules applied 84 place count 230 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 85 place count 230 transition count 194
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 101 place count 214 transition count 178
Iterating global reduction 2 with 16 rules applied. Total rules applied 117 place count 214 transition count 178
Applied a total of 117 rules in 44 ms. Remains 214 /273 variables (removed 59) and now considering 178/236 (removed 58) transitions.
// Phase 1: matrix 178 rows 214 cols
[2023-03-11 02:20:17] [INFO ] Computed 41 place invariants in 10 ms
[2023-03-11 02:20:17] [INFO ] Implicit Places using invariants in 251 ms returned []
[2023-03-11 02:20:17] [INFO ] Invariant cache hit.
[2023-03-11 02:20:17] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 481 ms to find 0 implicit places.
[2023-03-11 02:20:17] [INFO ] Invariant cache hit.
[2023-03-11 02:20:17] [INFO ] Dead Transitions using invariants and state equation in 183 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 214/273 places, 178/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 709 ms. Remains : 214/273 places, 178/236 transitions.
Support contains 35 out of 214 places after structural reductions.
[2023-03-11 02:20:17] [INFO ] Flatten gal took : 31 ms
[2023-03-11 02:20:18] [INFO ] Flatten gal took : 15 ms
[2023-03-11 02:20:18] [INFO ] Input system was already deterministic with 178 transitions.
Support contains 34 out of 214 places (down from 35) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 116 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 29) seen :19
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-11 02:20:18] [INFO ] Invariant cache hit.
[2023-03-11 02:20:18] [INFO ] [Real]Absence check using 41 positive place invariants in 11 ms returned sat
[2023-03-11 02:20:18] [INFO ] After 177ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-11 02:20:18] [INFO ] [Nat]Absence check using 41 positive place invariants in 7 ms returned sat
[2023-03-11 02:20:19] [INFO ] After 167ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :7
[2023-03-11 02:20:19] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 4 ms to minimize.
[2023-03-11 02:20:19] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 1 ms to minimize.
[2023-03-11 02:20:19] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2023-03-11 02:20:19] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2023-03-11 02:20:19] [INFO ] Deduced a trap composed of 36 places in 107 ms of which 0 ms to minimize.
[2023-03-11 02:20:19] [INFO ] Deduced a trap composed of 32 places in 27 ms of which 0 ms to minimize.
[2023-03-11 02:20:19] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2023-03-11 02:20:19] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2023-03-11 02:20:19] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 538 ms
[2023-03-11 02:20:19] [INFO ] After 810ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :7
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-11 02:20:19] [INFO ] After 965ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :7
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 6 properties in 21 ms.
Support contains 1 out of 214 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 214/214 places, 178/178 transitions.
Graph (trivial) has 113 edges and 214 vertex of which 6 / 214 are part of one of the 1 SCC in 5 ms
Free SCC test removed 5 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 440 edges and 209 vertex of which 208 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 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 26 place count 208 transition count 145
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 50 place count 184 transition count 145
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 50 place count 184 transition count 102
Deduced a syphon composed of 43 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 146 place count 131 transition count 102
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 153 place count 124 transition count 95
Iterating global reduction 2 with 7 rules applied. Total rules applied 160 place count 124 transition count 95
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 124 rules applied. Total rules applied 284 place count 61 transition count 34
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 285 place count 60 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 286 place count 59 transition count 33
Applied a total of 286 rules in 34 ms. Remains 59 /214 variables (removed 155) and now considering 33/178 (removed 145) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 59/214 places, 33/178 transitions.
Finished random walk after 106 steps, including 4 resets, run visited all 1 properties in 2 ms. (steps per millisecond=53 )
FORMULA BusinessProcesses-PT-03-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA BusinessProcesses-PT-03-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
FORMULA BusinessProcesses-PT-03-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 208 stabilizing places and 170 stable 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.4 ms
FORMULA BusinessProcesses-PT-03-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 214 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 214/214 places, 178/178 transitions.
Graph (trivial) has 113 edges and 214 vertex of which 6 / 214 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 443 edges and 209 vertex of which 208 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 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 25 place count 207 transition count 147
Reduce places removed 23 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 24 rules applied. Total rules applied 49 place count 184 transition count 146
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 183 transition count 146
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 50 place count 183 transition count 102
Deduced a syphon composed of 44 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 148 place count 129 transition count 102
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 156 place count 121 transition count 94
Iterating global reduction 3 with 8 rules applied. Total rules applied 164 place count 121 transition count 94
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 282 place count 61 transition count 36
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 283 place count 60 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 284 place count 59 transition count 35
Applied a total of 284 rules in 25 ms. Remains 59 /214 variables (removed 155) and now considering 35/178 (removed 143) transitions.
// Phase 1: matrix 35 rows 59 cols
[2023-03-11 02:20:20] [INFO ] Computed 28 place invariants in 0 ms
[2023-03-11 02:20:20] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-11 02:20:20] [INFO ] Invariant cache hit.
[2023-03-11 02:20:20] [INFO ] Implicit Places using invariants and state equation in 55 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44]
Discarding 28 places :
Implicit Place search using SMT with State Equation took 95 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 31/214 places, 35/178 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 31 transition count 29
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 25 transition count 29
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 15 place count 22 transition count 26
Iterating global reduction 2 with 3 rules applied. Total rules applied 18 place count 22 transition count 26
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 20 place count 22 transition count 24
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 22 place count 20 transition count 24
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 28 place count 17 transition count 21
Applied a total of 28 rules in 3 ms. Remains 17 /31 variables (removed 14) and now considering 21/35 (removed 14) transitions.
// Phase 1: matrix 21 rows 17 cols
[2023-03-11 02:20:20] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 02:20:20] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-11 02:20:20] [INFO ] Invariant cache hit.
[2023-03-11 02:20:20] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/214 places, 21/178 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 291 ms. Remains : 17/214 places, 21/178 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-03-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 13672 steps with 3376 reset in 29 ms.
FORMULA BusinessProcesses-PT-03-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLFireability-00 finished in 535 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((p1 U (p2||G(p1)))))))'
Support contains 3 out of 214 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 214/214 places, 178/178 transitions.
Graph (trivial) has 111 edges and 214 vertex of which 6 / 214 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 443 edges and 209 vertex of which 208 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 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 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 25 place count 207 transition count 147
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 48 place count 184 transition count 147
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 48 place count 184 transition count 104
Deduced a syphon composed of 43 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 144 place count 131 transition count 104
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 151 place count 124 transition count 97
Iterating global reduction 2 with 7 rules applied. Total rules applied 158 place count 124 transition count 97
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 115 rules applied. Total rules applied 273 place count 66 transition count 40
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 274 place count 65 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 275 place count 64 transition count 39
Applied a total of 275 rules in 13 ms. Remains 64 /214 variables (removed 150) and now considering 39/178 (removed 139) transitions.
// Phase 1: matrix 39 rows 64 cols
[2023-03-11 02:20:20] [INFO ] Computed 29 place invariants in 0 ms
[2023-03-11 02:20:20] [INFO ] Implicit Places using invariants in 35 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/214 places, 39/178 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 50 ms. Remains : 63/214 places, 39/178 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-03-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s5 1), p2:(AND (NEQ s52 1) (NEQ s1 1)), p1:(NEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-03-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLFireability-01 finished in 183 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p0 U G(p1))) U G(p2))))'
Support contains 5 out of 214 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 178/178 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 207 transition count 171
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 207 transition count 171
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 204 transition count 168
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 204 transition count 168
Applied a total of 20 rules in 6 ms. Remains 204 /214 variables (removed 10) and now considering 168/178 (removed 10) transitions.
// Phase 1: matrix 168 rows 204 cols
[2023-03-11 02:20:20] [INFO ] Computed 41 place invariants in 2 ms
[2023-03-11 02:20:20] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-11 02:20:20] [INFO ] Invariant cache hit.
[2023-03-11 02:20:21] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2023-03-11 02:20:21] [INFO ] Invariant cache hit.
[2023-03-11 02:20:21] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 204/214 places, 168/178 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 335 ms. Remains : 204/214 places, 168/178 transitions.
Stuttering acceptance computed with spot in 193 ms :[(NOT p2), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), true, (NOT p1), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : BusinessProcesses-PT-03-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=p2, acceptance={} source=1 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 6}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={} source=6 dest: 4}, { cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=7 dest: 5}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=7 dest: 6}, { cond=(AND p2 p1 p0), acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(EQ s115 1), p1:(EQ s179 1), p0:(AND (EQ s69 1) (EQ s158 1) (EQ s197 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-03-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLFireability-02 finished in 544 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((p0||(G(p1)&&X(p2)))))&&F(p1)))'
Support contains 2 out of 214 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 178/178 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 206 transition count 170
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 206 transition count 170
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 204 transition count 168
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 204 transition count 168
Applied a total of 20 rules in 6 ms. Remains 204 /214 variables (removed 10) and now considering 168/178 (removed 10) transitions.
// Phase 1: matrix 168 rows 204 cols
[2023-03-11 02:20:21] [INFO ] Computed 41 place invariants in 3 ms
[2023-03-11 02:20:21] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-11 02:20:21] [INFO ] Invariant cache hit.
[2023-03-11 02:20:21] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2023-03-11 02:20:21] [INFO ] Invariant cache hit.
[2023-03-11 02:20:21] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 204/214 places, 168/178 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 295 ms. Remains : 204/214 places, 168/178 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p1), (AND p1 (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-03-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 4}]], initial=0, aps=[p1:(EQ s89 1), p0:(EQ s89 0), p2:(EQ s201 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 94 steps with 1 reset in 1 ms.
FORMULA BusinessProcesses-PT-03-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLFireability-06 finished in 461 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 2 out of 214 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 178/178 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 205 transition count 169
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 205 transition count 169
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 203 transition count 167
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 203 transition count 167
Applied a total of 22 rules in 5 ms. Remains 203 /214 variables (removed 11) and now considering 167/178 (removed 11) transitions.
// Phase 1: matrix 167 rows 203 cols
[2023-03-11 02:20:21] [INFO ] Computed 41 place invariants in 2 ms
[2023-03-11 02:20:21] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-11 02:20:21] [INFO ] Invariant cache hit.
[2023-03-11 02:20:22] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2023-03-11 02:20:22] [INFO ] Invariant cache hit.
[2023-03-11 02:20:22] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 203/214 places, 167/178 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 339 ms. Remains : 203/214 places, 167/178 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-03-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(EQ s47 0), p0:(EQ s77 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 209 ms.
Product exploration explored 100000 steps with 50000 reset in 186 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.8 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 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p0)
Knowledge based reduction with 7 factoid took 179 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-03-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-03-LTLFireability-08 finished in 1014 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(G(p1))))'
Support contains 4 out of 214 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 214/214 places, 178/178 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 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 212 transition count 155
Reduce places removed 21 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 23 rules applied. Total rules applied 45 place count 191 transition count 153
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 47 place count 189 transition count 153
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 47 place count 189 transition count 107
Deduced a syphon composed of 46 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 101 rules applied. Total rules applied 148 place count 134 transition count 107
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 157 place count 125 transition count 98
Iterating global reduction 3 with 9 rules applied. Total rules applied 166 place count 125 transition count 98
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 284 place count 65 transition count 40
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 285 place count 65 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 286 place count 64 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 287 place count 63 transition count 38
Applied a total of 287 rules in 29 ms. Remains 63 /214 variables (removed 151) and now considering 38/178 (removed 140) transitions.
// Phase 1: matrix 38 rows 63 cols
[2023-03-11 02:20:22] [INFO ] Computed 29 place invariants in 1 ms
[2023-03-11 02:20:23] [INFO ] Implicit Places using invariants in 79 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 83 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/214 places, 38/178 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 38/38 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 116 ms. Remains : 62/214 places, 38/178 transitions.
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-03-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s12 0) (EQ s44 0) (EQ s61 0)), p1:(EQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 46 steps with 4 reset in 0 ms.
FORMULA BusinessProcesses-PT-03-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLFireability-10 finished in 184 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 214 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 178/178 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 205 transition count 169
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 205 transition count 169
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 202 transition count 166
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 202 transition count 166
Applied a total of 24 rules in 5 ms. Remains 202 /214 variables (removed 12) and now considering 166/178 (removed 12) transitions.
// Phase 1: matrix 166 rows 202 cols
[2023-03-11 02:20:23] [INFO ] Computed 41 place invariants in 5 ms
[2023-03-11 02:20:23] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-11 02:20:23] [INFO ] Invariant cache hit.
[2023-03-11 02:20:23] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2023-03-11 02:20:23] [INFO ] Invariant cache hit.
[2023-03-11 02:20:23] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 202/214 places, 166/178 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 363 ms. Remains : 202/214 places, 166/178 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-03-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 2760 reset in 176 ms.
Stack based approach found an accepted trace after 148 steps with 3 reset with depth 8 and stack size 8 in 1 ms.
FORMULA BusinessProcesses-PT-03-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-03-LTLFireability-11 finished in 604 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p1))||p0)))'
Support contains 2 out of 214 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 214/214 places, 178/178 transitions.
Graph (trivial) has 112 edges and 214 vertex of which 6 / 214 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 443 edges and 209 vertex of which 208 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 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 26 place count 207 transition count 146
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 50 place count 183 transition count 146
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 50 place count 183 transition count 103
Deduced a syphon composed of 43 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 146 place count 130 transition count 103
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 152 place count 124 transition count 97
Iterating global reduction 2 with 6 rules applied. Total rules applied 158 place count 124 transition count 97
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 2 with 122 rules applied. Total rules applied 280 place count 62 transition count 37
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 281 place count 61 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 282 place count 60 transition count 36
Applied a total of 282 rules in 18 ms. Remains 60 /214 variables (removed 154) and now considering 36/178 (removed 142) transitions.
// Phase 1: matrix 36 rows 60 cols
[2023-03-11 02:20:23] [INFO ] Computed 28 place invariants in 0 ms
[2023-03-11 02:20:23] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-11 02:20:23] [INFO ] Invariant cache hit.
[2023-03-11 02:20:23] [INFO ] Implicit Places using invariants and state equation in 76 ms returned [0, 1, 2, 3, 4, 6, 7, 8, 9, 10, 11, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44]
Discarding 28 places :
Implicit Place search using SMT with State Equation took 154 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/214 places, 36/178 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 32 transition count 29
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 25 transition count 29
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 17 place count 22 transition count 26
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 22 transition count 26
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 22 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 22 place count 21 transition count 25
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 23 place count 20 transition count 24
Iterating global reduction 4 with 1 rules applied. Total rules applied 24 place count 20 transition count 24
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 4 with 4 rules applied. Total rules applied 28 place count 18 transition count 22
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 29 place count 18 transition count 22
Applied a total of 29 rules in 6 ms. Remains 18 /32 variables (removed 14) and now considering 22/36 (removed 14) transitions.
// Phase 1: matrix 22 rows 18 cols
[2023-03-11 02:20:23] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 02:20:23] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-11 02:20:23] [INFO ] Invariant cache hit.
[2023-03-11 02:20:23] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/214 places, 22/178 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 252 ms. Remains : 18/214 places, 22/178 transitions.
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-03-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s15 1) (EQ s0 1)), p1:(EQ s0 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-03-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLFireability-12 finished in 439 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&(p0 U G(p1))&&(p2||F(p3)))))'
Support contains 3 out of 214 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 214/214 places, 178/178 transitions.
Graph (trivial) has 110 edges and 214 vertex of which 6 / 214 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 443 edges and 209 vertex of which 208 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 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 25 place count 207 transition count 147
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 48 place count 184 transition count 147
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 48 place count 184 transition count 104
Deduced a syphon composed of 43 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 144 place count 131 transition count 104
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 149 place count 126 transition count 99
Iterating global reduction 2 with 5 rules applied. Total rules applied 154 place count 126 transition count 99
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 2 with 122 rules applied. Total rules applied 276 place count 64 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 277 place count 63 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 278 place count 62 transition count 38
Applied a total of 278 rules in 18 ms. Remains 62 /214 variables (removed 152) and now considering 38/178 (removed 140) transitions.
// Phase 1: matrix 38 rows 62 cols
[2023-03-11 02:20:24] [INFO ] Computed 28 place invariants in 0 ms
[2023-03-11 02:20:24] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-11 02:20:24] [INFO ] Invariant cache hit.
[2023-03-11 02:20:24] [INFO ] Implicit Places using invariants and state equation in 117 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 19, 20, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44]
Discarding 28 places :
Implicit Place search using SMT with State Equation took 196 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/214 places, 38/178 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 34 transition count 32
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 28 transition count 32
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 14 place count 26 transition count 30
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 26 transition count 30
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 26 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 18 place count 25 transition count 29
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 26 place count 21 transition count 25
Applied a total of 26 rules in 7 ms. Remains 21 /34 variables (removed 13) and now considering 25/38 (removed 13) transitions.
// Phase 1: matrix 25 rows 21 cols
[2023-03-11 02:20:24] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-11 02:20:24] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-11 02:20:24] [INFO ] Invariant cache hit.
[2023-03-11 02:20:24] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 21/214 places, 25/178 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 285 ms. Remains : 21/214 places, 25/178 transitions.
Stuttering acceptance computed with spot in 316 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : BusinessProcesses-PT-03-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1 p2 (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={0} source=4 dest: 2}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=4 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), acceptance={0} source=5 dest: 2}, { cond=(AND p0 p1 p2 (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={0} source=5 dest: 4}, { cond=(OR (AND (NOT p0) p1 (NOT p3)) (AND p1 (NOT p2) (NOT p3))), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s3 1), p1:(EQ s18 1), p2:(EQ s18 0), p3:(EQ s16 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-03-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLFireability-14 finished in 627 ms.
All properties solved by simple procedures.
Total runtime 8093 ms.
ITS solved all properties within timeout

BK_STOP 1678501225037

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
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 r039-tajo-167813692600468"
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 ;