Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 16:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 11 16:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 16:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 11 16:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 146K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-12
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-25 15:31:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 15:31:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:31:42] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2024-05-25 15:31:42] [INFO ] Transformed 586 places.
[2024-05-25 15:31:42] [INFO ] Transformed 525 transitions.
[2024-05-25 15:31:42] [INFO ] Found NUPN structural information;
[2024-05-25 15:31:42] [INFO ] Parsed PT model containing 586 places and 525 transitions and 1560 arcs in 166 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 4 places in 9 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-12-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 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 75 places :
Symmetric choice reduction at 1 with 75 rule applications. Total rules 78 place count 504 transition count 446
Iterating global reduction 1 with 75 rules applied. Total rules applied 153 place count 504 transition count 446
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 187 place count 470 transition count 412
Iterating global reduction 1 with 34 rules applied. Total rules applied 221 place count 470 transition count 412
Applied a total of 221 rules in 103 ms. Remains 470 /582 variables (removed 112) and now considering 412/521 (removed 109) transitions.
// Phase 1: matrix 412 rows 470 cols
[2024-05-25 15:31:42] [INFO ] Computed 95 invariants in 31 ms
[2024-05-25 15:31:43] [INFO ] Implicit Places using invariants in 354 ms returned []
[2024-05-25 15:31:43] [INFO ] Invariant cache hit.
[2024-05-25 15:31:43] [INFO ] Implicit Places using invariants and state equation in 490 ms returned []
Implicit Place search using SMT with State Equation took 871 ms to find 0 implicit places.
[2024-05-25 15:31:43] [INFO ] Invariant cache hit.
[2024-05-25 15:31:43] [INFO ] Dead Transitions using invariants and state equation in 212 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 470/582 places, 412/521 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1188 ms. Remains : 470/582 places, 412/521 transitions.
Support contains 38 out of 470 places after structural reductions.
[2024-05-25 15:31:44] [INFO ] Flatten gal took : 67 ms
[2024-05-25 15:31:44] [INFO ] Flatten gal took : 30 ms
[2024-05-25 15:31:44] [INFO ] Input system was already deterministic with 412 transitions.
Incomplete random walk after 10000 steps, including 71 resets, run finished after 519 ms. (steps per millisecond=19 ) properties (out of 32) seen :20
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2024-05-25 15:31:45] [INFO ] Invariant cache hit.
[2024-05-25 15:31:45] [INFO ] [Real]Absence check using 52 positive place invariants in 17 ms returned sat
[2024-05-25 15:31:45] [INFO ] [Real]Absence check using 52 positive and 43 generalized place invariants in 15 ms returned sat
[2024-05-25 15:31:45] [INFO ] After 399ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:10
[2024-05-25 15:31:45] [INFO ] [Nat]Absence check using 52 positive place invariants in 13 ms returned sat
[2024-05-25 15:31:45] [INFO ] [Nat]Absence check using 52 positive and 43 generalized place invariants in 10 ms returned sat
[2024-05-25 15:31:46] [INFO ] After 270ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :8
[2024-05-25 15:31:46] [INFO ] Deduced a trap composed of 34 places in 128 ms of which 5 ms to minimize.
[2024-05-25 15:31:46] [INFO ] Deduced a trap composed of 69 places in 114 ms of which 1 ms to minimize.
[2024-05-25 15:31:46] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-05-25 15:31:46] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 0 ms to minimize.
[2024-05-25 15:31:46] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-05-25 15:31:46] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2024-05-25 15:31:47] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2024-05-25 15:31:47] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 0 ms to minimize.
[2024-05-25 15:31:47] [INFO ] Deduced a trap composed of 53 places in 65 ms of which 0 ms to minimize.
[2024-05-25 15:31:47] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 911 ms
[2024-05-25 15:31:47] [INFO ] After 1473ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :8
Attempting to minimize the solution found.
Minimization took 158 ms.
[2024-05-25 15:31:47] [INFO ] After 1866ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :8
Fused 11 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 120 ms.
Support contains 11 out of 470 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 470/470 places, 412/412 transitions.
Graph (trivial) has 211 edges and 470 vertex of which 6 / 470 are part of one of the 1 SCC in 10 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1043 edges and 465 vertex of which 464 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 464 transition count 355
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 100 place count 415 transition count 355
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 94 Pre rules applied. Total rules applied 100 place count 415 transition count 261
Deduced a syphon composed of 94 places in 2 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 306 place count 303 transition count 261
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 317 place count 292 transition count 250
Iterating global reduction 2 with 11 rules applied. Total rules applied 328 place count 292 transition count 250
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 560 place count 174 transition count 136
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 562 place count 173 transition count 140
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 564 place count 173 transition count 138
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 566 place count 171 transition count 138
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 567 place count 171 transition count 138
Applied a total of 567 rules in 122 ms. Remains 171 /470 variables (removed 299) and now considering 138/412 (removed 274) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 171/470 places, 138/412 transitions.
Incomplete random walk after 10000 steps, including 311 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 10000 steps, including 183 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 138 rows 171 cols
[2024-05-25 15:31:48] [INFO ] Computed 73 invariants in 8 ms
[2024-05-25 15:31:48] [INFO ] [Real]Absence check using 51 positive place invariants in 8 ms returned sat
[2024-05-25 15:31:48] [INFO ] [Real]Absence check using 51 positive and 22 generalized place invariants in 7 ms returned sat
[2024-05-25 15:31:48] [INFO ] After 55ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 15:31:48] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-25 15:31:48] [INFO ] After 11ms SMT Verify possible using 13 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:31:48] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:31:48] [INFO ] [Nat]Absence check using 51 positive place invariants in 7 ms returned sat
[2024-05-25 15:31:48] [INFO ] [Nat]Absence check using 51 positive and 22 generalized place invariants in 5 ms returned sat
[2024-05-25 15:31:48] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:31:48] [INFO ] After 9ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 15:31:48] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-25 15:31:48] [INFO ] After 137ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 50 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=50 )
Parikh walk visited 1 properties in 1 ms.
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
FORMULA BusinessProcesses-PT-12-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 455 stabilizing places and 397 stable transitions
Graph (complete) has 1050 edges and 470 vertex of which 469 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.15 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 470 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 470/470 places, 412/412 transitions.
Graph (complete) has 1050 edges and 470 vertex of which 469 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 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 468 transition count 362
Reduce places removed 48 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 50 rules applied. Total rules applied 99 place count 420 transition count 360
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 101 place count 418 transition count 360
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 102 Pre rules applied. Total rules applied 101 place count 418 transition count 258
Deduced a syphon composed of 102 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 3 with 222 rules applied. Total rules applied 323 place count 298 transition count 258
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 336 place count 285 transition count 245
Iterating global reduction 3 with 13 rules applied. Total rules applied 349 place count 285 transition count 245
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 349 place count 285 transition count 244
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 351 place count 284 transition count 244
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 117
Deduced a syphon composed of 117 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 3 with 238 rules applied. Total rules applied 589 place count 163 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 590 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 4 with 2 rules applied. Total rules applied 592 place count 162 transition count 130
Applied a total of 592 rules in 55 ms. Remains 162 /470 variables (removed 308) and now considering 130/412 (removed 282) transitions.
// Phase 1: matrix 130 rows 162 cols
[2024-05-25 15:31:48] [INFO ] Computed 73 invariants in 2 ms
[2024-05-25 15:31:48] [INFO ] Implicit Places using invariants in 103 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 105 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 143/470 places, 130/412 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 SI_LTL mode , in 2 iterations and 167 ms. Remains : 143/470 places, 130/412 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 139 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s118 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 7 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-00 finished in 360 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 5 out of 470 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 470/470 places, 412/412 transitions.
Graph (trivial) has 220 edges and 470 vertex of which 6 / 470 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 1044 edges and 465 vertex of which 464 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 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 463 transition count 353
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 104 place count 412 transition count 353
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 98 Pre rules applied. Total rules applied 104 place count 412 transition count 255
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 318 place count 296 transition count 255
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 331 place count 283 transition count 242
Iterating global reduction 2 with 13 rules applied. Total rules applied 344 place count 283 transition count 242
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 344 place count 283 transition count 241
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 346 place count 282 transition count 241
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 110
Deduced a syphon composed of 110 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 570 place count 168 transition count 131
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 572 place count 167 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 573 place count 166 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 574 place count 165 transition count 134
Applied a total of 574 rules in 59 ms. Remains 165 /470 variables (removed 305) and now considering 134/412 (removed 278) transitions.
// Phase 1: matrix 134 rows 165 cols
[2024-05-25 15:31:49] [INFO ] Computed 72 invariants in 3 ms
[2024-05-25 15:31:49] [INFO ] Implicit Places using invariants in 92 ms returned [43, 44, 49, 50, 51, 52, 53, 54, 55]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 101 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 156/470 places, 134/412 transitions.
Applied a total of 0 rules in 7 ms. Remains 156 /156 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 168 ms. Remains : 156/470 places, 134/412 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
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}]], initial=0, aps=[p0:(AND (OR (EQ s1 1) (AND (EQ s14 1) (EQ s52 1) (EQ s142 1))) (OR (EQ s1 1) (EQ s20 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 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 217 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0 U (G(p0)||(p0&&G((p1 U X((p2||G(p3))))))))))'
Support contains 5 out of 470 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 470/470 places, 412/412 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 457 transition count 399
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 457 transition count 399
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 455 transition count 397
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 455 transition count 397
Applied a total of 30 rules in 26 ms. Remains 455 /470 variables (removed 15) and now considering 397/412 (removed 15) transitions.
// Phase 1: matrix 397 rows 455 cols
[2024-05-25 15:31:49] [INFO ] Computed 95 invariants in 6 ms
[2024-05-25 15:31:49] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-25 15:31:49] [INFO ] Invariant cache hit.
[2024-05-25 15:31:49] [INFO ] Implicit Places using invariants and state equation in 431 ms returned []
Implicit Place search using SMT with State Equation took 581 ms to find 0 implicit places.
[2024-05-25 15:31:49] [INFO ] Invariant cache hit.
[2024-05-25 15:31:50] [INFO ] Dead Transitions using invariants and state equation in 220 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 455/470 places, 397/412 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 829 ms. Remains : 455/470 places, 397/412 transitions.
Stuttering acceptance computed with spot in 369 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 2} source=0 dest: 1}, { cond=p0, acceptance={2} source=0 dest: 2}, { cond=(AND p1 p0), acceptance={0, 2} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={0, 1, 2} source=1 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2) p3), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={0, 2} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={2} source=1 dest: 2}, { cond=(AND p1 p0 (NOT p2) p3), acceptance={0} source=1 dest: 3}, { cond=(AND p1 p0 (NOT p2) (NOT p3)), acceptance={0, 2} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p3), acceptance={0, 1} source=1 dest: 4}, { cond=(AND p0 (NOT p2) p3), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={0, 2} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=2 dest: 1}, { cond=p0, acceptance={2} source=2 dest: 2}, { cond=(NOT p0), acceptance={1, 2} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={0, 2} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0, 1, 2} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0 (NOT p2) p3), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2) p3), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={0, 2} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), acceptance={0, 1, 2} source=3 dest: 1}, { cond=(AND p1 p0 (NOT p2) p3), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2) p3), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p1 p0 (NOT p2) (NOT p3)), acceptance={0, 2} source=3 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2) (NOT p3)), acceptance={0, 1, 2} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0, 1, 2} source=4 dest: 0}, { cond=(AND (NOT p1) p0 p3), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={0, 2} source=4 dest: 1}, { cond=(AND p0 (NOT p3)), acceptance={2} source=4 dest: 2}, { cond=(AND p1 p0 p3), acceptance={0} source=4 dest: 3}, { cond=(AND p1 p0 (NOT p3)), acceptance={0, 2} source=4 dest: 3}, { cond=(AND (NOT p0) p3), acceptance={0, 1} source=4 dest: 4}, { cond=(AND p0 p3), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) p0 p3), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p3), acceptance={0, 1} source=5 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={0, 2} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={0, 1, 2} source=5 dest: 1}, { cond=(AND p0 (NOT p3)), acceptance={2} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p3)), acceptance={1, 2} source=5 dest: 2}, { cond=(AND p1 p0 p3), acceptance={0} source=5 dest: 3}, { cond=(AND p1 (NOT p0) p3), acceptance={0, 1} source=5 dest: 3}, { cond=(AND p1 p0 (NOT p3)), acceptance={0, 2} source=5 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={0, 1, 2} source=5 dest: 3}, { cond=(AND p0 p3), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) p3), acceptance={1} source=5 dest: 5}]], initial=0, aps=[p0:(NEQ s4 1), p1:(EQ s393 1), p2:(AND (EQ s440 1) (EQ s443 1)), p3:(EQ s99 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 728 reset in 365 ms.
Stack based approach found an accepted trace after 6104 steps with 45 reset with depth 17 and stack size 17 in 18 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-03 finished in 1609 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(X(G(X(F((!(p0 U p1)||p0)))))))))'
Support contains 2 out of 470 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 470/470 places, 412/412 transitions.
Graph (trivial) has 217 edges and 470 vertex of which 6 / 470 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 1044 edges and 465 vertex of which 464 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 463 transition count 355
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 100 place count 414 transition count 355
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 98 Pre rules applied. Total rules applied 100 place count 414 transition count 257
Deduced a syphon composed of 98 places in 1 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 314 place count 298 transition count 257
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 326 place count 286 transition count 245
Iterating global reduction 2 with 12 rules applied. Total rules applied 338 place count 286 transition count 245
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 338 place count 286 transition count 244
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 340 place count 285 transition count 244
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 116
Deduced a syphon composed of 116 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 236 rules applied. Total rules applied 576 place count 165 transition count 128
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 577 place count 164 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 578 place count 163 transition count 127
Applied a total of 578 rules in 47 ms. Remains 163 /470 variables (removed 307) and now considering 127/412 (removed 285) transitions.
// Phase 1: matrix 127 rows 163 cols
[2024-05-25 15:31:51] [INFO ] Computed 72 invariants in 3 ms
[2024-05-25 15:31:51] [INFO ] Implicit Places using invariants in 123 ms returned [0, 1, 6, 7, 30, 31, 32, 33, 40, 41, 42, 47, 48, 49, 50, 51, 52, 53]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 125 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 145/470 places, 127/412 transitions.
Applied a total of 0 rules in 4 ms. Remains 145 /145 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 178 ms. Remains : 145/470 places, 127/412 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s45 1), p1:(EQ s1 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 10 steps with 1 reset in 0 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-05 finished in 286 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 470 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 470/470 places, 412/412 transitions.
Graph (trivial) has 220 edges and 470 vertex of which 6 / 470 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 1044 edges and 465 vertex of which 464 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 463 transition count 354
Reduce places removed 50 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 51 rules applied. Total rules applied 103 place count 413 transition count 353
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 412 transition count 353
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 99 Pre rules applied. Total rules applied 104 place count 412 transition count 254
Deduced a syphon composed of 99 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 3 with 216 rules applied. Total rules applied 320 place count 295 transition count 254
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 333 place count 282 transition count 241
Iterating global reduction 3 with 13 rules applied. Total rules applied 346 place count 282 transition count 241
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 346 place count 282 transition count 240
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 348 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 3 with 232 rules applied. Total rules applied 580 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 3 with 2 rules applied. Total rules applied 582 place count 162 transition count 130
Applied a total of 582 rules in 41 ms. Remains 162 /470 variables (removed 308) and now considering 130/412 (removed 282) transitions.
// Phase 1: matrix 130 rows 162 cols
[2024-05-25 15:31:51] [INFO ] Computed 73 invariants in 2 ms
[2024-05-25 15:31:51] [INFO ] Implicit Places using invariants in 110 ms returned [1, 2, 5, 6, 29, 30, 31, 32, 39, 40, 41, 46, 47, 48, 49, 52, 53, 54]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 111 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 144/470 places, 130/412 transitions.
Applied a total of 0 rules in 6 ms. Remains 144 /144 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 159 ms. Remains : 144/470 places, 130/412 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s36 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-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-06 finished in 213 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&X((F(!p1)||G(p0)))) U X(G(!p2))))'
Support contains 3 out of 470 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 470/470 places, 412/412 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 459 transition count 401
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 459 transition count 401
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 457 transition count 399
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 457 transition count 399
Applied a total of 26 rules in 44 ms. Remains 457 /470 variables (removed 13) and now considering 399/412 (removed 13) transitions.
// Phase 1: matrix 399 rows 457 cols
[2024-05-25 15:31:51] [INFO ] Computed 95 invariants in 11 ms
[2024-05-25 15:31:51] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-05-25 15:31:51] [INFO ] Invariant cache hit.
[2024-05-25 15:31:52] [INFO ] Implicit Places using invariants and state equation in 622 ms returned []
Implicit Place search using SMT with State Equation took 819 ms to find 0 implicit places.
[2024-05-25 15:31:52] [INFO ] Invariant cache hit.
[2024-05-25 15:31:52] [INFO ] Dead Transitions using invariants and state equation in 273 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 457/470 places, 399/412 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1138 ms. Remains : 457/470 places, 399/412 transitions.
Stuttering acceptance computed with spot in 327 ms :[p2, (AND p1 p2 (NOT p0)), p2, true, p1, (AND p1 (NOT p2) (NOT p0)), (AND p1 p2)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) p2 p1), acceptance={} source=1 dest: 4}, { cond=(AND p0 p2 p1), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=5 dest: 5}], [{ cond=(AND p2 p1), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=6 dest: 6}]], initial=2, aps=[p2:(AND (EQ s310 1) (EQ s331 1)), p0:(NEQ s310 1), p1:(OR (EQ s310 1) (EQ s399 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33395 reset in 497 ms.
Product exploration explored 100000 steps with 33271 reset in 435 ms.
Computed a total of 442 stabilizing places and 384 stable transitions
Graph (complete) has 1035 edges and 457 vertex of which 456 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 442 stabilizing places and 384 stable transitions
Detected a total of 442/457 stabilizing places and 384/399 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND p0 p2 p1))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND p0 (NOT p2))), (X p0), (X (NOT p2)), (X (NOT (AND p0 p2))), (X (X (NOT (AND p0 p2 p1)))), true, (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 2829 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter sensitive) to 7 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 302 ms :[p2, (AND p1 p2 (NOT p0)), p2, true, p1, (AND p1 (NOT p2) (NOT p0)), (AND p1 p2)]
Incomplete random walk after 10000 steps, including 74 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 11) seen :8
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-25 15:31:57] [INFO ] Invariant cache hit.
[2024-05-25 15:31:57] [INFO ] [Real]Absence check using 52 positive place invariants in 28 ms returned sat
[2024-05-25 15:31:57] [INFO ] [Real]Absence check using 52 positive and 43 generalized place invariants in 26 ms returned sat
[2024-05-25 15:31:57] [INFO ] After 173ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:1
[2024-05-25 15:31:57] [INFO ] [Nat]Absence check using 52 positive place invariants in 24 ms returned sat
[2024-05-25 15:31:57] [INFO ] [Nat]Absence check using 52 positive and 43 generalized place invariants in 21 ms returned sat
[2024-05-25 15:31:57] [INFO ] After 193ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2024-05-25 15:31:58] [INFO ] Deduced a trap composed of 76 places in 146 ms of which 1 ms to minimize.
[2024-05-25 15:31:58] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-25 15:31:58] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 0 ms to minimize.
[2024-05-25 15:31:58] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
[2024-05-25 15:31:58] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 1 ms to minimize.
[2024-05-25 15:31:58] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 1 ms to minimize.
[2024-05-25 15:31:58] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 0 ms to minimize.
[2024-05-25 15:31:58] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 0 ms to minimize.
[2024-05-25 15:31:58] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 0 ms to minimize.
[2024-05-25 15:31:58] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1010 ms
[2024-05-25 15:31:58] [INFO ] After 1222ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2024-05-25 15:31:58] [INFO ] After 1440ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 196 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=98 )
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 457 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 457/457 places, 399/399 transitions.
Graph (trivial) has 205 edges and 457 vertex of which 6 / 457 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1028 edges and 452 vertex of which 451 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 48 place count 451 transition count 345
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 94 place count 405 transition count 345
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 94 place count 405 transition count 248
Deduced a syphon composed of 97 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 212 rules applied. Total rules applied 306 place count 290 transition count 248
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 307 place count 289 transition count 247
Iterating global reduction 2 with 1 rules applied. Total rules applied 308 place count 289 transition count 247
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 2 with 244 rules applied. Total rules applied 552 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 554 place count 164 transition count 131
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 556 place count 164 transition count 129
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 558 place count 162 transition count 129
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 559 place count 162 transition count 129
Applied a total of 559 rules in 41 ms. Remains 162 /457 variables (removed 295) and now considering 129/399 (removed 270) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 162/457 places, 129/399 transitions.
Finished random walk after 36 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=18 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND p0 p2 p1))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND p0 (NOT p2))), (X p0), (X (NOT p2)), (X (NOT (AND p0 p2))), (X (X (NOT (AND p0 p2 p1)))), true, (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 p2)))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) (NOT p2) p1)), (F (NOT (AND p0 (NOT p2)))), (F p2), (F (AND p0 p2 p1)), (F (AND (NOT p0) p2 p1)), (F (AND p0 (NOT p2) p1)), (F (AND (NOT p2) p1)), (F p1), (F (AND p2 p1))]
Property proved to be false thanks to negative knowledge :(F (AND p0 p2 p1))
Knowledge based reduction with 24 factoid took 7711 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-12-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-12-LTLFireability-07 finished in 15273 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0||(G(p1)&&F(p2)))&&(p2||G(p0)))))'
Support contains 3 out of 470 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 470/470 places, 412/412 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 459 transition count 401
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 459 transition count 401
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 458 transition count 400
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 458 transition count 400
Applied a total of 24 rules in 25 ms. Remains 458 /470 variables (removed 12) and now considering 400/412 (removed 12) transitions.
// Phase 1: matrix 400 rows 458 cols
[2024-05-25 15:32:06] [INFO ] Computed 95 invariants in 6 ms
[2024-05-25 15:32:07] [INFO ] Implicit Places using invariants in 228 ms returned []
[2024-05-25 15:32:07] [INFO ] Invariant cache hit.
[2024-05-25 15:32:07] [INFO ] Implicit Places using invariants and state equation in 558 ms returned []
Implicit Place search using SMT with State Equation took 790 ms to find 0 implicit places.
[2024-05-25 15:32:07] [INFO ] Invariant cache hit.
[2024-05-25 15:32:07] [INFO ] Dead Transitions using invariants and state equation in 242 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 458/470 places, 400/412 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1058 ms. Remains : 458/470 places, 400/412 transitions.
Stuttering acceptance computed with spot in 197 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(EQ s405 1), p1:(EQ s402 1), p2:(EQ s44 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-09 finished in 1283 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 470 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 470/470 places, 412/412 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 456 transition count 398
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 456 transition count 398
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 454 transition count 396
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 454 transition count 396
Applied a total of 32 rules in 34 ms. Remains 454 /470 variables (removed 16) and now considering 396/412 (removed 16) transitions.
// Phase 1: matrix 396 rows 454 cols
[2024-05-25 15:32:08] [INFO ] Computed 95 invariants in 5 ms
[2024-05-25 15:32:08] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-25 15:32:08] [INFO ] Invariant cache hit.
[2024-05-25 15:32:08] [INFO ] Implicit Places using invariants and state equation in 542 ms returned []
Implicit Place search using SMT with State Equation took 725 ms to find 0 implicit places.
[2024-05-25 15:32:08] [INFO ] Invariant cache hit.
[2024-05-25 15:32:09] [INFO ] Dead Transitions using invariants and state equation in 269 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 454/470 places, 396/412 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1031 ms. Remains : 454/470 places, 396/412 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT 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=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s422 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]]
Stuttering criterion allowed to conclude after 128 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-10 finished in 1193 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(X((G(p1)||p0))) U p2)&&X(p3)))'
Support contains 6 out of 470 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 470/470 places, 412/412 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 457 transition count 399
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 457 transition count 399
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 455 transition count 397
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 455 transition count 397
Applied a total of 30 rules in 33 ms. Remains 455 /470 variables (removed 15) and now considering 397/412 (removed 15) transitions.
// Phase 1: matrix 397 rows 455 cols
[2024-05-25 15:32:09] [INFO ] Computed 95 invariants in 8 ms
[2024-05-25 15:32:09] [INFO ] Implicit Places using invariants in 206 ms returned []
[2024-05-25 15:32:09] [INFO ] Invariant cache hit.
[2024-05-25 15:32:10] [INFO ] Implicit Places using invariants and state equation in 604 ms returned []
Implicit Place search using SMT with State Equation took 813 ms to find 0 implicit places.
[2024-05-25 15:32:10] [INFO ] Invariant cache hit.
[2024-05-25 15:32:10] [INFO ] Dead Transitions using invariants and state equation in 240 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 455/470 places, 397/412 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1089 ms. Remains : 455/470 places, 397/412 transitions.
Stuttering acceptance computed with spot in 259 ms :[(OR (NOT p2) (NOT p3)), (NOT p3), (OR (NOT p2) (AND (NOT p0) (NOT p1))), true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p3), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=true, acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(EQ s444 1), p3:(EQ s426 0), p0:(OR (EQ s322 1) (EQ s444 1)), p1:(AND (EQ s83 1) (EQ s269 1) (EQ s430 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 1 reset in 0 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-12 finished in 1373 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||G(p1))))'
Support contains 5 out of 470 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 470/470 places, 412/412 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 457 transition count 399
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 457 transition count 399
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 455 transition count 397
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 455 transition count 397
Applied a total of 30 rules in 37 ms. Remains 455 /470 variables (removed 15) and now considering 397/412 (removed 15) transitions.
// Phase 1: matrix 397 rows 455 cols
[2024-05-25 15:32:10] [INFO ] Computed 95 invariants in 6 ms
[2024-05-25 15:32:10] [INFO ] Implicit Places using invariants in 205 ms returned []
[2024-05-25 15:32:10] [INFO ] Invariant cache hit.
[2024-05-25 15:32:11] [INFO ] Implicit Places using invariants and state equation in 591 ms returned []
Implicit Place search using SMT with State Equation took 799 ms to find 0 implicit places.
[2024-05-25 15:32:11] [INFO ] Invariant cache hit.
[2024-05-25 15:32:11] [INFO ] Dead Transitions using invariants and state equation in 248 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 455/470 places, 397/412 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1086 ms. Remains : 455/470 places, 397/412 transitions.
Stuttering acceptance computed with spot in 233 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
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=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(AND (OR (EQ s71 0) (EQ s250 0) (EQ s380 0)) (OR (EQ s169 1) (EQ s399 1))), p0:(EQ s399 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-13 finished in 1339 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(X(G(p1)) U (p2&&F(p3)))))'
Support contains 4 out of 470 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 470/470 places, 412/412 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 460 transition count 402
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 460 transition count 402
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 459 transition count 401
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 459 transition count 401
Applied a total of 22 rules in 34 ms. Remains 459 /470 variables (removed 11) and now considering 401/412 (removed 11) transitions.
// Phase 1: matrix 401 rows 459 cols
[2024-05-25 15:32:11] [INFO ] Computed 95 invariants in 5 ms
[2024-05-25 15:32:12] [INFO ] Implicit Places using invariants in 212 ms returned []
[2024-05-25 15:32:12] [INFO ] Invariant cache hit.
[2024-05-25 15:32:12] [INFO ] Implicit Places using invariants and state equation in 670 ms returned []
Implicit Place search using SMT with State Equation took 884 ms to find 0 implicit places.
[2024-05-25 15:32:12] [INFO ] Invariant cache hit.
[2024-05-25 15:32:13] [INFO ] Dead Transitions using invariants and state equation in 281 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 459/470 places, 401/412 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1200 ms. Remains : 459/470 places, 401/412 transitions.
Stuttering acceptance computed with spot in 316 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p3) (NOT p0)), true, (NOT p1), (OR (NOT p2) (NOT p3)), (NOT p3)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=1 dest: 5}, { cond=(AND p2 (NOT p3) (NOT p0) p1), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 4}, { cond=(NOT p2), acceptance={0} source=5 dest: 5}, { cond=(AND p2 (NOT p3)), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p3), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(EQ s382 1), p3:(NEQ s291 1), p0:(EQ s38 1), p1:(NEQ s399 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 32428 steps with 236 reset in 116 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-15 finished in 1666 ms.
All properties solved by simple procedures.
Total runtime 31349 ms.

BK_STOP 1716651134031

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is BusinessProcesses-PT-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 r065-tajo-171620414900338"
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 ;