Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r024-tall-165251918500412.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BusinessProcesses-PT-12, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918500412
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 8.6K Apr 30 00:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 30 00:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 30 00:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 30 00:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K May 9 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 07:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 146K May 10 09:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-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 1652630214590

Running Version 202205111006
[2022-05-15 15:56:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 15:56:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 15:56:55] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2022-05-15 15:56:55] [INFO ] Transformed 586 places.
[2022-05-15 15:56:55] [INFO ] Transformed 525 transitions.
[2022-05-15 15:56:55] [INFO ] Found NUPN structural information;
[2022-05-15 15:56:55] [INFO ] Parsed PT model containing 586 places and 525 transitions in 218 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 4 places in 11 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-12-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 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 73 places :
Symmetric choice reduction at 1 with 73 rule applications. Total rules 76 place count 506 transition count 448
Iterating global reduction 1 with 73 rules applied. Total rules applied 149 place count 506 transition count 448
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 188 place count 467 transition count 409
Iterating global reduction 1 with 39 rules applied. Total rules applied 227 place count 467 transition count 409
Applied a total of 227 rules in 154 ms. Remains 467 /582 variables (removed 115) and now considering 409/521 (removed 112) transitions.
// Phase 1: matrix 409 rows 467 cols
[2022-05-15 15:56:58] [INFO ] Computed 95 place invariants in 27 ms
[2022-05-15 15:56:59] [INFO ] Implicit Places using invariants in 458 ms returned []
// Phase 1: matrix 409 rows 467 cols
[2022-05-15 15:56:59] [INFO ] Computed 95 place invariants in 12 ms
[2022-05-15 15:56:59] [INFO ] Implicit Places using invariants and state equation in 518 ms returned []
Implicit Place search using SMT with State Equation took 1010 ms to find 0 implicit places.
// Phase 1: matrix 409 rows 467 cols
[2022-05-15 15:56:59] [INFO ] Computed 95 place invariants in 13 ms
[2022-05-15 15:56:59] [INFO ] Dead Transitions using invariants and state equation in 204 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 467/582 places, 409/521 transitions.
Finished structural reductions, in 1 iterations. Remains : 467/582 places, 409/521 transitions.
Support contains 37 out of 467 places after structural reductions.
[2022-05-15 15:57:00] [INFO ] Flatten gal took : 59 ms
[2022-05-15 15:57:00] [INFO ] Flatten gal took : 29 ms
[2022-05-15 15:57:00] [INFO ] Input system was already deterministic with 409 transitions.
Support contains 34 out of 467 places (down from 37) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 72 resets, run finished after 592 ms. (steps per millisecond=16 ) properties (out of 27) seen :10
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 17) 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 17) 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 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) 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 17) 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 17) 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 17) 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 17) seen :0
Running SMT prover for 17 properties.
// Phase 1: matrix 409 rows 467 cols
[2022-05-15 15:57:00] [INFO ] Computed 95 place invariants in 8 ms
[2022-05-15 15:57:01] [INFO ] [Real]Absence check using 52 positive place invariants in 17 ms returned sat
[2022-05-15 15:57:01] [INFO ] [Real]Absence check using 52 positive and 43 generalized place invariants in 12 ms returned sat
[2022-05-15 15:57:01] [INFO ] After 302ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2022-05-15 15:57:01] [INFO ] [Nat]Absence check using 52 positive place invariants in 20 ms returned sat
[2022-05-15 15:57:01] [INFO ] [Nat]Absence check using 52 positive and 43 generalized place invariants in 12 ms returned sat
[2022-05-15 15:57:02] [INFO ] After 459ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :14
[2022-05-15 15:57:02] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 4 ms to minimize.
[2022-05-15 15:57:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2022-05-15 15:57:02] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 1 ms to minimize.
[2022-05-15 15:57:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2022-05-15 15:57:02] [INFO ] Deduced a trap composed of 51 places in 62 ms of which 1 ms to minimize.
[2022-05-15 15:57:02] [INFO ] Deduced a trap composed of 49 places in 66 ms of which 1 ms to minimize.
[2022-05-15 15:57:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 188 ms
[2022-05-15 15:57:02] [INFO ] Deduced a trap composed of 84 places in 126 ms of which 1 ms to minimize.
[2022-05-15 15:57:02] [INFO ] Deduced a trap composed of 79 places in 102 ms of which 3 ms to minimize.
[2022-05-15 15:57:03] [INFO ] Deduced a trap composed of 89 places in 109 ms of which 1 ms to minimize.
[2022-05-15 15:57:04] [INFO ] Deduced a trap composed of 85 places in 100 ms of which 1 ms to minimize.
[2022-05-15 15:57:04] [INFO ] Deduced a trap composed of 74 places in 97 ms of which 1 ms to minimize.
[2022-05-15 15:57:04] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2226 ms
[2022-05-15 15:57:05] [INFO ] Deduced a trap composed of 77 places in 93 ms of which 0 ms to minimize.
[2022-05-15 15:57:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2022-05-15 15:57:05] [INFO ] After 3685ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :14
Attempting to minimize the solution found.
Minimization took 331 ms.
[2022-05-15 15:57:05] [INFO ] After 4399ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :14
Fused 17 Parikh solutions to 12 different solutions.
Parikh walk visited 3 properties in 288 ms.
Support contains 13 out of 467 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 467/467 places, 409/409 transitions.
Graph (trivial) has 205 edges and 467 vertex of which 6 / 467 are part of one of the 1 SCC in 13 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1042 edges and 462 vertex of which 461 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 461 transition count 350
Reduce places removed 51 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 52 rules applied. Total rules applied 105 place count 410 transition count 349
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 106 place count 409 transition count 349
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 88 Pre rules applied. Total rules applied 106 place count 409 transition count 261
Deduced a syphon composed of 88 places in 1 ms
Ensure Unique test removed 15 places
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 3 with 191 rules applied. Total rules applied 297 place count 306 transition count 261
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 304 place count 299 transition count 254
Iterating global reduction 3 with 7 rules applied. Total rules applied 311 place count 299 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 311 place count 299 transition count 253
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 313 place count 298 transition count 253
Performed 113 Post agglomeration using F-continuation condition.Transition count delta: 113
Deduced a syphon composed of 113 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 3 with 230 rules applied. Total rules applied 543 place count 181 transition count 140
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 545 place count 180 transition count 144
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 547 place count 180 transition count 142
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 549 place count 178 transition count 142
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 554 place count 178 transition count 142
Applied a total of 554 rules in 110 ms. Remains 178 /467 variables (removed 289) and now considering 142/409 (removed 267) transitions.
Finished structural reductions, in 1 iterations. Remains : 178/467 places, 142/409 transitions.
Incomplete random walk after 10000 steps, including 301 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 11) seen :10
Incomplete Best-First random walk after 10001 steps, including 180 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 142 rows 178 cols
[2022-05-15 15:57:06] [INFO ] Computed 76 place invariants in 4 ms
[2022-05-15 15:57:06] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 15:57:06] [INFO ] [Nat]Absence check using 54 positive place invariants in 7 ms returned sat
[2022-05-15 15:57:06] [INFO ] [Nat]Absence check using 54 positive and 22 generalized place invariants in 4 ms returned sat
[2022-05-15 15:57:06] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 15:57:06] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-15 15:57:06] [INFO ] After 10ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 15:57:06] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2022-05-15 15:57:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2022-05-15 15:57:06] [INFO ] After 80ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-05-15 15:57:06] [INFO ] After 187ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 58 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=29 )
Parikh walk visited 1 properties in 1 ms.
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
FORMULA BusinessProcesses-PT-12-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 452 stabilizing places and 394 stable transitions
Graph (complete) has 1049 edges and 467 vertex of which 466 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.14 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 467 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 467/467 places, 409/409 transitions.
Graph (trivial) has 217 edges and 467 vertex of which 6 / 467 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1043 edges and 462 vertex of which 461 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 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 57 place count 460 transition count 346
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 112 place count 405 transition count 346
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 112 place count 405 transition count 251
Deduced a syphon composed of 95 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 320 place count 292 transition count 251
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 329 place count 283 transition count 242
Iterating global reduction 2 with 9 rules applied. Total rules applied 338 place count 283 transition count 242
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 338 place count 283 transition count 240
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 342 place count 281 transition count 240
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 114
Deduced a syphon composed of 114 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 574 place count 163 transition count 126
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 576 place count 162 transition count 130
Applied a total of 576 rules in 62 ms. Remains 162 /467 variables (removed 305) and now considering 130/409 (removed 279) transitions.
// Phase 1: matrix 130 rows 162 cols
[2022-05-15 15:57:06] [INFO ] Computed 73 place invariants in 1 ms
[2022-05-15 15:57:06] [INFO ] Implicit Places using invariants in 117 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 122 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 143/467 places, 130/409 transitions.
Applied a total of 0 rules in 7 ms. Remains 143 /143 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 143/467 places, 130/409 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s36 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 3 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-00 finished in 431 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0) U F(X(G((F(p1)&&p0)))))))'
Support contains 2 out of 467 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 467/467 places, 409/409 transitions.
Graph (trivial) has 215 edges and 467 vertex of which 6 / 467 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1043 edges and 462 vertex of which 461 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 460 transition count 347
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 110 place count 406 transition count 347
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 110 place count 406 transition count 252
Deduced a syphon composed of 95 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 318 place count 293 transition count 252
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 326 place count 285 transition count 244
Iterating global reduction 2 with 8 rules applied. Total rules applied 334 place count 285 transition count 244
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 334 place count 285 transition count 242
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 338 place count 283 transition count 242
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 114
Deduced a syphon composed of 114 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 570 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 572 place count 164 transition count 132
Applied a total of 572 rules in 51 ms. Remains 164 /467 variables (removed 303) and now considering 132/409 (removed 277) transitions.
// Phase 1: matrix 132 rows 164 cols
[2022-05-15 15:57:07] [INFO ] Computed 73 place invariants in 2 ms
[2022-05-15 15:57:07] [INFO ] Implicit Places using invariants in 111 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 112 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 145/467 places, 132/409 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 2 iterations. Remains : 145/467 places, 132/409 transitions.
Stuttering acceptance computed with spot in 92 ms :[(OR (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={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s67 1), p1:(EQ s99 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-01 finished in 277 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((F(p0)||X(G(X(F(p1))))))))'
Support contains 1 out of 467 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 467/467 places, 409/409 transitions.
Graph (trivial) has 217 edges and 467 vertex of which 6 / 467 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 1043 edges and 462 vertex of which 461 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 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 57 place count 460 transition count 346
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 112 place count 405 transition count 346
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 112 place count 405 transition count 251
Deduced a syphon composed of 95 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 207 rules applied. Total rules applied 319 place count 293 transition count 251
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 329 place count 283 transition count 241
Iterating global reduction 2 with 10 rules applied. Total rules applied 339 place count 283 transition count 241
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 339 place count 283 transition count 239
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 343 place count 281 transition count 239
Performed 113 Post agglomeration using F-continuation condition.Transition count delta: 113
Deduced a syphon composed of 113 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 230 rules applied. Total rules applied 573 place count 164 transition count 126
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 575 place count 163 transition count 130
Applied a total of 575 rules in 40 ms. Remains 163 /467 variables (removed 304) and now considering 130/409 (removed 279) transitions.
// Phase 1: matrix 130 rows 163 cols
[2022-05-15 15:57:07] [INFO ] Computed 74 place invariants in 1 ms
[2022-05-15 15:57:07] [INFO ] Implicit Places using invariants in 109 ms returned [1, 2, 3, 6, 7, 30, 31, 32, 33, 40, 41, 42, 47, 48, 49, 50, 51, 52, 53, 54]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 111 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 143/467 places, 130/409 transitions.
Applied a total of 0 rules in 5 ms. Remains 143 /143 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 143/467 places, 130/409 transitions.
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s98 0), p1:(EQ s98 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 21343 reset in 276 ms.
Product exploration explored 100000 steps with 21437 reset in 235 ms.
Computed a total of 133 stabilizing places and 121 stable transitions
Computed a total of 133 stabilizing places and 121 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2401 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 762 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Probably explored full state space saw : 9251 states, properties seen :0
Probabilistic random walk after 30358 steps, saw 9251 distinct states, run finished after 121 ms. (steps per millisecond=250 ) properties seen :0
Explored full state space saw : 9251 states, properties seen :0
Exhaustive walk after 30358 steps, saw 9251 distinct states, run finished after 66 ms. (steps per millisecond=459 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 4 factoid took 107 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA BusinessProcesses-PT-12-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-12-LTLFireability-03 finished in 1425 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 409/409 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 457 transition count 399
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 457 transition count 399
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 455 transition count 397
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 455 transition count 397
Applied a total of 24 rules in 29 ms. Remains 455 /467 variables (removed 12) and now considering 397/409 (removed 12) transitions.
// Phase 1: matrix 397 rows 455 cols
[2022-05-15 15:57:08] [INFO ] Computed 95 place invariants in 9 ms
[2022-05-15 15:57:09] [INFO ] Implicit Places using invariants in 151 ms returned []
// Phase 1: matrix 397 rows 455 cols
[2022-05-15 15:57:09] [INFO ] Computed 95 place invariants in 4 ms
[2022-05-15 15:57:09] [INFO ] Implicit Places using invariants and state equation in 495 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
// Phase 1: matrix 397 rows 455 cols
[2022-05-15 15:57:09] [INFO ] Computed 95 place invariants in 3 ms
[2022-05-15 15:57:09] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 455/467 places, 397/409 transitions.
Finished structural reductions, in 1 iterations. Remains : 455/467 places, 397/409 transitions.
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s411 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 4676 steps with 34 reset in 22 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-04 finished in 987 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(X(F(X(F(p0))))))&&X(p1)&&F(p2)))'
Support contains 3 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 409/409 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 458 transition count 400
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 458 transition count 400
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 457 transition count 399
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 457 transition count 399
Applied a total of 20 rules in 39 ms. Remains 457 /467 variables (removed 10) and now considering 399/409 (removed 10) transitions.
// Phase 1: matrix 399 rows 457 cols
[2022-05-15 15:57:09] [INFO ] Computed 95 place invariants in 7 ms
[2022-05-15 15:57:10] [INFO ] Implicit Places using invariants in 155 ms returned []
// Phase 1: matrix 399 rows 457 cols
[2022-05-15 15:57:10] [INFO ] Computed 95 place invariants in 2 ms
[2022-05-15 15:57:10] [INFO ] Implicit Places using invariants and state equation in 521 ms returned []
Implicit Place search using SMT with State Equation took 682 ms to find 0 implicit places.
// Phase 1: matrix 399 rows 457 cols
[2022-05-15 15:57:10] [INFO ] Computed 95 place invariants in 7 ms
[2022-05-15 15:57:10] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 457/467 places, 399/409 transitions.
Finished structural reductions, in 1 iterations. Remains : 457/467 places, 399/409 transitions.
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (OR (NOT p1) (NOT p0)), true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(EQ s13 1), p1:(EQ s316 1), p0:(EQ s44 0)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 56 steps with 1 reset in 1 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-05 finished in 1156 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p0)&&p1))||X(F(p2))))'
Support contains 3 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 409/409 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 457 transition count 399
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 457 transition count 399
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 455 transition count 397
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 455 transition count 397
Applied a total of 24 rules in 25 ms. Remains 455 /467 variables (removed 12) and now considering 397/409 (removed 12) transitions.
// Phase 1: matrix 397 rows 455 cols
[2022-05-15 15:57:11] [INFO ] Computed 95 place invariants in 6 ms
[2022-05-15 15:57:11] [INFO ] Implicit Places using invariants in 170 ms returned []
// Phase 1: matrix 397 rows 455 cols
[2022-05-15 15:57:11] [INFO ] Computed 95 place invariants in 2 ms
[2022-05-15 15:57:11] [INFO ] Implicit Places using invariants and state equation in 536 ms returned []
Implicit Place search using SMT with State Equation took 718 ms to find 0 implicit places.
// Phase 1: matrix 397 rows 455 cols
[2022-05-15 15:57:11] [INFO ] Computed 95 place invariants in 9 ms
[2022-05-15 15:57:11] [INFO ] Dead Transitions using invariants and state equation in 220 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 455/467 places, 397/409 transitions.
Finished structural reductions, in 1 iterations. Remains : 455/467 places, 397/409 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p2) p0), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p0))), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s274 1) (EQ s5 1)), p2:(EQ s5 1), p0:(EQ s152 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 5737 reset in 204 ms.
Stack based approach found an accepted trace after 139 steps with 8 reset with depth 5 and stack size 5 in 0 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-06 finished in 1310 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(G(p0))||G(p1)))))'
Support contains 3 out of 467 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 467/467 places, 409/409 transitions.
Graph (trivial) has 216 edges and 467 vertex of which 6 / 467 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1043 edges and 462 vertex of which 461 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 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 54 place count 460 transition count 349
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 106 place count 408 transition count 349
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 98 Pre rules applied. Total rules applied 106 place count 408 transition count 251
Deduced a syphon composed of 98 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 2 with 214 rules applied. Total rules applied 320 place count 292 transition count 251
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 330 place count 282 transition count 241
Iterating global reduction 2 with 10 rules applied. Total rules applied 340 place count 282 transition count 241
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 340 place count 282 transition count 239
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 344 place count 280 transition count 239
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 223 rules applied. Total rules applied 567 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 2 with 2 rules applied. Total rules applied 569 place count 167 transition count 132
Applied a total of 569 rules in 70 ms. Remains 167 /467 variables (removed 300) and now considering 132/409 (removed 277) transitions.
// Phase 1: matrix 132 rows 167 cols
[2022-05-15 15:57:12] [INFO ] Computed 76 place invariants in 1 ms
[2022-05-15 15:57:12] [INFO ] Implicit Places using invariants in 192 ms returned [1, 2, 5, 6, 29, 30, 31, 32, 39, 40, 41, 50, 51, 52, 53, 54, 55, 56, 57]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 204 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 148/467 places, 132/409 transitions.
Applied a total of 0 rules in 4 ms. Remains 148 /148 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 148/467 places, 132/409 transitions.
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s37 0) (EQ s79 0) (EQ s146 0)), p1:(AND (EQ s37 1) (EQ s79 1) (EQ s146 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 17766 reset in 263 ms.
Product exploration explored 100000 steps with 17830 reset in 397 ms.
Computed a total of 139 stabilizing places and 124 stable transitions
Computed a total of 139 stabilizing places and 124 stable transitions
Detected a total of 139/148 stabilizing places and 124/132 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 465 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 1983 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 608 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 592 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 132 rows 148 cols
[2022-05-15 15:57:14] [INFO ] Computed 57 place invariants in 1 ms
[2022-05-15 15:57:14] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2022-05-15 15:57:14] [INFO ] [Nat]Absence check using 33 positive place invariants in 8 ms returned sat
[2022-05-15 15:57:14] [INFO ] [Nat]Absence check using 33 positive and 24 generalized place invariants in 4 ms returned sat
[2022-05-15 15:57:14] [INFO ] After 46ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1)))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) p1))]
Property proved to be true thanks to knowledge :(F (OR (G p0) (G (NOT p0))))
Knowledge based reduction with 13 factoid took 436 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA BusinessProcesses-PT-12-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-12-LTLFireability-07 finished in 2335 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 467 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 467/467 places, 409/409 transitions.
Graph (trivial) has 214 edges and 467 vertex of which 6 / 467 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 1043 edges and 462 vertex of which 461 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 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 55 place count 460 transition count 348
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 1 with 53 rules applied. Total rules applied 108 place count 407 transition count 348
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 94 Pre rules applied. Total rules applied 108 place count 407 transition count 254
Deduced a syphon composed of 94 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 206 rules applied. Total rules applied 314 place count 295 transition count 254
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 322 place count 287 transition count 246
Iterating global reduction 2 with 8 rules applied. Total rules applied 330 place count 287 transition count 246
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 330 place count 287 transition count 244
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 334 place count 285 transition count 244
Performed 115 Post agglomeration using F-continuation condition.Transition count delta: 115
Deduced a syphon composed of 115 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 2 with 234 rules applied. Total rules applied 568 place count 166 transition count 129
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 570 place count 165 transition count 133
Applied a total of 570 rules in 32 ms. Remains 165 /467 variables (removed 302) and now considering 133/409 (removed 276) transitions.
// Phase 1: matrix 133 rows 165 cols
[2022-05-15 15:57:14] [INFO ] Computed 73 place invariants in 1 ms
[2022-05-15 15:57:14] [INFO ] Implicit Places using invariants in 131 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 137 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 146/467 places, 133/409 transitions.
Applied a total of 0 rules in 6 ms. Remains 146 /146 variables (removed 0) and now considering 133/133 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 146/467 places, 133/409 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s60 1) (EQ s78 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 8 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 216 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(!p0))))'
Support contains 1 out of 467 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 467/467 places, 409/409 transitions.
Graph (trivial) has 217 edges and 467 vertex of which 6 / 467 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1043 edges and 462 vertex of which 461 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 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 57 place count 460 transition count 346
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 112 place count 405 transition count 346
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 112 place count 405 transition count 251
Deduced a syphon composed of 95 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 320 place count 292 transition count 251
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 330 place count 282 transition count 241
Iterating global reduction 2 with 10 rules applied. Total rules applied 340 place count 282 transition count 241
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 340 place count 282 transition count 239
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 344 place count 280 transition count 239
Performed 113 Post agglomeration using F-continuation condition.Transition count delta: 113
Deduced a syphon composed of 113 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 230 rules applied. Total rules applied 574 place count 163 transition count 126
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 576 place count 162 transition count 130
Applied a total of 576 rules in 52 ms. Remains 162 /467 variables (removed 305) and now considering 130/409 (removed 279) transitions.
// Phase 1: matrix 130 rows 162 cols
[2022-05-15 15:57:14] [INFO ] Computed 73 place invariants in 1 ms
[2022-05-15 15:57:15] [INFO ] Implicit Places using invariants in 181 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 183 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 143/467 places, 130/409 transitions.
Applied a total of 0 rules in 5 ms. Remains 143 /143 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 143/467 places, 130/409 transitions.
Stuttering acceptance computed with spot in 100 ms :[true, p0]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s140 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-10 finished in 350 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(F(p0))||X(F(p0)))))'
Support contains 1 out of 467 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 467/467 places, 409/409 transitions.
Graph (trivial) has 217 edges and 467 vertex of which 6 / 467 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 1043 edges and 462 vertex of which 461 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 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 57 place count 460 transition count 346
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 112 place count 405 transition count 346
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 112 place count 405 transition count 251
Deduced a syphon composed of 95 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 320 place count 292 transition count 251
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 330 place count 282 transition count 241
Iterating global reduction 2 with 10 rules applied. Total rules applied 340 place count 282 transition count 241
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 340 place count 282 transition count 239
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 344 place count 280 transition count 239
Performed 113 Post agglomeration using F-continuation condition.Transition count delta: 113
Deduced a syphon composed of 113 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 230 rules applied. Total rules applied 574 place count 163 transition count 126
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 576 place count 162 transition count 130
Applied a total of 576 rules in 28 ms. Remains 162 /467 variables (removed 305) and now considering 130/409 (removed 279) transitions.
// Phase 1: matrix 130 rows 162 cols
[2022-05-15 15:57:15] [INFO ] Computed 73 place invariants in 1 ms
[2022-05-15 15:57:15] [INFO ] Implicit Places using invariants in 96 ms returned [1, 2, 5, 6, 30, 31, 32, 33, 40, 41, 42, 47, 48, 49, 50, 51, 52, 53, 54]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 97 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 143/467 places, 130/409 transitions.
Applied a total of 0 rules in 3 ms. Remains 143 /143 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 143/467 places, 130/409 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s25 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-11 finished in 166 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 467 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 467/467 places, 409/409 transitions.
Graph (trivial) has 216 edges and 467 vertex of which 6 / 467 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 1043 edges and 462 vertex of which 461 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 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 57 place count 460 transition count 346
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 112 place count 405 transition count 346
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 94 Pre rules applied. Total rules applied 112 place count 405 transition count 252
Deduced a syphon composed of 94 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 205 rules applied. Total rules applied 317 place count 294 transition count 252
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 327 place count 284 transition count 242
Iterating global reduction 2 with 10 rules applied. Total rules applied 337 place count 284 transition count 242
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 337 place count 284 transition count 240
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 341 place count 282 transition count 240
Performed 112 Post agglomeration using F-continuation condition.Transition count delta: 112
Deduced a syphon composed of 112 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 569 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 2 with 2 rules applied. Total rules applied 571 place count 165 transition count 132
Applied a total of 571 rules in 53 ms. Remains 165 /467 variables (removed 302) and now considering 132/409 (removed 277) transitions.
// Phase 1: matrix 132 rows 165 cols
[2022-05-15 15:57:15] [INFO ] Computed 74 place invariants in 7 ms
[2022-05-15 15:57:15] [INFO ] Implicit Places using invariants in 106 ms returned [1, 2, 5, 6, 31, 32, 33, 34, 41, 42, 43, 48, 49, 50, 51, 52, 53, 54, 55]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 116 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 146/467 places, 132/409 transitions.
Applied a total of 0 rules in 3 ms. Remains 146 /146 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 146/467 places, 132/409 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s7 1) (EQ s105 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-12 finished in 252 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p1))||G(!p1)))'
Support contains 4 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 409/409 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 457 transition count 399
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 457 transition count 399
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 455 transition count 397
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 455 transition count 397
Applied a total of 24 rules in 31 ms. Remains 455 /467 variables (removed 12) and now considering 397/409 (removed 12) transitions.
// Phase 1: matrix 397 rows 455 cols
[2022-05-15 15:57:15] [INFO ] Computed 95 place invariants in 4 ms
[2022-05-15 15:57:15] [INFO ] Implicit Places using invariants in 144 ms returned []
// Phase 1: matrix 397 rows 455 cols
[2022-05-15 15:57:15] [INFO ] Computed 95 place invariants in 3 ms
[2022-05-15 15:57:16] [INFO ] Implicit Places using invariants and state equation in 476 ms returned []
Implicit Place search using SMT with State Equation took 632 ms to find 0 implicit places.
// Phase 1: matrix 397 rows 455 cols
[2022-05-15 15:57:16] [INFO ] Computed 95 place invariants in 5 ms
[2022-05-15 15:57:16] [INFO ] Dead Transitions using invariants and state equation in 253 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 455/467 places, 397/409 transitions.
Finished structural reductions, in 1 iterations. Remains : 455/467 places, 397/409 transitions.
Stuttering acceptance computed with spot in 355 ms :[true, false, p1, (NOT p1), (NOT p1), false, false]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 6}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}], [{ cond=(NOT p1), acceptance={} source=5 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 6}]], initial=1, aps=[p0:(EQ s346 1), p1:(AND (EQ s74 1) (EQ s269 1) (EQ s421 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 732 reset in 190 ms.
Product exploration explored 100000 steps with 732 reset in 202 ms.
Computed a total of 440 stabilizing places and 382 stable transitions
Graph (complete) has 1033 edges and 455 vertex of which 454 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 440 stabilizing places and 382 stable transitions
Detected a total of 440/455 stabilizing places and 382/397 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 1862 ms. Reduced automaton from 7 states, 13 edges and 2 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 84 ms :[true, p1, p1]
Incomplete random walk after 10000 steps, including 72 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2224 steps, run visited all 1 properties in 12 ms. (steps per millisecond=185 )
Probabilistic random walk after 2224 steps, saw 1916 distinct states, run finished after 12 ms. (steps per millisecond=185 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 10 factoid took 373 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 70 ms :[true, p1, p1]
Stuttering acceptance computed with spot in 97 ms :[true, p1, p1]
Support contains 3 out of 455 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 397/397 transitions.
Applied a total of 0 rules in 12 ms. Remains 455 /455 variables (removed 0) and now considering 397/397 (removed 0) transitions.
// Phase 1: matrix 397 rows 455 cols
[2022-05-15 15:57:19] [INFO ] Computed 95 place invariants in 6 ms
[2022-05-15 15:57:20] [INFO ] Implicit Places using invariants in 186 ms returned []
// Phase 1: matrix 397 rows 455 cols
[2022-05-15 15:57:20] [INFO ] Computed 95 place invariants in 3 ms
[2022-05-15 15:57:20] [INFO ] Implicit Places using invariants and state equation in 517 ms returned []
Implicit Place search using SMT with State Equation took 715 ms to find 0 implicit places.
// Phase 1: matrix 397 rows 455 cols
[2022-05-15 15:57:20] [INFO ] Computed 95 place invariants in 6 ms
[2022-05-15 15:57:20] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 455/455 places, 397/397 transitions.
Computed a total of 440 stabilizing places and 382 stable transitions
Graph (complete) has 1033 edges and 455 vertex of which 454 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 440 stabilizing places and 382 stable transitions
Detected a total of 440/455 stabilizing places and 382/397 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p1), (X (NOT p1)), true, (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 208 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 109 ms :[true, p1, p1]
Incomplete random walk after 10000 steps, including 73 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2224 steps, run visited all 1 properties in 11 ms. (steps per millisecond=202 )
Probabilistic random walk after 2224 steps, saw 1916 distinct states, run finished after 11 ms. (steps per millisecond=202 ) properties seen :1
Knowledge obtained : [(NOT p1), (X (NOT p1)), true, (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 5 factoid took 199 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 260 ms :[true, p1, p1]
Stuttering acceptance computed with spot in 74 ms :[true, p1, p1]
Stuttering acceptance computed with spot in 85 ms :[true, p1, p1]
Product exploration explored 100000 steps with 733 reset in 157 ms.
Product exploration explored 100000 steps with 726 reset in 174 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 72 ms :[true, p1, p1]
Support contains 3 out of 455 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 455/455 places, 397/397 transitions.
Graph (trivial) has 205 edges and 455 vertex of which 6 / 455 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1027 edges and 450 vertex of which 449 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
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 46 rules applied. Total rules applied 48 place count 449 transition count 390
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 67 Pre rules applied. Total rules applied 48 place count 449 transition count 438
Deduced a syphon composed of 113 places in 1 ms
Iterating global reduction 1 with 67 rules applied. Total rules applied 115 place count 449 transition count 438
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 132 place count 432 transition count 406
Deduced a syphon composed of 97 places in 1 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 149 place count 432 transition count 406
Performed 147 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 244 places in 0 ms
Iterating global reduction 1 with 147 rules applied. Total rules applied 296 place count 432 transition count 406
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 330 place count 398 transition count 372
Deduced a syphon composed of 210 places in 0 ms
Iterating global reduction 1 with 34 rules applied. Total rules applied 364 place count 398 transition count 372
Deduced a syphon composed of 210 places in 0 ms
Applied a total of 364 rules in 89 ms. Remains 398 /455 variables (removed 57) and now considering 372/397 (removed 25) transitions.
[2022-05-15 15:57:22] [INFO ] Redundant transitions in 38 ms returned []
// Phase 1: matrix 372 rows 398 cols
[2022-05-15 15:57:22] [INFO ] Computed 95 place invariants in 4 ms
[2022-05-15 15:57:23] [INFO ] Dead Transitions using invariants and state equation in 550 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 398/455 places, 372/397 transitions.
Finished structural reductions, in 1 iterations. Remains : 398/455 places, 372/397 transitions.
Product exploration explored 100000 steps with 20000 reset in 647 ms.
Product exploration explored 100000 steps with 20000 reset in 625 ms.
Built C files in :
/tmp/ltsmin7616353423008856476
[2022-05-15 15:57:24] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7616353423008856476
Running compilation step : cd /tmp/ltsmin7616353423008856476;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 656 ms.
Running link step : cd /tmp/ltsmin7616353423008856476;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin7616353423008856476;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3755598893551704058.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 397/397 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 454 transition count 396
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 454 transition count 396
Applied a total of 2 rules in 37 ms. Remains 454 /455 variables (removed 1) and now considering 396/397 (removed 1) transitions.
// Phase 1: matrix 396 rows 454 cols
[2022-05-15 15:57:40] [INFO ] Computed 95 place invariants in 10 ms
[2022-05-15 15:57:40] [INFO ] Implicit Places using invariants in 215 ms returned []
// Phase 1: matrix 396 rows 454 cols
[2022-05-15 15:57:40] [INFO ] Computed 95 place invariants in 4 ms
[2022-05-15 15:57:40] [INFO ] Implicit Places using invariants and state equation in 661 ms returned []
Implicit Place search using SMT with State Equation took 880 ms to find 0 implicit places.
// Phase 1: matrix 396 rows 454 cols
[2022-05-15 15:57:40] [INFO ] Computed 95 place invariants in 6 ms
[2022-05-15 15:57:41] [INFO ] Dead Transitions using invariants and state equation in 205 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 454/455 places, 396/397 transitions.
Finished structural reductions, in 1 iterations. Remains : 454/455 places, 396/397 transitions.
Built C files in :
/tmp/ltsmin3504357010638274284
[2022-05-15 15:57:41] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3504357010638274284
Running compilation step : cd /tmp/ltsmin3504357010638274284;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 544 ms.
Running link step : cd /tmp/ltsmin3504357010638274284;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin3504357010638274284;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5838037703072422067.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 15:57:56] [INFO ] Flatten gal took : 24 ms
[2022-05-15 15:57:56] [INFO ] Flatten gal took : 23 ms
[2022-05-15 15:57:56] [INFO ] Time to serialize gal into /tmp/LTL8183026224964666919.gal : 4 ms
[2022-05-15 15:57:56] [INFO ] Time to serialize properties into /tmp/LTL14707433302077813451.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8183026224964666919.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14707433302077813451.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8183026...267
Read 1 LTL properties
Checking formula 0 : !(((("(p400==1)")U(X("(((p93==1)&&(p304==1))&&(p552==1))")))||(G("(((p93!=1)||(p304!=1))||(p552!=1))"))))
Formula 0 simplified : !(("(p400==1)" U X"(((p93==1)&&(p304==1))&&(p552==1))") | G"(((p93!=1)||(p304!=1))||(p552!=1))")
Detected timeout of ITS tools.
[2022-05-15 15:58:11] [INFO ] Flatten gal took : 20 ms
[2022-05-15 15:58:11] [INFO ] Applying decomposition
[2022-05-15 15:58:11] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12344548900333151663.txt' '-o' '/tmp/graph12344548900333151663.bin' '-w' '/tmp/graph12344548900333151663.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12344548900333151663.bin' '-l' '-1' '-v' '-w' '/tmp/graph12344548900333151663.weights' '-q' '0' '-e' '0.001'
[2022-05-15 15:58:11] [INFO ] Decomposing Gal with order
[2022-05-15 15:58:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 15:58:11] [INFO ] Removed a total of 258 redundant transitions.
[2022-05-15 15:58:11] [INFO ] Flatten gal took : 160 ms
[2022-05-15 15:58:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 10 ms.
[2022-05-15 15:58:12] [INFO ] Time to serialize gal into /tmp/LTL3607467011777731948.gal : 31 ms
[2022-05-15 15:58:12] [INFO ] Time to serialize properties into /tmp/LTL1076989244564837887.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3607467011777731948.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1076989244564837887.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3607467...245
Read 1 LTL properties
Checking formula 0 : !(((("(i15.i3.u118.p400==1)")U(X("(((i5.i1.u27.p93==1)&&(i5.i2.u99.p304==1))&&(i5.i0.u130.p552==1))")))||(G("(((i5.i1.u27.p93!=1)||(i5...200
Formula 0 simplified : !(("(i15.i3.u118.p400==1)" U X"(((i5.i1.u27.p93==1)&&(i5.i2.u99.p304==1))&&(i5.i0.u130.p552==1))") | G"(((i5.i1.u27.p93!=1)||(i5.i2....193
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t166, t178, t186, t264, t274, t398, t399, t401, t402, i0.i0.u121.t71, i0.i0.u...1169
Computing Next relation with stutter on 1232 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
474 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.8039,180100,1,0,324059,663,7231,711458,261,2124,821047
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-12-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property BusinessProcesses-PT-12-LTLFireability-13 finished in 62068 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(G((F(G(p1))||X(p2))))))'
Support contains 2 out of 467 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 467/467 places, 409/409 transitions.
Graph (trivial) has 216 edges and 467 vertex of which 6 / 467 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 1043 edges and 462 vertex of which 461 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 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 460 transition count 347
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 110 place count 406 transition count 347
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 110 place count 406 transition count 252
Deduced a syphon composed of 95 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 207 rules applied. Total rules applied 317 place count 294 transition count 252
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 327 place count 284 transition count 242
Iterating global reduction 2 with 10 rules applied. Total rules applied 337 place count 284 transition count 242
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 337 place count 284 transition count 240
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 341 place count 282 transition count 240
Performed 113 Post agglomeration using F-continuation condition.Transition count delta: 113
Deduced a syphon composed of 113 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 230 rules applied. Total rules applied 571 place count 165 transition count 127
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 573 place count 164 transition count 131
Applied a total of 573 rules in 36 ms. Remains 164 /467 variables (removed 303) and now considering 131/409 (removed 278) transitions.
// Phase 1: matrix 131 rows 164 cols
[2022-05-15 15:58:17] [INFO ] Computed 74 place invariants in 1 ms
[2022-05-15 15:58:17] [INFO ] Implicit Places using invariants in 213 ms returned [1, 2, 5, 6, 29, 30, 31, 34, 41, 42, 43, 48, 49, 50, 51, 52, 53, 54, 55, 127]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 232 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 144/467 places, 131/409 transitions.
Applied a total of 0 rules in 4 ms. Remains 144 /144 variables (removed 0) and now considering 131/131 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 144/467 places, 131/409 transitions.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s102 0), p1:(EQ s26 0), p2:(EQ s102 1)], nbAcceptance=2, 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 21827 reset in 332 ms.
Product exploration explored 100000 steps with 21565 reset in 246 ms.
Computed a total of 135 stabilizing places and 123 stable transitions
Computed a total of 135 stabilizing places and 123 stable transitions
Detected a total of 135/144 stabilizing places and 123/131 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p2))), (X (AND p1 (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 833 ms. Reduced automaton from 2 states, 6 edges and 3 AP to 2 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 2497 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 780 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 770 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 781 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 774 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 749 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Probably explored full state space saw : 8535 states, properties seen :4
Probabilistic random walk after 28294 steps, saw 8535 distinct states, run finished after 60 ms. (steps per millisecond=471 ) properties seen :4
Explored full state space saw : 8535 states, properties seen :0
Exhaustive walk after 28294 steps, saw 8535 distinct states, run finished after 59 ms. (steps per millisecond=479 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p2))), (X (AND p1 (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND p2 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p1))), (F (NOT (AND (NOT p2) p1))), (F (NOT p0)), (F (AND p2 p1))]
Knowledge based reduction with 15 factoid took 581 ms. Reduced automaton from 2 states, 6 edges and 3 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 131/131 transitions.
Applied a total of 0 rules in 11 ms. Remains 144 /144 variables (removed 0) and now considering 131/131 (removed 0) transitions.
// Phase 1: matrix 131 rows 144 cols
[2022-05-15 15:58:21] [INFO ] Computed 54 place invariants in 5 ms
[2022-05-15 15:58:21] [INFO ] Implicit Places using invariants in 95 ms returned []
// Phase 1: matrix 131 rows 144 cols
[2022-05-15 15:58:21] [INFO ] Computed 54 place invariants in 1 ms
[2022-05-15 15:58:21] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-15 15:58:21] [INFO ] Implicit Places using invariants and state equation in 177 ms returned [3, 27, 29, 31, 33, 38, 45, 47, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 276 ms to find 29 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/144 places, 131/131 transitions.
Graph (complete) has 376 edges and 115 vertex of which 103 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 103 transition count 114
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 91 transition count 114
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 36 place count 80 transition count 75
Iterating global reduction 2 with 11 rules applied. Total rules applied 47 place count 80 transition count 75
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 80 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 49 place count 79 transition count 74
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 51 place count 77 transition count 72
Iterating global reduction 4 with 2 rules applied. Total rules applied 53 place count 77 transition count 72
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 67 place count 69 transition count 66
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 69 place count 68 transition count 65
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 70 place count 68 transition count 64
Applied a total of 70 rules in 13 ms. Remains 68 /115 variables (removed 47) and now considering 64/131 (removed 67) transitions.
// Phase 1: matrix 64 rows 68 cols
[2022-05-15 15:58:21] [INFO ] Computed 16 place invariants in 0 ms
[2022-05-15 15:58:21] [INFO ] Implicit Places using invariants in 49 ms returned [3, 4, 5]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 51 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 65/144 places, 64/131 transitions.
Applied a total of 0 rules in 2 ms. Remains 65 /65 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 65/144 places, 64/131 transitions.
Computed a total of 56 stabilizing places and 56 stable transitions
Computed a total of 56 stabilizing places and 56 stable transitions
Detected a total of 56/65 stabilizing places and 56/64 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 216 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2568 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 770 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 751 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Finished probabilistic random walk after 255 steps, run visited all 2 properties in 5 ms. (steps per millisecond=51 )
Probabilistic random walk after 255 steps, saw 134 distinct states, run finished after 5 ms. (steps per millisecond=51 ) properties seen :2
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 270 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 22191 reset in 98 ms.
Product exploration explored 100000 steps with 22244 reset in 84 ms.
Built C files in :
/tmp/ltsmin6377471629576930667
[2022-05-15 15:58:22] [INFO ] Computing symmetric may disable matrix : 64 transitions.
[2022-05-15 15:58:22] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 15:58:22] [INFO ] Computing symmetric may enable matrix : 64 transitions.
[2022-05-15 15:58:22] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 15:58:22] [INFO ] Computing Do-Not-Accords matrix : 64 transitions.
[2022-05-15 15:58:22] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 15:58:22] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6377471629576930667
Running compilation step : cd /tmp/ltsmin6377471629576930667;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 169 ms.
Running link step : cd /tmp/ltsmin6377471629576930667;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin6377471629576930667;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7822784205058882062.hoa' '--buchi-type=spotba'
LTSmin run took 90 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-12-LTLFireability-15 finished in 5282 ms.
All properties solved by simple procedures.
Total runtime 87208 ms.

BK_STOP 1652630303039

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-12"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-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 r024-tall-165251918500412"
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 ;