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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 336K
-rw-r--r-- 1 mcc users 7.2K Apr 29 23:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 29 23:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 29 23:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 29 23:49 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.6K May 9 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 91K 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-08-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652625935727

Running Version 202205111006
[2022-05-15 14:45:36] [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:45:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 14:45:37] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2022-05-15 14:45:37] [INFO ] Transformed 393 places.
[2022-05-15 14:45:37] [INFO ] Transformed 344 transitions.
[2022-05-15 14:45:37] [INFO ] Found NUPN structural information;
[2022-05-15 14:45:37] [INFO ] Parsed PT model containing 393 places and 344 transitions in 219 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 6 formulas.
Deduced a syphon composed of 13 places in 5 ms
Reduce places removed 13 places and 13 transitions.
FORMULA BusinessProcesses-PT-08-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 331/331 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 372 transition count 331
Discarding 64 places :
Symmetric choice reduction at 1 with 64 rule applications. Total rules 72 place count 308 transition count 267
Iterating global reduction 1 with 64 rules applied. Total rules applied 136 place count 308 transition count 267
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 137 place count 308 transition count 266
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 175 place count 270 transition count 228
Iterating global reduction 2 with 38 rules applied. Total rules applied 213 place count 270 transition count 228
Applied a total of 213 rules in 82 ms. Remains 270 /380 variables (removed 110) and now considering 228/331 (removed 103) transitions.
// Phase 1: matrix 228 rows 270 cols
[2022-05-15 14:45:37] [INFO ] Computed 50 place invariants in 14 ms
[2022-05-15 14:45:37] [INFO ] Implicit Places using invariants in 219 ms returned []
// Phase 1: matrix 228 rows 270 cols
[2022-05-15 14:45:37] [INFO ] Computed 50 place invariants in 10 ms
[2022-05-15 14:45:37] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
// Phase 1: matrix 228 rows 270 cols
[2022-05-15 14:45:37] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-15 14:45:37] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 270/380 places, 228/331 transitions.
Finished structural reductions, in 1 iterations. Remains : 270/380 places, 228/331 transitions.
Support contains 42 out of 270 places after structural reductions.
[2022-05-15 14:45:38] [INFO ] Flatten gal took : 50 ms
[2022-05-15 14:45:38] [INFO ] Flatten gal took : 19 ms
[2022-05-15 14:45:38] [INFO ] Input system was already deterministic with 228 transitions.
Support contains 38 out of 270 places (down from 42) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 85 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 24) seen :20
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 228 rows 270 cols
[2022-05-15 14:45:38] [INFO ] Computed 50 place invariants in 8 ms
[2022-05-15 14:45:38] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2022-05-15 14:45:39] [INFO ] [Nat]Absence check using 50 positive place invariants in 18 ms returned sat
[2022-05-15 14:45:39] [INFO ] After 114ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2022-05-15 14:45:39] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 3 ms to minimize.
[2022-05-15 14:45:39] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2022-05-15 14:45:39] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2022-05-15 14:45:39] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2022-05-15 14:45:39] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2022-05-15 14:45:39] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 0 ms to minimize.
[2022-05-15 14:45:39] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2022-05-15 14:45:39] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2022-05-15 14:45:39] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 449 ms
[2022-05-15 14:45:39] [INFO ] After 623ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 40 ms.
[2022-05-15 14:45:39] [INFO ] After 765ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 2 properties in 12 ms.
Support contains 4 out of 270 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 270/270 places, 228/228 transitions.
Graph (complete) has 570 edges and 270 vertex of which 269 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
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 269 transition count 192
Reduce places removed 34 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 37 rules applied. Total rules applied 73 place count 235 transition count 189
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 76 place count 232 transition count 189
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 55 Pre rules applied. Total rules applied 76 place count 232 transition count 134
Deduced a syphon composed of 55 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 121 rules applied. Total rules applied 197 place count 166 transition count 134
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 205 place count 158 transition count 126
Iterating global reduction 3 with 8 rules applied. Total rules applied 213 place count 158 transition count 126
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 213 place count 158 transition count 125
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 215 place count 157 transition count 125
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 3 with 149 rules applied. Total rules applied 364 place count 81 transition count 52
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 365 place count 81 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 366 place count 80 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 367 place count 79 transition count 50
Applied a total of 367 rules in 46 ms. Remains 79 /270 variables (removed 191) and now considering 50/228 (removed 178) transitions.
Finished structural reductions, in 1 iterations. Remains : 79/270 places, 50/228 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Finished probabilistic random walk after 182 steps, run visited all 1 properties in 10 ms. (steps per millisecond=18 )
Probabilistic random walk after 182 steps, saw 70 distinct states, run finished after 10 ms. (steps per millisecond=18 ) properties seen :1
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Computed a total of 93 stabilizing places and 89 stable transitions
Graph (complete) has 570 edges and 270 vertex of which 269 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0) U !X(!G(X(X(G(p1))))))))'
Support contains 4 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 228/228 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 262 transition count 220
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 262 transition count 220
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 259 transition count 217
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 259 transition count 217
Applied a total of 22 rules in 19 ms. Remains 259 /270 variables (removed 11) and now considering 217/228 (removed 11) transitions.
// Phase 1: matrix 217 rows 259 cols
[2022-05-15 14:45:40] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-15 14:45:40] [INFO ] Implicit Places using invariants in 84 ms returned []
// Phase 1: matrix 217 rows 259 cols
[2022-05-15 14:45:40] [INFO ] Computed 50 place invariants in 3 ms
[2022-05-15 14:45:40] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
// Phase 1: matrix 217 rows 259 cols
[2022-05-15 14:45:40] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-15 14:45:40] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 259/270 places, 217/228 transitions.
Finished structural reductions, in 1 iterations. Remains : 259/270 places, 217/228 transitions.
Stuttering acceptance computed with spot in 459 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) p1)]
Running random walk in product with property : BusinessProcesses-PT-08-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 3}, { cond=p0, acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 8}], [{ cond=(NOT p0), acceptance={} source=7 dest: 0}, { cond=p0, acceptance={} source=7 dest: 1}, { cond=(AND p0 p1), acceptance={} source=7 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 4}, { cond=(AND p0 p1), acceptance={} source=8 dest: 8}]], initial=7, aps=[p0:(EQ s119 1), p1:(AND (EQ s105 1) (EQ s221 1) (EQ s258 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-08-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-LTLFireability-00 finished in 935 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0) U (F(p1)&&p2)))))'
Support contains 5 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 228/228 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 262 transition count 220
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 262 transition count 220
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 259 transition count 217
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 259 transition count 217
Applied a total of 22 rules in 19 ms. Remains 259 /270 variables (removed 11) and now considering 217/228 (removed 11) transitions.
// Phase 1: matrix 217 rows 259 cols
[2022-05-15 14:45:41] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-15 14:45:41] [INFO ] Implicit Places using invariants in 82 ms returned []
// Phase 1: matrix 217 rows 259 cols
[2022-05-15 14:45:41] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-15 14:45:41] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
// Phase 1: matrix 217 rows 259 cols
[2022-05-15 14:45:41] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-15 14:45:41] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 259/270 places, 217/228 transitions.
Finished structural reductions, in 1 iterations. Remains : 259/270 places, 217/228 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true, (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-08-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(EQ s81 1), p0:(EQ s46 1), p1:(AND (EQ s63 1) (EQ s189 1) (EQ s244 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-08-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-LTLFireability-01 finished in 569 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((((F(G(p0)) U G(p1))||p0) U (F(p2) U p1))))'
Support contains 5 out of 270 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 270/270 places, 228/228 transitions.
Graph (trivial) has 135 edges and 270 vertex of which 6 / 270 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 563 edges and 265 vertex of which 264 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 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 37 place count 263 transition count 185
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 72 place count 228 transition count 185
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 72 place count 228 transition count 135
Deduced a syphon composed of 50 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 110 rules applied. Total rules applied 182 place count 168 transition count 135
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 187 place count 163 transition count 130
Iterating global reduction 2 with 5 rules applied. Total rules applied 192 place count 163 transition count 130
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 192 place count 163 transition count 129
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 194 place count 162 transition count 129
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 153 rules applied. Total rules applied 347 place count 84 transition count 54
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 348 place count 83 transition count 53
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 349 place count 82 transition count 53
Applied a total of 349 rules in 46 ms. Remains 82 /270 variables (removed 188) and now considering 53/228 (removed 175) transitions.
// Phase 1: matrix 53 rows 82 cols
[2022-05-15 14:45:41] [INFO ] Computed 36 place invariants in 1 ms
[2022-05-15 14:45:41] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 53 rows 82 cols
[2022-05-15 14:45:41] [INFO ] Computed 36 place invariants in 0 ms
[2022-05-15 14:45:41] [INFO ] Implicit Places using invariants and state equation in 81 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 15, 17, 19, 21, 22, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61]
Discarding 37 places :
Implicit Place search using SMT with State Equation took 140 ms to find 37 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/270 places, 53/228 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 45 transition count 46
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 38 transition count 46
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 20 place count 32 transition count 40
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 32 transition count 40
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 29 place count 32 transition count 37
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 32 place count 29 transition count 37
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 38 place count 26 transition count 34
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 39 place count 26 transition count 33
Applied a total of 39 rules in 11 ms. Remains 26 /45 variables (removed 19) and now considering 33/53 (removed 20) transitions.
// Phase 1: matrix 33 rows 26 cols
[2022-05-15 14:45:41] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 14:45:41] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 33 rows 26 cols
[2022-05-15 14:45:41] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 14:45:41] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 26/270 places, 33/228 transitions.
Finished structural reductions, in 2 iterations. Remains : 26/270 places, 33/228 transitions.
Stuttering acceptance computed with spot in 239 ms :[(NOT p1), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-08-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s20 1), p2:(EQ s23 1), p0:(AND (EQ s0 1) (EQ s6 1) (EQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-08-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-LTLFireability-02 finished in 512 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0))||F(X(p1))))'
Support contains 2 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 228/228 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 264 transition count 222
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 264 transition count 222
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 262 transition count 220
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 262 transition count 220
Applied a total of 16 rules in 19 ms. Remains 262 /270 variables (removed 8) and now considering 220/228 (removed 8) transitions.
// Phase 1: matrix 220 rows 262 cols
[2022-05-15 14:45:42] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-15 14:45:42] [INFO ] Implicit Places using invariants in 84 ms returned []
// Phase 1: matrix 220 rows 262 cols
[2022-05-15 14:45:42] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-15 14:45:42] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
// Phase 1: matrix 220 rows 262 cols
[2022-05-15 14:45:42] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-15 14:45:42] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 262/270 places, 220/228 transitions.
Finished structural reductions, in 1 iterations. Remains : 262/270 places, 220/228 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-08-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s194 0), p0:(EQ s255 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 400 ms.
Product exploration explored 100000 steps with 50000 reset in 241 ms.
Computed a total of 91 stabilizing places and 87 stable transitions
Graph (complete) has 556 edges and 262 vertex of which 261 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 91 stabilizing places and 87 stable transitions
Detected a total of 91/262 stabilizing places and 87/220 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 7 factoid took 134 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA BusinessProcesses-PT-08-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-08-LTLFireability-06 finished in 1330 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||X(p1))))'
Support contains 4 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 228/228 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 262 transition count 220
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 262 transition count 220
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 259 transition count 217
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 259 transition count 217
Applied a total of 22 rules in 19 ms. Remains 259 /270 variables (removed 11) and now considering 217/228 (removed 11) transitions.
// Phase 1: matrix 217 rows 259 cols
[2022-05-15 14:45:43] [INFO ] Computed 50 place invariants in 3 ms
[2022-05-15 14:45:43] [INFO ] Implicit Places using invariants in 88 ms returned []
// Phase 1: matrix 217 rows 259 cols
[2022-05-15 14:45:43] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-15 14:45:43] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
// Phase 1: matrix 217 rows 259 cols
[2022-05-15 14:45:43] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-15 14:45:43] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 259/270 places, 217/228 transitions.
Finished structural reductions, in 1 iterations. Remains : 259/270 places, 217/228 transitions.
Stuttering acceptance computed with spot in 172 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-08-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(EQ s54 0), p1:(OR (EQ s36 0) (EQ s165 0) (EQ s234 0))], 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, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 852 reset in 255 ms.
Product exploration explored 100000 steps with 848 reset in 229 ms.
Computed a total of 90 stabilizing places and 86 stable transitions
Graph (complete) has 551 edges and 259 vertex of which 258 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 90 stabilizing places and 86 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), true, (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 569 ms. Reduced automaton from 5 states, 12 edges and 2 AP to 5 states, 11 edges and 2 AP.
Stuttering acceptance computed with spot in 166 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 89 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 217 rows 259 cols
[2022-05-15 14:45:45] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-15 14:45:45] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 14:45:45] [INFO ] [Nat]Absence check using 50 positive place invariants in 11 ms returned sat
[2022-05-15 14:45:45] [INFO ] After 86ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2022-05-15 14:45:45] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2022-05-15 14:45:45] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2022-05-15 14:45:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 122 ms
[2022-05-15 14:45:45] [INFO ] After 239ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 20 ms.
[2022-05-15 14:45:45] [INFO ] After 338ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 125 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=41 )
Parikh walk visited 2 properties in 2 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), true, (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p0 (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 14 factoid took 525 ms. Reduced automaton from 5 states, 11 edges and 2 AP to 5 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 151 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 151 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 4 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 217/217 transitions.
Applied a total of 0 rules in 7 ms. Remains 259 /259 variables (removed 0) and now considering 217/217 (removed 0) transitions.
// Phase 1: matrix 217 rows 259 cols
[2022-05-15 14:45:46] [INFO ] Computed 50 place invariants in 3 ms
[2022-05-15 14:45:46] [INFO ] Implicit Places using invariants in 91 ms returned []
// Phase 1: matrix 217 rows 259 cols
[2022-05-15 14:45:46] [INFO ] Computed 50 place invariants in 3 ms
[2022-05-15 14:45:47] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
// Phase 1: matrix 217 rows 259 cols
[2022-05-15 14:45:47] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-15 14:45:47] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 259/259 places, 217/217 transitions.
Computed a total of 90 stabilizing places and 86 stable transitions
Graph (complete) has 551 edges and 259 vertex of which 258 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 90 stabilizing places and 86 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (AND p0 p1)), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 279 ms. Reduced automaton from 5 states, 10 edges and 2 AP to 5 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 148 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 86 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 16 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 15 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 217 rows 259 cols
[2022-05-15 14:45:47] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-15 14:45:47] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 14:45:47] [INFO ] [Nat]Absence check using 50 positive place invariants in 10 ms returned sat
[2022-05-15 14:45:47] [INFO ] After 84ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 14:45:48] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2022-05-15 14:45:48] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2022-05-15 14:45:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 118 ms
[2022-05-15 14:45:48] [INFO ] After 232ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 22 ms.
[2022-05-15 14:45:48] [INFO ] After 318ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 127 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=31 )
Parikh walk visited 2 properties in 4 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (AND p0 p1)), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1)))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 8 factoid took 378 ms. Reduced automaton from 5 states, 10 edges and 2 AP to 5 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 142 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 170 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 176 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 852 reset in 162 ms.
Product exploration explored 100000 steps with 862 reset in 174 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 240 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 4 out of 259 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 259/259 places, 217/217 transitions.
Graph (trivial) has 126 edges and 259 vertex of which 6 / 259 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 544 edges and 254 vertex of which 253 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
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 29 rules applied. Total rules applied 31 place count 253 transition count 210
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 36 Pre rules applied. Total rules applied 31 place count 253 transition count 238
Deduced a syphon composed of 65 places in 1 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 67 place count 253 transition count 238
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 76 place count 244 transition count 224
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 85 place count 244 transition count 224
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 149 places in 0 ms
Iterating global reduction 1 with 93 rules applied. Total rules applied 178 place count 244 transition count 224
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 198 place count 224 transition count 204
Deduced a syphon composed of 129 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 218 place count 224 transition count 204
Deduced a syphon composed of 129 places in 0 ms
Applied a total of 218 rules in 47 ms. Remains 224 /259 variables (removed 35) and now considering 204/217 (removed 13) transitions.
[2022-05-15 14:45:49] [INFO ] Redundant transitions in 46 ms returned []
// Phase 1: matrix 204 rows 224 cols
[2022-05-15 14:45:49] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-15 14:45:50] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 224/259 places, 204/217 transitions.
Finished structural reductions, in 1 iterations. Remains : 224/259 places, 204/217 transitions.
Product exploration explored 100000 steps with 854 reset in 284 ms.
Product exploration explored 100000 steps with 847 reset in 274 ms.
Built C files in :
/tmp/ltsmin16413646568985047464
[2022-05-15 14:45:50] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16413646568985047464
Running compilation step : cd /tmp/ltsmin16413646568985047464;'/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 407 ms.
Running link step : cd /tmp/ltsmin16413646568985047464;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin16413646568985047464;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12000287219967109467.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 217/217 transitions.
Applied a total of 0 rules in 11 ms. Remains 259 /259 variables (removed 0) and now considering 217/217 (removed 0) transitions.
// Phase 1: matrix 217 rows 259 cols
[2022-05-15 14:46:05] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-15 14:46:05] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 217 rows 259 cols
[2022-05-15 14:46:05] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-15 14:46:06] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
// Phase 1: matrix 217 rows 259 cols
[2022-05-15 14:46:06] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-15 14:46:06] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 259/259 places, 217/217 transitions.
Built C files in :
/tmp/ltsmin6573435303109213158
[2022-05-15 14:46:06] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6573435303109213158
Running compilation step : cd /tmp/ltsmin6573435303109213158;'/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 325 ms.
Running link step : cd /tmp/ltsmin6573435303109213158;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin6573435303109213158;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5807319052574706148.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 14:46:21] [INFO ] Flatten gal took : 13 ms
[2022-05-15 14:46:21] [INFO ] Flatten gal took : 12 ms
[2022-05-15 14:46:21] [INFO ] Time to serialize gal into /tmp/LTL6346934699409141431.gal : 4 ms
[2022-05-15 14:46:21] [INFO ] Time to serialize properties into /tmp/LTL15943405599046926015.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6346934699409141431.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15943405599046926015.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6346934...267
Read 1 LTL properties
Checking formula 0 : !((G((G("(p63==0)"))||(X("(((p39==0)||(p217==0))||(p318==0))")))))
Formula 0 simplified : !G(G"(p63==0)" | X"(((p39==0)||(p217==0))||(p318==0))")
Detected timeout of ITS tools.
[2022-05-15 14:46:36] [INFO ] Flatten gal took : 13 ms
[2022-05-15 14:46:36] [INFO ] Applying decomposition
[2022-05-15 14:46:36] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11314523682090618856.txt' '-o' '/tmp/graph11314523682090618856.bin' '-w' '/tmp/graph11314523682090618856.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11314523682090618856.bin' '-l' '-1' '-v' '-w' '/tmp/graph11314523682090618856.weights' '-q' '0' '-e' '0.001'
[2022-05-15 14:46:36] [INFO ] Decomposing Gal with order
[2022-05-15 14:46:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 14:46:36] [INFO ] Removed a total of 89 redundant transitions.
[2022-05-15 14:46:36] [INFO ] Flatten gal took : 48 ms
[2022-05-15 14:46:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 7 ms.
[2022-05-15 14:46:36] [INFO ] Time to serialize gal into /tmp/LTL4715032275034320399.gal : 5 ms
[2022-05-15 14:46:36] [INFO ] Time to serialize properties into /tmp/LTL5395267397201026548.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4715032275034320399.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5395267397201026548.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4715032...245
Read 1 LTL properties
Checking formula 0 : !((G((G("(i5.u20.p63==0)"))||(X("(((i7.u13.p39==0)||(i14.u59.p217==0))||(i7.u77.p318==0))")))))
Formula 0 simplified : !G(G"(i5.u20.p63==0)" | X"(((i7.u13.p39==0)||(i14.u59.p217==0))||(i7.u77.p318==0))")
Reverse transition relation is NOT exact ! Due to transitions t117, t200, t204, t208, t211, t213, t214, t218, t223, t225, t226, i0.i0.u73.t36, i0.i1.u39.t1...798
Computing Next relation with stutter on 26 deadlock states
1604 unique states visited
5 strongly connected components in search stack
1662 transitions explored
61 items max in DFS search stack
666 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.69881,226176,1,0,455605,358,3324,629421,166,1340,910090
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-08-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property BusinessProcesses-PT-08-LTLFireability-08 finished in 61041 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 228/228 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 263 transition count 221
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 263 transition count 221
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 261 transition count 219
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 261 transition count 219
Applied a total of 18 rules in 18 ms. Remains 261 /270 variables (removed 9) and now considering 219/228 (removed 9) transitions.
// Phase 1: matrix 219 rows 261 cols
[2022-05-15 14:46:44] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-15 14:46:44] [INFO ] Implicit Places using invariants in 102 ms returned []
// Phase 1: matrix 219 rows 261 cols
[2022-05-15 14:46:44] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-15 14:46:44] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
// Phase 1: matrix 219 rows 261 cols
[2022-05-15 14:46:44] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-15 14:46:45] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 261/270 places, 219/228 transitions.
Finished structural reductions, in 1 iterations. Remains : 261/270 places, 219/228 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-08-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s240 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-08-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-LTLFireability-09 finished in 605 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 270 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 270/270 places, 228/228 transitions.
Graph (trivial) has 140 edges and 270 vertex of which 6 / 270 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 563 edges and 265 vertex of which 264 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 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 39 place count 263 transition count 183
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 76 place count 226 transition count 183
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 76 place count 226 transition count 131
Deduced a syphon composed of 52 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 115 rules applied. Total rules applied 191 place count 163 transition count 131
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 197 place count 157 transition count 125
Iterating global reduction 2 with 6 rules applied. Total rules applied 203 place count 157 transition count 125
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 203 place count 157 transition count 124
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 205 place count 156 transition count 124
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 153 rules applied. Total rules applied 358 place count 78 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 359 place count 77 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 360 place count 76 transition count 48
Applied a total of 360 rules in 36 ms. Remains 76 /270 variables (removed 194) and now considering 48/228 (removed 180) transitions.
// Phase 1: matrix 48 rows 76 cols
[2022-05-15 14:46:45] [INFO ] Computed 35 place invariants in 0 ms
[2022-05-15 14:46:45] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 48 rows 76 cols
[2022-05-15 14:46:45] [INFO ] Computed 35 place invariants in 1 ms
[2022-05-15 14:46:45] [INFO ] Implicit Places using invariants and state equation in 78 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 15, 17, 19, 20, 21, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 144 ms to find 38 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 38/270 places, 48/228 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 38 transition count 41
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 31 transition count 41
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 20 place count 25 transition count 35
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 25 transition count 35
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 29 place count 25 transition count 32
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 32 place count 22 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 4 with 6 rules applied. Total rules applied 38 place count 19 transition count 29
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 39 place count 19 transition count 28
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 41 place count 19 transition count 28
Applied a total of 41 rules in 4 ms. Remains 19 /38 variables (removed 19) and now considering 28/48 (removed 20) transitions.
// Phase 1: matrix 28 rows 19 cols
[2022-05-15 14:46:45] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 14:46:45] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 28 rows 19 cols
[2022-05-15 14:46:45] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 14:46:45] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/270 places, 28/228 transitions.
Finished structural reductions, in 2 iterations. Remains : 19/270 places, 28/228 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-08-LTLFireability-11 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 s16 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 24428 reset in 45 ms.
Product exploration explored 100000 steps with 24550 reset in 59 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Finished random walk after 45 steps, including 13 resets, run visited all 1 properties in 1 ms. (steps per millisecond=45 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 19 /19 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 19 cols
[2022-05-15 14:46:46] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 14:46:46] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 28 rows 19 cols
[2022-05-15 14:46:46] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 14:46:46] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2022-05-15 14:46:46] [INFO ] Redundant transitions in 30 ms returned []
// Phase 1: matrix 28 rows 19 cols
[2022-05-15 14:46:46] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 14:46:46] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 19/19 places, 28/28 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Finished random walk after 141 steps, including 49 resets, run visited all 1 properties in 1 ms. (steps per millisecond=141 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 24518 reset in 51 ms.
Product exploration explored 100000 steps with 24574 reset in 51 ms.
Built C files in :
/tmp/ltsmin12653841084276999059
[2022-05-15 14:46:46] [INFO ] Computing symmetric may disable matrix : 28 transitions.
[2022-05-15 14:46:46] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 14:46:46] [INFO ] Computing symmetric may enable matrix : 28 transitions.
[2022-05-15 14:46:46] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 14:46:46] [INFO ] Computing Do-Not-Accords matrix : 28 transitions.
[2022-05-15 14:46:46] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 14:46:46] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12653841084276999059
Running compilation step : cd /tmp/ltsmin12653841084276999059;'/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 94 ms.
Running link step : cd /tmp/ltsmin12653841084276999059;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin12653841084276999059;'/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/stateBased8887839992263947856.hoa' '--buchi-type=spotba'
LTSmin run took 62 ms.
FORMULA BusinessProcesses-PT-08-LTLFireability-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-08-LTLFireability-11 finished in 1922 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!G(!X((F(p0)||p1))) U p2))'
Support contains 8 out of 270 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 270/270 places, 228/228 transitions.
Graph (complete) has 570 edges and 270 vertex of which 269 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 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 268 transition count 194
Reduce places removed 32 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 35 rules applied. Total rules applied 68 place count 236 transition count 191
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 71 place count 233 transition count 191
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 53 Pre rules applied. Total rules applied 71 place count 233 transition count 138
Deduced a syphon composed of 53 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 187 place count 170 transition count 138
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 195 place count 162 transition count 130
Iterating global reduction 3 with 8 rules applied. Total rules applied 203 place count 162 transition count 130
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 203 place count 162 transition count 129
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 205 place count 161 transition count 129
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 145 rules applied. Total rules applied 350 place count 87 transition count 58
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 351 place count 87 transition count 57
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 352 place count 86 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 353 place count 85 transition count 56
Applied a total of 353 rules in 23 ms. Remains 85 /270 variables (removed 185) and now considering 56/228 (removed 172) transitions.
// Phase 1: matrix 56 rows 85 cols
[2022-05-15 14:46:47] [INFO ] Computed 36 place invariants in 1 ms
[2022-05-15 14:46:47] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 56 rows 85 cols
[2022-05-15 14:46:47] [INFO ] Computed 36 place invariants in 1 ms
[2022-05-15 14:46:47] [INFO ] Implicit Places using invariants and state equation in 74 ms returned [6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 57, 59, 61, 66]
Discarding 15 places :
Implicit Place search using SMT with State Equation took 146 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 70/270 places, 56/228 transitions.
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 70 transition count 56
Applied a total of 2 rules in 3 ms. Remains 70 /70 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 70 cols
[2022-05-15 14:46:47] [INFO ] Computed 21 place invariants in 3 ms
[2022-05-15 14:46:47] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 56 rows 70 cols
[2022-05-15 14:46:47] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-15 14:46:47] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 70/270 places, 56/228 transitions.
Finished structural reductions, in 2 iterations. Remains : 70/270 places, 56/228 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : BusinessProcesses-PT-08-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s43 1), p0:(AND (EQ s6 1) (EQ s51 1) (EQ s67 1)), p1:(AND (EQ s2 1) (EQ s47 1) (EQ s69 1) (EQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 8 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-08-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-LTLFireability-13 finished in 414 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(!((F(p0) U X(p0))&&F(p1)&&p0))) U p2))'
Support contains 5 out of 270 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 270/270 places, 228/228 transitions.
Graph (complete) has 570 edges and 270 vertex of which 269 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 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 268 transition count 193
Reduce places removed 33 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 35 rules applied. Total rules applied 69 place count 235 transition count 191
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 233 transition count 191
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 53 Pre rules applied. Total rules applied 71 place count 233 transition count 138
Deduced a syphon composed of 53 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 187 place count 170 transition count 138
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 194 place count 163 transition count 131
Iterating global reduction 3 with 7 rules applied. Total rules applied 201 place count 163 transition count 131
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 201 place count 163 transition count 130
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 203 place count 162 transition count 130
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 153 rules applied. Total rules applied 356 place count 84 transition count 55
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 357 place count 84 transition count 54
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 358 place count 83 transition count 53
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 359 place count 82 transition count 53
Applied a total of 359 rules in 22 ms. Remains 82 /270 variables (removed 188) and now considering 53/228 (removed 175) transitions.
// Phase 1: matrix 53 rows 82 cols
[2022-05-15 14:46:47] [INFO ] Computed 36 place invariants in 1 ms
[2022-05-15 14:46:47] [INFO ] Implicit Places using invariants in 47 ms returned [79]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/270 places, 53/228 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 81/270 places, 53/228 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p2), (AND p1 p0), (AND p1 p0)]
Running random walk in product with property : BusinessProcesses-PT-08-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s5 1) (EQ s39 1) (EQ s80 1)), p1:(EQ s16 1), p0:(EQ s65 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 260 steps with 28 reset in 1 ms.
FORMULA BusinessProcesses-PT-08-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-LTLFireability-14 finished in 184 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((p0 U p1) U G(p2)))))'
Support contains 5 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 228/228 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 262 transition count 220
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 262 transition count 220
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 259 transition count 217
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 259 transition count 217
Applied a total of 22 rules in 15 ms. Remains 259 /270 variables (removed 11) and now considering 217/228 (removed 11) transitions.
// Phase 1: matrix 217 rows 259 cols
[2022-05-15 14:46:47] [INFO ] Computed 50 place invariants in 0 ms
[2022-05-15 14:46:47] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 217 rows 259 cols
[2022-05-15 14:46:47] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-15 14:46:47] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
// Phase 1: matrix 217 rows 259 cols
[2022-05-15 14:46:47] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-15 14:46:48] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 259/270 places, 217/228 transitions.
Finished structural reductions, in 1 iterations. Remains : 259/270 places, 217/228 transitions.
Stuttering acceptance computed with spot in 221 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p1), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-08-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 3}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(AND (EQ s31 1) (EQ s212 1) (EQ s258 1)), p1:(EQ s114 1), p0:(EQ s112 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-08-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-LTLFireability-15 finished in 620 ms.
All properties solved by simple procedures.
Total runtime 71369 ms.

BK_STOP 1652626008327

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

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