Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.8K Feb 25 16:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 16:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 16:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 25 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 16:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 25 16:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 104K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-09-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678361166522

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-09
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-09 11:26:08] [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]
[2023-03-09 11:26:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 11:26:08] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2023-03-09 11:26:08] [INFO ] Transformed 403 places.
[2023-03-09 11:26:08] [INFO ] Transformed 374 transitions.
[2023-03-09 11:26:08] [INFO ] Found NUPN structural information;
[2023-03-09 11:26:08] [INFO ] Parsed PT model containing 403 places and 374 transitions and 1148 arcs in 152 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 8 formulas.
FORMULA BusinessProcesses-PT-09-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 374/374 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 402 transition count 374
Discarding 53 places :
Symmetric choice reduction at 1 with 53 rule applications. Total rules 54 place count 349 transition count 321
Iterating global reduction 1 with 53 rules applied. Total rules applied 107 place count 349 transition count 321
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 132 place count 324 transition count 296
Iterating global reduction 1 with 25 rules applied. Total rules applied 157 place count 324 transition count 296
Applied a total of 157 rules in 79 ms. Remains 324 /403 variables (removed 79) and now considering 296/374 (removed 78) transitions.
// Phase 1: matrix 296 rows 324 cols
[2023-03-09 11:26:08] [INFO ] Computed 64 place invariants in 22 ms
[2023-03-09 11:26:09] [INFO ] Implicit Places using invariants in 251 ms returned []
[2023-03-09 11:26:09] [INFO ] Invariant cache hit.
[2023-03-09 11:26:09] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
[2023-03-09 11:26:09] [INFO ] Invariant cache hit.
[2023-03-09 11:26:09] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 324/403 places, 296/374 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 823 ms. Remains : 324/403 places, 296/374 transitions.
Support contains 21 out of 324 places after structural reductions.
[2023-03-09 11:26:09] [INFO ] Flatten gal took : 50 ms
[2023-03-09 11:26:09] [INFO ] Flatten gal took : 19 ms
[2023-03-09 11:26:09] [INFO ] Input system was already deterministic with 296 transitions.
Incomplete random walk after 10000 steps, including 100 resets, run finished after 412 ms. (steps per millisecond=24 ) properties (out of 13) seen :5
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-09 11:26:10] [INFO ] Invariant cache hit.
[2023-03-09 11:26:10] [INFO ] [Real]Absence check using 36 positive place invariants in 8 ms returned sat
[2023-03-09 11:26:10] [INFO ] [Real]Absence check using 36 positive and 28 generalized place invariants in 6 ms returned sat
[2023-03-09 11:26:10] [INFO ] After 142ms SMT Verify possible using state equation in real domain returned unsat :2 sat :2 real:2
[2023-03-09 11:26:11] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 7 ms to minimize.
[2023-03-09 11:26:11] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 1 ms to minimize.
[2023-03-09 11:26:11] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2023-03-09 11:26:11] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 2 ms to minimize.
[2023-03-09 11:26:11] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2023-03-09 11:26:11] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2023-03-09 11:26:11] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 0 ms to minimize.
[2023-03-09 11:26:11] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2023-03-09 11:26:11] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2023-03-09 11:26:11] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2023-03-09 11:26:11] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 714 ms
[2023-03-09 11:26:11] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2023-03-09 11:26:11] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2023-03-09 11:26:11] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2023-03-09 11:26:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 191 ms
[2023-03-09 11:26:11] [INFO ] After 1075ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :0 real:4
[2023-03-09 11:26:11] [INFO ] After 1215ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:4
[2023-03-09 11:26:12] [INFO ] [Nat]Absence check using 36 positive place invariants in 10 ms returned sat
[2023-03-09 11:26:12] [INFO ] [Nat]Absence check using 36 positive and 28 generalized place invariants in 6 ms returned sat
[2023-03-09 11:26:12] [INFO ] After 138ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2023-03-09 11:26:12] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 0 ms to minimize.
[2023-03-09 11:26:12] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 0 ms to minimize.
[2023-03-09 11:26:12] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2023-03-09 11:26:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 250 ms
[2023-03-09 11:26:12] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 0 ms to minimize.
[2023-03-09 11:26:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2023-03-09 11:26:12] [INFO ] After 601ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 60 ms.
[2023-03-09 11:26:12] [INFO ] After 797ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 48 ms.
Support contains 7 out of 324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 296/296 transitions.
Graph (complete) has 755 edges and 324 vertex of which 323 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 323 transition count 268
Reduce places removed 27 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 30 rules applied. Total rules applied 58 place count 296 transition count 265
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 61 place count 293 transition count 265
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 69 Pre rules applied. Total rules applied 61 place count 293 transition count 196
Deduced a syphon composed of 69 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 146 rules applied. Total rules applied 207 place count 216 transition count 196
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 211 place count 212 transition count 192
Iterating global reduction 3 with 4 rules applied. Total rules applied 215 place count 212 transition count 192
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 215 place count 212 transition count 191
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 217 place count 211 transition count 191
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 155 rules applied. Total rules applied 372 place count 132 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 373 place count 132 transition count 114
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 375 place count 131 transition count 117
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 380 place count 131 transition count 117
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 381 place count 130 transition count 116
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 382 place count 129 transition count 116
Applied a total of 382 rules in 101 ms. Remains 129 /324 variables (removed 195) and now considering 116/296 (removed 180) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 129/324 places, 116/296 transitions.
Incomplete random walk after 10000 steps, including 1045 resets, run finished after 317 ms. (steps per millisecond=31 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 265 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 293 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 245 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 288 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 116 rows 129 cols
[2023-03-09 11:26:13] [INFO ] Computed 52 place invariants in 11 ms
[2023-03-09 11:26:13] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-09 11:26:13] [INFO ] [Real]Absence check using 33 positive and 19 generalized place invariants in 5 ms returned sat
[2023-03-09 11:26:13] [INFO ] After 84ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2023-03-09 11:26:13] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-09 11:26:13] [INFO ] After 19ms SMT Verify possible using 4 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 11:26:13] [INFO ] After 196ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 11:26:13] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2023-03-09 11:26:13] [INFO ] [Nat]Absence check using 33 positive and 19 generalized place invariants in 5 ms returned sat
[2023-03-09 11:26:13] [INFO ] After 79ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 11:26:13] [INFO ] After 18ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-09 11:26:13] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-09 11:26:13] [INFO ] After 255ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 116/116 transitions.
Graph (trivial) has 6 edges and 129 vertex of which 2 / 129 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 126 transition count 112
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 126 transition count 110
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 9 place count 124 transition count 110
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 123 transition count 109
Applied a total of 10 rules in 19 ms. Remains 123 /129 variables (removed 6) and now considering 109/116 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 123/129 places, 109/116 transitions.
Finished random walk after 7312 steps, including 449 resets, run visited all 3 properties in 45 ms. (steps per millisecond=162 )
Successfully simplified 2 atomic propositions for a total of 8 simplifications.
FORMULA BusinessProcesses-PT-09-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 194 stabilizing places and 196 stable transitions
Graph (complete) has 755 edges and 324 vertex of which 323 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(p0))) U G(p0)))'
Support contains 1 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 296/296 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 320 transition count 292
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 320 transition count 292
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 318 transition count 290
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 318 transition count 290
Applied a total of 12 rules in 12 ms. Remains 318 /324 variables (removed 6) and now considering 290/296 (removed 6) transitions.
// Phase 1: matrix 290 rows 318 cols
[2023-03-09 11:26:14] [INFO ] Computed 64 place invariants in 4 ms
[2023-03-09 11:26:14] [INFO ] Implicit Places using invariants in 215 ms returned []
[2023-03-09 11:26:14] [INFO ] Invariant cache hit.
[2023-03-09 11:26:15] [INFO ] Implicit Places using invariants and state equation in 549 ms returned []
Implicit Place search using SMT with State Equation took 768 ms to find 0 implicit places.
[2023-03-09 11:26:15] [INFO ] Invariant cache hit.
[2023-03-09 11:26:15] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 318/324 places, 290/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1012 ms. Remains : 318/324 places, 290/296 transitions.
Stuttering acceptance computed with spot in 337 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-09-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(EQ s262 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-09-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLFireability-00 finished in 1420 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 296/296 transitions.
Graph (trivial) has 148 edges and 324 vertex of which 6 / 324 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 749 edges and 319 vertex of which 318 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 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 36 place count 317 transition count 254
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 70 place count 283 transition count 254
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 70 place count 283 transition count 187
Deduced a syphon composed of 67 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 214 place count 206 transition count 187
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 218 place count 202 transition count 183
Iterating global reduction 2 with 4 rules applied. Total rules applied 222 place count 202 transition count 183
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 222 place count 202 transition count 182
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 224 place count 201 transition count 182
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 155 rules applied. Total rules applied 379 place count 122 transition count 106
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 381 place count 121 transition count 109
Applied a total of 381 rules in 50 ms. Remains 121 /324 variables (removed 203) and now considering 109/296 (removed 187) transitions.
// Phase 1: matrix 109 rows 121 cols
[2023-03-09 11:26:15] [INFO ] Computed 51 place invariants in 1 ms
[2023-03-09 11:26:15] [INFO ] Implicit Places using invariants in 120 ms returned [1, 2, 3, 11, 36, 37, 38, 39, 40, 41, 42]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 123 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 110/324 places, 109/296 transitions.
Applied a total of 0 rules in 6 ms. Remains 110 /110 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 181 ms. Remains : 110/324 places, 109/296 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-09-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:(EQ s34 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-09-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLFireability-01 finished in 250 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&(G(p1)||G(p2)))))'
Support contains 3 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 296/296 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 319 transition count 291
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 319 transition count 291
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 317 transition count 289
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 317 transition count 289
Applied a total of 14 rules in 19 ms. Remains 317 /324 variables (removed 7) and now considering 289/296 (removed 7) transitions.
// Phase 1: matrix 289 rows 317 cols
[2023-03-09 11:26:15] [INFO ] Computed 64 place invariants in 5 ms
[2023-03-09 11:26:16] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-09 11:26:16] [INFO ] Invariant cache hit.
[2023-03-09 11:26:16] [INFO ] Implicit Places using invariants and state equation in 435 ms returned []
Implicit Place search using SMT with State Equation took 588 ms to find 0 implicit places.
[2023-03-09 11:26:16] [INFO ] Invariant cache hit.
[2023-03-09 11:26:16] [INFO ] Dead Transitions using invariants and state equation in 223 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 317/324 places, 289/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 845 ms. Remains : 317/324 places, 289/296 transitions.
Stuttering acceptance computed with spot in 462 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-09-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 5}, { cond=(AND p1 p2), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 2}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 5}, { cond=(AND p1 p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(EQ s301 1), p2:(OR (EQ s34 1) (EQ s30 1)), p0:(EQ s30 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 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-09-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLFireability-02 finished in 1333 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 296/296 transitions.
Graph (complete) has 755 edges and 324 vertex of which 323 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 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 322 transition count 264
Reduce places removed 30 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 32 rules applied. Total rules applied 63 place count 292 transition count 262
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 290 transition count 262
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 71 Pre rules applied. Total rules applied 65 place count 290 transition count 191
Deduced a syphon composed of 71 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 217 place count 209 transition count 191
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 221 place count 205 transition count 187
Iterating global reduction 3 with 4 rules applied. Total rules applied 225 place count 205 transition count 187
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 225 place count 205 transition count 186
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 227 place count 204 transition count 186
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 155 rules applied. Total rules applied 382 place count 125 transition count 110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 383 place count 125 transition count 109
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 385 place count 124 transition count 112
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 386 place count 123 transition count 111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 387 place count 122 transition count 111
Applied a total of 387 rules in 91 ms. Remains 122 /324 variables (removed 202) and now considering 111/296 (removed 185) transitions.
// Phase 1: matrix 111 rows 122 cols
[2023-03-09 11:26:17] [INFO ] Computed 50 place invariants in 1 ms
[2023-03-09 11:26:17] [INFO ] Implicit Places using invariants in 173 ms returned [40, 41, 42]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 175 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 119/324 places, 111/296 transitions.
Applied a total of 0 rules in 3 ms. Remains 119 /119 variables (removed 0) and now considering 111/111 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 269 ms. Remains : 119/324 places, 111/296 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-09-LTLFireability-09 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 (EQ s38 1) (EQ s60 1) (EQ s96 1) (EQ s50 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 13 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-09-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLFireability-09 finished in 393 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 296/296 transitions.
Graph (trivial) has 146 edges and 324 vertex of which 6 / 324 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 749 edges and 319 vertex of which 318 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 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 35 place count 317 transition count 255
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 68 place count 284 transition count 255
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 68 place count 284 transition count 188
Deduced a syphon composed of 67 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 212 place count 207 transition count 188
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 215 place count 204 transition count 185
Iterating global reduction 2 with 3 rules applied. Total rules applied 218 place count 204 transition count 185
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 161 rules applied. Total rules applied 379 place count 122 transition count 106
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 381 place count 121 transition count 109
Applied a total of 381 rules in 34 ms. Remains 121 /324 variables (removed 203) and now considering 109/296 (removed 187) transitions.
// Phase 1: matrix 109 rows 121 cols
[2023-03-09 11:26:17] [INFO ] Computed 51 place invariants in 1 ms
[2023-03-09 11:26:17] [INFO ] Implicit Places using invariants in 149 ms returned [1, 2, 3, 11, 36, 37, 38, 39, 40, 41, 42]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 151 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 110/324 places, 109/296 transitions.
Applied a total of 0 rules in 4 ms. Remains 110 /110 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 191 ms. Remains : 110/324 places, 109/296 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-09-LTLFireability-10 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:(NEQ s58 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 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-09-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLFireability-10 finished in 342 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(F(p1)&&X(F(p0)))))'
Support contains 3 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 296/296 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 320 transition count 292
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 320 transition count 292
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 319 transition count 291
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 319 transition count 291
Applied a total of 10 rules in 11 ms. Remains 319 /324 variables (removed 5) and now considering 291/296 (removed 5) transitions.
// Phase 1: matrix 291 rows 319 cols
[2023-03-09 11:26:18] [INFO ] Computed 64 place invariants in 5 ms
[2023-03-09 11:26:18] [INFO ] Implicit Places using invariants in 193 ms returned []
[2023-03-09 11:26:18] [INFO ] Invariant cache hit.
[2023-03-09 11:26:18] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
[2023-03-09 11:26:18] [INFO ] Invariant cache hit.
[2023-03-09 11:26:19] [INFO ] Dead Transitions using invariants and state equation in 900 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 319/324 places, 291/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1445 ms. Remains : 319/324 places, 291/296 transitions.
Stuttering acceptance computed with spot in 260 ms :[(NOT p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-09-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s274 1), p1:(AND (EQ s30 1) (EQ s119 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 105 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-09-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLFireability-14 finished in 1753 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 2 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 296/296 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 320 transition count 292
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 320 transition count 292
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 318 transition count 290
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 318 transition count 290
Applied a total of 12 rules in 28 ms. Remains 318 /324 variables (removed 6) and now considering 290/296 (removed 6) transitions.
// Phase 1: matrix 290 rows 318 cols
[2023-03-09 11:26:19] [INFO ] Computed 64 place invariants in 5 ms
[2023-03-09 11:26:20] [INFO ] Implicit Places using invariants in 245 ms returned []
[2023-03-09 11:26:20] [INFO ] Invariant cache hit.
[2023-03-09 11:26:20] [INFO ] Implicit Places using invariants and state equation in 488 ms returned []
Implicit Place search using SMT with State Equation took 735 ms to find 0 implicit places.
[2023-03-09 11:26:20] [INFO ] Invariant cache hit.
[2023-03-09 11:26:20] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 318/324 places, 290/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 931 ms. Remains : 318/324 places, 290/296 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-09-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s210 1), p0:(OR (EQ s131 1) (EQ s210 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-09-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLFireability-15 finished in 1175 ms.
All properties solved by simple procedures.
Total runtime 12426 ms.

BK_STOP 1678361181174

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-09"
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-5348"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-09, 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 r037-tajo-167813690500516"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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