Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 6.4K Feb 25 16:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 25 16:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 16:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 25 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 16:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 16:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 146K Mar 5 18:22 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-12-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678644126405

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-12
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 18:02:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 18:02:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 18:02:08] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2023-03-12 18:02:08] [INFO ] Transformed 586 places.
[2023-03-12 18:02:08] [INFO ] Transformed 525 transitions.
[2023-03-12 18:02:08] [INFO ] Found NUPN structural information;
[2023-03-12 18:02:08] [INFO ] Parsed PT model containing 586 places and 525 transitions and 1560 arcs in 140 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 4 places in 9 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-12-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 582 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 582/582 places, 521/521 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 579 transition count 521
Discarding 78 places :
Symmetric choice reduction at 1 with 78 rule applications. Total rules 81 place count 501 transition count 443
Iterating global reduction 1 with 78 rules applied. Total rules applied 159 place count 501 transition count 443
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 195 place count 465 transition count 407
Iterating global reduction 1 with 36 rules applied. Total rules applied 231 place count 465 transition count 407
Applied a total of 231 rules in 101 ms. Remains 465 /582 variables (removed 117) and now considering 407/521 (removed 114) transitions.
// Phase 1: matrix 407 rows 465 cols
[2023-03-12 18:02:08] [INFO ] Computed 95 place invariants in 28 ms
[2023-03-12 18:02:08] [INFO ] Implicit Places using invariants in 319 ms returned []
[2023-03-12 18:02:08] [INFO ] Invariant cache hit.
[2023-03-12 18:02:09] [INFO ] Implicit Places using invariants and state equation in 543 ms returned []
Implicit Place search using SMT with State Equation took 893 ms to find 0 implicit places.
[2023-03-12 18:02:09] [INFO ] Invariant cache hit.
[2023-03-12 18:02:09] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 465/582 places, 407/521 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1224 ms. Remains : 465/582 places, 407/521 transitions.
Support contains 43 out of 465 places after structural reductions.
[2023-03-12 18:02:09] [INFO ] Flatten gal took : 57 ms
[2023-03-12 18:02:09] [INFO ] Flatten gal took : 35 ms
[2023-03-12 18:02:09] [INFO ] Input system was already deterministic with 407 transitions.
Support contains 40 out of 465 places (down from 43) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 74 resets, run finished after 684 ms. (steps per millisecond=14 ) properties (out of 24) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 18) 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 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) seen :0
Running SMT prover for 18 properties.
[2023-03-12 18:02:10] [INFO ] Invariant cache hit.
[2023-03-12 18:02:10] [INFO ] [Real]Absence check using 54 positive place invariants in 17 ms returned sat
[2023-03-12 18:02:10] [INFO ] [Real]Absence check using 54 positive and 41 generalized place invariants in 11 ms returned sat
[2023-03-12 18:02:10] [INFO ] After 287ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2023-03-12 18:02:11] [INFO ] [Nat]Absence check using 54 positive place invariants in 12 ms returned sat
[2023-03-12 18:02:11] [INFO ] [Nat]Absence check using 54 positive and 41 generalized place invariants in 9 ms returned sat
[2023-03-12 18:02:11] [INFO ] After 361ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :14
[2023-03-12 18:02:11] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 4 ms to minimize.
[2023-03-12 18:02:11] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2023-03-12 18:02:11] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 2 ms to minimize.
[2023-03-12 18:02:12] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 5 ms to minimize.
[2023-03-12 18:02:12] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 1 ms to minimize.
[2023-03-12 18:02:12] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 0 ms to minimize.
[2023-03-12 18:02:12] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2023-03-12 18:02:12] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 1 ms to minimize.
[2023-03-12 18:02:12] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 2 ms to minimize.
[2023-03-12 18:02:12] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2023-03-12 18:02:12] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2023-03-12 18:02:12] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 0 ms to minimize.
[2023-03-12 18:02:12] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 0 ms to minimize.
[2023-03-12 18:02:12] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1161 ms
[2023-03-12 18:02:12] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2023-03-12 18:02:12] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2023-03-12 18:02:13] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2023-03-12 18:02:13] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 0 ms to minimize.
[2023-03-12 18:02:13] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 0 ms to minimize.
[2023-03-12 18:02:13] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2023-03-12 18:02:13] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2023-03-12 18:02:13] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2023-03-12 18:02:13] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 0 ms to minimize.
[2023-03-12 18:02:13] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 0 ms to minimize.
[2023-03-12 18:02:13] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 1 ms to minimize.
[2023-03-12 18:02:13] [INFO ] Deduced a trap composed of 45 places in 35 ms of which 0 ms to minimize.
[2023-03-12 18:02:13] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 692 ms
[2023-03-12 18:02:13] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2023-03-12 18:02:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2023-03-12 18:02:13] [INFO ] Deduced a trap composed of 81 places in 101 ms of which 1 ms to minimize.
[2023-03-12 18:02:14] [INFO ] Deduced a trap composed of 86 places in 90 ms of which 1 ms to minimize.
[2023-03-12 18:02:14] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 0 ms to minimize.
[2023-03-12 18:02:14] [INFO ] Deduced a trap composed of 107 places in 82 ms of which 1 ms to minimize.
[2023-03-12 18:02:14] [INFO ] Deduced a trap composed of 97 places in 81 ms of which 1 ms to minimize.
[2023-03-12 18:02:14] [INFO ] Deduced a trap composed of 89 places in 80 ms of which 1 ms to minimize.
[2023-03-12 18:02:14] [INFO ] Deduced a trap composed of 84 places in 78 ms of which 1 ms to minimize.
[2023-03-12 18:02:14] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 804 ms
[2023-03-12 18:02:14] [INFO ] After 3439ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :13
Attempting to minimize the solution found.
Minimization took 263 ms.
[2023-03-12 18:02:14] [INFO ] After 3997ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :13
Fused 18 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 223 ms.
Support contains 20 out of 465 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 407/407 transitions.
Graph (complete) has 1048 edges and 465 vertex of which 464 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 464 transition count 364
Reduce places removed 42 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 45 rules applied. Total rules applied 88 place count 422 transition count 361
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 91 place count 419 transition count 361
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 94 Pre rules applied. Total rules applied 91 place count 419 transition count 267
Deduced a syphon composed of 94 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 204 rules applied. Total rules applied 295 place count 309 transition count 267
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 296 place count 308 transition count 266
Iterating global reduction 3 with 1 rules applied. Total rules applied 297 place count 308 transition count 266
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 117
Deduced a syphon composed of 117 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 3 with 235 rules applied. Total rules applied 532 place count 190 transition count 149
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 533 place count 190 transition count 148
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 535 place count 189 transition count 152
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 541 place count 189 transition count 152
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 542 place count 188 transition count 151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 543 place count 187 transition count 151
Applied a total of 543 rules in 85 ms. Remains 187 /465 variables (removed 278) and now considering 151/407 (removed 256) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 187/465 places, 151/407 transitions.
Incomplete random walk after 10000 steps, including 973 resets, run finished after 318 ms. (steps per millisecond=31 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 273 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 200 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 260 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 201 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 246 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 242 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 258 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 283 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 250 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 244 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 262 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 264 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 253 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 13) seen :0
Finished probabilistic random walk after 83722 steps, run visited all 13 properties in 231 ms. (steps per millisecond=362 )
Probabilistic random walk after 83722 steps, saw 19079 distinct states, run finished after 231 ms. (steps per millisecond=362 ) properties seen :13
Successfully simplified 5 atomic propositions for a total of 11 simplifications.
FORMULA BusinessProcesses-PT-12-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 450 stabilizing places and 392 stable transitions
Graph (complete) has 1048 edges and 465 vertex of which 464 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.14 ms
FORMULA BusinessProcesses-PT-12-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(G(p1))))'
Support contains 6 out of 465 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 465/465 places, 407/407 transitions.
Graph (complete) has 1048 edges and 465 vertex of which 464 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 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 463 transition count 359
Reduce places removed 46 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 48 rules applied. Total rules applied 95 place count 417 transition count 357
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 97 place count 415 transition count 357
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 97 place count 415 transition count 257
Deduced a syphon composed of 100 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 3 with 218 rules applied. Total rules applied 315 place count 297 transition count 257
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 322 place count 290 transition count 250
Iterating global reduction 3 with 7 rules applied. Total rules applied 329 place count 290 transition count 250
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 329 place count 290 transition count 249
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 331 place count 289 transition count 249
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 117
Deduced a syphon composed of 117 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 3 with 238 rules applied. Total rules applied 569 place count 168 transition count 132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 570 place count 168 transition count 131
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 572 place count 167 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 573 place count 166 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 574 place count 165 transition count 134
Applied a total of 574 rules in 61 ms. Remains 165 /465 variables (removed 300) and now considering 134/407 (removed 273) transitions.
// Phase 1: matrix 134 rows 165 cols
[2023-03-12 18:02:17] [INFO ] Computed 72 place invariants in 4 ms
[2023-03-12 18:02:17] [INFO ] Implicit Places using invariants in 99 ms returned [34, 41, 42, 43, 48, 49, 50, 51, 52, 53, 54]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 101 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 154/465 places, 134/407 transitions.
Applied a total of 0 rules in 6 ms. Remains 154 /154 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 168 ms. Remains : 154/465 places, 134/407 transitions.
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s12 1) (EQ s49 1) (EQ s130 1)), p1:(OR (EQ s32 0) (EQ s70 0) (EQ s128 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 12133 reset in 296 ms.
Product exploration explored 100000 steps with 12013 reset in 262 ms.
Computed a total of 149 stabilizing places and 129 stable transitions
Computed a total of 149 stabilizing places and 129 stable transitions
Detected a total of 149/154 stabilizing places and 129/134 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 239 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 1231 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 324 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Finished probabilistic random walk after 203 steps, run visited all 1 properties in 13 ms. (steps per millisecond=15 )
Probabilistic random walk after 203 steps, saw 104 distinct states, run finished after 13 ms. (steps per millisecond=15 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 6 factoid took 197 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Support contains 3 out of 154 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 134/134 transitions.
Applied a total of 0 rules in 5 ms. Remains 154 /154 variables (removed 0) and now considering 134/134 (removed 0) transitions.
// Phase 1: matrix 134 rows 154 cols
[2023-03-12 18:02:18] [INFO ] Computed 61 place invariants in 3 ms
[2023-03-12 18:02:18] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-12 18:02:18] [INFO ] Invariant cache hit.
[2023-03-12 18:02:18] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-12 18:02:19] [INFO ] Implicit Places using invariants and state equation in 194 ms returned [34, 36, 38, 40, 45, 53, 55, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 101]
Discarding 28 places :
Implicit Place search using SMT with State Equation took 291 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 126/154 places, 134/134 transitions.
Graph (complete) has 446 edges and 126 vertex of which 123 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 123 transition count 122
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 112 transition count 122
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 25 place count 110 transition count 119
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 110 transition count 119
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 110 transition count 118
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 29 place count 109 transition count 118
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 30 place count 108 transition count 117
Iterating global reduction 4 with 1 rules applied. Total rules applied 31 place count 108 transition count 117
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 47 place count 99 transition count 110
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 49 place count 98 transition count 109
Applied a total of 49 rules in 21 ms. Remains 98 /126 variables (removed 28) and now considering 109/134 (removed 25) transitions.
// Phase 1: matrix 109 rows 98 cols
[2023-03-12 18:02:19] [INFO ] Computed 29 place invariants in 3 ms
[2023-03-12 18:02:19] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-12 18:02:19] [INFO ] Invariant cache hit.
[2023-03-12 18:02:19] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-12 18:02:19] [INFO ] Implicit Places using invariants and state equation in 156 ms returned [5, 6, 7, 30, 31]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 217 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 93/154 places, 109/134 transitions.
Graph (complete) has 355 edges and 93 vertex of which 84 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
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 9 place count 76 transition count 73
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 76 transition count 73
Applied a total of 17 rules in 6 ms. Remains 76 /93 variables (removed 17) and now considering 73/109 (removed 36) transitions.
// Phase 1: matrix 73 rows 76 cols
[2023-03-12 18:02:19] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-12 18:02:19] [INFO ] Implicit Places using invariants in 49 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 50 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 75/154 places, 73/134 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 73/73 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 594 ms. Remains : 75/154 places, 73/134 transitions.
Computed a total of 70 stabilizing places and 68 stable transitions
Computed a total of 70 stabilizing places and 68 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 1231 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 319 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 153 steps, run visited all 1 properties in 6 ms. (steps per millisecond=25 )
Probabilistic random walk after 153 steps, saw 86 distinct states, run finished after 6 ms. (steps per millisecond=25 ) properties seen :1
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p1)]
Product exploration explored 100000 steps with 12280 reset in 115 ms.
Product exploration explored 100000 steps with 12255 reset in 137 ms.
Support contains 3 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 73/73 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 75 transition count 72
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 74 transition count 72
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 73 transition count 68
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 73 transition count 68
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 0 with 4 rules applied. Total rules applied 8 place count 71 transition count 66
Applied a total of 8 rules in 18 ms. Remains 71 /75 variables (removed 4) and now considering 66/73 (removed 7) transitions.
// Phase 1: matrix 66 rows 71 cols
[2023-03-12 18:02:19] [INFO ] Computed 18 place invariants in 0 ms
[2023-03-12 18:02:20] [INFO ] Implicit Places using invariants in 74 ms returned [5, 6]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 75 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/75 places, 66/73 transitions.
Applied a total of 0 rules in 2 ms. Remains 69 /69 variables (removed 0) and now considering 66/66 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 96 ms. Remains : 69/75 places, 66/73 transitions.
Treatment of property BusinessProcesses-PT-12-LTLFireability-01 finished in 2978 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&(p1 U p2))))'
Support contains 2 out of 465 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 465/465 places, 407/407 transitions.
Graph (trivial) has 215 edges and 465 vertex of which 6 / 465 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1042 edges and 460 vertex of which 459 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 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 458 transition count 349
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 408 transition count 349
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 102 place count 408 transition count 252
Deduced a syphon composed of 97 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 212 rules applied. Total rules applied 314 place count 293 transition count 252
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 320 place count 287 transition count 246
Iterating global reduction 2 with 6 rules applied. Total rules applied 326 place count 287 transition count 246
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 326 place count 287 transition count 245
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 328 place count 286 transition count 245
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 117
Deduced a syphon composed of 117 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 2 with 238 rules applied. Total rules applied 566 place count 165 transition count 128
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 568 place count 164 transition count 132
Applied a total of 568 rules in 47 ms. Remains 164 /465 variables (removed 301) and now considering 132/407 (removed 275) transitions.
// Phase 1: matrix 132 rows 164 cols
[2023-03-12 18:02:20] [INFO ] Computed 73 place invariants in 3 ms
[2023-03-12 18:02:20] [INFO ] Implicit Places using invariants in 376 ms returned [1, 2, 5, 6, 29, 30, 31, 32, 39, 40, 41, 46, 47, 48, 49, 50, 51, 52, 53]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 379 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 145/465 places, 132/407 transitions.
Applied a total of 0 rules in 6 ms. Remains 145 /145 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 433 ms. Remains : 145/465 places, 132/407 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p2), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p2:(EQ s111 1), p1:(EQ s37 1), p0:(EQ s37 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-03 finished in 529 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((!p1 U p2)))))'
Support contains 7 out of 465 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 465/465 places, 407/407 transitions.
Graph (complete) has 1048 edges and 465 vertex of which 464 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 463 transition count 360
Reduce places removed 45 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 47 rules applied. Total rules applied 93 place count 418 transition count 358
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 95 place count 416 transition count 358
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 98 Pre rules applied. Total rules applied 95 place count 416 transition count 260
Deduced a syphon composed of 98 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 3 with 213 rules applied. Total rules applied 308 place count 301 transition count 260
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 314 place count 295 transition count 254
Iterating global reduction 3 with 6 rules applied. Total rules applied 320 place count 295 transition count 254
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 320 place count 295 transition count 253
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 322 place count 294 transition count 253
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 119
Deduced a syphon composed of 119 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 3 with 242 rules applied. Total rules applied 564 place count 171 transition count 134
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 565 place count 171 transition count 133
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 567 place count 170 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 568 place count 169 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 569 place count 168 transition count 136
Applied a total of 569 rules in 54 ms. Remains 168 /465 variables (removed 297) and now considering 136/407 (removed 271) transitions.
// Phase 1: matrix 136 rows 168 cols
[2023-03-12 18:02:20] [INFO ] Computed 73 place invariants in 2 ms
[2023-03-12 18:02:20] [INFO ] Implicit Places using invariants in 91 ms returned [51, 52, 53, 54, 55]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 93 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 163/465 places, 136/407 transitions.
Applied a total of 0 rules in 6 ms. Remains 163 /163 variables (removed 0) and now considering 136/136 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 155 ms. Remains : 163/465 places, 136/407 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(OR (AND p0 p2) (AND p0 (NOT p1))), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1))), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) p1), acceptance={1} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s124 0), p2:(AND (EQ s31 1) (EQ s69 1) (EQ s122 1)), p1:(AND (EQ s49 1) (EQ s101 1) (EQ s138 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 11989 reset in 286 ms.
Product exploration explored 100000 steps with 12226 reset in 406 ms.
Computed a total of 158 stabilizing places and 131 stable transitions
Computed a total of 158 stabilizing places and 131 stable transitions
Detected a total of 158/163 stabilizing places and 131/136 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (OR (AND p0 p2) (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (OR (AND p0 p2) (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1)))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 556 ms. Reduced automaton from 2 states, 10 edges and 3 AP (stutter insensitive) to 2 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 1212 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 348 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 323 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 354 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 136 rows 163 cols
[2023-03-12 18:02:22] [INFO ] Computed 68 place invariants in 2 ms
[2023-03-12 18:02:22] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 18:02:22] [INFO ] [Nat]Absence check using 46 positive place invariants in 5 ms returned sat
[2023-03-12 18:02:22] [INFO ] [Nat]Absence check using 46 positive and 22 generalized place invariants in 4 ms returned sat
[2023-03-12 18:02:22] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-12 18:02:22] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-12 18:02:22] [INFO ] After 44ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-12 18:02:22] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2023-03-12 18:02:22] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 1 ms to minimize.
[2023-03-12 18:02:23] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2023-03-12 18:02:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 259 ms
[2023-03-12 18:02:23] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 0 ms to minimize.
[2023-03-12 18:02:23] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2023-03-12 18:02:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 161 ms
[2023-03-12 18:02:23] [INFO ] After 576ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 75 ms.
[2023-03-12 18:02:23] [INFO ] After 813ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 7 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 136/136 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 163 transition count 136
Applied a total of 1 rules in 14 ms. Remains 163 /163 variables (removed 0) and now considering 136/136 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 163/163 places, 136/136 transitions.
Incomplete random walk after 10000 steps, including 1220 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 345 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 367 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Finished probabilistic random walk after 247 steps, run visited all 2 properties in 7 ms. (steps per millisecond=35 )
Probabilistic random walk after 247 steps, saw 121 distinct states, run finished after 7 ms. (steps per millisecond=35 ) properties seen :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (OR (AND p0 p2) (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (OR (AND p0 p2) (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1)))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p2) p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2) (NOT p1)))), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (NOT (OR (AND p0 p2) (AND p0 (NOT p1))))), (F (AND p0 (NOT p2) p1)), (F (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 16 factoid took 752 ms. Reduced automaton from 2 states, 10 edges and 3 AP (stutter insensitive) to 2 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 7 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 136/136 transitions.
Applied a total of 0 rules in 7 ms. Remains 163 /163 variables (removed 0) and now considering 136/136 (removed 0) transitions.
[2023-03-12 18:02:24] [INFO ] Invariant cache hit.
[2023-03-12 18:02:24] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-12 18:02:24] [INFO ] Invariant cache hit.
[2023-03-12 18:02:24] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-12 18:02:24] [INFO ] Implicit Places using invariants and state equation in 308 ms returned [52, 59, 61, 70, 72, 74, 76, 78, 80, 82, 84, 86, 88, 90, 92, 94, 96, 98, 100, 102, 104, 106, 108]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 417 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 140/163 places, 136/136 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 140 transition count 126
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 130 transition count 126
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 22 place count 128 transition count 123
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 128 transition count 123
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 128 transition count 122
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 26 place count 127 transition count 122
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 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 44 place count 116 transition count 115
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 48 place count 114 transition count 113
Applied a total of 48 rules in 14 ms. Remains 114 /140 variables (removed 26) and now considering 113/136 (removed 23) transitions.
// Phase 1: matrix 113 rows 114 cols
[2023-03-12 18:02:25] [INFO ] Computed 41 place invariants in 1 ms
[2023-03-12 18:02:25] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-12 18:02:25] [INFO ] Invariant cache hit.
[2023-03-12 18:02:25] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-12 18:02:25] [INFO ] Implicit Places using invariants and state equation in 156 ms returned [5, 6, 7, 29, 30, 33, 34, 35, 37, 39, 41, 42, 43, 44, 45]
Discarding 15 places :
Implicit Place search using SMT with State Equation took 241 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 99/163 places, 113/136 transitions.
Graph (complete) has 372 edges and 99 vertex of which 90 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
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 10 place count 81 transition count 73
Iterating global reduction 0 with 9 rules applied. Total rules applied 19 place count 81 transition count 73
Applied a total of 19 rules in 4 ms. Remains 81 /99 variables (removed 18) and now considering 73/113 (removed 40) transitions.
// Phase 1: matrix 73 rows 81 cols
[2023-03-12 18:02:25] [INFO ] Computed 21 place invariants in 0 ms
[2023-03-12 18:02:25] [INFO ] Implicit Places using invariants in 51 ms returned [5, 6, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 53 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 78/163 places, 73/136 transitions.
Applied a total of 0 rules in 1 ms. Remains 78 /78 variables (removed 0) and now considering 73/73 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 740 ms. Remains : 78/163 places, 73/136 transitions.
Computed a total of 73 stabilizing places and 68 stable transitions
Computed a total of 73 stabilizing places and 68 stable transitions
Detected a total of 73/78 stabilizing places and 68/73 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)))), (X (NOT (AND p1 (NOT p2)))), (X (OR (AND p0 (NOT p1)) (AND p0 p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (AND p0 (NOT p1)) (AND p0 p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 605 ms. Reduced automaton from 2 states, 9 edges and 3 AP (stutter insensitive) to 2 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 1231 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 349 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 329 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 356 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 371 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 73 rows 78 cols
[2023-03-12 18:02:26] [INFO ] Computed 18 place invariants in 3 ms
[2023-03-12 18:02:26] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 18:02:26] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-12 18:02:26] [INFO ] [Nat]Absence check using 11 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-12 18:02:26] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-12 18:02:26] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-12 18:02:26] [INFO ] After 18ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2023-03-12 18:02:26] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2023-03-12 18:02:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2023-03-12 18:02:26] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2023-03-12 18:02:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2023-03-12 18:02:26] [INFO ] After 129ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-12 18:02:26] [INFO ] After 248ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 7 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 73/73 transitions.
Applied a total of 0 rules in 1 ms. Remains 78 /78 variables (removed 0) and now considering 73/73 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 78/78 places, 73/73 transitions.
Incomplete random walk after 10000 steps, including 1235 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 345 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 343 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 332 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Finished probabilistic random walk after 195 steps, run visited all 3 properties in 7 ms. (steps per millisecond=27 )
Probabilistic random walk after 195 steps, saw 106 distinct states, run finished after 7 ms. (steps per millisecond=27 ) properties seen :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)))), (X (NOT (AND p1 (NOT p2)))), (X (OR (AND p0 (NOT p1)) (AND p0 p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (AND p0 (NOT p1)) (AND p0 p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND p1 (NOT p2) (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2) p0))), (F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F (NOT (OR (AND (NOT p1) p0) (AND p2 p0)))), (F (AND p1 (NOT p2) p0)), (F (OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p0)))), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 20 factoid took 1059 ms. Reduced automaton from 2 states, 9 edges and 3 AP (stutter insensitive) to 2 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 12285 reset in 188 ms.
Product exploration explored 100000 steps with 12350 reset in 196 ms.
Support contains 7 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 73/73 transitions.
Applied a total of 0 rules in 2 ms. Remains 78 /78 variables (removed 0) and now considering 73/73 (removed 0) transitions.
[2023-03-12 18:02:28] [INFO ] Invariant cache hit.
[2023-03-12 18:02:28] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-12 18:02:28] [INFO ] Invariant cache hit.
[2023-03-12 18:02:28] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-12 18:02:28] [INFO ] Implicit Places using invariants and state equation in 92 ms returned [14, 20, 22]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 166 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 75/78 places, 73/73 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 75 transition count 70
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 72 transition count 70
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 8 place count 70 transition count 67
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 70 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 70 transition count 66
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 23 rules applied. Total rules applied 34 place count 56 transition count 57
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 37 place count 53 transition count 54
Iterating global reduction 3 with 3 rules applied. Total rules applied 40 place count 53 transition count 54
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 41 place count 53 transition count 53
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 43 place count 52 transition count 52
Applied a total of 43 rules in 7 ms. Remains 52 /75 variables (removed 23) and now considering 52/73 (removed 21) transitions.
// Phase 1: matrix 52 rows 52 cols
[2023-03-12 18:02:28] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-12 18:02:28] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-12 18:02:28] [INFO ] Invariant cache hit.
[2023-03-12 18:02:29] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-12 18:02:29] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 52/78 places, 52/73 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 265 ms. Remains : 52/78 places, 52/73 transitions.
Treatment of property BusinessProcesses-PT-12-LTLFireability-07 finished in 8445 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 465 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 465/465 places, 407/407 transitions.
Graph (trivial) has 213 edges and 465 vertex of which 6 / 465 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 1042 edges and 460 vertex of which 459 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 50 place count 458 transition count 351
Reduce places removed 48 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 49 rules applied. Total rules applied 99 place count 410 transition count 350
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 100 place count 409 transition count 350
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 97 Pre rules applied. Total rules applied 100 place count 409 transition count 253
Deduced a syphon composed of 97 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 3 with 212 rules applied. Total rules applied 312 place count 294 transition count 253
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 318 place count 288 transition count 247
Iterating global reduction 3 with 6 rules applied. Total rules applied 324 place count 288 transition count 247
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 324 place count 288 transition count 246
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 326 place count 287 transition count 246
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 118
Deduced a syphon composed of 118 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 3 with 237 rules applied. Total rules applied 563 place count 168 transition count 128
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 565 place count 167 transition count 132
Applied a total of 565 rules in 42 ms. Remains 167 /465 variables (removed 298) and now considering 132/407 (removed 275) transitions.
// Phase 1: matrix 132 rows 167 cols
[2023-03-12 18:02:29] [INFO ] Computed 76 place invariants in 2 ms
[2023-03-12 18:02:29] [INFO ] Implicit Places using invariants in 144 ms returned [1, 2, 5, 6, 29, 30, 31, 32, 39, 40, 41, 50, 51, 52, 53, 54, 55, 56, 57, 161, 163, 165]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 147 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 145/465 places, 132/407 transitions.
Applied a total of 0 rules in 5 ms. Remains 145 /145 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 194 ms. Remains : 145/465 places, 132/407 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s32 1), p1:(EQ s111 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-08 finished in 337 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(F(p1))))))'
Support contains 2 out of 465 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 465/465 places, 407/407 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 459 transition count 401
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 459 transition count 401
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 455 transition count 397
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 455 transition count 397
Applied a total of 20 rules in 28 ms. Remains 455 /465 variables (removed 10) and now considering 397/407 (removed 10) transitions.
// Phase 1: matrix 397 rows 455 cols
[2023-03-12 18:02:29] [INFO ] Computed 95 place invariants in 4 ms
[2023-03-12 18:02:29] [INFO ] Implicit Places using invariants in 195 ms returned []
[2023-03-12 18:02:29] [INFO ] Invariant cache hit.
[2023-03-12 18:02:30] [INFO ] Implicit Places using invariants and state equation in 526 ms returned []
Implicit Place search using SMT with State Equation took 726 ms to find 0 implicit places.
[2023-03-12 18:02:30] [INFO ] Invariant cache hit.
[2023-03-12 18:02:30] [INFO ] Dead Transitions using invariants and state equation in 238 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 455/465 places, 397/407 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 994 ms. Remains : 455/465 places, 397/407 transitions.
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s307 1), p1:(OR (EQ s307 1) (EQ s234 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1172 reset in 268 ms.
Stack based approach found an accepted trace after 1318 steps with 15 reset with depth 8 and stack size 8 in 3 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-09 finished in 1443 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 2 out of 465 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 465/465 places, 407/407 transitions.
Graph (trivial) has 215 edges and 465 vertex of which 6 / 465 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 1042 edges and 460 vertex of which 459 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 458 transition count 350
Reduce places removed 49 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 50 rules applied. Total rules applied 101 place count 409 transition count 349
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 102 place count 408 transition count 349
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 102 place count 408 transition count 253
Deduced a syphon composed of 96 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 3 with 209 rules applied. Total rules applied 311 place count 295 transition count 253
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 318 place count 288 transition count 246
Iterating global reduction 3 with 7 rules applied. Total rules applied 325 place count 288 transition count 246
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 325 place count 288 transition count 245
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 327 place count 287 transition count 245
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 117
Deduced a syphon composed of 117 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 3 with 238 rules applied. Total rules applied 565 place count 166 transition count 128
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 567 place count 165 transition count 132
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 568 place count 164 transition count 131
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 569 place count 163 transition count 131
Applied a total of 569 rules in 40 ms. Remains 163 /465 variables (removed 302) and now considering 131/407 (removed 276) transitions.
// Phase 1: matrix 131 rows 163 cols
[2023-03-12 18:02:30] [INFO ] Computed 73 place invariants in 2 ms
[2023-03-12 18:02:31] [INFO ] Implicit Places using invariants in 132 ms returned [49, 50, 51, 52, 53, 54, 55, 125]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 134 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 155/465 places, 131/407 transitions.
Applied a total of 0 rules in 3 ms. Remains 155 /155 variables (removed 0) and now considering 131/131 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 179 ms. Remains : 155/465 places, 131/407 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(EQ s33 1), p1:(EQ s1 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-14 finished in 264 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X((p0 U (X(p1)||G(p0)))))))'
Support contains 2 out of 465 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 465/465 places, 407/407 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 459 transition count 401
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 459 transition count 401
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 455 transition count 397
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 455 transition count 397
Applied a total of 20 rules in 26 ms. Remains 455 /465 variables (removed 10) and now considering 397/407 (removed 10) transitions.
// Phase 1: matrix 397 rows 455 cols
[2023-03-12 18:02:31] [INFO ] Computed 95 place invariants in 2 ms
[2023-03-12 18:02:31] [INFO ] Implicit Places using invariants in 158 ms returned []
[2023-03-12 18:02:31] [INFO ] Invariant cache hit.
[2023-03-12 18:02:31] [INFO ] Implicit Places using invariants and state equation in 485 ms returned []
Implicit Place search using SMT with State Equation took 651 ms to find 0 implicit places.
[2023-03-12 18:02:31] [INFO ] Invariant cache hit.
[2023-03-12 18:02:32] [INFO ] Dead Transitions using invariants and state equation in 306 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 455/465 places, 397/407 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 985 ms. Remains : 455/465 places, 397/407 transitions.
Stuttering acceptance computed with spot in 252 ms :[true, (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(NEQ s381 1), p0:(EQ s251 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, 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-12-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-15 finished in 1253 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((!p1 U p2)))))'
[2023-03-12 18:02:32] [INFO ] Flatten gal took : 43 ms
[2023-03-12 18:02:32] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-12 18:02:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 465 places, 407 transitions and 1321 arcs took 7 ms.
Total runtime 24798 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1227/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1227/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : BusinessProcesses-PT-12-LTLFireability-01
Could not compute solution for formula : BusinessProcesses-PT-12-LTLFireability-07

BK_STOP 1678644153532

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name BusinessProcesses-PT-12-LTLFireability-01
ltl formula formula --ltl=/tmp/1227/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 465 places, 407 transitions and 1321 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.020 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1227/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1227/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1227/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1227/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name BusinessProcesses-PT-12-LTLFireability-07
ltl formula formula --ltl=/tmp/1227/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 465 places, 407 transitions and 1321 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.000 user 0.030 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1227/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1227/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1227/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1227/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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-12"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is BusinessProcesses-PT-12, 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 r041-tajo-167813694800540"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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