Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 328K
-rw-r--r-- 1 mcc users 6.0K Apr 30 00:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Apr 30 00:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 30 00:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 30 00:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 100K May 10 09:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652625585777

Running Version 202205111006
[2022-05-15 14:39:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 14:39:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 14:39:47] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2022-05-15 14:39:47] [INFO ] Transformed 386 places.
[2022-05-15 14:39:47] [INFO ] Transformed 360 transitions.
[2022-05-15 14:39:47] [INFO ] Found NUPN structural information;
[2022-05-15 14:39:47] [INFO ] Parsed PT model containing 386 places and 360 transitions in 199 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA BusinessProcesses-PT-07-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-07-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-07-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 386 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 386/386 places, 360/360 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 385 transition count 360
Discarding 53 places :
Symmetric choice reduction at 1 with 53 rule applications. Total rules 54 place count 332 transition count 307
Iterating global reduction 1 with 53 rules applied. Total rules applied 107 place count 332 transition count 307
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 128 place count 311 transition count 286
Iterating global reduction 1 with 21 rules applied. Total rules applied 149 place count 311 transition count 286
Applied a total of 149 rules in 90 ms. Remains 311 /386 variables (removed 75) and now considering 286/360 (removed 74) transitions.
// Phase 1: matrix 286 rows 311 cols
[2022-05-15 14:39:47] [INFO ] Computed 61 place invariants in 24 ms
[2022-05-15 14:39:47] [INFO ] Implicit Places using invariants in 311 ms returned []
// Phase 1: matrix 286 rows 311 cols
[2022-05-15 14:39:47] [INFO ] Computed 61 place invariants in 23 ms
[2022-05-15 14:39:47] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 662 ms to find 0 implicit places.
// Phase 1: matrix 286 rows 311 cols
[2022-05-15 14:39:48] [INFO ] Computed 61 place invariants in 7 ms
[2022-05-15 14:39:48] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 311/386 places, 286/360 transitions.
Finished structural reductions, in 1 iterations. Remains : 311/386 places, 286/360 transitions.
Support contains 34 out of 311 places after structural reductions.
[2022-05-15 14:39:48] [INFO ] Flatten gal took : 53 ms
[2022-05-15 14:39:48] [INFO ] Flatten gal took : 23 ms
[2022-05-15 14:39:48] [INFO ] Input system was already deterministic with 286 transitions.
Support contains 33 out of 311 places (down from 34) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 108 resets, run finished after 576 ms. (steps per millisecond=17 ) properties (out of 27) seen :18
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :4
Running SMT prover for 3 properties.
// Phase 1: matrix 286 rows 311 cols
[2022-05-15 14:39:49] [INFO ] Computed 61 place invariants in 9 ms
[2022-05-15 14:39:49] [INFO ] [Real]Absence check using 32 positive place invariants in 8 ms returned sat
[2022-05-15 14:39:49] [INFO ] [Real]Absence check using 32 positive and 29 generalized place invariants in 11 ms returned sat
[2022-05-15 14:39:49] [INFO ] After 89ms SMT Verify possible using state equation in real domain returned unsat :2 sat :1
[2022-05-15 14:39:49] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 4 ms to minimize.
[2022-05-15 14:39:50] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 1 ms to minimize.
[2022-05-15 14:39:50] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2022-05-15 14:39:50] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2022-05-15 14:39:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 400 ms
[2022-05-15 14:39:50] [INFO ] After 498ms SMT Verify possible using trap constraints in real domain returned unsat :3 sat :0
[2022-05-15 14:39:50] [INFO ] After 630ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
FORMULA BusinessProcesses-PT-07-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 187 stabilizing places and 189 stable transitions
Graph (complete) has 727 edges and 311 vertex of which 310 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.14 ms
FORMULA BusinessProcesses-PT-07-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 286/286 transitions.
Graph (trivial) has 141 edges and 311 vertex of which 6 / 311 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 721 edges and 306 vertex of which 305 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 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 31 place count 304 transition count 249
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 60 place count 275 transition count 249
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 60 place count 275 transition count 184
Deduced a syphon composed of 65 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 139 rules applied. Total rules applied 199 place count 201 transition count 184
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 204 place count 196 transition count 179
Iterating global reduction 2 with 5 rules applied. Total rules applied 209 place count 196 transition count 179
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 209 place count 196 transition count 178
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 211 place count 195 transition count 178
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 149 rules applied. Total rules applied 360 place count 120 transition count 104
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 362 place count 119 transition count 107
Applied a total of 362 rules in 72 ms. Remains 119 /311 variables (removed 192) and now considering 107/286 (removed 179) transitions.
// Phase 1: matrix 107 rows 119 cols
[2022-05-15 14:39:50] [INFO ] Computed 51 place invariants in 1 ms
[2022-05-15 14:39:50] [INFO ] Implicit Places using invariants in 180 ms returned [1, 2, 8, 10, 12, 37, 38, 39, 40, 41, 42, 43]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 183 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 107/311 places, 107/286 transitions.
Applied a total of 0 rules in 6 ms. Remains 107 /107 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 107/311 places, 107/286 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-07-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:(EQ s72 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-LTLFireability-00 finished in 487 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&F(G(X((G(p1)||F(p2)))))))'
Support contains 4 out of 311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 311/311 places, 286/286 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 305 transition count 280
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 305 transition count 280
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 303 transition count 278
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 303 transition count 278
Applied a total of 16 rules in 18 ms. Remains 303 /311 variables (removed 8) and now considering 278/286 (removed 8) transitions.
// Phase 1: matrix 278 rows 303 cols
[2022-05-15 14:39:51] [INFO ] Computed 61 place invariants in 3 ms
[2022-05-15 14:39:51] [INFO ] Implicit Places using invariants in 207 ms returned []
// Phase 1: matrix 278 rows 303 cols
[2022-05-15 14:39:51] [INFO ] Computed 61 place invariants in 2 ms
[2022-05-15 14:39:51] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 548 ms to find 0 implicit places.
// Phase 1: matrix 278 rows 303 cols
[2022-05-15 14:39:51] [INFO ] Computed 61 place invariants in 4 ms
[2022-05-15 14:39:51] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 303/311 places, 278/286 transitions.
Finished structural reductions, in 1 iterations. Remains : 303/311 places, 278/286 transitions.
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s115 0), p1:(AND (EQ s298 1) (EQ s301 1)), p2:(EQ s29 0)], 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 1095 reset in 283 ms.
Product exploration explored 100000 steps with 1080 reset in 203 ms.
Computed a total of 186 stabilizing places and 188 stable transitions
Graph (complete) has 719 edges and 303 vertex of which 302 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 186 stabilizing places and 188 stable transitions
Detected a total of 186/303 stabilizing places and 188/278 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 306 ms. Reduced automaton from 5 states, 9 edges and 3 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 113 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1123765 steps, run timeout after 3001 ms. (steps per millisecond=374 ) properties seen :{}
Probabilistic random walk after 1123765 steps, saw 159863 distinct states, run finished after 3004 ms. (steps per millisecond=374 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 278 rows 303 cols
[2022-05-15 14:39:56] [INFO ] Computed 61 place invariants in 3 ms
[2022-05-15 14:39:56] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 14:39:56] [INFO ] [Nat]Absence check using 33 positive place invariants in 8 ms returned sat
[2022-05-15 14:39:56] [INFO ] [Nat]Absence check using 33 positive and 28 generalized place invariants in 7 ms returned sat
[2022-05-15 14:39:56] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 14:39:56] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2022-05-15 14:39:56] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2022-05-15 14:39:56] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2022-05-15 14:39:56] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2022-05-15 14:39:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 180 ms
[2022-05-15 14:39:56] [INFO ] Deduced a trap composed of 52 places in 75 ms of which 1 ms to minimize.
[2022-05-15 14:39:56] [INFO ] Deduced a trap composed of 55 places in 77 ms of which 1 ms to minimize.
[2022-05-15 14:39:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 202 ms
[2022-05-15 14:39:56] [INFO ] After 552ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 28 ms.
[2022-05-15 14:39:56] [INFO ] After 748ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 ms.
Support contains 3 out of 303 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 303/303 places, 278/278 transitions.
Graph (trivial) has 130 edges and 303 vertex of which 6 / 303 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 712 edges and 298 vertex of which 297 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 28 place count 297 transition count 244
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 54 place count 271 transition count 244
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 63 Pre rules applied. Total rules applied 54 place count 271 transition count 181
Deduced a syphon composed of 63 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 135 rules applied. Total rules applied 189 place count 199 transition count 181
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 155 rules applied. Total rules applied 344 place count 120 transition count 105
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 346 place count 119 transition count 108
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 348 place count 119 transition count 106
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 350 place count 117 transition count 106
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 351 place count 117 transition count 106
Applied a total of 351 rules in 37 ms. Remains 117 /303 variables (removed 186) and now considering 106/278 (removed 172) transitions.
Finished structural reductions, in 1 iterations. Remains : 117/303 places, 106/278 transitions.
Incomplete random walk after 10000 steps, including 695 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 307 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 106 rows 117 cols
[2022-05-15 14:39:56] [INFO ] Computed 49 place invariants in 1 ms
[2022-05-15 14:39:57] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 14:39:57] [INFO ] [Nat]Absence check using 34 positive place invariants in 5 ms returned sat
[2022-05-15 14:39:57] [INFO ] [Nat]Absence check using 34 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-15 14:39:57] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 14:39:57] [INFO ] State equation strengthened by 11 read => feed constraints.
[2022-05-15 14:39:57] [INFO ] After 6ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 14:39:57] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2022-05-15 14:39:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2022-05-15 14:39:57] [INFO ] After 59ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-15 14:39:57] [INFO ] After 135ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 117 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 117/117 places, 106/106 transitions.
Applied a total of 0 rules in 7 ms. Remains 117 /117 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 117/117 places, 106/106 transitions.
Incomplete random walk after 10000 steps, including 736 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Finished Best-First random walk after 4990 steps, including 143 resets, run visited all 1 properties in 8 ms. (steps per millisecond=623 )
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p1))), (F (AND (NOT p2) p1))]
Knowledge based reduction with 8 factoid took 317 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 3 out of 303 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 303/303 places, 278/278 transitions.
Graph (trivial) has 128 edges and 303 vertex of which 6 / 303 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 713 edges and 298 vertex of which 297 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 27 place count 296 transition count 245
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 52 place count 271 transition count 245
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 63 Pre rules applied. Total rules applied 52 place count 271 transition count 182
Deduced a syphon composed of 63 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 135 rules applied. Total rules applied 187 place count 199 transition count 182
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 151 rules applied. Total rules applied 338 place count 122 transition count 108
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 340 place count 121 transition count 111
Applied a total of 340 rules in 28 ms. Remains 121 /303 variables (removed 182) and now considering 111/278 (removed 167) transitions.
// Phase 1: matrix 111 rows 121 cols
[2022-05-15 14:39:57] [INFO ] Computed 49 place invariants in 0 ms
[2022-05-15 14:39:57] [INFO ] Implicit Places using invariants in 85 ms returned [1, 2, 12, 37, 38, 42, 43, 44, 45]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 87 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 112/303 places, 111/278 transitions.
Applied a total of 0 rules in 5 ms. Remains 112 /112 variables (removed 0) and now considering 111/111 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 112/303 places, 111/278 transitions.
Computed a total of 67 stabilizing places and 81 stable transitions
Computed a total of 67 stabilizing places and 81 stable transitions
Detected a total of 67/112 stabilizing places and 81/111 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p1)))), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 314 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 2219 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 688 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 111 rows 112 cols
[2022-05-15 14:39:58] [INFO ] Computed 40 place invariants in 2 ms
[2022-05-15 14:39:58] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 14:39:58] [INFO ] [Nat]Absence check using 22 positive place invariants in 3 ms returned sat
[2022-05-15 14:39:58] [INFO ] [Nat]Absence check using 22 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-15 14:39:58] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 14:39:58] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-15 14:39:58] [INFO ] After 8ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 14:39:58] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 0 ms to minimize.
[2022-05-15 14:39:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2022-05-15 14:39:58] [INFO ] After 64ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-05-15 14:39:58] [INFO ] After 137ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 112 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 112/112 places, 111/111 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 112 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 111 transition count 109
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 5 place count 110 transition count 108
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 110 transition count 106
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 9 place count 108 transition count 106
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 10 place count 108 transition count 106
Applied a total of 10 rules in 18 ms. Remains 108 /112 variables (removed 4) and now considering 106/111 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 108/112 places, 106/111 transitions.
Incomplete random walk after 10000 steps, including 709 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 268 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1564 steps, run visited all 1 properties in 7 ms. (steps per millisecond=223 )
Probabilistic random walk after 1564 steps, saw 540 distinct states, run finished after 7 ms. (steps per millisecond=223 ) properties seen :1
Knowledge obtained : [(AND p2 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p1)))), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p1))), (F (AND (NOT p2) p1))]
Knowledge based reduction with 6 factoid took 255 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering criterion allowed to conclude after 47123 steps with 9330 reset in 116 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-LTLFireability-03 finished in 8278 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 286/286 transitions.
Graph (trivial) has 141 edges and 311 vertex of which 6 / 311 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 721 edges and 306 vertex of which 305 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 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 31 place count 304 transition count 249
Reduce places removed 29 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 30 rules applied. Total rules applied 61 place count 275 transition count 248
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 274 transition count 248
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 62 place count 274 transition count 183
Deduced a syphon composed of 65 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 139 rules applied. Total rules applied 201 place count 200 transition count 183
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 206 place count 195 transition count 178
Iterating global reduction 3 with 5 rules applied. Total rules applied 211 place count 195 transition count 178
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 211 place count 195 transition count 177
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 213 place count 194 transition count 177
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 151 rules applied. Total rules applied 364 place count 117 transition count 103
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 3 with 2 rules applied. Total rules applied 366 place count 116 transition count 106
Applied a total of 366 rules in 44 ms. Remains 116 /311 variables (removed 195) and now considering 106/286 (removed 180) transitions.
// Phase 1: matrix 106 rows 116 cols
[2022-05-15 14:39:59] [INFO ] Computed 49 place invariants in 0 ms
[2022-05-15 14:39:59] [INFO ] Implicit Places using invariants in 71 ms returned [1, 11, 36, 37, 38, 39, 40, 41, 42]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 77 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 107/311 places, 106/286 transitions.
Applied a total of 0 rules in 8 ms. Remains 107 /107 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 107/311 places, 106/286 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-LTLFireability-04 finished in 207 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 286/286 transitions.
Graph (trivial) has 142 edges and 311 vertex of which 6 / 311 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 721 edges and 306 vertex of which 305 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 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 32 place count 304 transition count 248
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 62 place count 274 transition count 248
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 62 place count 274 transition count 183
Deduced a syphon composed of 65 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 139 rules applied. Total rules applied 201 place count 200 transition count 183
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 206 place count 195 transition count 178
Iterating global reduction 2 with 5 rules applied. Total rules applied 211 place count 195 transition count 178
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 211 place count 195 transition count 177
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 213 place count 194 transition count 177
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 149 rules applied. Total rules applied 362 place count 118 transition count 104
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 364 place count 117 transition count 107
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 370 place count 117 transition count 107
Applied a total of 370 rules in 28 ms. Remains 117 /311 variables (removed 194) and now considering 107/286 (removed 179) transitions.
// Phase 1: matrix 107 rows 117 cols
[2022-05-15 14:39:59] [INFO ] Computed 49 place invariants in 1 ms
[2022-05-15 14:39:59] [INFO ] Implicit Places using invariants in 129 ms returned [1, 2, 10, 35, 36, 37, 38, 39, 40, 41]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 131 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 107/311 places, 107/286 transitions.
Applied a total of 0 rules in 4 ms. Remains 107 /107 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 107/311 places, 107/286 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-05 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 s73 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-07-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-LTLFireability-05 finished in 237 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(!p0 U p1)))'
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 286/286 transitions.
Graph (trivial) has 140 edges and 311 vertex of which 6 / 311 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 721 edges and 306 vertex of which 305 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 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 31 place count 304 transition count 249
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 60 place count 275 transition count 249
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 60 place count 275 transition count 185
Deduced a syphon composed of 64 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 136 rules applied. Total rules applied 196 place count 203 transition count 185
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 201 place count 198 transition count 180
Iterating global reduction 2 with 5 rules applied. Total rules applied 206 place count 198 transition count 180
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 206 place count 198 transition count 179
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 208 place count 197 transition count 179
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 149 rules applied. Total rules applied 357 place count 121 transition count 106
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 359 place count 120 transition count 109
Applied a total of 359 rules in 25 ms. Remains 120 /311 variables (removed 191) and now considering 109/286 (removed 177) transitions.
// Phase 1: matrix 109 rows 120 cols
[2022-05-15 14:40:00] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-15 14:40:00] [INFO ] Implicit Places using invariants in 147 ms returned [1, 2, 10, 35, 39, 40, 41, 42, 43, 44, 91]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 148 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/311 places, 109/286 transitions.
Applied a total of 0 rules in 4 ms. Remains 109 /109 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 109/311 places, 109/286 transitions.
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(EQ s37 1), p1:(AND (EQ s33 1) (EQ s37 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-LTLFireability-07 finished in 812 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (F(p2)||p1)))'
Support contains 4 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 286/286 transitions.
Graph (trivial) has 137 edges and 311 vertex of which 6 / 311 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 721 edges and 306 vertex of which 305 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 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 30 place count 304 transition count 250
Reduce places removed 28 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 29 rules applied. Total rules applied 59 place count 276 transition count 249
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 275 transition count 249
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 60 place count 275 transition count 184
Deduced a syphon composed of 65 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 139 rules applied. Total rules applied 199 place count 201 transition count 184
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 202 place count 198 transition count 181
Iterating global reduction 3 with 3 rules applied. Total rules applied 205 place count 198 transition count 181
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 205 place count 198 transition count 180
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 207 place count 197 transition count 180
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 147 rules applied. Total rules applied 354 place count 122 transition count 108
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 3 with 2 rules applied. Total rules applied 356 place count 121 transition count 111
Applied a total of 356 rules in 22 ms. Remains 121 /311 variables (removed 190) and now considering 111/286 (removed 175) transitions.
// Phase 1: matrix 111 rows 121 cols
[2022-05-15 14:40:00] [INFO ] Computed 49 place invariants in 1 ms
[2022-05-15 14:40:00] [INFO ] Implicit Places using invariants in 148 ms returned [1, 2, 10, 35, 36, 37, 38, 39, 42]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 150 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 112/311 places, 111/286 transitions.
Applied a total of 0 rules in 14 ms. Remains 112 /112 variables (removed 0) and now considering 111/111 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 112/311 places, 111/286 transitions.
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s33 1) (EQ s78 1)), p2:(EQ s78 1), p0:(AND (EQ s78 1) (OR (EQ s40 1) (EQ s72 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-LTLFireability-09 finished in 290 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(X(p0)))&&X(G(p1))))'
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 311/311 places, 286/286 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 305 transition count 280
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 305 transition count 280
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 303 transition count 278
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 303 transition count 278
Applied a total of 16 rules in 13 ms. Remains 303 /311 variables (removed 8) and now considering 278/286 (removed 8) transitions.
// Phase 1: matrix 278 rows 303 cols
[2022-05-15 14:40:00] [INFO ] Computed 61 place invariants in 3 ms
[2022-05-15 14:40:01] [INFO ] Implicit Places using invariants in 106 ms returned []
// Phase 1: matrix 278 rows 303 cols
[2022-05-15 14:40:01] [INFO ] Computed 61 place invariants in 2 ms
[2022-05-15 14:40:01] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
// Phase 1: matrix 278 rows 303 cols
[2022-05-15 14:40:01] [INFO ] Computed 61 place invariants in 6 ms
[2022-05-15 14:40:01] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 303/311 places, 278/286 transitions.
Finished structural reductions, in 1 iterations. Remains : 303/311 places, 278/286 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(EQ s103 1), p0:(EQ s233 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][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-07-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-LTLFireability-10 finished in 705 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(p0))))'
Support contains 1 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 286/286 transitions.
Graph (trivial) has 142 edges and 311 vertex of which 6 / 311 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 721 edges and 306 vertex of which 305 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 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 32 place count 304 transition count 248
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 62 place count 274 transition count 248
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 62 place count 274 transition count 183
Deduced a syphon composed of 65 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 139 rules applied. Total rules applied 201 place count 200 transition count 183
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 206 place count 195 transition count 178
Iterating global reduction 2 with 5 rules applied. Total rules applied 211 place count 195 transition count 178
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 211 place count 195 transition count 177
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 213 place count 194 transition count 177
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 149 rules applied. Total rules applied 362 place count 118 transition count 104
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 364 place count 117 transition count 107
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 370 place count 117 transition count 107
Applied a total of 370 rules in 19 ms. Remains 117 /311 variables (removed 194) and now considering 107/286 (removed 179) transitions.
// Phase 1: matrix 107 rows 117 cols
[2022-05-15 14:40:01] [INFO ] Computed 49 place invariants in 1 ms
[2022-05-15 14:40:01] [INFO ] Implicit Places using invariants in 76 ms returned [1, 2, 10, 36, 37, 38, 39, 40, 41, 42]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 77 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 107/311 places, 107/286 transitions.
Applied a total of 0 rules in 2 ms. Remains 107 /107 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 107/311 places, 107/286 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-11 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 s11 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-07-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-LTLFireability-11 finished in 144 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(G(F(!(X(p0) U X(p1))))))'
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 286/286 transitions.
Graph (trivial) has 141 edges and 311 vertex of which 6 / 311 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 721 edges and 306 vertex of which 305 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 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 32 place count 304 transition count 248
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 62 place count 274 transition count 248
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 62 place count 274 transition count 183
Deduced a syphon composed of 65 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 139 rules applied. Total rules applied 201 place count 200 transition count 183
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 205 place count 196 transition count 179
Iterating global reduction 2 with 4 rules applied. Total rules applied 209 place count 196 transition count 179
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 209 place count 196 transition count 178
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 211 place count 195 transition count 178
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 149 rules applied. Total rules applied 360 place count 119 transition count 105
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 362 place count 118 transition count 108
Applied a total of 362 rules in 15 ms. Remains 118 /311 variables (removed 193) and now considering 108/286 (removed 178) transitions.
// Phase 1: matrix 108 rows 118 cols
[2022-05-15 14:40:01] [INFO ] Computed 49 place invariants in 1 ms
[2022-05-15 14:40:01] [INFO ] Implicit Places using invariants in 78 ms returned [1, 2, 10, 35, 36, 37, 38, 39, 40, 41]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 79 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/311 places, 108/286 transitions.
Applied a total of 0 rules in 6 ms. Remains 108 /108 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 108/311 places, 108/286 transitions.
Stuttering acceptance computed with spot in 61 ms :[p1, p1]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s69 1), p0:(EQ s34 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 14341 reset in 151 ms.
Product exploration explored 100000 steps with 14484 reset in 179 ms.
Computed a total of 67 stabilizing places and 81 stable transitions
Computed a total of 67 stabilizing places and 81 stable transitions
Detected a total of 67/108 stabilizing places and 81/108 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 5 factoid took 201 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 65 ms :[p1, p1]
Incomplete random walk after 10000 steps, including 1575 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 509 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 108 rows 108 cols
[2022-05-15 14:40:02] [INFO ] Computed 39 place invariants in 2 ms
[2022-05-15 14:40:02] [INFO ] [Real]Absence check using 22 positive place invariants in 9 ms returned sat
[2022-05-15 14:40:02] [INFO ] [Real]Absence check using 22 positive and 17 generalized place invariants in 7 ms returned sat
[2022-05-15 14:40:02] [INFO ] After 29ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 14:40:02] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-15 14:40:02] [INFO ] After 7ms SMT Verify possible using 4 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 14:40:02] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 14:40:02] [INFO ] [Nat]Absence check using 22 positive place invariants in 2 ms returned sat
[2022-05-15 14:40:02] [INFO ] [Nat]Absence check using 22 positive and 17 generalized place invariants in 3 ms returned sat
[2022-05-15 14:40:02] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 14:40:02] [INFO ] After 4ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 14:40:02] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-05-15 14:40:02] [INFO ] After 77ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 108 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 108/108 places, 108/108 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 108 transition count 107
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 1 with 4 rules applied. Total rules applied 5 place count 106 transition count 105
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 106 transition count 103
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 9 place count 104 transition count 103
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 104 transition count 103
Applied a total of 10 rules in 8 ms. Remains 104 /108 variables (removed 4) and now considering 103/108 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 104/108 places, 103/108 transitions.
Finished random walk after 63 steps, including 4 resets, run visited all 1 properties in 1 ms. (steps per millisecond=63 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F p1), (F (AND (NOT p1) p0))]
Knowledge based reduction with 5 factoid took 236 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 65 ms :[p1, p1]
Stuttering acceptance computed with spot in 57 ms :[p1, p1]
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 108/108 transitions.
Applied a total of 0 rules in 7 ms. Remains 108 /108 variables (removed 0) and now considering 108/108 (removed 0) transitions.
// Phase 1: matrix 108 rows 108 cols
[2022-05-15 14:40:03] [INFO ] Computed 39 place invariants in 1 ms
[2022-05-15 14:40:03] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 108 rows 108 cols
[2022-05-15 14:40:03] [INFO ] Computed 39 place invariants in 0 ms
[2022-05-15 14:40:03] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-15 14:40:03] [INFO ] Implicit Places using invariants and state equation in 126 ms returned [10, 57, 59, 65, 67]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 201 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/108 places, 108/108 transitions.
Graph (complete) has 392 edges and 103 vertex of which 94 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 94 transition count 103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 93 transition count 103
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 13 place count 83 transition count 65
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 83 transition count 65
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 82 transition count 64
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 82 transition count 64
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 27 place count 81 transition count 63
Applied a total of 27 rules in 18 ms. Remains 81 /103 variables (removed 22) and now considering 63/108 (removed 45) transitions.
// Phase 1: matrix 63 rows 81 cols
[2022-05-15 14:40:03] [INFO ] Computed 29 place invariants in 1 ms
[2022-05-15 14:40:03] [INFO ] Implicit Places using invariants in 61 ms returned [10, 11, 12]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 61 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 78/108 places, 63/108 transitions.
Applied a total of 0 rules in 2 ms. Remains 78 /78 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 78/108 places, 63/108 transitions.
Computed a total of 37 stabilizing places and 36 stable transitions
Computed a total of 37 stabilizing places and 36 stable transitions
Detected a total of 37/78 stabilizing places and 36/63 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 5 factoid took 216 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 59 ms :[p1, p1]
Incomplete random walk after 10000 steps, including 1612 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 535 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 63 rows 78 cols
[2022-05-15 14:40:03] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-15 14:40:03] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-15 14:40:03] [INFO ] [Real]Absence check using 17 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-15 14:40:03] [INFO ] After 18ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 14:40:03] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-15 14:40:03] [INFO ] After 15ms SMT Verify possible using 3 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 14:40:03] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 14:40:03] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-15 14:40:03] [INFO ] [Nat]Absence check using 17 positive and 9 generalized place invariants in 1 ms returned sat
[2022-05-15 14:40:03] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 14:40:03] [INFO ] After 3ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 14:40:03] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-05-15 14:40:03] [INFO ] After 61ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 78 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 78/78 places, 63/63 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 78 transition count 62
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 5 place count 76 transition count 60
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 76 transition count 58
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 9 place count 74 transition count 58
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 12 place count 74 transition count 55
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 15 place count 71 transition count 55
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 16 place count 71 transition count 55
Applied a total of 16 rules in 9 ms. Remains 71 /78 variables (removed 7) and now considering 55/63 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 71/78 places, 55/63 transitions.
Finished random walk after 24 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F p1), (F (AND (NOT p1) p0))]
Knowledge based reduction with 5 factoid took 251 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 65 ms :[p1, p1]
Stuttering acceptance computed with spot in 63 ms :[p1, p1]
Stuttering acceptance computed with spot in 56 ms :[p1, p1]
Product exploration explored 100000 steps with 14725 reset in 105 ms.
Product exploration explored 100000 steps with 14686 reset in 121 ms.
Built C files in :
/tmp/ltsmin16445330516220018087
[2022-05-15 14:40:04] [INFO ] Computing symmetric may disable matrix : 63 transitions.
[2022-05-15 14:40:04] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 14:40:04] [INFO ] Computing symmetric may enable matrix : 63 transitions.
[2022-05-15 14:40:04] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 14:40:04] [INFO ] Computing Do-Not-Accords matrix : 63 transitions.
[2022-05-15 14:40:04] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 14:40:04] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16445330516220018087
Running compilation step : cd /tmp/ltsmin16445330516220018087;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1316 ms.
Running link step : cd /tmp/ltsmin16445330516220018087;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin16445330516220018087;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14875527449458225637.hoa' '--buchi-type=spotba'
LTSmin run took 2366 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-12 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-07-LTLFireability-12 finished in 6557 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||p1)))'
Support contains 3 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 286/286 transitions.
Graph (trivial) has 139 edges and 311 vertex of which 6 / 311 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 721 edges and 306 vertex of which 305 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 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 32 place count 304 transition count 248
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 62 place count 274 transition count 248
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 62 Pre rules applied. Total rules applied 62 place count 274 transition count 186
Deduced a syphon composed of 62 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 132 rules applied. Total rules applied 194 place count 204 transition count 186
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 199 place count 199 transition count 181
Iterating global reduction 2 with 5 rules applied. Total rules applied 204 place count 199 transition count 181
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 204 place count 199 transition count 180
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 198 transition count 180
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 151 rules applied. Total rules applied 357 place count 121 transition count 106
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 359 place count 120 transition count 109
Applied a total of 359 rules in 21 ms. Remains 120 /311 variables (removed 191) and now considering 109/286 (removed 177) transitions.
// Phase 1: matrix 109 rows 120 cols
[2022-05-15 14:40:08] [INFO ] Computed 50 place invariants in 4 ms
[2022-05-15 14:40:08] [INFO ] Implicit Places using invariants in 83 ms returned [1, 2, 11, 38, 39, 40, 41, 42, 43, 44]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 92 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 110/311 places, 109/286 transitions.
Applied a total of 0 rules in 3 ms. Remains 110 /110 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 110/311 places, 109/286 transitions.
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s5 1), p1:(AND (EQ s15 1) (EQ s79 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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-07-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-LTLFireability-14 finished in 160 ms.
All properties solved by simple procedures.
Total runtime 21533 ms.

BK_STOP 1652625608556

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-07"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-07, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r024-tall-165251918400372"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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