Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r041-tajo-167813694700452.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is BusinessProcesses-PT-01, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694700452
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 6.8K Feb 25 16:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 25 16:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 16:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 16:46 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.3K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 17K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 16:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 25 16:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 16:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 16:47 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 47K 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-01-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678639541500

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-01
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 16:45:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 16:45:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:45:43] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2023-03-12 16:45:43] [INFO ] Transformed 200 places.
[2023-03-12 16:45:43] [INFO ] Transformed 178 transitions.
[2023-03-12 16:45:43] [INFO ] Found NUPN structural information;
[2023-03-12 16:45:43] [INFO ] Parsed PT model containing 200 places and 178 transitions and 487 arcs in 147 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-01-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 177/177 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 197 transition count 177
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 25 place count 174 transition count 154
Iterating global reduction 1 with 23 rules applied. Total rules applied 48 place count 174 transition count 154
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 57 place count 165 transition count 145
Iterating global reduction 1 with 9 rules applied. Total rules applied 66 place count 165 transition count 145
Applied a total of 66 rules in 52 ms. Remains 165 /199 variables (removed 34) and now considering 145/177 (removed 32) transitions.
// Phase 1: matrix 145 rows 165 cols
[2023-03-12 16:45:43] [INFO ] Computed 28 place invariants in 7 ms
[2023-03-12 16:45:43] [INFO ] Implicit Places using invariants in 228 ms returned []
[2023-03-12 16:45:43] [INFO ] Invariant cache hit.
[2023-03-12 16:45:44] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
[2023-03-12 16:45:44] [INFO ] Invariant cache hit.
[2023-03-12 16:45:44] [INFO ] Dead Transitions using invariants and state equation in 369 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 165/199 places, 145/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 927 ms. Remains : 165/199 places, 145/177 transitions.
Support contains 38 out of 165 places after structural reductions.
[2023-03-12 16:45:44] [INFO ] Flatten gal took : 57 ms
[2023-03-12 16:45:44] [INFO ] Flatten gal took : 21 ms
[2023-03-12 16:45:44] [INFO ] Input system was already deterministic with 145 transitions.
Incomplete random walk after 10000 steps, including 114 resets, run finished after 305 ms. (steps per millisecond=32 ) properties (out of 32) seen :31
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 16:45:45] [INFO ] Invariant cache hit.
[2023-03-12 16:45:45] [INFO ] [Real]Absence check using 18 positive place invariants in 20 ms returned sat
[2023-03-12 16:45:45] [INFO ] [Real]Absence check using 18 positive and 10 generalized place invariants in 5 ms returned sat
[2023-03-12 16:45:45] [INFO ] After 312ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA BusinessProcesses-PT-01-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 140 stabilizing places and 120 stable transitions
Graph (complete) has 343 edges and 165 vertex of which 164 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 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||X(F((p0&&F(p1))))))&&(X(p2) U ((p3&&X(p2))||X(G(p2))))))'
Support contains 3 out of 165 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 145/145 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 155 transition count 135
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 155 transition count 135
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 155 transition count 134
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 26 place count 150 transition count 129
Iterating global reduction 1 with 5 rules applied. Total rules applied 31 place count 150 transition count 129
Applied a total of 31 rules in 16 ms. Remains 150 /165 variables (removed 15) and now considering 129/145 (removed 16) transitions.
// Phase 1: matrix 129 rows 150 cols
[2023-03-12 16:45:46] [INFO ] Computed 28 place invariants in 3 ms
[2023-03-12 16:45:46] [INFO ] Implicit Places using invariants in 170 ms returned []
[2023-03-12 16:45:46] [INFO ] Invariant cache hit.
[2023-03-12 16:45:46] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
[2023-03-12 16:45:46] [INFO ] Invariant cache hit.
[2023-03-12 16:45:46] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 150/165 places, 129/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 550 ms. Remains : 150/165 places, 129/145 transitions.
Stuttering acceptance computed with spot in 287 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (NOT p2), true]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p3), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s104 1), p3:(NEQ s135 1), p2:(NEQ s141 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 7066 reset in 412 ms.
Stack based approach found an accepted trace after 134 steps with 8 reset with depth 10 and stack size 10 in 0 ms.
FORMULA BusinessProcesses-PT-01-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-01-LTLFireability-00 finished in 1336 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 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 145/145 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 152 transition count 132
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 152 transition count 132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 152 transition count 131
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 34 place count 145 transition count 124
Iterating global reduction 1 with 7 rules applied. Total rules applied 41 place count 145 transition count 124
Applied a total of 41 rules in 20 ms. Remains 145 /165 variables (removed 20) and now considering 124/145 (removed 21) transitions.
// Phase 1: matrix 124 rows 145 cols
[2023-03-12 16:45:47] [INFO ] Computed 28 place invariants in 5 ms
[2023-03-12 16:45:47] [INFO ] Implicit Places using invariants in 272 ms returned []
[2023-03-12 16:45:47] [INFO ] Invariant cache hit.
[2023-03-12 16:45:47] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
[2023-03-12 16:45:47] [INFO ] Invariant cache hit.
[2023-03-12 16:45:47] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 145/165 places, 124/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 603 ms. Remains : 145/165 places, 124/145 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-01 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 s45 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 149 ms.
Product exploration explored 100000 steps with 50000 reset in 195 ms.
Computed a total of 122 stabilizing places and 102 stable transitions
Graph (complete) has 314 edges and 145 vertex of which 144 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 122 stabilizing places and 102 stable transitions
Detected a total of 122/145 stabilizing places and 102/124 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 121 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-01-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-01-LTLFireability-01 finished in 1175 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||F(p1)))))'
Support contains 2 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 145/145 transitions.
Graph (trivial) has 88 edges and 165 vertex of which 6 / 165 are part of one of the 1 SCC in 5 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 337 edges and 160 vertex of which 159 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 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 24 place count 158 transition count 115
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 46 place count 136 transition count 115
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 46 place count 136 transition count 89
Deduced a syphon composed of 26 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 104 place count 104 transition count 89
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 115 place count 93 transition count 78
Iterating global reduction 2 with 11 rules applied. Total rules applied 126 place count 93 transition count 78
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 126 place count 93 transition count 75
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 132 place count 90 transition count 75
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 204 place count 54 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 206 place count 53 transition count 42
Applied a total of 206 rules in 49 ms. Remains 53 /165 variables (removed 112) and now considering 42/145 (removed 103) transitions.
// Phase 1: matrix 42 rows 53 cols
[2023-03-12 16:45:48] [INFO ] Computed 22 place invariants in 2 ms
[2023-03-12 16:45:48] [INFO ] Implicit Places using invariants in 84 ms returned [1, 2, 5, 6, 7, 15]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 90 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/165 places, 42/145 transitions.
Applied a total of 0 rules in 6 ms. Remains 47 /47 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 146 ms. Remains : 47/165 places, 42/145 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s32 1), p1:(EQ s29 0)], 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 31 steps with 4 reset in 1 ms.
FORMULA BusinessProcesses-PT-01-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-LTLFireability-02 finished in 288 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 145/145 transitions.
Graph (trivial) has 91 edges and 165 vertex of which 7 / 165 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 335 edges and 159 vertex of which 158 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 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 157 transition count 112
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 48 place count 134 transition count 112
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 48 place count 134 transition count 86
Deduced a syphon composed of 26 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 57 rules applied. Total rules applied 105 place count 103 transition count 86
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 117 place count 91 transition count 74
Iterating global reduction 2 with 12 rules applied. Total rules applied 129 place count 91 transition count 74
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 129 place count 91 transition count 71
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 135 place count 88 transition count 71
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 203 place count 54 transition count 37
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 205 place count 53 transition count 40
Applied a total of 205 rules in 54 ms. Remains 53 /165 variables (removed 112) and now considering 40/145 (removed 105) transitions.
// Phase 1: matrix 40 rows 53 cols
[2023-03-12 16:45:48] [INFO ] Computed 23 place invariants in 1 ms
[2023-03-12 16:45:49] [INFO ] Implicit Places using invariants in 146 ms returned [1, 2, 5, 6, 7, 17, 47]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 147 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/165 places, 40/145 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 45 transition count 39
Applied a total of 2 rules in 4 ms. Remains 45 /46 variables (removed 1) and now considering 39/40 (removed 1) transitions.
// Phase 1: matrix 39 rows 45 cols
[2023-03-12 16:45:49] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-12 16:45:49] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-12 16:45:49] [INFO ] Invariant cache hit.
[2023-03-12 16:45:49] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-12 16:45:49] [INFO ] Implicit Places using invariants and state equation in 83 ms returned [3, 12, 13, 17, 19, 21, 27, 29]
Discarding 8 places :
Implicit Place search using SMT with State Equation took 149 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 37/165 places, 39/145 transitions.
Graph (complete) has 111 edges and 37 vertex of which 35 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 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 3 place count 35 transition count 36
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 33 transition count 36
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 8 place count 30 transition count 30
Iterating global reduction 2 with 3 rules applied. Total rules applied 11 place count 30 transition count 30
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 17 place count 27 transition count 27
Applied a total of 17 rules in 5 ms. Remains 27 /37 variables (removed 10) and now considering 27/39 (removed 12) transitions.
// Phase 1: matrix 27 rows 27 cols
[2023-03-12 16:45:49] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-12 16:45:49] [INFO ] Implicit Places using invariants in 60 ms returned [3, 4]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 73 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 25/165 places, 27/145 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 27/27 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 438 ms. Remains : 25/165 places, 27/145 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-01-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-LTLFireability-03 finished in 488 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0&&X(F(p1)))))'
Support contains 2 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 145/145 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 153 transition count 133
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 153 transition count 133
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 153 transition count 132
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 31 place count 147 transition count 126
Iterating global reduction 1 with 6 rules applied. Total rules applied 37 place count 147 transition count 126
Applied a total of 37 rules in 7 ms. Remains 147 /165 variables (removed 18) and now considering 126/145 (removed 19) transitions.
// Phase 1: matrix 126 rows 147 cols
[2023-03-12 16:45:49] [INFO ] Computed 28 place invariants in 2 ms
[2023-03-12 16:45:49] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-12 16:45:49] [INFO ] Invariant cache hit.
[2023-03-12 16:45:49] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2023-03-12 16:45:49] [INFO ] Invariant cache hit.
[2023-03-12 16:45:49] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 147/165 places, 126/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 368 ms. Remains : 147/165 places, 126/145 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s7 0), p0:(NEQ s134 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-01-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-LTLFireability-04 finished in 537 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X((p0||X(p1)))&&G(p2))))'
Support contains 3 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 145/145 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 153 transition count 133
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 153 transition count 133
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 153 transition count 132
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 32 place count 146 transition count 125
Iterating global reduction 1 with 7 rules applied. Total rules applied 39 place count 146 transition count 125
Applied a total of 39 rules in 4 ms. Remains 146 /165 variables (removed 19) and now considering 125/145 (removed 20) transitions.
// Phase 1: matrix 125 rows 146 cols
[2023-03-12 16:45:49] [INFO ] Computed 28 place invariants in 1 ms
[2023-03-12 16:45:50] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-12 16:45:50] [INFO ] Invariant cache hit.
[2023-03-12 16:45:50] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2023-03-12 16:45:50] [INFO ] Invariant cache hit.
[2023-03-12 16:45:50] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 146/165 places, 125/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 392 ms. Remains : 146/165 places, 125/145 transitions.
Stuttering acceptance computed with spot in 199 ms :[true, (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p2), acceptance={} source=2 dest: 5}], [{ cond=(OR (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p2 p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 3}, { cond=(AND p0 p2), acceptance={} source=5 dest: 4}]], initial=1, aps=[p0:(EQ s24 1), p2:(EQ s105 0), p1:(AND (EQ s24 0) (EQ s7 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 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-01-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-LTLFireability-05 finished in 607 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X((p1&&G((p2&&X(p3)))))))))'
Support contains 7 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 145/145 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 153 transition count 133
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 153 transition count 133
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 153 transition count 132
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 148 transition count 127
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 148 transition count 127
Applied a total of 35 rules in 6 ms. Remains 148 /165 variables (removed 17) and now considering 127/145 (removed 18) transitions.
// Phase 1: matrix 127 rows 148 cols
[2023-03-12 16:45:50] [INFO ] Computed 28 place invariants in 3 ms
[2023-03-12 16:45:50] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-12 16:45:50] [INFO ] Invariant cache hit.
[2023-03-12 16:45:50] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2023-03-12 16:45:50] [INFO ] Invariant cache hit.
[2023-03-12 16:45:50] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 148/165 places, 127/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 324 ms. Remains : 148/165 places, 127/145 transitions.
Stuttering acceptance computed with spot in 282 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)))]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={0} source=1 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1 p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 3}], [{ cond=(OR (AND p0 (NOT p2)) (AND p0 (NOT p3))), acceptance={0} source=2 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p2 p3), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p2 p3), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2)) (AND p0 (NOT p3))), acceptance={0} source=3 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), acceptance={0} source=3 dest: 1}, { cond=(AND p0 p1 p2 p3), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1 p2 p3), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s117 0), p1:(OR (EQ s53 0) (EQ s139 0)), p2:(EQ s124 1), p3:(OR (EQ s55 0) (EQ s103 0) (EQ s142 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1145 reset in 280 ms.
Stack based approach found an accepted trace after 50 steps with 0 reset with depth 51 and stack size 51 in 1 ms.
FORMULA BusinessProcesses-PT-01-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-01-LTLFireability-06 finished in 917 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U p1))'
Support contains 5 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 145/145 transitions.
Graph (trivial) has 88 edges and 165 vertex of which 7 / 165 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 335 edges and 159 vertex of which 158 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 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 24 place count 157 transition count 113
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 46 place count 135 transition count 113
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 46 place count 135 transition count 89
Deduced a syphon composed of 24 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 53 rules applied. Total rules applied 99 place count 106 transition count 89
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 111 place count 94 transition count 77
Iterating global reduction 2 with 12 rules applied. Total rules applied 123 place count 94 transition count 77
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 123 place count 94 transition count 74
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 129 place count 91 transition count 74
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 197 place count 57 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 199 place count 56 transition count 43
Applied a total of 199 rules in 32 ms. Remains 56 /165 variables (removed 109) and now considering 43/145 (removed 102) transitions.
// Phase 1: matrix 43 rows 56 cols
[2023-03-12 16:45:51] [INFO ] Computed 23 place invariants in 0 ms
[2023-03-12 16:45:51] [INFO ] Implicit Places using invariants in 430 ms returned [1, 2, 6, 7, 8, 18]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 438 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/165 places, 43/145 transitions.
Applied a total of 0 rules in 3 ms. Remains 50 /50 variables (removed 0) and now considering 43/43 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 474 ms. Remains : 50/165 places, 43/145 transitions.
Stuttering acceptance computed with spot in 54 ms :[true, (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(AND (EQ s1 1) (EQ s19 1) (EQ s34 1)), p0:(OR (AND (EQ s7 1) (EQ s43 1)) (AND (EQ s1 1) (EQ s19 1) (EQ s34 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][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-01-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-LTLFireability-07 finished in 553 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 145/145 transitions.
Graph (trivial) has 89 edges and 165 vertex of which 5 / 165 are part of one of the 1 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 338 edges and 161 vertex of which 160 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 159 transition count 115
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 48 place count 136 transition count 115
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 48 place count 136 transition count 88
Deduced a syphon composed of 27 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 108 place count 103 transition count 88
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 120 place count 91 transition count 76
Iterating global reduction 2 with 12 rules applied. Total rules applied 132 place count 91 transition count 76
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 132 place count 91 transition count 73
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 138 place count 88 transition count 73
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 208 place count 53 transition count 38
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 210 place count 52 transition count 41
Applied a total of 210 rules in 13 ms. Remains 52 /165 variables (removed 113) and now considering 41/145 (removed 104) transitions.
// Phase 1: matrix 41 rows 52 cols
[2023-03-12 16:45:51] [INFO ] Computed 22 place invariants in 2 ms
[2023-03-12 16:45:52] [INFO ] Implicit Places using invariants in 36 ms returned [1, 2, 5, 6, 7, 15]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 50 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/165 places, 41/145 transitions.
Applied a total of 0 rules in 1 ms. Remains 46 /46 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 67 ms. Remains : 46/165 places, 41/145 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s32 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 9887 reset in 175 ms.
Product exploration explored 100000 steps with 9938 reset in 131 ms.
Computed a total of 37 stabilizing places and 31 stable transitions
Computed a total of 37 stabilizing places and 31 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 273 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 199 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 41/41 transitions.
Applied a total of 0 rules in 2 ms. Remains 46 /46 variables (removed 0) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 46 cols
[2023-03-12 16:45:53] [INFO ] Computed 16 place invariants in 3 ms
[2023-03-12 16:45:53] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-12 16:45:53] [INFO ] Invariant cache hit.
[2023-03-12 16:45:53] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-12 16:45:53] [INFO ] Implicit Places using invariants and state equation in 54 ms returned [3, 11, 12, 16, 18, 20, 26, 28]
Discarding 8 places :
Implicit Place search using SMT with State Equation took 120 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 38/46 places, 41/41 transitions.
Graph (complete) has 120 edges and 38 vertex of which 36 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 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 3 place count 36 transition count 38
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 34 transition count 38
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 8 place count 31 transition count 32
Iterating global reduction 2 with 3 rules applied. Total rules applied 11 place count 31 transition count 32
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 17 place count 28 transition count 29
Applied a total of 17 rules in 5 ms. Remains 28 /38 variables (removed 10) and now considering 29/41 (removed 12) transitions.
// Phase 1: matrix 29 rows 28 cols
[2023-03-12 16:45:53] [INFO ] Computed 8 place invariants in 0 ms
[2023-03-12 16:45:53] [INFO ] Implicit Places using invariants in 43 ms returned [3, 4]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 44 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 26/46 places, 29/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 29/29 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 173 ms. Remains : 26/46 places, 29/41 transitions.
Computed a total of 17 stabilizing places and 19 stable transitions
Computed a total of 17 stabilizing places and 19 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 155 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 10365 reset in 123 ms.
Product exploration explored 100000 steps with 10451 reset in 92 ms.
Support contains 1 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 29/29 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 29/29 (removed 0) transitions.
// Phase 1: matrix 29 rows 26 cols
[2023-03-12 16:45:54] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-12 16:45:54] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-12 16:45:54] [INFO ] Invariant cache hit.
[2023-03-12 16:45:54] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-12 16:45:54] [INFO ] Implicit Places using invariants and state equation in 38 ms returned [9, 11]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 108 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/26 places, 29/29 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 24 transition count 27
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 22 transition count 27
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 9 place count 19 transition count 25
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 11 place count 18 transition count 24
Applied a total of 11 rules in 6 ms. Remains 18 /24 variables (removed 6) and now considering 24/29 (removed 5) transitions.
// Phase 1: matrix 24 rows 18 cols
[2023-03-12 16:45:54] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-12 16:45:54] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-12 16:45:54] [INFO ] Invariant cache hit.
[2023-03-12 16:45:54] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-12 16:45:54] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/26 places, 24/29 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 170 ms. Remains : 18/26 places, 24/29 transitions.
Treatment of property BusinessProcesses-PT-01-LTLFireability-09 finished in 2301 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G((p1||X((p2 U p3)))))))'
Support contains 3 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 145/145 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 154 transition count 134
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 154 transition count 134
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 154 transition count 133
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 29 place count 148 transition count 127
Iterating global reduction 1 with 6 rules applied. Total rules applied 35 place count 148 transition count 127
Applied a total of 35 rules in 5 ms. Remains 148 /165 variables (removed 17) and now considering 127/145 (removed 18) transitions.
// Phase 1: matrix 127 rows 148 cols
[2023-03-12 16:45:54] [INFO ] Computed 28 place invariants in 1 ms
[2023-03-12 16:45:54] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-12 16:45:54] [INFO ] Invariant cache hit.
[2023-03-12 16:45:54] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2023-03-12 16:45:54] [INFO ] Invariant cache hit.
[2023-03-12 16:45:54] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 148/165 places, 127/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 256 ms. Remains : 148/165 places, 127/145 transitions.
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), true]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p3) p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s137 1), p1:(EQ s70 0), p3:(EQ s129 1), p2:(EQ s70 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]]
Entered a terminal (fully accepting) state of product in 201 steps with 1 reset in 1 ms.
FORMULA BusinessProcesses-PT-01-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-LTLFireability-10 finished in 463 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0 U X(p1)))))'
Support contains 4 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 145/145 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 152 transition count 132
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 152 transition count 132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 152 transition count 131
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 34 place count 145 transition count 124
Iterating global reduction 1 with 7 rules applied. Total rules applied 41 place count 145 transition count 124
Applied a total of 41 rules in 8 ms. Remains 145 /165 variables (removed 20) and now considering 124/145 (removed 21) transitions.
// Phase 1: matrix 124 rows 145 cols
[2023-03-12 16:45:54] [INFO ] Computed 28 place invariants in 2 ms
[2023-03-12 16:45:54] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-12 16:45:54] [INFO ] Invariant cache hit.
[2023-03-12 16:45:54] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
[2023-03-12 16:45:54] [INFO ] Invariant cache hit.
[2023-03-12 16:45:55] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 145/165 places, 124/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 322 ms. Remains : 145/165 places, 124/145 transitions.
Stuttering acceptance computed with spot in 205 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s44 1) (EQ s111 1) (EQ s131 1)), p1:(EQ s1 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]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-01-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-LTLFireability-11 finished in 555 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))&&F(p1)))'
Support contains 4 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 145/145 transitions.
Graph (complete) has 343 edges and 165 vertex of which 164 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 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 163 transition count 126
Reduce places removed 17 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 19 rules applied. Total rules applied 37 place count 146 transition count 124
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 39 place count 144 transition count 124
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 39 place count 144 transition count 92
Deduced a syphon composed of 32 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 109 place count 106 transition count 92
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 121 place count 94 transition count 80
Iterating global reduction 3 with 12 rules applied. Total rules applied 133 place count 94 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 135 place count 94 transition count 78
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 136 place count 93 transition count 78
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 136 place count 93 transition count 75
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 142 place count 90 transition count 75
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 5 with 68 rules applied. Total rules applied 210 place count 56 transition count 41
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 211 place count 56 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 213 place count 55 transition count 43
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 214 place count 54 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 215 place count 53 transition count 42
Applied a total of 215 rules in 25 ms. Remains 53 /165 variables (removed 112) and now considering 42/145 (removed 103) transitions.
// Phase 1: matrix 42 rows 53 cols
[2023-03-12 16:45:55] [INFO ] Computed 21 place invariants in 0 ms
[2023-03-12 16:45:55] [INFO ] Implicit Places using invariants in 54 ms returned [9, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 67 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/165 places, 42/145 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 93 ms. Remains : 51/165 places, 42/145 transitions.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(NEQ s2 1), p0:(OR (EQ s7 0) (EQ s29 0) (EQ s46 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 8039 reset in 121 ms.
Stack based approach found an accepted trace after 188 steps with 15 reset with depth 27 and stack size 25 in 1 ms.
FORMULA BusinessProcesses-PT-01-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-01-LTLFireability-12 finished in 340 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) U (X(p1)||G(p2))) U X(p1)))'
Support contains 3 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 145/145 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 153 transition count 133
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 153 transition count 133
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 153 transition count 132
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 32 place count 146 transition count 125
Iterating global reduction 1 with 7 rules applied. Total rules applied 39 place count 146 transition count 125
Applied a total of 39 rules in 7 ms. Remains 146 /165 variables (removed 19) and now considering 125/145 (removed 20) transitions.
// Phase 1: matrix 125 rows 146 cols
[2023-03-12 16:45:55] [INFO ] Computed 28 place invariants in 1 ms
[2023-03-12 16:45:55] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-12 16:45:55] [INFO ] Invariant cache hit.
[2023-03-12 16:45:55] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2023-03-12 16:45:55] [INFO ] Invariant cache hit.
[2023-03-12 16:45:55] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 146/165 places, 125/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 286 ms. Remains : 146/165 places, 125/145 transitions.
Stuttering acceptance computed with spot in 280 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s27 1), p2:(EQ s8 1), p1:(EQ s145 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 66 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-01-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-LTLFireability-13 finished in 584 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||X(p1))))'
Support contains 2 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 145/145 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 154 transition count 134
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 154 transition count 134
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 154 transition count 133
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 29 place count 148 transition count 127
Iterating global reduction 1 with 6 rules applied. Total rules applied 35 place count 148 transition count 127
Applied a total of 35 rules in 4 ms. Remains 148 /165 variables (removed 17) and now considering 127/145 (removed 18) transitions.
// Phase 1: matrix 127 rows 148 cols
[2023-03-12 16:45:56] [INFO ] Computed 28 place invariants in 5 ms
[2023-03-12 16:45:56] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-12 16:45:56] [INFO ] Invariant cache hit.
[2023-03-12 16:45:56] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2023-03-12 16:45:56] [INFO ] Invariant cache hit.
[2023-03-12 16:45:56] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 148/165 places, 127/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 309 ms. Remains : 148/165 places, 127/145 transitions.
Stuttering acceptance computed with spot in 96 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s129 1), p1:(EQ s123 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-01-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-LTLFireability-14 finished in 418 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)))'
[2023-03-12 16:45:56] [INFO ] Flatten gal took : 21 ms
[2023-03-12 16:45:56] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-12 16:45:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 165 places, 145 transitions and 419 arcs took 3 ms.
Total runtime 13521 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/994/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : BusinessProcesses-PT-01-LTLFireability-09

BK_STOP 1678639557347

--------------------
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
mcc2023
ltl formula name BusinessProcesses-PT-01-LTLFireability-09
ltl formula formula --ltl=/tmp/994/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 165 places, 145 transitions and 419 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.010 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/994/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/994/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/994/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/994/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x5651d47413f4]
1: pnml2lts-mc(+0xa2496) [0x5651d4741496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f6256c4e140]
3: pnml2lts-mc(+0x405be5) [0x5651d4aa4be5]
4: pnml2lts-mc(+0x16b3f9) [0x5651d480a3f9]
5: pnml2lts-mc(+0x164ac4) [0x5651d4803ac4]
6: pnml2lts-mc(+0x272e0a) [0x5651d4911e0a]
7: pnml2lts-mc(+0xb61f0) [0x5651d47551f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f6256aa14d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f6256aa167a]
10: pnml2lts-mc(+0xa1581) [0x5651d4740581]
11: pnml2lts-mc(+0xa1910) [0x5651d4740910]
12: pnml2lts-mc(+0xa32a2) [0x5651d47422a2]
13: pnml2lts-mc(+0xa50f4) [0x5651d47440f4]
14: pnml2lts-mc(+0xa516b) [0x5651d474416b]
15: pnml2lts-mc(+0x3f34b3) [0x5651d4a924b3]
16: pnml2lts-mc(+0x7c63d) [0x5651d471b63d]
17: pnml2lts-mc(+0x67d86) [0x5651d4706d86]
18: pnml2lts-mc(+0x60a8a) [0x5651d46ffa8a]
19: pnml2lts-mc(+0x5eb15) [0x5651d46fdb15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f6256a89d0a]
21: pnml2lts-mc(+0x6075e) [0x5651d46ff75e]

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is BusinessProcesses-PT-01, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r041-tajo-167813694700452"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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