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-171620414900348.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-14, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r065-tajo-171620414900348
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K 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.3K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 9.6K Apr 11 16:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 11 16:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 11 16:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 16:37 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 156K 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-14-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716651264438

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-14
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-25 15:34:26] [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:34:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:34:27] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2024-05-25 15:34:27] [INFO ] Transformed 624 places.
[2024-05-25 15:34:27] [INFO ] Transformed 564 transitions.
[2024-05-25 15:34:27] [INFO ] Found NUPN structural information;
[2024-05-25 15:34:27] [INFO ] Parsed PT model containing 624 places and 564 transitions and 1657 arcs in 284 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 8 places in 21 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-14-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 616 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 616/616 places, 556/556 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 611 transition count 556
Discarding 89 places :
Symmetric choice reduction at 1 with 89 rule applications. Total rules 94 place count 522 transition count 467
Iterating global reduction 1 with 89 rules applied. Total rules applied 183 place count 522 transition count 467
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 228 place count 477 transition count 422
Iterating global reduction 1 with 45 rules applied. Total rules applied 273 place count 477 transition count 422
Applied a total of 273 rules in 235 ms. Remains 477 /616 variables (removed 139) and now considering 422/556 (removed 134) transitions.
// Phase 1: matrix 422 rows 477 cols
[2024-05-25 15:34:27] [INFO ] Computed 94 invariants in 80 ms
[2024-05-25 15:34:28] [INFO ] Implicit Places using invariants in 650 ms returned []
[2024-05-25 15:34:28] [INFO ] Invariant cache hit.
[2024-05-25 15:34:29] [INFO ] Implicit Places using invariants and state equation in 695 ms returned []
Implicit Place search using SMT with State Equation took 1399 ms to find 0 implicit places.
[2024-05-25 15:34:29] [INFO ] Invariant cache hit.
[2024-05-25 15:34:29] [INFO ] Dead Transitions using invariants and state equation in 333 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 477/616 places, 422/556 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1969 ms. Remains : 477/616 places, 422/556 transitions.
Support contains 42 out of 477 places after structural reductions.
[2024-05-25 15:34:29] [INFO ] Flatten gal took : 101 ms
[2024-05-25 15:34:29] [INFO ] Flatten gal took : 59 ms
[2024-05-25 15:34:29] [INFO ] Input system was already deterministic with 422 transitions.
Incomplete random walk after 10000 steps, including 68 resets, run finished after 395 ms. (steps per millisecond=25 ) properties (out of 32) seen :13
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
[2024-05-25 15:34:30] [INFO ] Invariant cache hit.
[2024-05-25 15:34:30] [INFO ] [Real]Absence check using 55 positive place invariants in 18 ms returned sat
[2024-05-25 15:34:30] [INFO ] [Real]Absence check using 55 positive and 39 generalized place invariants in 22 ms returned sat
[2024-05-25 15:34:30] [INFO ] After 422ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2024-05-25 15:34:31] [INFO ] [Nat]Absence check using 55 positive place invariants in 23 ms returned sat
[2024-05-25 15:34:31] [INFO ] [Nat]Absence check using 55 positive and 39 generalized place invariants in 24 ms returned sat
[2024-05-25 15:34:31] [INFO ] After 499ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :15
[2024-05-25 15:34:32] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 4 ms to minimize.
[2024-05-25 15:34:32] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 0 ms to minimize.
[2024-05-25 15:34:32] [INFO ] Deduced a trap composed of 15 places in 393 ms of which 1 ms to minimize.
[2024-05-25 15:34:32] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 2 ms to minimize.
[2024-05-25 15:34:32] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 0 ms to minimize.
[2024-05-25 15:34:33] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 18 ms to minimize.
[2024-05-25 15:34:33] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1132 ms
[2024-05-25 15:34:33] [INFO ] Deduced a trap composed of 86 places in 117 ms of which 1 ms to minimize.
[2024-05-25 15:34:33] [INFO ] Deduced a trap composed of 81 places in 125 ms of which 1 ms to minimize.
[2024-05-25 15:34:33] [INFO ] Deduced a trap composed of 84 places in 148 ms of which 0 ms to minimize.
[2024-05-25 15:34:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 463 ms
[2024-05-25 15:34:34] [INFO ] Deduced a trap composed of 35 places in 141 ms of which 0 ms to minimize.
[2024-05-25 15:34:34] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 1 ms to minimize.
[2024-05-25 15:34:34] [INFO ] Deduced a trap composed of 35 places in 453 ms of which 0 ms to minimize.
[2024-05-25 15:34:34] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 1 ms to minimize.
[2024-05-25 15:34:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 841 ms
[2024-05-25 15:34:34] [INFO ] After 3450ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :13
Attempting to minimize the solution found.
Minimization took 210 ms.
[2024-05-25 15:34:35] [INFO ] After 4160ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :13
Fused 19 Parikh solutions to 11 different solutions.
Parikh walk visited 5 properties in 143 ms.
Support contains 13 out of 477 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 477/477 places, 422/422 transitions.
Graph (trivial) has 211 edges and 477 vertex of which 6 / 477 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1080 edges and 472 vertex of which 471 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 471 transition count 365
Reduce places removed 49 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 51 rules applied. Total rules applied 102 place count 422 transition count 363
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 104 place count 420 transition count 363
Performed 91 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 91 Pre rules applied. Total rules applied 104 place count 420 transition count 272
Deduced a syphon composed of 91 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 195 rules applied. Total rules applied 299 place count 316 transition count 272
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 305 place count 310 transition count 266
Iterating global reduction 3 with 6 rules applied. Total rules applied 311 place count 310 transition count 266
Performed 121 Post agglomeration using F-continuation condition.Transition count delta: 121
Deduced a syphon composed of 121 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 3 with 247 rules applied. Total rules applied 558 place count 184 transition count 145
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 560 place count 183 transition count 149
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 562 place count 183 transition count 147
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 564 place count 181 transition count 147
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 569 place count 181 transition count 147
Applied a total of 569 rules in 256 ms. Remains 181 /477 variables (removed 296) and now considering 147/422 (removed 275) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 270 ms. Remains : 181/477 places, 147/422 transitions.
Finished random walk after 361 steps, including 14 resets, run visited all 8 properties in 7 ms. (steps per millisecond=51 )
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 5 atomic propositions for a total of 14 simplifications.
FORMULA BusinessProcesses-PT-14-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 127 stabilizing places and 120 stable transitions
Graph (complete) has 1087 edges and 477 vertex of which 476 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.17 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)||G(F((p1||G(p2))))))))'
Support contains 2 out of 477 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 477/477 places, 422/422 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 470 transition count 415
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 470 transition count 415
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 466 transition count 411
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 466 transition count 411
Applied a total of 22 rules in 29 ms. Remains 466 /477 variables (removed 11) and now considering 411/422 (removed 11) transitions.
// Phase 1: matrix 411 rows 466 cols
[2024-05-25 15:34:36] [INFO ] Computed 94 invariants in 12 ms
[2024-05-25 15:34:36] [INFO ] Implicit Places using invariants in 641 ms returned []
[2024-05-25 15:34:36] [INFO ] Invariant cache hit.
[2024-05-25 15:34:37] [INFO ] Implicit Places using invariants and state equation in 509 ms returned []
Implicit Place search using SMT with State Equation took 1152 ms to find 0 implicit places.
[2024-05-25 15:34:37] [INFO ] Invariant cache hit.
[2024-05-25 15:34:37] [INFO ] Dead Transitions using invariants and state equation in 261 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 466/477 places, 411/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1456 ms. Remains : 466/477 places, 411/422 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 263 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(EQ s248 1), p2:(EQ s113 1), p1:(EQ s248 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 712 reset in 274 ms.
Stack based approach found an accepted trace after 17621 steps with 126 reset with depth 149 and stack size 149 in 53 ms.
FORMULA BusinessProcesses-PT-14-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-14-LTLFireability-00 finished in 2115 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)||G((p1&&X(X(G(p1))))))))'
Support contains 4 out of 477 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 477/477 places, 422/422 transitions.
Graph (trivial) has 220 edges and 477 vertex of which 6 / 477 are part of one of the 1 SCC in 10 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1081 edges and 472 vertex of which 471 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 54 place count 470 transition count 362
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 106 place count 418 transition count 362
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 106 place count 418 transition count 266
Deduced a syphon composed of 96 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 314 place count 306 transition count 266
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 320 place count 300 transition count 260
Iterating global reduction 2 with 6 rules applied. Total rules applied 326 place count 300 transition count 260
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 2 with 255 rules applied. Total rules applied 581 place count 170 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 583 place count 169 transition count 139
Applied a total of 583 rules in 176 ms. Remains 169 /477 variables (removed 308) and now considering 139/422 (removed 283) transitions.
// Phase 1: matrix 139 rows 169 cols
[2024-05-25 15:34:38] [INFO ] Computed 73 invariants in 1 ms
[2024-05-25 15:34:38] [INFO ] Implicit Places using invariants in 156 ms returned [1, 2, 3, 4, 5, 6, 7, 16, 17, 21, 22, 23, 24, 25, 26, 49, 50, 51, 52, 53]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 160 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 149/477 places, 139/422 transitions.
Applied a total of 0 rules in 6 ms. Remains 149 /149 variables (removed 0) and now considering 139/139 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 345 ms. Remains : 149/477 places, 139/422 transitions.
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s1 0) (EQ s65 0) (EQ s109 0)), p1:(EQ s56 1)], nbAcceptance=2, 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 13164 reset in 306 ms.
Product exploration explored 100000 steps with 13197 reset in 305 ms.
Computed a total of 14 stabilizing places and 12 stable transitions
Computed a total of 14 stabilizing places and 12 stable transitions
Detected a total of 14/149 stabilizing places and 12/139 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 8 factoid took 307 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 1426 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 421 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 442 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 139 rows 149 cols
[2024-05-25 15:34:39] [INFO ] Computed 53 invariants in 30 ms
[2024-05-25 15:34:39] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 15:34:40] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2024-05-25 15:34:40] [INFO ] [Nat]Absence check using 34 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-25 15:34:40] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 15:34:40] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-25 15:34:40] [INFO ] After 13ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-25 15:34:40] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-25 15:34:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 ms
[2024-05-25 15:34:40] [INFO ] After 83ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-25 15:34:40] [INFO ] After 209ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 22 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=22 )
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 149 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 139/139 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 149 transition count 138
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 149 transition count 136
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 147 transition count 136
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 147 transition count 136
Applied a total of 6 rules in 27 ms. Remains 147 /149 variables (removed 2) and now considering 136/139 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 147/149 places, 136/139 transitions.
Finished random walk after 236 steps, including 9 resets, run visited all 1 properties in 2 ms. (steps per millisecond=118 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 8 factoid took 333 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p1))]
Support contains 4 out of 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 139/139 transitions.
Applied a total of 0 rules in 18 ms. Remains 149 /149 variables (removed 0) and now considering 139/139 (removed 0) transitions.
[2024-05-25 15:34:40] [INFO ] Invariant cache hit.
[2024-05-25 15:34:40] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-25 15:34:40] [INFO ] Invariant cache hit.
[2024-05-25 15:34:40] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-25 15:34:41] [INFO ] Implicit Places using invariants and state equation in 264 ms returned [3, 5, 9, 12, 35, 37, 39, 40, 41, 43, 45, 47, 49, 51, 57, 59, 61, 68, 70, 72, 74, 76, 78, 80, 82, 90, 92, 94, 96, 98]
Discarding 30 places :
Implicit Place search using SMT with State Equation took 401 ms to find 30 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 119/149 places, 139/139 transitions.
Graph (complete) has 388 edges and 119 vertex of which 108 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 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 8 place count 108 transition count 127
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 101 transition count 127
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 29 place count 87 transition count 84
Iterating global reduction 2 with 14 rules applied. Total rules applied 43 place count 87 transition count 84
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 46 place count 87 transition count 81
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 49 place count 84 transition count 81
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 50 place count 83 transition count 80
Iterating global reduction 4 with 1 rules applied. Total rules applied 51 place count 83 transition count 80
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 17 rules applied. Total rules applied 68 place count 74 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 70 place count 73 transition count 71
Applied a total of 70 rules in 18 ms. Remains 73 /119 variables (removed 46) and now considering 71/139 (removed 68) transitions.
// Phase 1: matrix 71 rows 73 cols
[2024-05-25 15:34:41] [INFO ] Computed 18 invariants in 1 ms
[2024-05-25 15:34:41] [INFO ] Implicit Places using invariants in 70 ms returned [7, 8, 9]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 85 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 70/149 places, 71/139 transitions.
Applied a total of 0 rules in 3 ms. Remains 70 /70 variables (removed 0) and now considering 71/71 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 529 ms. Remains : 70/149 places, 71/139 transitions.
Computed a total of 6 stabilizing places and 7 stable transitions
Computed a total of 6 stabilizing places and 7 stable transitions
Detected a total of 6/70 stabilizing places and 7/71 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 8 factoid took 252 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 1438 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 428 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 480 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 71 rows 70 cols
[2024-05-25 15:34:41] [INFO ] Computed 15 invariants in 1 ms
[2024-05-25 15:34:41] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 15:34:41] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2024-05-25 15:34:41] [INFO ] [Nat]Absence check using 9 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-25 15:34:41] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 15:34:41] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-25 15:34:41] [INFO ] After 6ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-25 15:34:41] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-25 15:34:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2024-05-25 15:34:41] [INFO ] After 48ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-25 15:34:41] [INFO ] After 140ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 16 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=16 )
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 71/71 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 70 transition count 70
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 70 transition count 68
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 68 transition count 68
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 9 place count 68 transition count 64
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 13 place count 64 transition count 64
Applied a total of 13 rules in 9 ms. Remains 64 /70 variables (removed 6) and now considering 64/71 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 64/70 places, 64/71 transitions.
Finished random walk after 22 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=22 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 8 factoid took 368 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 13371 reset in 141 ms.
Product exploration explored 100000 steps with 13363 reset in 140 ms.
Built C files in :
/tmp/ltsmin18012954665897585050
[2024-05-25 15:34:42] [INFO ] Computing symmetric may disable matrix : 71 transitions.
[2024-05-25 15:34:42] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:34:42] [INFO ] Computing symmetric may enable matrix : 71 transitions.
[2024-05-25 15:34:42] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:34:42] [INFO ] Computing Do-Not-Accords matrix : 71 transitions.
[2024-05-25 15:34:42] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:34:42] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18012954665897585050
Running compilation step : cd /tmp/ltsmin18012954665897585050;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 319 ms.
Running link step : cd /tmp/ltsmin18012954665897585050;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin18012954665897585050;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12778716273682760345.hoa' '--buchi-type=spotba'
LTSmin run took 197 ms.
FORMULA BusinessProcesses-PT-14-LTLFireability-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-14-LTLFireability-01 finished in 4931 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)))'
Support contains 2 out of 477 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 477/477 places, 422/422 transitions.
Graph (trivial) has 221 edges and 477 vertex of which 6 / 477 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 1081 edges and 472 vertex of which 471 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 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 470 transition count 363
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 104 place count 419 transition count 363
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 104 place count 419 transition count 264
Deduced a syphon composed of 99 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 2 with 215 rules applied. Total rules applied 319 place count 303 transition count 264
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 324 place count 298 transition count 259
Iterating global reduction 2 with 5 rules applied. Total rules applied 329 place count 298 transition count 259
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 2 with 255 rules applied. Total rules applied 584 place count 168 transition count 134
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 586 place count 167 transition count 138
Applied a total of 586 rules in 53 ms. Remains 167 /477 variables (removed 310) and now considering 138/422 (removed 284) transitions.
// Phase 1: matrix 138 rows 167 cols
[2024-05-25 15:34:43] [INFO ] Computed 72 invariants in 2 ms
[2024-05-25 15:34:43] [INFO ] Implicit Places using invariants in 174 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 47, 48, 49, 50, 51]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 175 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 147/477 places, 138/422 transitions.
Applied a total of 0 rules in 5 ms. Remains 147 /147 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 246 ms. Remains : 147/477 places, 138/422 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-05 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:(OR (EQ s60 0) (EQ s107 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-14-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLFireability-05 finished in 367 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((X(G(p0))||F(p1))))'
Support contains 3 out of 477 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 477/477 places, 422/422 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 470 transition count 415
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 470 transition count 415
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 466 transition count 411
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 466 transition count 411
Applied a total of 22 rules in 76 ms. Remains 466 /477 variables (removed 11) and now considering 411/422 (removed 11) transitions.
// Phase 1: matrix 411 rows 466 cols
[2024-05-25 15:34:43] [INFO ] Computed 94 invariants in 4 ms
[2024-05-25 15:34:43] [INFO ] Implicit Places using invariants in 335 ms returned []
[2024-05-25 15:34:43] [INFO ] Invariant cache hit.
[2024-05-25 15:34:44] [INFO ] Implicit Places using invariants and state equation in 530 ms returned []
Implicit Place search using SMT with State Equation took 867 ms to find 0 implicit places.
[2024-05-25 15:34:44] [INFO ] Invariant cache hit.
[2024-05-25 15:34:44] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 466/477 places, 411/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1180 ms. Remains : 466/477 places, 411/422 transitions.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s417 0) (EQ s461 1) (EQ s464 1)), p0:(EQ s417 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 165 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-14-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLFireability-06 finished in 1294 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 U p1)&&G((X(X(p1))&&p2)))))'
Support contains 4 out of 477 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 477/477 places, 422/422 transitions.
Graph (trivial) has 221 edges and 477 vertex of which 6 / 477 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1081 edges and 472 vertex of which 471 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 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 54 place count 470 transition count 362
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 106 place count 418 transition count 362
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 106 place count 418 transition count 263
Deduced a syphon composed of 99 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 214 rules applied. Total rules applied 320 place count 303 transition count 263
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 326 place count 297 transition count 257
Iterating global reduction 2 with 6 rules applied. Total rules applied 332 place count 297 transition count 257
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 2 with 245 rules applied. Total rules applied 577 place count 172 transition count 137
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 579 place count 171 transition count 141
Applied a total of 579 rules in 55 ms. Remains 171 /477 variables (removed 306) and now considering 141/422 (removed 281) transitions.
// Phase 1: matrix 141 rows 171 cols
[2024-05-25 15:34:44] [INFO ] Computed 73 invariants in 1 ms
[2024-05-25 15:34:45] [INFO ] Implicit Places using invariants in 415 ms returned [5, 17, 18, 22, 23, 24, 25, 26, 27, 50, 51, 52, 53, 54]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 427 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 157/477 places, 141/422 transitions.
Applied a total of 0 rules in 4 ms. Remains 157 /157 variables (removed 0) and now considering 141/141 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 486 ms. Remains : 157/477 places, 141/422 transitions.
Stuttering acceptance computed with spot in 347 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p1) (NOT p0)) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=0 dest: 1}, { cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={0} source=0 dest: 2}, { cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0 p2), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p0)) (NOT p2)), acceptance={0} source=2 dest: 4}, { cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={0} source=2 dest: 5}, { cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 0}, { cond=p2, acceptance={0} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2))), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=4 dest: 3}], [{ cond=(AND (NOT p1) p0 p2), acceptance={0} source=5 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2))), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 3}]], initial=0, aps=[p1:(EQ s65 1), p0:(EQ s113 1), p2:(AND (EQ s2 1) (EQ s111 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-14-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLFireability-07 finished in 850 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)&&(p1 U (G(p1)||(p1&&G(p2))))))'
Support contains 3 out of 477 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 477/477 places, 422/422 transitions.
Graph (trivial) has 223 edges and 477 vertex of which 6 / 477 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 1081 edges and 472 vertex of which 471 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 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 470 transition count 363
Reduce places removed 51 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 53 rules applied. Total rules applied 106 place count 419 transition count 361
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 108 place count 417 transition count 361
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 108 place count 417 transition count 261
Deduced a syphon composed of 100 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 3 with 217 rules applied. Total rules applied 325 place count 300 transition count 261
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 332 place count 293 transition count 254
Iterating global reduction 3 with 7 rules applied. Total rules applied 339 place count 293 transition count 254
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 3 with 245 rules applied. Total rules applied 584 place count 168 transition count 134
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 586 place count 167 transition count 138
Applied a total of 586 rules in 40 ms. Remains 167 /477 variables (removed 310) and now considering 138/422 (removed 284) transitions.
// Phase 1: matrix 138 rows 167 cols
[2024-05-25 15:34:45] [INFO ] Computed 72 invariants in 1 ms
[2024-05-25 15:34:46] [INFO ] Implicit Places using invariants in 409 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 20, 21, 22, 23, 26, 49, 50, 51, 52, 53]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 423 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 149/477 places, 138/422 transitions.
Applied a total of 0 rules in 11 ms. Remains 149 /149 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 474 ms. Remains : 149/477 places, 138/422 transitions.
Stuttering acceptance computed with spot in 305 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}, { cond=(AND p2 p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND p2 p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 3}, { cond=(AND p2 p1), acceptance={} source=4 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 1}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(NEQ s38 1), p0:(EQ s8 0), p2:(NEQ s13 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 15223 reset in 280 ms.
Product exploration explored 100000 steps with 15232 reset in 220 ms.
Computed a total of 14 stabilizing places and 12 stable transitions
Computed a total of 14 stabilizing places and 12 stable transitions
Detected a total of 14/149 stabilizing places and 12/138 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p0 p2), (X (AND p2 p1)), (X p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 (NOT p1)))), (X p0), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
Knowledge based reduction with 13 factoid took 499 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 1653 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 574 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 502 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 604 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 138 rows 149 cols
[2024-05-25 15:34:47] [INFO ] Computed 54 invariants in 1 ms
[2024-05-25 15:34:47] [INFO ] [Real]Absence check using 37 positive place invariants in 5 ms returned sat
[2024-05-25 15:34:47] [INFO ] [Real]Absence check using 37 positive and 17 generalized place invariants in 3 ms returned sat
[2024-05-25 15:34:47] [INFO ] After 76ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2024-05-25 15:34:47] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-25 15:34:48] [INFO ] After 11ms SMT Verify possible using 5 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 15:34:48] [INFO ] After 181ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 15:34:48] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-05-25 15:34:48] [INFO ] [Nat]Absence check using 37 positive and 17 generalized place invariants in 5 ms returned sat
[2024-05-25 15:34:48] [INFO ] After 84ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 15:34:48] [INFO ] After 26ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-25 15:34:48] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 20 ms.
[2024-05-25 15:34:48] [INFO ] After 230ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 21 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=10 )
Parikh walk visited 3 properties in 1 ms.
Knowledge obtained : [(AND p1 p0 p2), (X (AND p2 p1)), (X p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 (NOT p1)))), (X p0), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (F (AND p1 (NOT p2))), (F (NOT (AND p1 p2))), (F (NOT p1)), (F (NOT p2)), (F (AND (NOT p1) p2)), (F (AND (NOT p1) (NOT p2)))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p1) (NOT p2)))
Knowledge based reduction with 13 factoid took 746 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-14-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-14-LTLFireability-08 finished in 3341 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 (G(!p1)||X(G(p2)))))'
Support contains 5 out of 477 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 477/477 places, 422/422 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 471 transition count 416
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 471 transition count 416
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 467 transition count 412
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 467 transition count 412
Applied a total of 20 rules in 27 ms. Remains 467 /477 variables (removed 10) and now considering 412/422 (removed 10) transitions.
// Phase 1: matrix 412 rows 467 cols
[2024-05-25 15:34:49] [INFO ] Computed 94 invariants in 7 ms
[2024-05-25 15:34:49] [INFO ] Implicit Places using invariants in 240 ms returned []
[2024-05-25 15:34:49] [INFO ] Invariant cache hit.
[2024-05-25 15:34:49] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 725 ms to find 0 implicit places.
[2024-05-25 15:34:49] [INFO ] Invariant cache hit.
[2024-05-25 15:34:49] [INFO ] Dead Transitions using invariants and state equation in 243 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 467/477 places, 412/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1010 ms. Remains : 467/477 places, 412/422 transitions.
Stuttering acceptance computed with spot in 317 ms :[(NOT p2), (AND (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND p1 (NOT p2)), (AND (NOT p0) (NOT p2)), true, p1, (NOT p0), (AND p1 (NOT p0) p2)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 5}], [{ cond=(AND p1 p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 6}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 8}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND p1 p0 p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={1} source=3 dest: 3}, { cond=(AND p1 p0 (NOT p2)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p1 p0), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={0, 1} source=5 dest: 5}], [{ cond=p1, acceptance={} source=6 dest: 5}, { cond=(NOT p1), acceptance={} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 5}, { cond=p0, acceptance={} source=7 dest: 7}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=8 dest: 6}, { cond=(AND p1 p0 p2), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=8 dest: 8}]], initial=3, aps=[p2:(NEQ s351 1), p1:(AND (EQ s73 1) (EQ s325 1) (EQ s432 1)), p0:(EQ s283 1)], nbAcceptance=2, 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]]
Product exploration explored 100000 steps with 682 reset in 167 ms.
Product exploration explored 100000 steps with 680 reset in 225 ms.
Computed a total of 124 stabilizing places and 117 stable transitions
Graph (complete) has 1068 edges and 467 vertex of which 466 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Computed a total of 124 stabilizing places and 117 stable transitions
Detected a total of 124/467 stabilizing places and 117/412 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0 p2))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0)))), (X (X p2)), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), true, (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0 p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 42 factoid took 1384 ms. Reduced automaton from 9 states, 31 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 144 ms :[true, p1, (AND p1 (NOT p2)), (NOT p2)]
Incomplete random walk after 10000 steps, including 68 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-25 15:34:52] [INFO ] Invariant cache hit.
[2024-05-25 15:34:52] [INFO ] [Real]Absence check using 55 positive place invariants in 29 ms returned sat
[2024-05-25 15:34:52] [INFO ] [Real]Absence check using 55 positive and 39 generalized place invariants in 23 ms returned sat
[2024-05-25 15:34:53] [INFO ] After 551ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 15:34:53] [INFO ] [Nat]Absence check using 55 positive place invariants in 12 ms returned sat
[2024-05-25 15:34:53] [INFO ] [Nat]Absence check using 55 positive and 39 generalized place invariants in 9 ms returned sat
[2024-05-25 15:34:53] [INFO ] After 171ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 15:34:53] [INFO ] Deduced a trap composed of 12 places in 181 ms of which 0 ms to minimize.
[2024-05-25 15:34:53] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-25 15:34:53] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-25 15:34:53] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 0 ms to minimize.
[2024-05-25 15:34:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 433 ms
[2024-05-25 15:34:53] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 0 ms to minimize.
[2024-05-25 15:34:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2024-05-25 15:34:53] [INFO ] After 757ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 55 ms.
[2024-05-25 15:34:54] [INFO ] After 939ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 467 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 467/467 places, 412/412 transitions.
Graph (complete) has 1068 edges and 467 vertex of which 466 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
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 466 transition count 363
Reduce places removed 48 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 50 rules applied. Total rules applied 99 place count 418 transition count 361
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 101 place count 416 transition count 361
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 101 place count 416 transition count 261
Deduced a syphon composed of 100 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 3 with 217 rules applied. Total rules applied 318 place count 299 transition count 261
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 319 place count 298 transition count 260
Iterating global reduction 3 with 1 rules applied. Total rules applied 320 place count 298 transition count 260
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 255 rules applied. Total rules applied 575 place count 168 transition count 135
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 576 place count 168 transition count 134
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 578 place count 167 transition count 138
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 584 place count 167 transition count 138
Applied a total of 584 rules in 48 ms. Remains 167 /467 variables (removed 300) and now considering 138/412 (removed 274) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 167/467 places, 138/412 transitions.
Incomplete random walk after 10000 steps, including 967 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 248 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 250 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 292 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 3) seen :0
Probably explored full state space saw : 16141 states, properties seen :2
Probabilistic random walk after 56429 steps, saw 16141 distinct states, run finished after 223 ms. (steps per millisecond=253 ) properties seen :2
Explored full state space saw : 16141 states, properties seen :0
Exhaustive walk after 56429 steps, saw 16141 distinct states, run finished after 187 ms. (steps per millisecond=301 ) properties seen :0
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0 p2))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0)))), (X (X p2)), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), true, (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0 p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p2) p1)))]
False Knowledge obtained : [(F (AND p2 p1)), (F (NOT (AND p2 (NOT p1)))), (F (NOT p2)), (F p1), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 43 factoid took 3920 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 138 ms :[true, p1, (AND p1 (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 124 ms :[true, p1, (AND p1 (NOT p2)), (NOT p2)]
Support contains 4 out of 467 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 467/467 places, 412/412 transitions.
Graph (complete) has 1068 edges and 467 vertex of which 466 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 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 465 transition count 362
Reduce places removed 48 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 50 rules applied. Total rules applied 99 place count 417 transition count 360
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 101 place count 415 transition count 360
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 99 Pre rules applied. Total rules applied 101 place count 415 transition count 261
Deduced a syphon composed of 99 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 3 with 215 rules applied. Total rules applied 316 place count 299 transition count 261
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 255 rules applied. Total rules applied 571 place count 169 transition count 136
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 572 place count 169 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 574 place count 168 transition count 139
Applied a total of 574 rules in 54 ms. Remains 168 /467 variables (removed 299) and now considering 139/412 (removed 273) transitions.
// Phase 1: matrix 139 rows 168 cols
[2024-05-25 15:34:59] [INFO ] Computed 72 invariants in 2 ms
[2024-05-25 15:34:59] [INFO ] Implicit Places using invariants in 140 ms returned [1, 2, 3, 4, 5, 6, 7, 15, 16, 20, 21, 22, 23, 24, 25, 48, 49, 50, 51, 52]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 141 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 148/467 places, 139/412 transitions.
Applied a total of 0 rules in 17 ms. Remains 148 /148 variables (removed 0) and now considering 139/139 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 212 ms. Remains : 148/467 places, 139/412 transitions.
Computed a total of 14 stabilizing places and 12 stable transitions
Computed a total of 14 stabilizing places and 12 stable transitions
Detected a total of 14/148 stabilizing places and 12/139 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p2), (X (NOT (AND (NOT p2) p1))), (X (AND p2 (NOT p1))), (X (NOT p1)), true, (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
Knowledge based reduction with 12 factoid took 548 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[true, p1, (NOT p2), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 1016 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 227 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 219 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 245 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 139 rows 148 cols
[2024-05-25 15:35:00] [INFO ] Computed 52 invariants in 1 ms
[2024-05-25 15:35:00] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-25 15:35:00] [INFO ] [Real]Absence check using 35 positive and 17 generalized place invariants in 3 ms returned sat
[2024-05-25 15:35:00] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 15:35:00] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-25 15:35:00] [INFO ] [Nat]Absence check using 35 positive and 17 generalized place invariants in 6 ms returned sat
[2024-05-25 15:35:00] [INFO ] After 126ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 15:35:00] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-25 15:35:00] [INFO ] After 78ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-25 15:35:00] [INFO ] After 182ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 68 ms.
[2024-05-25 15:35:00] [INFO ] After 437ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 2 properties in 5 ms.
Support contains 4 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 139/139 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 147 transition count 138
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 147 transition count 138
Applied a total of 3 rules in 10 ms. Remains 147 /148 variables (removed 1) and now considering 138/139 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 147/148 places, 138/139 transitions.
Incomplete random walk after 10000 steps, including 991 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 212 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Probably explored full state space saw : 16144 states, properties seen :0
Probabilistic random walk after 56442 steps, saw 16144 distinct states, run finished after 116 ms. (steps per millisecond=486 ) properties seen :0
Explored full state space saw : 16144 states, properties seen :0
Exhaustive walk after 56442 steps, saw 16144 distinct states, run finished after 88 ms. (steps per millisecond=641 ) properties seen :0
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p2), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p2), (X (NOT (AND (NOT p2) p1))), (X (AND p2 (NOT p1))), (X (NOT p1)), true, (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND p1 (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (F (AND p1 p2)), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND (NOT p1) p2))), (F p1), (F (NOT p2))]
Knowledge based reduction with 13 factoid took 898 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 143 ms :[true, (NOT p2), (AND (NOT p2) p1), p1]
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p2), (AND (NOT p2) p1), p1]
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p2), (AND (NOT p2) p1), p1]
Product exploration explored 100000 steps with 9957 reset in 171 ms.
Product exploration explored 100000 steps with 10018 reset in 257 ms.
Built C files in :
/tmp/ltsmin13321496706172673526
[2024-05-25 15:35:02] [INFO ] Computing symmetric may disable matrix : 139 transitions.
[2024-05-25 15:35:02] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:35:02] [INFO ] Computing symmetric may enable matrix : 139 transitions.
[2024-05-25 15:35:02] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:35:02] [INFO ] Computing Do-Not-Accords matrix : 139 transitions.
[2024-05-25 15:35:02] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:35:02] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13321496706172673526
Running compilation step : cd /tmp/ltsmin13321496706172673526;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 272 ms.
Running link step : cd /tmp/ltsmin13321496706172673526;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin13321496706172673526;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3266786474776155816.hoa' '--buchi-type=spotba'
LTSmin run took 380 ms.
FORMULA BusinessProcesses-PT-14-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-14-LTLFireability-10 finished in 14417 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 X(X(X((p1 U p2))))))))'
Support contains 3 out of 477 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 477/477 places, 422/422 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 471 transition count 416
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 471 transition count 416
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 467 transition count 412
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 467 transition count 412
Applied a total of 20 rules in 28 ms. Remains 467 /477 variables (removed 10) and now considering 412/422 (removed 10) transitions.
// Phase 1: matrix 412 rows 467 cols
[2024-05-25 15:35:03] [INFO ] Computed 94 invariants in 6 ms
[2024-05-25 15:35:03] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-25 15:35:03] [INFO ] Invariant cache hit.
[2024-05-25 15:35:04] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 619 ms to find 0 implicit places.
[2024-05-25 15:35:04] [INFO ] Invariant cache hit.
[2024-05-25 15:35:04] [INFO ] Dead Transitions using invariants and state equation in 213 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 467/477 places, 412/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 881 ms. Remains : 467/477 places, 412/422 transitions.
Stuttering acceptance computed with spot in 457 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}, { cond=p0, acceptance={0} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 3}, { cond=p0, acceptance={0} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 6}, { cond=true, acceptance={} source=3 dest: 7}, { cond=p0, acceptance={0} source=3 dest: 8}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 9}, { cond=true, acceptance={} source=4 dest: 10}, { cond=p0, acceptance={0} source=4 dest: 11}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 6}, { cond=p0, acceptance={0} source=5 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 6}, { cond=(NOT p2), acceptance={} source=6 dest: 7}, { cond=(AND p0 (NOT p2)), acceptance={0} source=6 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=7 dest: 9}, { cond=(NOT p2), acceptance={} source=7 dest: 10}, { cond=(AND p0 (NOT p2)), acceptance={0} source=7 dest: 11}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=8 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=9 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=9 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=9 dest: 5}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=9 dest: 6}, { cond=(AND (NOT p2) p1), acceptance={} source=9 dest: 7}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=9 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=10 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=10 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=10 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=10 dest: 9}, { cond=(AND (NOT p2) p1), acceptance={} source=10 dest: 10}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=10 dest: 11}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=11 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=11 dest: 5}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=11 dest: 6}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=11 dest: 8}]], initial=0, aps=[p0:(NEQ s217 1), p2:(EQ s342 1), p1:(EQ s379 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, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 310 steps with 5 reset in 1 ms.
FORMULA BusinessProcesses-PT-14-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLFireability-11 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' '!(X((p0 U (G(p1) U X(p2)))))'
Support contains 3 out of 477 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 477/477 places, 422/422 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 472 transition count 417
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 472 transition count 417
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 470 transition count 415
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 470 transition count 415
Applied a total of 14 rules in 27 ms. Remains 470 /477 variables (removed 7) and now considering 415/422 (removed 7) transitions.
// Phase 1: matrix 415 rows 470 cols
[2024-05-25 15:35:04] [INFO ] Computed 94 invariants in 3 ms
[2024-05-25 15:35:05] [INFO ] Implicit Places using invariants in 259 ms returned []
[2024-05-25 15:35:05] [INFO ] Invariant cache hit.
[2024-05-25 15:35:05] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 736 ms to find 0 implicit places.
[2024-05-25 15:35:05] [INFO ] Invariant cache hit.
[2024-05-25 15:35:05] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 470/477 places, 415/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 965 ms. Remains : 470/477 places, 415/422 transitions.
Stuttering acceptance computed with spot in 194 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(NEQ s66 1), p0:(EQ s244 1), p2:(EQ s57 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 678 reset in 156 ms.
Product exploration explored 100000 steps with 682 reset in 175 ms.
Computed a total of 125 stabilizing places and 118 stable transitions
Graph (complete) has 1075 edges and 470 vertex of which 469 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 125 stabilizing places and 118 stable transitions
Detected a total of 125/470 stabilizing places and 118/415 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (AND p1 (NOT p0))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 362 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 66 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 699442 steps, run timeout after 3001 ms. (steps per millisecond=233 ) properties seen :{}
Probabilistic random walk after 699442 steps, saw 109916 distinct states, run finished after 3001 ms. (steps per millisecond=233 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-25 15:35:09] [INFO ] Invariant cache hit.
[2024-05-25 15:35:10] [INFO ] [Real]Absence check using 55 positive place invariants in 12 ms returned sat
[2024-05-25 15:35:10] [INFO ] [Real]Absence check using 55 positive and 39 generalized place invariants in 8 ms returned sat
[2024-05-25 15:35:10] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 15:35:10] [INFO ] [Nat]Absence check using 55 positive place invariants in 12 ms returned sat
[2024-05-25 15:35:10] [INFO ] [Nat]Absence check using 55 positive and 39 generalized place invariants in 8 ms returned sat
[2024-05-25 15:35:10] [INFO ] After 148ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 15:35:10] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 0 ms to minimize.
[2024-05-25 15:35:10] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-25 15:35:10] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 0 ms to minimize.
[2024-05-25 15:35:10] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 0 ms to minimize.
[2024-05-25 15:35:10] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 0 ms to minimize.
[2024-05-25 15:35:10] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 1 ms to minimize.
[2024-05-25 15:35:11] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 0 ms to minimize.
[2024-05-25 15:35:11] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 1 ms to minimize.
[2024-05-25 15:35:11] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 4 ms to minimize.
[2024-05-25 15:35:11] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 842 ms
[2024-05-25 15:35:11] [INFO ] After 1055ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 40 ms.
[2024-05-25 15:35:11] [INFO ] After 1214ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 220 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=110 )
Parikh walk visited 3 properties in 9 ms.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (AND p1 (NOT p0))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p2)))), (F (NOT p1)), (F (AND (NOT p1) (NOT p2)))]
Property proved to be false thanks to negative knowledge :(F (NOT p1))
Knowledge based reduction with 12 factoid took 468 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-14-LTLFireability-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-14-LTLFireability-12 finished in 7063 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((X(p1)&&p0))||G(p2)))'
Support contains 2 out of 477 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 477/477 places, 422/422 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 470 transition count 415
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 470 transition count 415
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 466 transition count 411
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 466 transition count 411
Applied a total of 22 rules in 23 ms. Remains 466 /477 variables (removed 11) and now considering 411/422 (removed 11) transitions.
// Phase 1: matrix 411 rows 466 cols
[2024-05-25 15:35:11] [INFO ] Computed 94 invariants in 5 ms
[2024-05-25 15:35:12] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-05-25 15:35:12] [INFO ] Invariant cache hit.
[2024-05-25 15:35:12] [INFO ] Implicit Places using invariants and state equation in 458 ms returned []
Implicit Place search using SMT with State Equation took 668 ms to find 0 implicit places.
[2024-05-25 15:35:12] [INFO ] Invariant cache hit.
[2024-05-25 15:35:12] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 466/477 places, 411/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 918 ms. Remains : 466/477 places, 411/422 transitions.
Stuttering acceptance computed with spot in 133 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2 p1), acceptance={} source=3 dest: 3}, { cond=(OR (AND (NOT p0) p2) (AND p2 (NOT p1))), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (EQ s135 0) (EQ s403 0)), p2:(EQ s403 0), p1:(EQ s135 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 680 reset in 160 ms.
Product exploration explored 100000 steps with 685 reset in 175 ms.
Computed a total of 123 stabilizing places and 116 stable transitions
Graph (complete) has 1067 edges and 466 vertex of which 465 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 123 stabilizing places and 116 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 p1))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (OR (NOT p0) (NOT p1))), (X p2), (X (NOT (AND p0 (NOT p2) p1))), (X (OR (AND (NOT p0) p2) (AND p2 (NOT p1)))), true, (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))))), (X (X (OR (NOT p0) (NOT p1)))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (OR (AND (NOT p0) p2) (AND p2 (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 16 factoid took 121 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p2)]
Incomplete random walk after 10000 steps, including 69 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2301 steps, run visited all 1 properties in 14 ms. (steps per millisecond=164 )
Probabilistic random walk after 2301 steps, saw 2053 distinct states, run finished after 14 ms. (steps per millisecond=164 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 p1))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (OR (NOT p0) (NOT p1))), (X p2), (X (NOT (AND p0 (NOT p2) p1))), (X (OR (AND (NOT p0) p2) (AND p2 (NOT p1)))), true, (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))))), (X (X (OR (NOT p0) (NOT p1)))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (OR (AND (NOT p0) p2) (AND p2 (NOT p1)))))]
False Knowledge obtained : [(F (NOT p2))]
Property proved to be false thanks to negative knowledge :(F (NOT p2))
Knowledge based reduction with 16 factoid took 183 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-14-LTLFireability-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-14-LTLFireability-13 finished in 1835 ms.
All properties solved by simple procedures.
Total runtime 46790 ms.

BK_STOP 1716651313897

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ 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-14"
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-14, 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-171620414900348"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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