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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 660K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K 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.8K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K 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 14K Apr 11 16:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 11 16:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 11 16:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 11 16:34 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 161K 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-17-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716651456028

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-17
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-25 15:37:38] [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:37:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:37:39] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2024-05-25 15:37:39] [INFO ] Transformed 650 places.
[2024-05-25 15:37:39] [INFO ] Transformed 580 transitions.
[2024-05-25 15:37:39] [INFO ] Found NUPN structural information;
[2024-05-25 15:37:39] [INFO ] Parsed PT model containing 650 places and 580 transitions and 1709 arcs in 303 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 4 places in 11 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-17-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 646 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 646/646 places, 576/576 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 643 transition count 576
Discarding 88 places :
Symmetric choice reduction at 1 with 88 rule applications. Total rules 91 place count 555 transition count 488
Iterating global reduction 1 with 88 rules applied. Total rules applied 179 place count 555 transition count 488
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 223 place count 511 transition count 444
Iterating global reduction 1 with 44 rules applied. Total rules applied 267 place count 511 transition count 444
Applied a total of 267 rules in 153 ms. Remains 511 /646 variables (removed 135) and now considering 444/576 (removed 132) transitions.
// Phase 1: matrix 444 rows 511 cols
[2024-05-25 15:37:39] [INFO ] Computed 105 invariants in 23 ms
[2024-05-25 15:37:40] [INFO ] Implicit Places using invariants in 559 ms returned []
[2024-05-25 15:37:40] [INFO ] Invariant cache hit.
[2024-05-25 15:37:41] [INFO ] Implicit Places using invariants and state equation in 931 ms returned []
Implicit Place search using SMT with State Equation took 1552 ms to find 0 implicit places.
[2024-05-25 15:37:41] [INFO ] Invariant cache hit.
[2024-05-25 15:37:41] [INFO ] Dead Transitions using invariants and state equation in 408 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 511/646 places, 444/576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2121 ms. Remains : 511/646 places, 444/576 transitions.
Support contains 29 out of 511 places after structural reductions.
[2024-05-25 15:37:41] [INFO ] Flatten gal took : 84 ms
[2024-05-25 15:37:41] [INFO ] Flatten gal took : 38 ms
[2024-05-25 15:37:41] [INFO ] Input system was already deterministic with 444 transitions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 765 ms. (steps per millisecond=13 ) properties (out of 24) seen :14
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2024-05-25 15:37:43] [INFO ] Invariant cache hit.
[2024-05-25 15:37:43] [INFO ] [Real]Absence check using 62 positive place invariants in 40 ms returned sat
[2024-05-25 15:37:43] [INFO ] [Real]Absence check using 62 positive and 43 generalized place invariants in 19 ms returned sat
[2024-05-25 15:37:44] [INFO ] After 486ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:8
[2024-05-25 15:37:44] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 8 ms to minimize.
[2024-05-25 15:37:47] [INFO ] Deduced a trap composed of 11 places in 2404 ms of which 19 ms to minimize.
[2024-05-25 15:37:47] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 1 ms to minimize.
[2024-05-25 15:37:47] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 1 ms to minimize.
[2024-05-25 15:37:47] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 2 ms to minimize.
[2024-05-25 15:37:47] [INFO ] Deduced a trap composed of 55 places in 107 ms of which 0 ms to minimize.
[2024-05-25 15:37:47] [INFO ] Deduced a trap composed of 55 places in 124 ms of which 12 ms to minimize.
[2024-05-25 15:37:48] [INFO ] Deduced a trap composed of 33 places in 143 ms of which 1 ms to minimize.
[2024-05-25 15:37:48] [INFO ] Deduced a trap composed of 52 places in 104 ms of which 0 ms to minimize.
[2024-05-25 15:37:48] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3866 ms
[2024-05-25 15:37:49] [INFO ] Deduced a trap composed of 35 places in 1213 ms of which 26 ms to minimize.
[2024-05-25 15:37:49] [INFO ] Deduced a trap composed of 26 places in 260 ms of which 0 ms to minimize.
[2024-05-25 15:37:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1593 ms
[2024-05-25 15:37:49] [INFO ] After 6043ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-25 15:37:49] [INFO ] After 6450ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-25 15:37:50] [INFO ] [Nat]Absence check using 62 positive place invariants in 42 ms returned sat
[2024-05-25 15:37:50] [INFO ] [Nat]Absence check using 62 positive and 43 generalized place invariants in 22 ms returned sat
[2024-05-25 15:37:51] [INFO ] After 620ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2024-05-25 15:37:51] [INFO ] Deduced a trap composed of 8 places in 162 ms of which 1 ms to minimize.
[2024-05-25 15:37:51] [INFO ] Deduced a trap composed of 20 places in 147 ms of which 1 ms to minimize.
[2024-05-25 15:37:51] [INFO ] Deduced a trap composed of 29 places in 175 ms of which 0 ms to minimize.
[2024-05-25 15:37:51] [INFO ] Deduced a trap composed of 21 places in 150 ms of which 0 ms to minimize.
[2024-05-25 15:37:51] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 1 ms to minimize.
[2024-05-25 15:37:52] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 1 ms to minimize.
[2024-05-25 15:37:52] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 1 ms to minimize.
[2024-05-25 15:37:52] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 1 ms to minimize.
[2024-05-25 15:37:54] [INFO ] Deduced a trap composed of 23 places in 1669 ms of which 1 ms to minimize.
[2024-05-25 15:37:54] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 1 ms to minimize.
[2024-05-25 15:37:54] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 1 ms to minimize.
[2024-05-25 15:37:54] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 0 ms to minimize.
[2024-05-25 15:37:54] [INFO ] Deduced a trap composed of 56 places in 85 ms of which 0 ms to minimize.
[2024-05-25 15:37:54] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 0 ms to minimize.
[2024-05-25 15:37:54] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 0 ms to minimize.
[2024-05-25 15:37:54] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 0 ms to minimize.
[2024-05-25 15:37:54] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 1 ms to minimize.
[2024-05-25 15:37:54] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3821 ms
[2024-05-25 15:37:55] [INFO ] Deduced a trap composed of 90 places in 136 ms of which 1 ms to minimize.
[2024-05-25 15:37:55] [INFO ] Deduced a trap composed of 87 places in 173 ms of which 5 ms to minimize.
[2024-05-25 15:37:55] [INFO ] Deduced a trap composed of 86 places in 130 ms of which 1 ms to minimize.
[2024-05-25 15:37:55] [INFO ] Deduced a trap composed of 91 places in 112 ms of which 1 ms to minimize.
[2024-05-25 15:37:55] [INFO ] Deduced a trap composed of 88 places in 113 ms of which 0 ms to minimize.
[2024-05-25 15:37:56] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 862 ms
[2024-05-25 15:37:56] [INFO ] After 5676ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 335 ms.
[2024-05-25 15:37:56] [INFO ] After 6545ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 3 properties in 182 ms.
Support contains 12 out of 511 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 511/511 places, 444/444 transitions.
Graph (trivial) has 230 edges and 511 vertex of which 7 / 511 are part of one of the 1 SCC in 5 ms
Free SCC test removed 6 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 1140 edges and 505 vertex of which 504 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 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 55 place count 504 transition count 382
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 1 with 53 rules applied. Total rules applied 108 place count 451 transition count 382
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 104 Pre rules applied. Total rules applied 108 place count 451 transition count 278
Deduced a syphon composed of 104 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 336 place count 327 transition count 278
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 341 place count 322 transition count 273
Iterating global reduction 2 with 5 rules applied. Total rules applied 346 place count 322 transition count 273
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 346 place count 322 transition count 272
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 348 place count 321 transition count 272
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 261 rules applied. Total rules applied 609 place count 188 transition count 144
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 612 place count 188 transition count 141
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 615 place count 185 transition count 141
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 620 place count 185 transition count 141
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 621 place count 184 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 622 place count 183 transition count 140
Applied a total of 622 rules in 125 ms. Remains 183 /511 variables (removed 328) and now considering 140/444 (removed 304) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 183/511 places, 140/444 transitions.
Incomplete random walk after 10000 steps, including 184 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 7) seen :6
Finished Best-First random walk after 3613 steps, including 19 resets, run visited all 1 properties in 10 ms. (steps per millisecond=361 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 213 stabilizing places and 185 stable transitions
Graph (complete) has 1148 edges and 511 vertex of which 510 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.28 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 444/444 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 502 transition count 435
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 502 transition count 435
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 501 transition count 434
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 501 transition count 434
Applied a total of 20 rules in 86 ms. Remains 501 /511 variables (removed 10) and now considering 434/444 (removed 10) transitions.
// Phase 1: matrix 434 rows 501 cols
[2024-05-25 15:37:57] [INFO ] Computed 105 invariants in 35 ms
[2024-05-25 15:37:57] [INFO ] Implicit Places using invariants in 247 ms returned []
[2024-05-25 15:37:57] [INFO ] Invariant cache hit.
[2024-05-25 15:37:58] [INFO ] Implicit Places using invariants and state equation in 634 ms returned []
Implicit Place search using SMT with State Equation took 888 ms to find 0 implicit places.
[2024-05-25 15:37:58] [INFO ] Invariant cache hit.
[2024-05-25 15:37:58] [INFO ] Dead Transitions using invariants and state equation in 242 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 501/511 places, 434/444 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1220 ms. Remains : 501/511 places, 434/444 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 428 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s318 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 91 steps with 0 reset in 9 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLFireability-00 finished in 1737 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0&&G(p1)))))))'
Support contains 2 out of 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 444/444 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 502 transition count 435
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 502 transition count 435
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 501 transition count 434
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 501 transition count 434
Applied a total of 20 rules in 73 ms. Remains 501 /511 variables (removed 10) and now considering 434/444 (removed 10) transitions.
[2024-05-25 15:37:59] [INFO ] Invariant cache hit.
[2024-05-25 15:37:59] [INFO ] Implicit Places using invariants in 247 ms returned []
[2024-05-25 15:37:59] [INFO ] Invariant cache hit.
[2024-05-25 15:38:00] [INFO ] Implicit Places using invariants and state equation in 981 ms returned []
Implicit Place search using SMT with State Equation took 1230 ms to find 0 implicit places.
[2024-05-25 15:38:00] [INFO ] Invariant cache hit.
[2024-05-25 15:38:00] [INFO ] Dead Transitions using invariants and state equation in 358 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 501/511 places, 434/444 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1675 ms. Remains : 501/511 places, 434/444 transitions.
Stuttering acceptance computed with spot in 345 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s189 1), p1:(EQ s260 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 140 steps with 0 reset in 5 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLFireability-01 finished in 2047 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(G(p0)))'
Support contains 3 out of 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 444/444 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 502 transition count 435
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 502 transition count 435
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 501 transition count 434
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 501 transition count 434
Applied a total of 20 rules in 61 ms. Remains 501 /511 variables (removed 10) and now considering 434/444 (removed 10) transitions.
[2024-05-25 15:38:01] [INFO ] Invariant cache hit.
[2024-05-25 15:38:01] [INFO ] Implicit Places using invariants in 282 ms returned []
[2024-05-25 15:38:01] [INFO ] Invariant cache hit.
[2024-05-25 15:38:03] [INFO ] Implicit Places using invariants and state equation in 1535 ms returned []
Implicit Place search using SMT with State Equation took 1821 ms to find 0 implicit places.
[2024-05-25 15:38:03] [INFO ] Invariant cache hit.
[2024-05-25 15:38:03] [INFO ] Dead Transitions using invariants and state equation in 377 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 501/511 places, 434/444 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2261 ms. Remains : 501/511 places, 434/444 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (NEQ s109 1) (NEQ s313 1) (NEQ s482 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 658 reset in 351 ms.
Product exploration explored 100000 steps with 657 reset in 382 ms.
Computed a total of 206 stabilizing places and 178 stable transitions
Graph (complete) has 1135 edges and 501 vertex of which 500 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Computed a total of 206 stabilizing places and 178 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 117 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 65 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Finished probabilistic random walk after 83655 steps, run visited all 1 properties in 440 ms. (steps per millisecond=190 )
Probabilistic random walk after 83655 steps, saw 18135 distinct states, run finished after 445 ms. (steps per millisecond=187 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 201 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-17-LTLFireability-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-17-LTLFireability-02 finished in 4120 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 444/444 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 502 transition count 435
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 502 transition count 435
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 501 transition count 434
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 501 transition count 434
Applied a total of 20 rules in 33 ms. Remains 501 /511 variables (removed 10) and now considering 434/444 (removed 10) transitions.
[2024-05-25 15:38:05] [INFO ] Invariant cache hit.
[2024-05-25 15:38:05] [INFO ] Implicit Places using invariants in 345 ms returned []
[2024-05-25 15:38:05] [INFO ] Invariant cache hit.
[2024-05-25 15:38:06] [INFO ] Implicit Places using invariants and state equation in 726 ms returned []
Implicit Place search using SMT with State Equation took 1102 ms to find 0 implicit places.
[2024-05-25 15:38:06] [INFO ] Invariant cache hit.
[2024-05-25 15:38:07] [INFO ] Dead Transitions using invariants and state equation in 1025 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 501/511 places, 434/444 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2161 ms. Remains : 501/511 places, 434/444 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s241 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 479 ms.
Product exploration explored 100000 steps with 50000 reset in 381 ms.
Computed a total of 206 stabilizing places and 178 stable transitions
Graph (complete) has 1135 edges and 501 vertex of which 500 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.16 ms
Computed a total of 206 stabilizing places and 178 stable transitions
Detected a total of 206/501 stabilizing places and 178/434 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 44 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-17-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-17-LTLFireability-03 finished in 3207 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(p0)))'
Support contains 1 out of 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 444/444 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 503 transition count 436
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 503 transition count 436
Applied a total of 16 rules in 20 ms. Remains 503 /511 variables (removed 8) and now considering 436/444 (removed 8) transitions.
// Phase 1: matrix 436 rows 503 cols
[2024-05-25 15:38:08] [INFO ] Computed 105 invariants in 5 ms
[2024-05-25 15:38:08] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-05-25 15:38:08] [INFO ] Invariant cache hit.
[2024-05-25 15:38:09] [INFO ] Implicit Places using invariants and state equation in 649 ms returned []
Implicit Place search using SMT with State Equation took 899 ms to find 0 implicit places.
[2024-05-25 15:38:09] [INFO ] Invariant cache hit.
[2024-05-25 15:38:09] [INFO ] Dead Transitions using invariants and state equation in 252 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 503/511 places, 436/444 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1187 ms. Remains : 503/511 places, 436/444 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s458 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLFireability-07 finished in 1316 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(F(p0))))'
Support contains 3 out of 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 444/444 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 502 transition count 435
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 502 transition count 435
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 501 transition count 434
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 501 transition count 434
Applied a total of 20 rules in 36 ms. Remains 501 /511 variables (removed 10) and now considering 434/444 (removed 10) transitions.
// Phase 1: matrix 434 rows 501 cols
[2024-05-25 15:38:09] [INFO ] Computed 105 invariants in 8 ms
[2024-05-25 15:38:10] [INFO ] Implicit Places using invariants in 229 ms returned []
[2024-05-25 15:38:10] [INFO ] Invariant cache hit.
[2024-05-25 15:38:10] [INFO ] Implicit Places using invariants and state equation in 584 ms returned []
Implicit Place search using SMT with State Equation took 828 ms to find 0 implicit places.
[2024-05-25 15:38:10] [INFO ] Invariant cache hit.
[2024-05-25 15:38:11] [INFO ] Dead Transitions using invariants and state equation in 378 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 501/511 places, 434/444 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1249 ms. Remains : 501/511 places, 434/444 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s211 0) (EQ s384 0) (EQ s462 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 408 ms.
Product exploration explored 100000 steps with 33333 reset in 394 ms.
Computed a total of 206 stabilizing places and 178 stable transitions
Graph (complete) has 1135 edges and 501 vertex of which 500 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 206 stabilizing places and 178 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-17-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-17-LTLFireability-08 finished in 2319 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 p1)||(p2 U (p3||G(p2))))))'
Support contains 3 out of 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 444/444 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 502 transition count 435
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 502 transition count 435
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 501 transition count 434
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 501 transition count 434
Applied a total of 20 rules in 34 ms. Remains 501 /511 variables (removed 10) and now considering 434/444 (removed 10) transitions.
[2024-05-25 15:38:12] [INFO ] Invariant cache hit.
[2024-05-25 15:38:12] [INFO ] Implicit Places using invariants in 283 ms returned []
[2024-05-25 15:38:12] [INFO ] Invariant cache hit.
[2024-05-25 15:38:13] [INFO ] Implicit Places using invariants and state equation in 808 ms returned []
Implicit Place search using SMT with State Equation took 1098 ms to find 0 implicit places.
[2024-05-25 15:38:13] [INFO ] Invariant cache hit.
[2024-05-25 15:38:13] [INFO ] Dead Transitions using invariants and state equation in 379 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 501/511 places, 434/444 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1525 ms. Remains : 501/511 places, 434/444 transitions.
Stuttering acceptance computed with spot in 263 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0 (NOT p3) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p3) p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (EQ s61 1) (EQ s466 1)), p0:(OR (EQ s3 1) (EQ s466 1)), p3:(AND (NEQ s466 1) (NEQ s61 1)), p2:(NEQ s61 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 439 ms.
Product exploration explored 100000 steps with 50000 reset in 371 ms.
Computed a total of 206 stabilizing places and 178 stable transitions
Graph (complete) has 1135 edges and 501 vertex of which 500 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.17 ms
Computed a total of 206 stabilizing places and 178 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p3 p2), (X (NOT (AND (NOT p1) p0 (NOT p3) p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3) p2)))), true, (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p3) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 38 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-17-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-17-LTLFireability-09 finished in 2735 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(p0) U (p1||G(p2)))))'
Support contains 3 out of 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 444/444 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 505 transition count 438
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 505 transition count 438
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 504 transition count 437
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 504 transition count 437
Applied a total of 14 rules in 52 ms. Remains 504 /511 variables (removed 7) and now considering 437/444 (removed 7) transitions.
// Phase 1: matrix 437 rows 504 cols
[2024-05-25 15:38:14] [INFO ] Computed 105 invariants in 6 ms
[2024-05-25 15:38:15] [INFO ] Implicit Places using invariants in 319 ms returned []
[2024-05-25 15:38:15] [INFO ] Invariant cache hit.
[2024-05-25 15:38:15] [INFO ] Implicit Places using invariants and state equation in 645 ms returned []
Implicit Place search using SMT with State Equation took 977 ms to find 0 implicit places.
[2024-05-25 15:38:15] [INFO ] Invariant cache hit.
[2024-05-25 15:38:16] [INFO ] Dead Transitions using invariants and state equation in 327 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 504/511 places, 437/444 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1372 ms. Remains : 504/511 places, 437/444 transitions.
Stuttering acceptance computed with spot in 264 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(NEQ s464 1), p2:(NEQ s276 1), p0:(NEQ s292 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 780 reset in 452 ms.
Product exploration explored 100000 steps with 772 reset in 209 ms.
Computed a total of 209 stabilizing places and 181 stable transitions
Graph (complete) has 1139 edges and 504 vertex of which 503 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 209 stabilizing places and 181 stable transitions
Detected a total of 209/504 stabilizing places and 181/437 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 p0), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), true, (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 359 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 291 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Incomplete random walk after 10000 steps, including 66 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-25 15:38:18] [INFO ] Invariant cache hit.
[2024-05-25 15:38:18] [INFO ] [Real]Absence check using 59 positive place invariants in 17 ms returned sat
[2024-05-25 15:38:18] [INFO ] [Real]Absence check using 59 positive and 46 generalized place invariants in 13 ms returned sat
[2024-05-25 15:38:18] [INFO ] After 272ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2024-05-25 15:38:18] [INFO ] Deduced a trap composed of 22 places in 153 ms of which 1 ms to minimize.
[2024-05-25 15:38:19] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 0 ms to minimize.
[2024-05-25 15:38:19] [INFO ] Deduced a trap composed of 24 places in 138 ms of which 1 ms to minimize.
[2024-05-25 15:38:19] [INFO ] Deduced a trap composed of 33 places in 137 ms of which 0 ms to minimize.
[2024-05-25 15:38:19] [INFO ] Deduced a trap composed of 24 places in 155 ms of which 1 ms to minimize.
[2024-05-25 15:38:19] [INFO ] Deduced a trap composed of 63 places in 165 ms of which 2 ms to minimize.
[2024-05-25 15:38:19] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1070 ms
[2024-05-25 15:38:20] [INFO ] After 1569ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 15:38:20] [INFO ] After 1810ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 15:38:20] [INFO ] [Nat]Absence check using 59 positive place invariants in 34 ms returned sat
[2024-05-25 15:38:20] [INFO ] [Nat]Absence check using 59 positive and 46 generalized place invariants in 27 ms returned sat
[2024-05-25 15:38:20] [INFO ] After 386ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 15:38:20] [INFO ] Deduced a trap composed of 22 places in 138 ms of which 14 ms to minimize.
[2024-05-25 15:38:21] [INFO ] Deduced a trap composed of 30 places in 421 ms of which 27 ms to minimize.
[2024-05-25 15:38:21] [INFO ] Deduced a trap composed of 24 places in 163 ms of which 36 ms to minimize.
[2024-05-25 15:38:21] [INFO ] Deduced a trap composed of 33 places in 164 ms of which 1 ms to minimize.
[2024-05-25 15:38:21] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 1 ms to minimize.
[2024-05-25 15:38:21] [INFO ] Deduced a trap composed of 63 places in 133 ms of which 1 ms to minimize.
[2024-05-25 15:38:21] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1313 ms
[2024-05-25 15:38:22] [INFO ] Deduced a trap composed of 89 places in 133 ms of which 0 ms to minimize.
[2024-05-25 15:38:22] [INFO ] Deduced a trap composed of 90 places in 135 ms of which 1 ms to minimize.
[2024-05-25 15:38:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 366 ms
[2024-05-25 15:38:22] [INFO ] After 2157ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 71 ms.
[2024-05-25 15:38:22] [INFO ] After 2496ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 21 ms.
Support contains 3 out of 504 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 504/504 places, 437/437 transitions.
Graph (trivial) has 227 edges and 504 vertex of which 6 / 504 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1132 edges and 499 vertex of which 498 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 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 498 transition count 378
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 104 place count 447 transition count 378
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 106 Pre rules applied. Total rules applied 104 place count 447 transition count 272
Deduced a syphon composed of 106 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 336 place count 321 transition count 272
Performed 136 Post agglomeration using F-continuation condition.Transition count delta: 136
Deduced a syphon composed of 136 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 2 with 277 rules applied. Total rules applied 613 place count 180 transition count 136
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 615 place count 179 transition count 140
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 617 place count 179 transition count 138
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 619 place count 177 transition count 138
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 620 place count 177 transition count 138
Applied a total of 620 rules in 69 ms. Remains 177 /504 variables (removed 327) and now considering 138/437 (removed 299) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 177/504 places, 138/437 transitions.
Incomplete random walk after 10000 steps, including 272 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 121 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 138 rows 177 cols
[2024-05-25 15:38:22] [INFO ] Computed 80 invariants in 2 ms
[2024-05-25 15:38:22] [INFO ] [Real]Absence check using 59 positive place invariants in 8 ms returned sat
[2024-05-25 15:38:22] [INFO ] [Real]Absence check using 59 positive and 21 generalized place invariants in 6 ms returned sat
[2024-05-25 15:38:22] [INFO ] After 57ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 15:38:22] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-25 15:38:22] [INFO ] After 9ms SMT Verify possible using 13 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:38:22] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:38:23] [INFO ] [Nat]Absence check using 59 positive place invariants in 13 ms returned sat
[2024-05-25 15:38:23] [INFO ] [Nat]Absence check using 59 positive and 21 generalized place invariants in 6 ms returned sat
[2024-05-25 15:38:23] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:38:23] [INFO ] After 9ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 15:38:23] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-25 15:38:23] [INFO ] After 167ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 138/138 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 177 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 176 transition count 137
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 175 transition count 136
Applied a total of 4 rules in 12 ms. Remains 175 /177 variables (removed 2) and now considering 136/138 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 175/177 places, 136/138 transitions.
Incomplete random walk after 10000 steps, including 260 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 125 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Probably explored full state space saw : 5709 states, properties seen :0
Probabilistic random walk after 18617 steps, saw 5709 distinct states, run finished after 77 ms. (steps per millisecond=241 ) properties seen :0
Explored full state space saw : 5709 states, properties seen :0
Exhaustive walk after 18617 steps, saw 5709 distinct states, run finished after 67 ms. (steps per millisecond=277 ) properties seen :0
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p0), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), true, (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) p2)), (F (AND (NOT p0) (NOT p2))), (F (NOT p2)), (F (NOT p0)), (F (AND (NOT p1) p2))]
Knowledge based reduction with 16 factoid took 1515 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 318 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 281 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 437/437 transitions.
Applied a total of 0 rules in 11 ms. Remains 504 /504 variables (removed 0) and now considering 437/437 (removed 0) transitions.
// Phase 1: matrix 437 rows 504 cols
[2024-05-25 15:38:25] [INFO ] Computed 105 invariants in 5 ms
[2024-05-25 15:38:27] [INFO ] Implicit Places using invariants in 1604 ms returned []
[2024-05-25 15:38:27] [INFO ] Invariant cache hit.
[2024-05-25 15:38:27] [INFO ] Implicit Places using invariants and state equation in 674 ms returned []
Implicit Place search using SMT with State Equation took 2293 ms to find 0 implicit places.
[2024-05-25 15:38:27] [INFO ] Invariant cache hit.
[2024-05-25 15:38:28] [INFO ] Dead Transitions using invariants and state equation in 407 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2716 ms. Remains : 504/504 places, 437/437 transitions.
Computed a total of 209 stabilizing places and 181 stable transitions
Graph (complete) has 1139 edges and 504 vertex of which 503 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 209 stabilizing places and 181 stable transitions
Detected a total of 209/504 stabilizing places and 181/437 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X p1), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0)))), true, (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p2)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 493 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 64 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-25 15:38:29] [INFO ] Invariant cache hit.
[2024-05-25 15:38:29] [INFO ] [Real]Absence check using 59 positive place invariants in 33 ms returned sat
[2024-05-25 15:38:29] [INFO ] [Real]Absence check using 59 positive and 46 generalized place invariants in 30 ms returned sat
[2024-05-25 15:38:29] [INFO ] After 410ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-25 15:38:30] [INFO ] Deduced a trap composed of 29 places in 167 ms of which 5 ms to minimize.
[2024-05-25 15:38:30] [INFO ] Deduced a trap composed of 43 places in 140 ms of which 0 ms to minimize.
[2024-05-25 15:38:30] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 0 ms to minimize.
[2024-05-25 15:38:30] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 1 ms to minimize.
[2024-05-25 15:38:30] [INFO ] Deduced a trap composed of 21 places in 165 ms of which 1 ms to minimize.
[2024-05-25 15:38:30] [INFO ] Deduced a trap composed of 13 places in 172 ms of which 0 ms to minimize.
[2024-05-25 15:38:31] [INFO ] Deduced a trap composed of 48 places in 130 ms of which 1 ms to minimize.
[2024-05-25 15:38:31] [INFO ] Deduced a trap composed of 24 places in 174 ms of which 0 ms to minimize.
[2024-05-25 15:38:31] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 0 ms to minimize.
[2024-05-25 15:38:31] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1590 ms
[2024-05-25 15:38:31] [INFO ] After 2097ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 15:38:31] [INFO ] After 2374ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 15:38:31] [INFO ] [Nat]Absence check using 59 positive place invariants in 16 ms returned sat
[2024-05-25 15:38:31] [INFO ] [Nat]Absence check using 59 positive and 46 generalized place invariants in 12 ms returned sat
[2024-05-25 15:38:31] [INFO ] After 190ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 15:38:31] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 1 ms to minimize.
[2024-05-25 15:38:32] [INFO ] Deduced a trap composed of 43 places in 103 ms of which 1 ms to minimize.
[2024-05-25 15:38:32] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 1 ms to minimize.
[2024-05-25 15:38:32] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 1 ms to minimize.
[2024-05-25 15:38:32] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 1 ms to minimize.
[2024-05-25 15:38:32] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 0 ms to minimize.
[2024-05-25 15:38:32] [INFO ] Deduced a trap composed of 48 places in 138 ms of which 3 ms to minimize.
[2024-05-25 15:38:32] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 0 ms to minimize.
[2024-05-25 15:38:33] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 2 ms to minimize.
[2024-05-25 15:38:33] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1177 ms
[2024-05-25 15:38:33] [INFO ] After 1407ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 49 ms.
[2024-05-25 15:38:33] [INFO ] After 1647ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 504 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 504/504 places, 437/437 transitions.
Graph (trivial) has 228 edges and 504 vertex of which 6 / 504 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1132 edges and 499 vertex of which 498 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 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 498 transition count 378
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 104 place count 447 transition count 378
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 106 Pre rules applied. Total rules applied 104 place count 447 transition count 272
Deduced a syphon composed of 106 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 336 place count 321 transition count 272
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 337 place count 320 transition count 271
Iterating global reduction 2 with 1 rules applied. Total rules applied 338 place count 320 transition count 271
Performed 136 Post agglomeration using F-continuation condition.Transition count delta: 136
Deduced a syphon composed of 136 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 2 with 277 rules applied. Total rules applied 615 place count 179 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 617 place count 178 transition count 139
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 619 place count 178 transition count 137
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 621 place count 176 transition count 137
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 622 place count 176 transition count 137
Applied a total of 622 rules in 71 ms. Remains 176 /504 variables (removed 328) and now considering 137/437 (removed 300) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 176/504 places, 137/437 transitions.
Incomplete random walk after 10000 steps, including 258 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :1
Finished Best-First random walk after 962 steps, including 7 resets, run visited all 1 properties in 3 ms. (steps per millisecond=320 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X p1), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0)))), true, (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p2)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p0) p2)), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (NOT p1)), (F (AND (NOT p0) (NOT p2))), (F (NOT p2))]
Knowledge based reduction with 15 factoid took 1191 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 208 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 243 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 656 reset in 255 ms.
Product exploration explored 100000 steps with 657 reset in 334 ms.
Applying partial POR strategy [true, false, true, false]
Stuttering acceptance computed with spot in 182 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 437/437 transitions.
Graph (trivial) has 227 edges and 504 vertex of which 6 / 504 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 1133 edges and 499 vertex of which 498 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 498 transition count 430
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 74 Pre rules applied. Total rules applied 53 place count 498 transition count 484
Deduced a syphon composed of 125 places in 0 ms
Iterating global reduction 1 with 74 rules applied. Total rules applied 127 place count 498 transition count 484
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 144 place count 481 transition count 451
Deduced a syphon composed of 108 places in 1 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 161 place count 481 transition count 451
Performed 167 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 275 places in 1 ms
Iterating global reduction 1 with 167 rules applied. Total rules applied 328 place count 481 transition count 451
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 366 place count 443 transition count 413
Deduced a syphon composed of 237 places in 0 ms
Iterating global reduction 1 with 38 rules applied. Total rules applied 404 place count 443 transition count 413
Deduced a syphon composed of 237 places in 0 ms
Applied a total of 404 rules in 197 ms. Remains 443 /504 variables (removed 61) and now considering 413/437 (removed 24) transitions.
[2024-05-25 15:38:36] [INFO ] Redundant transitions in 31 ms returned []
// Phase 1: matrix 413 rows 443 cols
[2024-05-25 15:38:36] [INFO ] Computed 105 invariants in 6 ms
[2024-05-25 15:38:37] [INFO ] Dead Transitions using invariants and state equation in 516 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 443/504 places, 413/437 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 813 ms. Remains : 443/504 places, 413/437 transitions.
Built C files in :
/tmp/ltsmin9428688591582622829
[2024-05-25 15:38:37] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9428688591582622829
Running compilation step : cd /tmp/ltsmin9428688591582622829;'/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 1283 ms.
Running link step : cd /tmp/ltsmin9428688591582622829;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin9428688591582622829;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15814063701474250446.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 437/437 transitions.
Applied a total of 0 rules in 9 ms. Remains 504 /504 variables (removed 0) and now considering 437/437 (removed 0) transitions.
// Phase 1: matrix 437 rows 504 cols
[2024-05-25 15:38:52] [INFO ] Computed 105 invariants in 5 ms
[2024-05-25 15:38:52] [INFO ] Implicit Places using invariants in 322 ms returned []
[2024-05-25 15:38:52] [INFO ] Invariant cache hit.
[2024-05-25 15:38:53] [INFO ] Implicit Places using invariants and state equation in 917 ms returned []
Implicit Place search using SMT with State Equation took 1254 ms to find 0 implicit places.
[2024-05-25 15:38:53] [INFO ] Invariant cache hit.
[2024-05-25 15:38:53] [INFO ] Dead Transitions using invariants and state equation in 310 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1579 ms. Remains : 504/504 places, 437/437 transitions.
Built C files in :
/tmp/ltsmin5737143251416915732
[2024-05-25 15:38:53] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5737143251416915732
Running compilation step : cd /tmp/ltsmin5737143251416915732;'/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 841 ms.
Running link step : cd /tmp/ltsmin5737143251416915732;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin5737143251416915732;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3882605588687891135.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 15:39:09] [INFO ] Flatten gal took : 43 ms
[2024-05-25 15:39:09] [INFO ] Flatten gal took : 35 ms
[2024-05-25 15:39:09] [INFO ] Time to serialize gal into /tmp/LTL15745126224973344299.gal : 7 ms
[2024-05-25 15:39:09] [INFO ] Time to serialize properties into /tmp/LTL17930180600279027343.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15745126224973344299.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14259736954243044556.hoa' '-atoms' '/tmp/LTL17930180600279027343.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL17930180600279027343.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14259736954243044556.hoa
Detected timeout of ITS tools.
[2024-05-25 15:39:24] [INFO ] Flatten gal took : 37 ms
[2024-05-25 15:39:24] [INFO ] Flatten gal took : 30 ms
[2024-05-25 15:39:24] [INFO ] Time to serialize gal into /tmp/LTL7325444346149059454.gal : 6 ms
[2024-05-25 15:39:24] [INFO ] Time to serialize properties into /tmp/LTL7900357420971784624.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7325444346149059454.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7900357420971784624.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((X("(p327!=1)"))U(("(p610!=1)")||(G("(p309!=1)"))))))
Formula 0 simplified : F(X!"(p327!=1)" R (!"(p610!=1)" & F!"(p309!=1)"))
Detected timeout of ITS tools.
[2024-05-25 15:39:39] [INFO ] Flatten gal took : 29 ms
[2024-05-25 15:39:39] [INFO ] Applying decomposition
[2024-05-25 15:39:39] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph1574021552836930546.txt' '-o' '/tmp/graph1574021552836930546.bin' '-w' '/tmp/graph1574021552836930546.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1574021552836930546.bin' '-l' '-1' '-v' '-w' '/tmp/graph1574021552836930546.weights' '-q' '0' '-e' '0.001'
[2024-05-25 15:39:39] [INFO ] Decomposing Gal with order
[2024-05-25 15:39:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 15:39:39] [INFO ] Removed a total of 268 redundant transitions.
[2024-05-25 15:39:39] [INFO ] Flatten gal took : 101 ms
[2024-05-25 15:39:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 76 ms.
[2024-05-25 15:39:39] [INFO ] Time to serialize gal into /tmp/LTL3629088665776279122.gal : 21 ms
[2024-05-25 15:39:39] [INFO ] Time to serialize properties into /tmp/LTL1782329414007501472.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3629088665776279122.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1782329414007501472.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G((X("(i14.i1.u110.p327!=1)"))U(("(i15.u166.p610!=1)")||(G("(i13.i2.u105.p309!=1)"))))))
Formula 0 simplified : F(X!"(i14.i1.u110.p327!=1)" R (!"(i15.u166.p610!=1)" & F!"(i13.i2.u105.p309!=1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7171513295308868385
[2024-05-25 15:39:55] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7171513295308868385
Running compilation step : cd /tmp/ltsmin7171513295308868385;'/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 911 ms.
Running link step : cd /tmp/ltsmin7171513295308868385;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin7171513295308868385;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X((LTLAPp0==true)) U ((LTLAPp1==true)||[]((LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BusinessProcesses-PT-17-LTLFireability-10 finished in 115346 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 444/444 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 502 transition count 435
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 502 transition count 435
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 501 transition count 434
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 501 transition count 434
Applied a total of 20 rules in 26 ms. Remains 501 /511 variables (removed 10) and now considering 434/444 (removed 10) transitions.
// Phase 1: matrix 434 rows 501 cols
[2024-05-25 15:40:10] [INFO ] Computed 105 invariants in 9 ms
[2024-05-25 15:40:10] [INFO ] Implicit Places using invariants in 237 ms returned []
[2024-05-25 15:40:10] [INFO ] Invariant cache hit.
[2024-05-25 15:40:11] [INFO ] Implicit Places using invariants and state equation in 566 ms returned []
Implicit Place search using SMT with State Equation took 811 ms to find 0 implicit places.
[2024-05-25 15:40:11] [INFO ] Invariant cache hit.
[2024-05-25 15:40:11] [INFO ] Dead Transitions using invariants and state equation in 259 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 501/511 places, 434/444 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1108 ms. Remains : 501/511 places, 434/444 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s247 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1805 reset in 182 ms.
Stack based approach found an accepted trace after 172 steps with 3 reset with depth 9 and stack size 9 in 0 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-17-LTLFireability-11 finished in 1422 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 3 out of 511 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 511/511 places, 444/444 transitions.
Graph (trivial) has 237 edges and 511 vertex of which 7 / 511 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1141 edges and 505 vertex of which 504 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 57 place count 503 transition count 380
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 112 place count 448 transition count 380
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 106 Pre rules applied. Total rules applied 112 place count 448 transition count 274
Deduced a syphon composed of 106 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 344 place count 322 transition count 274
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 351 place count 315 transition count 267
Iterating global reduction 2 with 7 rules applied. Total rules applied 358 place count 315 transition count 267
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 358 place count 315 transition count 266
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 360 place count 314 transition count 266
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 130
Deduced a syphon composed of 130 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 2 with 265 rules applied. Total rules applied 625 place count 179 transition count 136
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 627 place count 178 transition count 140
Applied a total of 627 rules in 57 ms. Remains 178 /511 variables (removed 333) and now considering 140/444 (removed 304) transitions.
// Phase 1: matrix 140 rows 178 cols
[2024-05-25 15:40:11] [INFO ] Computed 80 invariants in 3 ms
[2024-05-25 15:40:11] [INFO ] Implicit Places using invariants in 190 ms returned [1, 2, 3, 4, 5, 8, 9, 33, 34, 35, 36, 43, 44, 45, 50, 51, 52, 53, 54, 55, 56, 57]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 202 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 156/511 places, 140/444 transitions.
Applied a total of 0 rules in 3 ms. Remains 156 /156 variables (removed 0) and now considering 140/140 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 274 ms. Remains : 156/511 places, 140/444 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-12 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 (NEQ s24 1) (NEQ s60 1) (NEQ s148 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]]
Product exploration explored 100000 steps with 17773 reset in 294 ms.
Product exploration explored 100000 steps with 17916 reset in 233 ms.
Computed a total of 31 stabilizing places and 23 stable transitions
Computed a total of 31 stabilizing places and 23 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1984 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 598 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Finished probabilistic random walk after 585 steps, run visited all 1 properties in 6 ms. (steps per millisecond=97 )
Probabilistic random walk after 585 steps, saw 275 distinct states, run finished after 6 ms. (steps per millisecond=97 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 194 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 140/140 transitions.
Applied a total of 0 rules in 4 ms. Remains 156 /156 variables (removed 0) and now considering 140/140 (removed 0) transitions.
// Phase 1: matrix 140 rows 156 cols
[2024-05-25 15:40:13] [INFO ] Computed 58 invariants in 1 ms
[2024-05-25 15:40:13] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-25 15:40:13] [INFO ] Invariant cache hit.
[2024-05-25 15:40:13] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-25 15:40:13] [INFO ] Implicit Places using invariants and state equation in 239 ms returned [3, 26, 28, 30, 37, 39, 41, 43, 45, 52, 54, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 101]
Discarding 32 places :
Implicit Place search using SMT with State Equation took 416 ms to find 32 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/156 places, 140/140 transitions.
Graph (complete) has 396 edges and 124 vertex of which 115 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 115 transition count 123
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 102 transition count 123
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 38 place count 91 transition count 87
Iterating global reduction 2 with 11 rules applied. Total rules applied 49 place count 91 transition count 87
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 51 place count 91 transition count 85
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 53 place count 89 transition count 85
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 56 place count 86 transition count 82
Iterating global reduction 4 with 3 rules applied. Total rules applied 59 place count 86 transition count 82
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 77 place count 75 transition count 75
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 81 place count 73 transition count 73
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 82 place count 73 transition count 72
Applied a total of 82 rules in 9 ms. Remains 73 /124 variables (removed 51) and now considering 72/140 (removed 68) transitions.
// Phase 1: matrix 72 rows 73 cols
[2024-05-25 15:40:13] [INFO ] Computed 17 invariants in 0 ms
[2024-05-25 15:40:15] [INFO ] Implicit Places using invariants in 1248 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1263 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 72/156 places, 72/140 transitions.
Applied a total of 0 rules in 2 ms. Remains 72 /72 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1694 ms. Remains : 72/156 places, 72/140 transitions.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2025 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 593 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 316 steps, run visited all 1 properties in 13 ms. (steps per millisecond=24 )
Probabilistic random walk after 316 steps, saw 166 distinct states, run finished after 25 ms. (steps per millisecond=12 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 146 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 18171 reset in 159 ms.
Product exploration explored 100000 steps with 18209 reset in 150 ms.
Built C files in :
/tmp/ltsmin370622088650934505
[2024-05-25 15:40:16] [INFO ] Computing symmetric may disable matrix : 72 transitions.
[2024-05-25 15:40:16] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:40:16] [INFO ] Computing symmetric may enable matrix : 72 transitions.
[2024-05-25 15:40:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:40:16] [INFO ] Computing Do-Not-Accords matrix : 72 transitions.
[2024-05-25 15:40:16] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:40:16] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin370622088650934505
Running compilation step : cd /tmp/ltsmin370622088650934505;'/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 331 ms.
Running link step : cd /tmp/ltsmin370622088650934505;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin370622088650934505;'/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/stateBased10595566437362463401.hoa' '--buchi-type=spotba'
LTSmin run took 287 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-12 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-17-LTLFireability-12 finished in 5390 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 444/444 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 503 transition count 436
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 503 transition count 436
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 502 transition count 435
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 502 transition count 435
Applied a total of 18 rules in 21 ms. Remains 502 /511 variables (removed 9) and now considering 435/444 (removed 9) transitions.
// Phase 1: matrix 435 rows 502 cols
[2024-05-25 15:40:17] [INFO ] Computed 105 invariants in 4 ms
[2024-05-25 15:40:17] [INFO ] Implicit Places using invariants in 228 ms returned []
[2024-05-25 15:40:17] [INFO ] Invariant cache hit.
[2024-05-25 15:40:17] [INFO ] Implicit Places using invariants and state equation in 644 ms returned []
Implicit Place search using SMT with State Equation took 877 ms to find 0 implicit places.
[2024-05-25 15:40:17] [INFO ] Invariant cache hit.
[2024-05-25 15:40:18] [INFO ] Dead Transitions using invariants and state equation in 298 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 502/511 places, 435/444 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1201 ms. Remains : 502/511 places, 435/444 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s330 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 462 ms.
Product exploration explored 100000 steps with 50000 reset in 340 ms.
Computed a total of 207 stabilizing places and 179 stable transitions
Graph (complete) has 1136 edges and 502 vertex of which 501 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.12 ms
Computed a total of 207 stabilizing places and 179 stable transitions
Detected a total of 207/502 stabilizing places and 179/435 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 41 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-17-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-17-LTLFireability-13 finished in 2173 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G((F(p1)&&F(G(p2)))))))'
Support contains 3 out of 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 444/444 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 504 transition count 437
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 504 transition count 437
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 503 transition count 436
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 503 transition count 436
Applied a total of 16 rules in 37 ms. Remains 503 /511 variables (removed 8) and now considering 436/444 (removed 8) transitions.
// Phase 1: matrix 436 rows 503 cols
[2024-05-25 15:40:19] [INFO ] Computed 105 invariants in 6 ms
[2024-05-25 15:40:19] [INFO ] Implicit Places using invariants in 239 ms returned []
[2024-05-25 15:40:19] [INFO ] Invariant cache hit.
[2024-05-25 15:40:20] [INFO ] Implicit Places using invariants and state equation in 733 ms returned []
Implicit Place search using SMT with State Equation took 976 ms to find 0 implicit places.
[2024-05-25 15:40:20] [INFO ] Invariant cache hit.
[2024-05-25 15:40:20] [INFO ] Dead Transitions using invariants and state equation in 407 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 503/511 places, 436/444 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1423 ms. Remains : 503/511 places, 436/444 transitions.
Stuttering acceptance computed with spot in 376 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s399 1), p1:(EQ s378 1), p2:(EQ s451 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLFireability-14 finished in 1855 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)&&X((p1||X(X((p2 U p3)))))))))'
Support contains 6 out of 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 444/444 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 504 transition count 437
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 504 transition count 437
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 503 transition count 436
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 503 transition count 436
Applied a total of 16 rules in 53 ms. Remains 503 /511 variables (removed 8) and now considering 436/444 (removed 8) transitions.
// Phase 1: matrix 436 rows 503 cols
[2024-05-25 15:40:21] [INFO ] Computed 105 invariants in 6 ms
[2024-05-25 15:40:21] [INFO ] Implicit Places using invariants in 418 ms returned []
[2024-05-25 15:40:21] [INFO ] Invariant cache hit.
[2024-05-25 15:40:22] [INFO ] Implicit Places using invariants and state equation in 729 ms returned []
Implicit Place search using SMT with State Equation took 1164 ms to find 0 implicit places.
[2024-05-25 15:40:22] [INFO ] Invariant cache hit.
[2024-05-25 15:40:22] [INFO ] Dead Transitions using invariants and state equation in 265 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 503/511 places, 436/444 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1484 ms. Remains : 503/511 places, 436/444 transitions.
Stuttering acceptance computed with spot in 914 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 7}, { cond=p0, acceptance={} source=4 dest: 8}, { cond=p0, acceptance={0} source=4 dest: 9}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 7}, { cond=p0, acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 10}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 11}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 12}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=7 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=7 dest: 2}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={0} source=7 dest: 3}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={0} source=7 dest: 7}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=7 dest: 8}, { cond=(AND p0 (NOT p3) p2), acceptance={0} source=7 dest: 9}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=8 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=8 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={0} source=8 dest: 7}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=9 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=9 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=9 dest: 6}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={0} source=9 dest: 10}, { cond=(AND p0 (NOT p1) (NOT p3) p2), acceptance={} source=9 dest: 11}, { cond=(AND p0 (NOT p1) (NOT p3) p2), acceptance={0} source=9 dest: 12}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=10 dest: 7}, { cond=(AND p0 (NOT p3)), acceptance={} source=10 dest: 8}, { cond=(AND p0 (NOT p3)), acceptance={0} source=10 dest: 9}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=11 dest: 7}, { cond=(AND p0 (NOT p3)), acceptance={} source=11 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={0} source=12 dest: 10}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=12 dest: 11}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={0} source=12 dest: 12}]], initial=0, aps=[p0:(EQ s432 0), p1:(EQ s447 1), p3:(EQ s188 1), p2:(AND (EQ s87 1) (EQ s313 1) (EQ s429 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, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 652 reset in 246 ms.
Product exploration explored 100000 steps with 655 reset in 254 ms.
Computed a total of 206 stabilizing places and 178 stable transitions
Graph (complete) has 1137 edges and 503 vertex of which 502 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 206 stabilizing places and 178 stable transitions
Detected a total of 206/503 stabilizing places and 178/436 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 246 ms. Reduced automaton from 13 states, 41 edges and 4 AP (stutter sensitive) to 13 states, 41 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1120 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 568 ms. (steps per millisecond=17 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) 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 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) 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 15) 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 15) seen :0
Interrupted probabilistic random walk after 521095 steps, run timeout after 3001 ms. (steps per millisecond=173 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 6=1, 7=1, 8=1, 10=1, 11=1, 12=1, 13=1, 14=1}
Probabilistic random walk after 521095 steps, saw 86937 distinct states, run finished after 3020 ms. (steps per millisecond=172 ) properties seen :13
Running SMT prover for 2 properties.
[2024-05-25 15:40:29] [INFO ] Invariant cache hit.
[2024-05-25 15:40:29] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 15:40:29] [INFO ] [Nat]Absence check using 62 positive place invariants in 23 ms returned sat
[2024-05-25 15:40:29] [INFO ] [Nat]Absence check using 62 positive and 43 generalized place invariants in 11 ms returned sat
[2024-05-25 15:40:29] [INFO ] After 156ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p3) (G (NOT p3)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2))), (G (NOT (AND (NOT p0) (NOT p3) p2)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2)))), (F (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))), (F (NOT (AND p0 (NOT p3) (NOT p2)))), (F (NOT (AND p0 (NOT p1) (NOT p3)))), (F (AND (NOT p0) (NOT p3) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p3))), (F (AND p0 (NOT p3) p2)), (F (NOT (AND p0 (NOT p3)))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p3))), (F (AND p0 (NOT p1) (NOT p3) p2))]
Knowledge based reduction with 8 factoid took 827 ms. Reduced automaton from 13 states, 41 edges and 4 AP (stutter sensitive) to 13 states, 38 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 946 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 703 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
[2024-05-25 15:40:31] [INFO ] Invariant cache hit.
[2024-05-25 15:40:32] [INFO ] [Real]Absence check using 62 positive place invariants in 21 ms returned sat
[2024-05-25 15:40:32] [INFO ] [Real]Absence check using 62 positive and 43 generalized place invariants in 40 ms returned sat
[2024-05-25 15:40:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:40:33] [INFO ] [Real]Absence check using state equation in 1064 ms returned sat
[2024-05-25 15:40:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:40:33] [INFO ] [Nat]Absence check using 62 positive place invariants in 22 ms returned sat
[2024-05-25 15:40:33] [INFO ] [Nat]Absence check using 62 positive and 43 generalized place invariants in 19 ms returned sat
[2024-05-25 15:40:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:40:34] [INFO ] [Nat]Absence check using state equation in 722 ms returned sat
[2024-05-25 15:40:34] [INFO ] Deduced a trap composed of 85 places in 131 ms of which 2 ms to minimize.
[2024-05-25 15:40:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
[2024-05-25 15:40:34] [INFO ] Computed and/alt/rep : 430/835/430 causal constraints (skipped 5 transitions) in 32 ms.
[2024-05-25 15:40:37] [INFO ] Added : 276 causal constraints over 56 iterations in 2874 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p3))
Support contains 6 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 436/436 transitions.
Applied a total of 0 rules in 9 ms. Remains 503 /503 variables (removed 0) and now considering 436/436 (removed 0) transitions.
[2024-05-25 15:40:37] [INFO ] Invariant cache hit.
[2024-05-25 15:40:37] [INFO ] Implicit Places using invariants in 350 ms returned []
[2024-05-25 15:40:37] [INFO ] Invariant cache hit.
[2024-05-25 15:40:38] [INFO ] Implicit Places using invariants and state equation in 684 ms returned []
Implicit Place search using SMT with State Equation took 1036 ms to find 0 implicit places.
[2024-05-25 15:40:38] [INFO ] Invariant cache hit.
[2024-05-25 15:40:38] [INFO ] Dead Transitions using invariants and state equation in 318 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1368 ms. Remains : 503/503 places, 436/436 transitions.
Computed a total of 206 stabilizing places and 178 stable transitions
Graph (complete) has 1137 edges and 503 vertex of which 502 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 206 stabilizing places and 178 stable transitions
Detected a total of 206/503 stabilizing places and 178/436 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 177 ms. Reduced automaton from 13 states, 38 edges and 4 AP (stutter sensitive) to 13 states, 38 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 902 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 375 ms. (steps per millisecond=26 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :0
Finished probabilistic random walk after 2651 steps, run visited all 11 properties in 39 ms. (steps per millisecond=67 )
Probabilistic random walk after 2651 steps, saw 2322 distinct states, run finished after 40 ms. (steps per millisecond=66 ) properties seen :11
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p3) (NOT p2)))), (F (AND (NOT p0) (NOT p3))), (F (AND (NOT p0) (NOT p1) (NOT p3))), (F (AND p0 (NOT p3) p2)), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1) (NOT p3) p2)), (F (NOT (AND p0 (NOT p1) (NOT p3)))), (F (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2)))), (F (NOT (AND p0 (NOT p3))))]
Knowledge based reduction with 6 factoid took 709 ms. Reduced automaton from 13 states, 38 edges and 4 AP (stutter sensitive) to 13 states, 38 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 893 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 974 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
[2024-05-25 15:40:43] [INFO ] Invariant cache hit.
[2024-05-25 15:40:43] [INFO ] [Real]Absence check using 62 positive place invariants in 28 ms returned sat
[2024-05-25 15:40:43] [INFO ] [Real]Absence check using 62 positive and 43 generalized place invariants in 27 ms returned sat
[2024-05-25 15:40:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:40:45] [INFO ] [Real]Absence check using state equation in 1632 ms returned sat
[2024-05-25 15:40:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:40:45] [INFO ] [Nat]Absence check using 62 positive place invariants in 26 ms returned sat
[2024-05-25 15:40:45] [INFO ] [Nat]Absence check using 62 positive and 43 generalized place invariants in 25 ms returned sat
[2024-05-25 15:40:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:40:46] [INFO ] [Nat]Absence check using state equation in 794 ms returned sat
[2024-05-25 15:40:46] [INFO ] Deduced a trap composed of 85 places in 187 ms of which 1 ms to minimize.
[2024-05-25 15:40:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 249 ms
[2024-05-25 15:40:46] [INFO ] Computed and/alt/rep : 430/835/430 causal constraints (skipped 5 transitions) in 49 ms.
[2024-05-25 15:40:49] [INFO ] Added : 276 causal constraints over 56 iterations in 2747 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p3))
Stuttering acceptance computed with spot in 867 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 659 reset in 213 ms.
Product exploration explored 100000 steps with 659 reset in 241 ms.
Built C files in :
/tmp/ltsmin6448819094492492196
[2024-05-25 15:40:51] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6448819094492492196
Running compilation step : cd /tmp/ltsmin6448819094492492196;'/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 975 ms.
Running link step : cd /tmp/ltsmin6448819094492492196;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin6448819094492492196;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17226513040484787722.hoa' '--buchi-type=spotba'
LTSmin run took 341 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-17-LTLFireability-15 finished in 31394 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(p0) U (p1||G(p2)))))'
Found a Lengthening insensitive property : BusinessProcesses-PT-17-LTLFireability-10
Stuttering acceptance computed with spot in 421 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Support contains 3 out of 511 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 511/511 places, 444/444 transitions.
Graph (trivial) has 234 edges and 511 vertex of which 7 / 511 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1141 edges and 505 vertex of which 504 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 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 503 transition count 381
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 110 place count 449 transition count 381
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 106 Pre rules applied. Total rules applied 110 place count 449 transition count 275
Deduced a syphon composed of 106 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 342 place count 323 transition count 275
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 346 place count 319 transition count 271
Iterating global reduction 2 with 4 rules applied. Total rules applied 350 place count 319 transition count 271
Performed 134 Post agglomeration using F-continuation condition.Transition count delta: 134
Deduced a syphon composed of 134 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 2 with 273 rules applied. Total rules applied 623 place count 180 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 625 place count 179 transition count 141
Applied a total of 625 rules in 72 ms. Remains 179 /511 variables (removed 332) and now considering 141/444 (removed 303) transitions.
// Phase 1: matrix 141 rows 179 cols
[2024-05-25 15:40:53] [INFO ] Computed 80 invariants in 1 ms
[2024-05-25 15:40:53] [INFO ] Implicit Places using invariants in 275 ms returned [1, 2, 3, 4, 5, 8, 9, 32, 33, 34, 35, 42, 43, 44, 49, 50, 51, 52, 53, 54, 55, 56]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 289 ms to find 22 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 157/511 places, 141/444 transitions.
Applied a total of 0 rules in 13 ms. Remains 157 /157 variables (removed 0) and now considering 141/141 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 388 ms. Remains : 157/511 places, 141/444 transitions.
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(NEQ s131 1), p2:(NEQ s40 1), p0:(NEQ s50 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 15460 reset in 171 ms.
Product exploration explored 100000 steps with 15399 reset in 229 ms.
Computed a total of 34 stabilizing places and 26 stable transitions
Computed a total of 34 stabilizing places and 26 stable transitions
Detected a total of 34/157 stabilizing places and 26/141 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 p0), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0)))))]
Knowledge based reduction with 12 factoid took 725 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 290 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Incomplete random walk after 10000 steps, including 1593 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10000 steps, including 466 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 490 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 540 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 141 rows 157 cols
[2024-05-25 15:40:55] [INFO ] Computed 58 invariants in 1 ms
[2024-05-25 15:40:55] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-25 15:40:55] [INFO ] [Real]Absence check using 36 positive and 22 generalized place invariants in 4 ms returned sat
[2024-05-25 15:40:55] [INFO ] After 59ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2024-05-25 15:40:55] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-25 15:40:55] [INFO ] After 17ms SMT Verify possible using 5 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 15:40:55] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 15:40:55] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-25 15:40:55] [INFO ] [Nat]Absence check using 36 positive and 22 generalized place invariants in 5 ms returned sat
[2024-05-25 15:40:55] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 15:40:55] [INFO ] After 16ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-25 15:40:55] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-25 15:40:55] [INFO ] After 175ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 141/141 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 157 transition count 140
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 157 transition count 138
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 155 transition count 138
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 155 transition count 138
Applied a total of 6 rules in 14 ms. Remains 155 /157 variables (removed 2) and now considering 138/141 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 155/157 places, 138/141 transitions.
Incomplete random walk after 10000 steps, including 273 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 128 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 138 rows 155 cols
[2024-05-25 15:40:55] [INFO ] Computed 58 invariants in 1 ms
[2024-05-25 15:40:55] [INFO ] [Real]Absence check using 38 positive place invariants in 7 ms returned sat
[2024-05-25 15:40:55] [INFO ] [Real]Absence check using 38 positive and 20 generalized place invariants in 5 ms returned sat
[2024-05-25 15:40:56] [INFO ] After 78ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 15:40:56] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-25 15:40:56] [INFO ] After 7ms SMT Verify possible using 5 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:40:56] [INFO ] After 168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:40:56] [INFO ] [Nat]Absence check using 38 positive place invariants in 6 ms returned sat
[2024-05-25 15:40:56] [INFO ] [Nat]Absence check using 38 positive and 20 generalized place invariants in 4 ms returned sat
[2024-05-25 15:40:56] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:40:56] [INFO ] After 7ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 15:40:56] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-25 15:40:56] [INFO ] After 145ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 138/138 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 155 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 154 transition count 137
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 153 transition count 136
Applied a total of 4 rules in 8 ms. Remains 153 /155 variables (removed 2) and now considering 136/138 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 153/155 places, 136/138 transitions.
Incomplete random walk after 10000 steps, including 303 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 138 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Probably explored full state space saw : 5709 states, properties seen :0
Probabilistic random walk after 18617 steps, saw 5709 distinct states, run finished after 63 ms. (steps per millisecond=295 ) properties seen :0
Explored full state space saw : 5709 states, properties seen :0
Exhaustive walk after 18617 steps, saw 5709 distinct states, run finished after 54 ms. (steps per millisecond=344 ) properties seen :0
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p0), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (F (AND (NOT p0) p2)), (F (AND (NOT p0) (NOT p2))), (F (NOT p2)), (F (NOT p0)), (F (AND (NOT p1) p2))]
Knowledge based reduction with 13 factoid took 1667 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 251 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 205 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 141/141 transitions.
Applied a total of 0 rules in 2 ms. Remains 157 /157 variables (removed 0) and now considering 141/141 (removed 0) transitions.
// Phase 1: matrix 141 rows 157 cols
[2024-05-25 15:40:58] [INFO ] Computed 58 invariants in 2 ms
[2024-05-25 15:40:58] [INFO ] Implicit Places using invariants in 194 ms returned []
[2024-05-25 15:40:58] [INFO ] Invariant cache hit.
[2024-05-25 15:40:58] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-25 15:40:59] [INFO ] Implicit Places using invariants and state equation in 461 ms returned [3, 25, 27, 29, 36, 38, 43, 45, 54, 56, 62, 64, 66, 68, 70, 72, 74, 76, 78, 80, 82, 84, 86, 88, 90, 92, 94, 96, 98, 100, 102]
Discarding 31 places :
Implicit Place search using SMT with State Equation took 658 ms to find 31 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 126/157 places, 141/141 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 123 transition count 137
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 123 transition count 137
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 120 transition count 134
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 120 transition count 134
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 119 transition count 133
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 119 transition count 133
Applied a total of 14 rules in 17 ms. Remains 119 /126 variables (removed 7) and now considering 133/141 (removed 8) transitions.
// Phase 1: matrix 133 rows 119 cols
[2024-05-25 15:40:59] [INFO ] Computed 27 invariants in 1 ms
[2024-05-25 15:40:59] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-25 15:40:59] [INFO ] Invariant cache hit.
[2024-05-25 15:40:59] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-25 15:40:59] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 119/157 places, 133/141 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 987 ms. Remains : 119/157 places, 133/141 transitions.
Computed a total of 19 stabilizing places and 21 stable transitions
Graph (complete) has 390 edges and 119 vertex of which 110 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Computed a total of 19 stabilizing places and 21 stable transitions
Detected a total of 19/119 stabilizing places and 21/133 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X p1), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p2)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 11 factoid took 1084 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 1604 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 571 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 517 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-25 15:41:01] [INFO ] Invariant cache hit.
[2024-05-25 15:41:01] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-05-25 15:41:01] [INFO ] [Real]Absence check using 15 positive and 12 generalized place invariants in 5 ms returned sat
[2024-05-25 15:41:01] [INFO ] After 63ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-25 15:41:01] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-25 15:41:01] [INFO ] After 25ms SMT Verify possible using 4 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 15:41:01] [INFO ] After 208ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 15:41:01] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-05-25 15:41:01] [INFO ] [Nat]Absence check using 15 positive and 12 generalized place invariants in 4 ms returned sat
[2024-05-25 15:41:01] [INFO ] After 59ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 15:41:01] [INFO ] After 14ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-25 15:41:01] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 12 ms.
[2024-05-25 15:41:01] [INFO ] After 173ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 133/133 transitions.
Graph (complete) has 374 edges and 119 vertex of which 109 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 109 transition count 115
Reduce places removed 12 places and 0 transitions.
Graph (complete) has 294 edges and 97 vertex of which 96 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 13 rules applied. Total rules applied 28 place count 96 transition count 115
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 29 place count 96 transition count 114
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 38 place count 87 transition count 78
Iterating global reduction 3 with 9 rules applied. Total rules applied 47 place count 87 transition count 78
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 4 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 67 place count 75 transition count 70
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 71 place count 73 transition count 68
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 73 transition count 67
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 73 transition count 65
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 76 place count 71 transition count 65
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 77 place count 71 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 78 place count 70 transition count 64
Applied a total of 78 rules in 12 ms. Remains 70 /119 variables (removed 49) and now considering 64/133 (removed 69) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 70/119 places, 64/133 transitions.
Incomplete random walk after 10000 steps, including 438 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :1
Finished Best-First random walk after 449 steps, including 4 resets, run visited all 1 properties in 1 ms. (steps per millisecond=449 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X p1), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p2)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X p1)), (X (X (NOT p1))), (F (AND (NOT p0) p2)), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (NOT p1)), (F (AND (NOT p0) (NOT p2))), (F (NOT p2))]
Knowledge based reduction with 11 factoid took 1744 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 164 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 182 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 14619 reset in 195 ms.
Product exploration explored 100000 steps with 14655 reset in 155 ms.
Applying partial POR strategy [true, false, true, false]
Stuttering acceptance computed with spot in 204 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 119 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 119/119 places, 133/133 transitions.
Graph (complete) has 390 edges and 119 vertex of which 110 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 110 transition count 129
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 22 place count 101 transition count 93
Deduced a syphon composed of 12 places in 1 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 31 place count 101 transition count 93
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 38 place count 101 transition count 95
Deduced a syphon composed of 19 places in 0 ms
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 101 transition count 93
Deduced a syphon composed of 19 places in 0 ms
Applied a total of 40 rules in 15 ms. Remains 101 /119 variables (removed 18) and now considering 93/133 (removed 40) transitions.
[2024-05-25 15:41:04] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 93 rows 101 cols
[2024-05-25 15:41:04] [INFO ] Computed 22 invariants in 1 ms
[2024-05-25 15:41:04] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/119 places, 93/133 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 140 ms. Remains : 101/119 places, 93/133 transitions.
Built C files in :
/tmp/ltsmin10031724319774017844
[2024-05-25 15:41:04] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10031724319774017844
Running compilation step : cd /tmp/ltsmin10031724319774017844;'/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 336 ms.
Running link step : cd /tmp/ltsmin10031724319774017844;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin10031724319774017844;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16846000582570628400.hoa' '--buchi-type=spotba'
LTSmin run took 1005 ms.
Treatment of property BusinessProcesses-PT-17-LTLFireability-10 finished in 13725 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-10 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-05-25 15:41:06] [INFO ] Flatten gal took : 19 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 207420 ms.

BK_STOP 1716651666560

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-17"
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-17, 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-171620415000363"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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