Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 16:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Apr 11 16:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 11 16:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 16:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 104K May 18 16:42 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-09-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716650803787

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-09
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-25 15:26:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 15:26:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:26:46] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2024-05-25 15:26:46] [INFO ] Transformed 403 places.
[2024-05-25 15:26:46] [INFO ] Transformed 374 transitions.
[2024-05-25 15:26:46] [INFO ] Found NUPN structural information;
[2024-05-25 15:26:46] [INFO ] Parsed PT model containing 403 places and 374 transitions and 1148 arcs in 192 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA BusinessProcesses-PT-09-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 374/374 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 402 transition count 374
Discarding 54 places :
Symmetric choice reduction at 1 with 54 rule applications. Total rules 55 place count 348 transition count 320
Iterating global reduction 1 with 54 rules applied. Total rules applied 109 place count 348 transition count 320
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 133 place count 324 transition count 296
Iterating global reduction 1 with 24 rules applied. Total rules applied 157 place count 324 transition count 296
Applied a total of 157 rules in 70 ms. Remains 324 /403 variables (removed 79) and now considering 296/374 (removed 78) transitions.
// Phase 1: matrix 296 rows 324 cols
[2024-05-25 15:26:46] [INFO ] Computed 64 invariants in 35 ms
[2024-05-25 15:26:46] [INFO ] Implicit Places using invariants in 343 ms returned []
[2024-05-25 15:26:46] [INFO ] Invariant cache hit.
[2024-05-25 15:26:47] [INFO ] Implicit Places using invariants and state equation in 695 ms returned []
Implicit Place search using SMT with State Equation took 1068 ms to find 0 implicit places.
[2024-05-25 15:26:47] [INFO ] Invariant cache hit.
[2024-05-25 15:26:47] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 324/403 places, 296/374 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1368 ms. Remains : 324/403 places, 296/374 transitions.
Support contains 37 out of 324 places after structural reductions.
[2024-05-25 15:26:48] [INFO ] Flatten gal took : 117 ms
[2024-05-25 15:26:48] [INFO ] Flatten gal took : 37 ms
[2024-05-25 15:26:48] [INFO ] Input system was already deterministic with 296 transitions.
Incomplete random walk after 10000 steps, including 104 resets, run finished after 700 ms. (steps per millisecond=14 ) properties (out of 30) seen :23
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-25 15:26:49] [INFO ] Invariant cache hit.
[2024-05-25 15:26:49] [INFO ] [Real]Absence check using 34 positive place invariants in 15 ms returned sat
[2024-05-25 15:26:49] [INFO ] [Real]Absence check using 34 positive and 30 generalized place invariants in 8 ms returned sat
[2024-05-25 15:26:49] [INFO ] After 195ms SMT Verify possible using state equation in real domain returned unsat :1 sat :3 real:1
[2024-05-25 15:26:50] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 15 ms to minimize.
[2024-05-25 15:26:50] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 1 ms to minimize.
[2024-05-25 15:26:50] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 2 ms to minimize.
[2024-05-25 15:26:50] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 2 ms to minimize.
[2024-05-25 15:26:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 453 ms
[2024-05-25 15:26:50] [INFO ] Deduced a trap composed of 67 places in 176 ms of which 1 ms to minimize.
[2024-05-25 15:26:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2024-05-25 15:26:50] [INFO ] After 910ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :0 real:4
[2024-05-25 15:26:50] [INFO ] After 1257ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2024-05-25 15:26:50] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2024-05-25 15:26:50] [INFO ] [Nat]Absence check using 34 positive and 30 generalized place invariants in 8 ms returned sat
[2024-05-25 15:26:51] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2024-05-25 15:26:51] [INFO ] Deduced a trap composed of 18 places in 131 ms of which 2 ms to minimize.
[2024-05-25 15:26:51] [INFO ] Deduced a trap composed of 8 places in 158 ms of which 0 ms to minimize.
[2024-05-25 15:26:51] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 1 ms to minimize.
[2024-05-25 15:26:51] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-25 15:26:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 520 ms
[2024-05-25 15:26:51] [INFO ] After 789ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 65 ms.
[2024-05-25 15:26:51] [INFO ] After 1040ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 20 ms.
Support contains 7 out of 324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 296/296 transitions.
Graph (trivial) has 141 edges and 324 vertex of which 7 / 324 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 747 edges and 318 vertex of which 317 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 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 317 transition count 257
Reduce places removed 30 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 31 rules applied. Total rules applied 63 place count 287 transition count 256
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 286 transition count 256
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 61 Pre rules applied. Total rules applied 64 place count 286 transition count 195
Deduced a syphon composed of 61 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 194 place count 217 transition count 195
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 197 place count 214 transition count 192
Iterating global reduction 3 with 3 rules applied. Total rules applied 200 place count 214 transition count 192
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 200 place count 214 transition count 191
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 202 place count 213 transition count 191
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 165 rules applied. Total rules applied 367 place count 129 transition count 110
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 369 place count 128 transition count 113
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 371 place count 128 transition count 111
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 373 place count 126 transition count 111
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 374 place count 126 transition count 111
Applied a total of 374 rules in 66 ms. Remains 126 /324 variables (removed 198) and now considering 111/296 (removed 185) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 126/324 places, 111/296 transitions.
Finished random walk after 1000 steps, including 60 resets, run visited all 4 properties in 8 ms. (steps per millisecond=125 )
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 194 stabilizing places and 196 stable transitions
Graph (complete) has 755 edges and 324 vertex of which 323 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.18 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 296/296 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 318 transition count 290
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 318 transition count 290
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 317 transition count 289
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 317 transition count 289
Applied a total of 14 rules in 25 ms. Remains 317 /324 variables (removed 7) and now considering 289/296 (removed 7) transitions.
// Phase 1: matrix 289 rows 317 cols
[2024-05-25 15:26:52] [INFO ] Computed 64 invariants in 8 ms
[2024-05-25 15:26:52] [INFO ] Implicit Places using invariants in 220 ms returned []
[2024-05-25 15:26:52] [INFO ] Invariant cache hit.
[2024-05-25 15:26:53] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 550 ms to find 0 implicit places.
[2024-05-25 15:26:53] [INFO ] Invariant cache hit.
[2024-05-25 15:26:53] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 317/324 places, 289/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 752 ms. Remains : 317/324 places, 289/296 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-09-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s44 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 191 steps with 0 reset in 14 ms.
FORMULA BusinessProcesses-PT-09-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLFireability-01 finished in 1029 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(p0 U G(p1))))))'
Support contains 2 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 296/296 transitions.
Graph (trivial) has 146 edges and 324 vertex of which 7 / 324 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 748 edges and 318 vertex of which 317 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 33 place count 316 transition count 256
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 64 place count 285 transition count 256
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 64 place count 285 transition count 189
Deduced a syphon composed of 67 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 208 place count 208 transition count 189
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 212 place count 204 transition count 185
Iterating global reduction 2 with 4 rules applied. Total rules applied 216 place count 204 transition count 185
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 216 place count 204 transition count 184
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 218 place count 203 transition count 184
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 373 place count 124 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 375 place count 123 transition count 111
Applied a total of 375 rules in 92 ms. Remains 123 /324 variables (removed 201) and now considering 111/296 (removed 185) transitions.
// Phase 1: matrix 111 rows 123 cols
[2024-05-25 15:26:53] [INFO ] Computed 51 invariants in 14 ms
[2024-05-25 15:26:54] [INFO ] Implicit Places using invariants in 802 ms returned [1, 2, 3, 11, 38, 39, 40, 41, 42, 43, 44]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 809 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 112/324 places, 111/296 transitions.
Applied a total of 0 rules in 33 ms. Remains 112 /112 variables (removed 0) and now considering 111/111 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 934 ms. Remains : 112/324 places, 111/296 transitions.
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-09-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s8 1), p1:(EQ s36 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-09-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLFireability-02 finished in 1136 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||F(p1))))'
Support contains 4 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 296/296 transitions.
Graph (trivial) has 145 edges and 324 vertex of which 7 / 324 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 748 edges and 318 vertex of which 317 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 33 place count 316 transition count 256
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 64 place count 285 transition count 256
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 64 place count 285 transition count 191
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 203 place count 211 transition count 191
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 208 place count 206 transition count 186
Iterating global reduction 2 with 5 rules applied. Total rules applied 213 place count 206 transition count 186
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 213 place count 206 transition count 185
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 215 place count 205 transition count 185
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 370 place count 126 transition count 109
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 372 place count 125 transition count 112
Applied a total of 372 rules in 63 ms. Remains 125 /324 variables (removed 199) and now considering 112/296 (removed 184) transitions.
// Phase 1: matrix 112 rows 125 cols
[2024-05-25 15:26:54] [INFO ] Computed 52 invariants in 2 ms
[2024-05-25 15:26:55] [INFO ] Implicit Places using invariants in 724 ms returned [1, 2, 3, 11, 37, 38, 39, 40, 41, 42, 46, 101]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 742 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 113/324 places, 112/296 transitions.
Applied a total of 0 rules in 6 ms. Remains 113 /113 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 812 ms. Remains : 113/324 places, 112/296 transitions.
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-09-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s34 0), p1:(OR (EQ s21 0) (EQ s61 0) (EQ s101 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 16240 reset in 438 ms.
Product exploration explored 100000 steps with 16375 reset in 282 ms.
Computed a total of 70 stabilizing places and 84 stable transitions
Computed a total of 70 stabilizing places and 84 stable transitions
Detected a total of 70/113 stabilizing places and 84/112 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 256 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 1824 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 579 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 112 rows 113 cols
[2024-05-25 15:26:56] [INFO ] Computed 40 invariants in 2 ms
[2024-05-25 15:26:56] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:26:56] [INFO ] [Nat]Absence check using 24 positive place invariants in 3 ms returned sat
[2024-05-25 15:26:56] [INFO ] [Nat]Absence check using 24 positive and 16 generalized place invariants in 3 ms returned sat
[2024-05-25 15:26:56] [INFO ] After 76ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 17 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-09-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-09-LTLFireability-03 finished in 2399 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 3 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 296/296 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 318 transition count 290
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 318 transition count 290
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 317 transition count 289
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 317 transition count 289
Applied a total of 14 rules in 14 ms. Remains 317 /324 variables (removed 7) and now considering 289/296 (removed 7) transitions.
// Phase 1: matrix 289 rows 317 cols
[2024-05-25 15:26:57] [INFO ] Computed 64 invariants in 3 ms
[2024-05-25 15:26:57] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-05-25 15:26:57] [INFO ] Invariant cache hit.
[2024-05-25 15:26:57] [INFO ] Implicit Places using invariants and state equation in 555 ms returned []
Implicit Place search using SMT with State Equation took 822 ms to find 0 implicit places.
[2024-05-25 15:26:57] [INFO ] Invariant cache hit.
[2024-05-25 15:26:58] [INFO ] Dead Transitions using invariants and state equation in 250 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 317/324 places, 289/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1098 ms. Remains : 317/324 places, 289/296 transitions.
Stuttering acceptance computed with spot in 217 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-09-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s42 1) (EQ s195 1) (EQ s282 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-09-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLFireability-04 finished in 1360 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p0 U p1) U !p0))))'
Support contains 2 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 296/296 transitions.
Graph (trivial) has 145 edges and 324 vertex of which 7 / 324 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 748 edges and 318 vertex of which 317 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 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 33 place count 316 transition count 256
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 64 place count 285 transition count 256
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 66 Pre rules applied. Total rules applied 64 place count 285 transition count 190
Deduced a syphon composed of 66 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 206 place count 209 transition count 190
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 210 place count 205 transition count 186
Iterating global reduction 2 with 4 rules applied. Total rules applied 214 place count 205 transition count 186
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 161 rules applied. Total rules applied 375 place count 123 transition count 107
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 377 place count 122 transition count 110
Applied a total of 377 rules in 42 ms. Remains 122 /324 variables (removed 202) and now considering 110/296 (removed 186) transitions.
// Phase 1: matrix 110 rows 122 cols
[2024-05-25 15:26:58] [INFO ] Computed 51 invariants in 2 ms
[2024-05-25 15:26:58] [INFO ] Implicit Places using invariants in 196 ms returned [1, 2, 3, 12, 37, 38, 39, 40, 41, 42, 43]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 198 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 111/324 places, 110/296 transitions.
Applied a total of 0 rules in 3 ms. Remains 111 /111 variables (removed 0) and now considering 110/110 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 244 ms. Remains : 111/324 places, 110/296 transitions.
Stuttering acceptance computed with spot in 344 ms :[p0, false, p0]
Running random walk in product with property : BusinessProcesses-PT-09-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s3 1), p1:(EQ s67 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 79 steps with 9 reset in 0 ms.
FORMULA BusinessProcesses-PT-09-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLFireability-05 finished in 606 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((p0 U G(p1))))||F(p2)))'
Support contains 5 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 296/296 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 319 transition count 291
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 319 transition count 291
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 318 transition count 290
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 318 transition count 290
Applied a total of 12 rules in 27 ms. Remains 318 /324 variables (removed 6) and now considering 290/296 (removed 6) transitions.
// Phase 1: matrix 290 rows 318 cols
[2024-05-25 15:26:58] [INFO ] Computed 64 invariants in 4 ms
[2024-05-25 15:26:59] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-05-25 15:26:59] [INFO ] Invariant cache hit.
[2024-05-25 15:26:59] [INFO ] Implicit Places using invariants and state equation in 550 ms returned []
Implicit Place search using SMT with State Equation took 759 ms to find 0 implicit places.
[2024-05-25 15:26:59] [INFO ] Invariant cache hit.
[2024-05-25 15:26:59] [INFO ] Dead Transitions using invariants and state equation in 193 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 318/324 places, 290/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 990 ms. Remains : 318/324 places, 290/296 transitions.
Stuttering acceptance computed with spot in 339 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-09-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s81 1), p1:(AND (EQ s39 1) (EQ s192 1) (EQ s283 1)), p0:(NEQ s78 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 82 steps with 0 reset in 12 ms.
FORMULA BusinessProcesses-PT-09-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLFireability-06 finished in 1367 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0||X((p0&&G(p1)))))'
Support contains 4 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 296/296 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 318 transition count 290
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 318 transition count 290
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 317 transition count 289
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 317 transition count 289
Applied a total of 14 rules in 17 ms. Remains 317 /324 variables (removed 7) and now considering 289/296 (removed 7) transitions.
// Phase 1: matrix 289 rows 317 cols
[2024-05-25 15:27:00] [INFO ] Computed 64 invariants in 3 ms
[2024-05-25 15:27:00] [INFO ] Implicit Places using invariants in 226 ms returned []
[2024-05-25 15:27:00] [INFO ] Invariant cache hit.
[2024-05-25 15:27:00] [INFO ] Implicit Places using invariants and state equation in 424 ms returned []
Implicit Place search using SMT with State Equation took 655 ms to find 0 implicit places.
[2024-05-25 15:27:00] [INFO ] Invariant cache hit.
[2024-05-25 15:27:01] [INFO ] Dead Transitions using invariants and state equation in 331 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 317/324 places, 289/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1011 ms. Remains : 317/324 places, 289/296 transitions.
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-09-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p0:(EQ s99 1), p1:(AND (EQ s42 1) (EQ s195 1) (EQ s282 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-09-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLFireability-07 finished in 1189 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((X(G(p0))&&(G(F(p1)) U p2))))))'
Support contains 5 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 296/296 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 319 transition count 291
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 319 transition count 291
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 318 transition count 290
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 318 transition count 290
Applied a total of 12 rules in 15 ms. Remains 318 /324 variables (removed 6) and now considering 290/296 (removed 6) transitions.
// Phase 1: matrix 290 rows 318 cols
[2024-05-25 15:27:01] [INFO ] Computed 64 invariants in 3 ms
[2024-05-25 15:27:01] [INFO ] Implicit Places using invariants in 250 ms returned []
[2024-05-25 15:27:01] [INFO ] Invariant cache hit.
[2024-05-25 15:27:02] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 642 ms to find 0 implicit places.
[2024-05-25 15:27:02] [INFO ] Invariant cache hit.
[2024-05-25 15:27:02] [INFO ] Dead Transitions using invariants and state equation in 238 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 318/324 places, 290/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 914 ms. Remains : 318/324 places, 290/296 transitions.
Stuttering acceptance computed with spot in 472 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p2), true]
Running random walk in product with property : BusinessProcesses-PT-09-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(NOT p2), acceptance={} source=3 dest: 6}, { cond=(NOT p2), acceptance={} source=3 dest: 7}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 8}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=7 dest: 5}, { cond=(NOT p2), acceptance={0} source=7 dest: 6}, { cond=(NOT p2), acceptance={0} source=7 dest: 7}], [{ cond=true, acceptance={0} source=8 dest: 8}]], initial=0, aps=[p2:(EQ s246 1), p1:(OR (AND (EQ s109 1) (EQ s199 1) (EQ s283 1)) (EQ s137 1)), p0:(AND (EQ s109 1) (EQ s199 1) (EQ s283 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 90 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-09-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLFireability-08 finished in 1428 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 296/296 transitions.
Graph (trivial) has 145 edges and 324 vertex of which 4 / 324 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 752 edges and 321 vertex of which 320 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 34 place count 319 transition count 259
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 66 place count 287 transition count 259
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 66 place count 287 transition count 192
Deduced a syphon composed of 67 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 210 place count 210 transition count 192
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 215 place count 205 transition count 187
Iterating global reduction 2 with 5 rules applied. Total rules applied 220 place count 205 transition count 187
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 220 place count 205 transition count 186
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 222 place count 204 transition count 186
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 159 rules applied. Total rules applied 381 place count 123 transition count 108
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 2 with 4 rules applied. Total rules applied 385 place count 121 transition count 110
Applied a total of 385 rules in 46 ms. Remains 121 /324 variables (removed 203) and now considering 110/296 (removed 186) transitions.
// Phase 1: matrix 110 rows 121 cols
[2024-05-25 15:27:02] [INFO ] Computed 51 invariants in 1 ms
[2024-05-25 15:27:03] [INFO ] Implicit Places using invariants in 147 ms returned [1, 2, 3, 11, 36, 37, 38, 39, 40, 41, 42]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 149 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 110/324 places, 110/296 transitions.
Applied a total of 0 rules in 4 ms. Remains 110 /110 variables (removed 0) and now considering 110/110 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 200 ms. Remains : 110/324 places, 110/296 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-09-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s72 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 14026 reset in 230 ms.
Stack based approach found an accepted trace after 17 steps with 1 reset with depth 5 and stack size 5 in 2 ms.
FORMULA BusinessProcesses-PT-09-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-09-LTLFireability-09 finished in 504 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(F(p0)))||G(p1))))'
Support contains 2 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 296/296 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 319 transition count 291
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 319 transition count 291
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 318 transition count 290
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 318 transition count 290
Applied a total of 12 rules in 12 ms. Remains 318 /324 variables (removed 6) and now considering 290/296 (removed 6) transitions.
// Phase 1: matrix 290 rows 318 cols
[2024-05-25 15:27:03] [INFO ] Computed 64 invariants in 4 ms
[2024-05-25 15:27:10] [INFO ] Implicit Places using invariants in 6613 ms returned []
[2024-05-25 15:27:10] [INFO ] Invariant cache hit.
[2024-05-25 15:27:10] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 7017 ms to find 0 implicit places.
[2024-05-25 15:27:10] [INFO ] Invariant cache hit.
[2024-05-25 15:27:10] [INFO ] Dead Transitions using invariants and state equation in 244 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 318/324 places, 290/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7288 ms. Remains : 318/324 places, 290/296 transitions.
Stuttering acceptance computed with spot in 337 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-09-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=p1, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(EQ s242 1), p1:(EQ s48 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 82 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-09-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLFireability-10 finished in 7661 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(G(p1)&&(p0||X(p0))))))'
Support contains 3 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 296/296 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 318 transition count 290
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 318 transition count 290
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 317 transition count 289
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 317 transition count 289
Applied a total of 14 rules in 12 ms. Remains 317 /324 variables (removed 7) and now considering 289/296 (removed 7) transitions.
// Phase 1: matrix 289 rows 317 cols
[2024-05-25 15:27:11] [INFO ] Computed 64 invariants in 46 ms
[2024-05-25 15:27:11] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-05-25 15:27:11] [INFO ] Invariant cache hit.
[2024-05-25 15:27:11] [INFO ] Implicit Places using invariants and state equation in 558 ms returned []
Implicit Place search using SMT with State Equation took 766 ms to find 0 implicit places.
[2024-05-25 15:27:11] [INFO ] Invariant cache hit.
[2024-05-25 15:27:12] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 317/324 places, 289/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1000 ms. Remains : 317/324 places, 289/296 transitions.
Stuttering acceptance computed with spot in 211 ms :[true, (NOT p0), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-09-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p0 p1), acceptance={} source=4 dest: 2}]], initial=1, aps=[p1:(AND (EQ s59 0) (EQ s47 0)), p0:(EQ s73 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 303 ms.
Product exploration explored 100000 steps with 50000 reset in 253 ms.
Computed a total of 189 stabilizing places and 191 stable transitions
Graph (complete) has 748 edges and 317 vertex of which 316 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.15 ms
Computed a total of 189 stabilizing places and 191 stable transitions
Detected a total of 189/317 stabilizing places and 191/289 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 (NOT p0) p1))), true, (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 33 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-09-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-09-LTLFireability-11 finished in 1836 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 296/296 transitions.
Graph (trivial) has 145 edges and 324 vertex of which 7 / 324 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 748 edges and 318 vertex of which 317 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 33 place count 316 transition count 256
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 64 place count 285 transition count 256
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 64 place count 285 transition count 191
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 203 place count 211 transition count 191
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 208 place count 206 transition count 186
Iterating global reduction 2 with 5 rules applied. Total rules applied 213 place count 206 transition count 186
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 213 place count 206 transition count 185
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 215 place count 205 transition count 185
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 159 rules applied. Total rules applied 374 place count 124 transition count 107
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 376 place count 123 transition count 110
Applied a total of 376 rules in 26 ms. Remains 123 /324 variables (removed 201) and now considering 110/296 (removed 186) transitions.
// Phase 1: matrix 110 rows 123 cols
[2024-05-25 15:27:12] [INFO ] Computed 52 invariants in 1 ms
[2024-05-25 15:27:13] [INFO ] Implicit Places using invariants in 553 ms returned [1, 2, 3, 13, 38, 39, 40, 41, 42, 43, 44]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 558 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 112/324 places, 110/296 transitions.
Applied a total of 0 rules in 4 ms. Remains 112 /112 variables (removed 0) and now considering 110/110 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 589 ms. Remains : 112/324 places, 110/296 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-09-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s43 1) (EQ s77 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][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-09-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLFireability-12 finished in 705 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0&&X(p1)))||(p2 U p3)||F(p4)))'
Support contains 3 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 296/296 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 319 transition count 291
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 319 transition count 291
Applied a total of 10 rules in 16 ms. Remains 319 /324 variables (removed 5) and now considering 291/296 (removed 5) transitions.
// Phase 1: matrix 291 rows 319 cols
[2024-05-25 15:27:13] [INFO ] Computed 64 invariants in 4 ms
[2024-05-25 15:27:13] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-05-25 15:27:13] [INFO ] Invariant cache hit.
[2024-05-25 15:27:14] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
[2024-05-25 15:27:14] [INFO ] Invariant cache hit.
[2024-05-25 15:27:18] [INFO ] Dead Transitions using invariants and state equation in 4571 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 319/324 places, 291/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5235 ms. Remains : 319/324 places, 291/296 transitions.
Stuttering acceptance computed with spot in 429 ms :[(AND (NOT p4) (NOT p1)), (AND (NOT p1) (NOT p3) (NOT p4)), (OR (AND (NOT p0) (NOT p4)) (AND (NOT p1) (NOT p4))), (NOT p4), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p3) (NOT p4))), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p3) (NOT p4))), (AND (NOT p3) (NOT p4))]
Running random walk in product with property : BusinessProcesses-PT-09-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p4) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p4) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p4) (NOT p1)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p4) p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p4) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p4), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p4)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p4)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p4) p0), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p3) p2 (NOT p4) p0), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p4) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p4) (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p4)), acceptance={0} source=6 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p4)), acceptance={0} source=6 dest: 6}]], initial=4, aps=[p4:(EQ s70 1), p1:(EQ s247 0), p3:(EQ s247 1), p2:(EQ s159 1), p0:(EQ s70 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, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 292 ms.
Product exploration explored 100000 steps with 33333 reset in 232 ms.
Computed a total of 191 stabilizing places and 193 stable transitions
Graph (complete) has 750 edges and 319 vertex of which 318 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 191 stabilizing places and 193 stable transitions
Detected a total of 191/319 stabilizing places and 193/291 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/5 atomic propositions.
Knowledge obtained : [(AND (NOT p4) p1 (NOT p3) (NOT p2) p0), (X (NOT (AND (NOT p3) (NOT p2) (NOT p4) (NOT p0)))), (X (AND (NOT p4) p0)), (X (NOT (AND (NOT p4) (NOT p0)))), (X (AND (NOT p3) (NOT p2) (NOT p4) p0)), (X (NOT (AND (NOT p3) p2 (NOT p4) p0))), (X (NOT (AND (NOT p3) p2 (NOT p4) (NOT p0)))), (X (X (NOT (AND (NOT p4) (NOT p1))))), (X (X (AND (NOT p3) (NOT p2) (NOT p4)))), (X (X (NOT (AND (NOT p3) p2 (NOT p4))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p4) (NOT p1))))), (X (X (NOT p4))), (X (X (NOT (AND (NOT p3) p2 (NOT p4) (NOT p1))))), (F (OR (G p4) (G (NOT p4)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 16 factoid took 80 ms. Reduced automaton from 7 states, 14 edges and 5 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-09-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-09-LTLFireability-13 finished in 6298 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U (p1||F(p2)))))'
Support contains 3 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 296/296 transitions.
Graph (trivial) has 145 edges and 324 vertex of which 7 / 324 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 748 edges and 318 vertex of which 317 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 33 place count 316 transition count 256
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 65 place count 285 transition count 255
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 284 transition count 255
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 66 place count 284 transition count 191
Deduced a syphon composed of 64 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 3 with 137 rules applied. Total rules applied 203 place count 211 transition count 191
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 207 place count 207 transition count 187
Iterating global reduction 3 with 4 rules applied. Total rules applied 211 place count 207 transition count 187
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 207 transition count 186
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 206 transition count 186
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 3 with 159 rules applied. Total rules applied 372 place count 125 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 374 place count 124 transition count 111
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 375 place count 123 transition count 110
Applied a total of 375 rules in 63 ms. Remains 123 /324 variables (removed 201) and now considering 110/296 (removed 186) transitions.
// Phase 1: matrix 110 rows 123 cols
[2024-05-25 15:27:20] [INFO ] Computed 52 invariants in 1 ms
[2024-05-25 15:27:20] [INFO ] Implicit Places using invariants in 137 ms returned [97]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 141 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 122/324 places, 110/296 transitions.
Applied a total of 0 rules in 4 ms. Remains 122 /122 variables (removed 0) and now considering 110/110 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 208 ms. Remains : 122/324 places, 110/296 transitions.
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-09-LTLFireability-15 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) p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s41 1) (EQ s59 1)), p2:(NEQ s45 1), p0:(EQ s41 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 9 steps with 2 reset in 0 ms.
FORMULA BusinessProcesses-PT-09-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLFireability-15 finished in 386 ms.
All properties solved by simple procedures.
Total runtime 34421 ms.

BK_STOP 1716650840686

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-09"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is BusinessProcesses-PT-09, 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 r065-tajo-171620414900323"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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