Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 372K
-rw-r--r-- 1 mcc users 6.2K Apr 29 23:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Apr 29 23:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 29 23:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 29 23:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 9 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 07:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 07:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 161K May 10 09:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652637205165

Running Version 202205111006
[2022-05-15 17:53:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 17:53:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 17:53:26] [INFO ] Load time of PNML (sax parser for PT used): 135 ms
[2022-05-15 17:53:26] [INFO ] Transformed 650 places.
[2022-05-15 17:53:26] [INFO ] Transformed 580 transitions.
[2022-05-15 17:53:26] [INFO ] Found NUPN structural information;
[2022-05-15 17:53:26] [INFO ] Parsed PT model containing 650 places and 580 transitions in 301 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 4 places in 12 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-17-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 646 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 646/646 places, 576/576 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 643 transition count 576
Discarding 90 places :
Symmetric choice reduction at 1 with 90 rule applications. Total rules 93 place count 553 transition count 486
Iterating global reduction 1 with 90 rules applied. Total rules applied 183 place count 553 transition count 486
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 226 place count 510 transition count 443
Iterating global reduction 1 with 43 rules applied. Total rules applied 269 place count 510 transition count 443
Applied a total of 269 rules in 185 ms. Remains 510 /646 variables (removed 136) and now considering 443/576 (removed 133) transitions.
// Phase 1: matrix 443 rows 510 cols
[2022-05-15 17:53:27] [INFO ] Computed 105 place invariants in 64 ms
[2022-05-15 17:53:27] [INFO ] Implicit Places using invariants in 491 ms returned []
// Phase 1: matrix 443 rows 510 cols
[2022-05-15 17:53:27] [INFO ] Computed 105 place invariants in 22 ms
[2022-05-15 17:53:28] [INFO ] Implicit Places using invariants and state equation in 685 ms returned []
Implicit Place search using SMT with State Equation took 1217 ms to find 0 implicit places.
// Phase 1: matrix 443 rows 510 cols
[2022-05-15 17:53:28] [INFO ] Computed 105 place invariants in 19 ms
[2022-05-15 17:53:28] [INFO ] Dead Transitions using invariants and state equation in 592 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 510/646 places, 443/576 transitions.
Finished structural reductions, in 1 iterations. Remains : 510/646 places, 443/576 transitions.
Support contains 38 out of 510 places after structural reductions.
[2022-05-15 17:53:29] [INFO ] Flatten gal took : 63 ms
[2022-05-15 17:53:29] [INFO ] Flatten gal took : 35 ms
[2022-05-15 17:53:29] [INFO ] Input system was already deterministic with 443 transitions.
Incomplete random walk after 10000 steps, including 66 resets, run finished after 544 ms. (steps per millisecond=18 ) properties (out of 29) seen :10
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
// Phase 1: matrix 443 rows 510 cols
[2022-05-15 17:53:29] [INFO ] Computed 105 place invariants in 10 ms
[2022-05-15 17:53:31] [INFO ] [Real]Absence check using 59 positive place invariants in 26 ms returned sat
[2022-05-15 17:53:31] [INFO ] [Real]Absence check using 59 positive and 46 generalized place invariants in 12 ms returned sat
[2022-05-15 17:53:31] [INFO ] After 1352ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:18
[2022-05-15 17:53:31] [INFO ] [Nat]Absence check using 59 positive place invariants in 26 ms returned sat
[2022-05-15 17:53:31] [INFO ] [Nat]Absence check using 59 positive and 46 generalized place invariants in 12 ms returned sat
[2022-05-15 17:53:32] [INFO ] After 579ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :16
[2022-05-15 17:53:32] [INFO ] Deduced a trap composed of 70 places in 132 ms of which 8 ms to minimize.
[2022-05-15 17:53:32] [INFO ] Deduced a trap composed of 70 places in 130 ms of which 1 ms to minimize.
[2022-05-15 17:53:32] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 1 ms to minimize.
[2022-05-15 17:53:32] [INFO ] Deduced a trap composed of 71 places in 103 ms of which 1 ms to minimize.
[2022-05-15 17:53:32] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 0 ms to minimize.
[2022-05-15 17:53:33] [INFO ] Deduced a trap composed of 74 places in 112 ms of which 0 ms to minimize.
[2022-05-15 17:53:33] [INFO ] Deduced a trap composed of 95 places in 102 ms of which 1 ms to minimize.
[2022-05-15 17:53:33] [INFO ] Deduced a trap composed of 87 places in 111 ms of which 1 ms to minimize.
[2022-05-15 17:53:33] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 0 ms to minimize.
[2022-05-15 17:53:33] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 0 ms to minimize.
[2022-05-15 17:53:33] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 0 ms to minimize.
[2022-05-15 17:53:33] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 0 ms to minimize.
[2022-05-15 17:53:33] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 1 ms to minimize.
[2022-05-15 17:53:33] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1508 ms
[2022-05-15 17:53:34] [INFO ] Deduced a trap composed of 90 places in 95 ms of which 1 ms to minimize.
[2022-05-15 17:53:34] [INFO ] Deduced a trap composed of 93 places in 91 ms of which 0 ms to minimize.
[2022-05-15 17:53:34] [INFO ] Deduced a trap composed of 91 places in 89 ms of which 1 ms to minimize.
[2022-05-15 17:53:34] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 1 ms to minimize.
[2022-05-15 17:53:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 460 ms
[2022-05-15 17:53:34] [INFO ] Deduced a trap composed of 88 places in 100 ms of which 1 ms to minimize.
[2022-05-15 17:53:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2022-05-15 17:53:34] [INFO ] Deduced a trap composed of 87 places in 90 ms of which 0 ms to minimize.
[2022-05-15 17:53:35] [INFO ] Deduced a trap composed of 94 places in 94 ms of which 1 ms to minimize.
[2022-05-15 17:53:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 261 ms
[2022-05-15 17:53:35] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2022-05-15 17:53:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2022-05-15 17:53:35] [INFO ] After 3718ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :16
Attempting to minimize the solution found.
Minimization took 434 ms.
[2022-05-15 17:53:35] [INFO ] After 4570ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :16
Fused 19 Parikh solutions to 14 different solutions.
Parikh walk visited 6 properties in 193 ms.
Support contains 15 out of 510 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 510/510 places, 443/443 transitions.
Graph (complete) has 1146 edges and 510 vertex of which 509 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 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 509 transition count 396
Reduce places removed 46 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 49 rules applied. Total rules applied 96 place count 463 transition count 393
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 99 place count 460 transition count 393
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 106 Pre rules applied. Total rules applied 99 place count 460 transition count 287
Deduced a syphon composed of 106 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 3 with 230 rules applied. Total rules applied 329 place count 336 transition count 287
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 332 place count 333 transition count 284
Iterating global reduction 3 with 3 rules applied. Total rules applied 335 place count 333 transition count 284
Performed 133 Post agglomeration using F-continuation condition.Transition count delta: 133
Deduced a syphon composed of 133 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 3 with 271 rules applied. Total rules applied 606 place count 195 transition count 151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 607 place count 195 transition count 150
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 4 with 2 rules applied. Total rules applied 609 place count 194 transition count 154
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 614 place count 194 transition count 154
Applied a total of 614 rules in 114 ms. Remains 194 /510 variables (removed 316) and now considering 154/443 (removed 289) transitions.
Finished structural reductions, in 1 iterations. Remains : 194/510 places, 154/443 transitions.
Incomplete random walk after 10000 steps, including 1059 resets, run finished after 303 ms. (steps per millisecond=33 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 321 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 327 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 333 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 325 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 345 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 333 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 327 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 327 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 287 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 346 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 10) seen :0
Finished probabilistic random walk after 48001 steps, run visited all 10 properties in 224 ms. (steps per millisecond=214 )
Probabilistic random walk after 48001 steps, saw 12844 distinct states, run finished after 224 ms. (steps per millisecond=214 ) properties seen :10
FORMULA BusinessProcesses-PT-17-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
FORMULA BusinessProcesses-PT-17-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 212 stabilizing places and 184 stable transitions
Graph (complete) has 1146 edges and 510 vertex of which 509 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.32 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F((p0 U G(p1)))&&!p0))))'
Support contains 2 out of 510 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 510/510 places, 443/443 transitions.
Graph (trivial) has 235 edges and 510 vertex of which 6 / 510 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1140 edges and 505 vertex of which 504 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 55 place count 503 transition count 382
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 1 with 53 rules applied. Total rules applied 108 place count 450 transition count 382
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 107 Pre rules applied. Total rules applied 108 place count 450 transition count 275
Deduced a syphon composed of 107 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 234 rules applied. Total rules applied 342 place count 323 transition count 275
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 347 place count 318 transition count 270
Iterating global reduction 2 with 5 rules applied. Total rules applied 352 place count 318 transition count 270
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 352 place count 318 transition count 269
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 354 place count 317 transition count 269
Performed 132 Post agglomeration using F-continuation condition.Transition count delta: 132
Deduced a syphon composed of 132 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 2 with 269 rules applied. Total rules applied 623 place count 180 transition count 137
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 625 place count 179 transition count 141
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 626 place count 178 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 627 place count 177 transition count 140
Applied a total of 627 rules in 62 ms. Remains 177 /510 variables (removed 333) and now considering 140/443 (removed 303) transitions.
// Phase 1: matrix 140 rows 177 cols
[2022-05-15 17:53:38] [INFO ] Computed 79 place invariants in 1 ms
[2022-05-15 17:53:38] [INFO ] Implicit Places using invariants in 104 ms returned [9, 10, 33, 34, 35, 36, 43, 44, 45, 50, 51, 52, 53, 54, 55, 56]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 126 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 161/510 places, 140/443 transitions.
Applied a total of 0 rules in 7 ms. Remains 161 /161 variables (removed 0) and now considering 140/140 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 161/510 places, 140/443 transitions.
Stuttering acceptance computed with spot in 330 ms :[(OR (NOT p1) p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s6 1), p1:(EQ s62 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLFireability-01 finished in 574 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((false U F(!p0)))||G(X(p1)))))'
Support contains 5 out of 510 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 510/510 places, 443/443 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 504 transition count 437
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 504 transition count 437
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 501 transition count 434
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 501 transition count 434
Applied a total of 18 rules in 38 ms. Remains 501 /510 variables (removed 9) and now considering 434/443 (removed 9) transitions.
// Phase 1: matrix 434 rows 501 cols
[2022-05-15 17:53:38] [INFO ] Computed 105 place invariants in 3 ms
[2022-05-15 17:53:38] [INFO ] Implicit Places using invariants in 224 ms returned []
// Phase 1: matrix 434 rows 501 cols
[2022-05-15 17:53:38] [INFO ] Computed 105 place invariants in 7 ms
[2022-05-15 17:53:39] [INFO ] Implicit Places using invariants and state equation in 588 ms returned []
Implicit Place search using SMT with State Equation took 834 ms to find 0 implicit places.
// Phase 1: matrix 434 rows 501 cols
[2022-05-15 17:53:39] [INFO ] Computed 105 place invariants in 3 ms
[2022-05-15 17:53:39] [INFO ] Dead Transitions using invariants and state equation in 213 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 501/510 places, 434/443 transitions.
Finished structural reductions, in 1 iterations. Remains : 501/510 places, 434/443 transitions.
Stuttering acceptance computed with spot in 149 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (EQ s209 1) (AND (EQ s106 1) (EQ s290 1) (EQ s464 1))), p1:(EQ s405 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 556 ms.
Product exploration explored 100000 steps with 50000 reset in 447 ms.
Computed a total of 206 stabilizing places and 178 stable transitions
Graph (complete) has 1135 edges and 501 vertex of which 500 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 206 stabilizing places and 178 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 4 factoid took 67 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA BusinessProcesses-PT-17-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-17-LTLFireability-02 finished in 2335 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(p0))))'
Support contains 1 out of 510 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 510/510 places, 443/443 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 504 transition count 437
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 504 transition count 437
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 501 transition count 434
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 501 transition count 434
Applied a total of 18 rules in 27 ms. Remains 501 /510 variables (removed 9) and now considering 434/443 (removed 9) transitions.
// Phase 1: matrix 434 rows 501 cols
[2022-05-15 17:53:40] [INFO ] Computed 105 place invariants in 4 ms
[2022-05-15 17:53:41] [INFO ] Implicit Places using invariants in 162 ms returned []
// Phase 1: matrix 434 rows 501 cols
[2022-05-15 17:53:41] [INFO ] Computed 105 place invariants in 3 ms
[2022-05-15 17:53:41] [INFO ] Implicit Places using invariants and state equation in 617 ms returned []
Implicit Place search using SMT with State Equation took 782 ms to find 0 implicit places.
// Phase 1: matrix 434 rows 501 cols
[2022-05-15 17:53:41] [INFO ] Computed 105 place invariants in 3 ms
[2022-05-15 17:53:41] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 501/510 places, 434/443 transitions.
Finished structural reductions, in 1 iterations. Remains : 501/510 places, 434/443 transitions.
Stuttering acceptance computed with spot in 455 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s255 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 85 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLFireability-04 finished in 1501 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(G((X((X(p0)&&p1))||F(p2)))))'
Support contains 5 out of 510 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 510/510 places, 443/443 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 505 transition count 438
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 505 transition count 438
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 502 transition count 435
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 502 transition count 435
Applied a total of 16 rules in 36 ms. Remains 502 /510 variables (removed 8) and now considering 435/443 (removed 8) transitions.
// Phase 1: matrix 435 rows 502 cols
[2022-05-15 17:53:42] [INFO ] Computed 105 place invariants in 7 ms
[2022-05-15 17:53:42] [INFO ] Implicit Places using invariants in 177 ms returned []
// Phase 1: matrix 435 rows 502 cols
[2022-05-15 17:53:42] [INFO ] Computed 105 place invariants in 3 ms
[2022-05-15 17:53:43] [INFO ] Implicit Places using invariants and state equation in 595 ms returned []
Implicit Place search using SMT with State Equation took 777 ms to find 0 implicit places.
// Phase 1: matrix 435 rows 502 cols
[2022-05-15 17:53:43] [INFO ] Computed 105 place invariants in 3 ms
[2022-05-15 17:53:43] [INFO ] Dead Transitions using invariants and state equation in 226 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 502/510 places, 435/443 transitions.
Finished structural reductions, in 1 iterations. Remains : 502/510 places, 435/443 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p2) p1 (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 2}]], initial=0, aps=[p2:(OR (EQ s209 0) (EQ s374 0) (EQ s455 0)), p1:(EQ s84 0), p0:(EQ s201 0)], 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]]
Product exploration explored 100000 steps with 660 reset in 287 ms.
Product exploration explored 100000 steps with 664 reset in 250 ms.
Computed a total of 206 stabilizing places and 178 stable transitions
Graph (complete) has 1136 edges and 502 vertex of which 501 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 206 stabilizing places and 178 stable transitions
Detected a total of 206/502 stabilizing places and 178/435 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 317 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 144 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p2) p1 (NOT p0))]
Incomplete random walk after 10000 steps, including 65 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 435 rows 502 cols
[2022-05-15 17:53:44] [INFO ] Computed 105 place invariants in 6 ms
[2022-05-15 17:53:44] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 17:53:45] [INFO ] [Nat]Absence check using 59 positive place invariants in 23 ms returned sat
[2022-05-15 17:53:45] [INFO ] [Nat]Absence check using 59 positive and 46 generalized place invariants in 13 ms returned sat
[2022-05-15 17:53:45] [INFO ] After 273ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p2) (NOT p0) p1))), (G (NOT (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (NOT p2)), (F (AND (NOT p2) p1))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p2) (NOT p1))))
Knowledge based reduction with 9 factoid took 223 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA BusinessProcesses-PT-17-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-17-LTLFireability-05 finished in 3029 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)&&(X(X((X(G(p1))&&p2)))||p3))))'
Support contains 3 out of 510 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 510/510 places, 443/443 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 505 transition count 438
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 505 transition count 438
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 502 transition count 435
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 502 transition count 435
Applied a total of 16 rules in 27 ms. Remains 502 /510 variables (removed 8) and now considering 435/443 (removed 8) transitions.
// Phase 1: matrix 435 rows 502 cols
[2022-05-15 17:53:45] [INFO ] Computed 105 place invariants in 6 ms
[2022-05-15 17:53:45] [INFO ] Implicit Places using invariants in 166 ms returned []
// Phase 1: matrix 435 rows 502 cols
[2022-05-15 17:53:45] [INFO ] Computed 105 place invariants in 6 ms
[2022-05-15 17:53:46] [INFO ] Implicit Places using invariants and state equation in 675 ms returned []
Implicit Place search using SMT with State Equation took 843 ms to find 0 implicit places.
// Phase 1: matrix 435 rows 502 cols
[2022-05-15 17:53:46] [INFO ] Computed 105 place invariants in 3 ms
[2022-05-15 17:53:46] [INFO ] Dead Transitions using invariants and state equation in 246 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 502/510 places, 435/443 transitions.
Finished structural reductions, in 1 iterations. Remains : 502/510 places, 435/443 transitions.
Stuttering acceptance computed with spot in 245 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p0), (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), true, (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), (AND p0 (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 3}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p3:(EQ s436 0), p0:(EQ s311 1), p2:(EQ s436 1), p1:(EQ s498 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLFireability-08 finished in 1380 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 510 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 510/510 places, 443/443 transitions.
Graph (trivial) has 236 edges and 510 vertex of which 6 / 510 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 1140 edges and 505 vertex of which 504 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 54 place count 503 transition count 383
Reduce places removed 52 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 53 rules applied. Total rules applied 107 place count 451 transition count 382
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 108 place count 450 transition count 382
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 107 Pre rules applied. Total rules applied 108 place count 450 transition count 275
Deduced a syphon composed of 107 places in 0 ms
Ensure Unique test removed 19 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 3 with 233 rules applied. Total rules applied 341 place count 324 transition count 275
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 347 place count 318 transition count 269
Iterating global reduction 3 with 6 rules applied. Total rules applied 353 place count 318 transition count 269
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 353 place count 318 transition count 268
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 355 place count 317 transition count 268
Performed 134 Post agglomeration using F-continuation condition.Transition count delta: 134
Deduced a syphon composed of 134 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 3 with 273 rules applied. Total rules applied 628 place count 178 transition count 134
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 630 place count 177 transition count 138
Applied a total of 630 rules in 47 ms. Remains 177 /510 variables (removed 333) and now considering 138/443 (removed 305) transitions.
// Phase 1: matrix 138 rows 177 cols
[2022-05-15 17:53:46] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-15 17:53:46] [INFO ] Implicit Places using invariants in 104 ms returned [1, 2, 3, 4, 5, 8, 11, 34, 35, 36, 37, 44, 45, 46, 51, 52, 53, 54, 55, 56, 57, 58, 133]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 116 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 154/510 places, 138/443 transitions.
Applied a total of 0 rules in 5 ms. Remains 154 /154 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 154/510 places, 138/443 transitions.
Stuttering acceptance computed with spot in 981 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s4 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-17-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLFireability-09 finished in 1167 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(p0))||(X(p1)&&p2))))'
Support contains 2 out of 510 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 510/510 places, 443/443 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 505 transition count 438
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 505 transition count 438
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 503 transition count 436
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 503 transition count 436
Applied a total of 14 rules in 24 ms. Remains 503 /510 variables (removed 7) and now considering 436/443 (removed 7) transitions.
// Phase 1: matrix 436 rows 503 cols
[2022-05-15 17:53:48] [INFO ] Computed 105 place invariants in 8 ms
[2022-05-15 17:53:48] [INFO ] Implicit Places using invariants in 168 ms returned []
// Phase 1: matrix 436 rows 503 cols
[2022-05-15 17:53:48] [INFO ] Computed 105 place invariants in 4 ms
[2022-05-15 17:53:48] [INFO ] Implicit Places using invariants and state equation in 649 ms returned []
Implicit Place search using SMT with State Equation took 819 ms to find 0 implicit places.
// Phase 1: matrix 436 rows 503 cols
[2022-05-15 17:53:48] [INFO ] Computed 105 place invariants in 2 ms
[2022-05-15 17:53:49] [INFO ] Dead Transitions using invariants and state equation in 291 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 503/510 places, 436/443 transitions.
Finished structural reductions, in 1 iterations. Remains : 503/510 places, 436/443 transitions.
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 0}, { cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}, { cond=p2, acceptance={} source=4 dest: 2}]], initial=3, aps=[p2:(EQ s145 1), p1:(EQ s145 0), p0:(EQ s419 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1241 reset in 159 ms.
Stack based approach found an accepted trace after 360 steps with 5 reset with depth 9 and stack size 9 in 1 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-17-LTLFireability-10 finished in 1532 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 510 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 510/510 places, 443/443 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 504 transition count 437
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 504 transition count 437
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 501 transition count 434
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 501 transition count 434
Applied a total of 18 rules in 20 ms. Remains 501 /510 variables (removed 9) and now considering 434/443 (removed 9) transitions.
// Phase 1: matrix 434 rows 501 cols
[2022-05-15 17:53:49] [INFO ] Computed 105 place invariants in 7 ms
[2022-05-15 17:53:49] [INFO ] Implicit Places using invariants in 186 ms returned []
// Phase 1: matrix 434 rows 501 cols
[2022-05-15 17:53:49] [INFO ] Computed 105 place invariants in 5 ms
[2022-05-15 17:53:50] [INFO ] Implicit Places using invariants and state equation in 580 ms returned []
Implicit Place search using SMT with State Equation took 781 ms to find 0 implicit places.
// Phase 1: matrix 434 rows 501 cols
[2022-05-15 17:53:50] [INFO ] Computed 105 place invariants in 9 ms
[2022-05-15 17:53:50] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 501/510 places, 434/443 transitions.
Finished structural reductions, in 1 iterations. Remains : 501/510 places, 434/443 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s40 1) (EQ s277 1) (EQ s462 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 143 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLFireability-11 finished in 1137 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(!(F(G(p0)) U p0))&&(X(p1)||p2))))'
Support contains 2 out of 510 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 510/510 places, 443/443 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 504 transition count 437
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 504 transition count 437
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 501 transition count 434
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 501 transition count 434
Applied a total of 18 rules in 23 ms. Remains 501 /510 variables (removed 9) and now considering 434/443 (removed 9) transitions.
// Phase 1: matrix 434 rows 501 cols
[2022-05-15 17:53:50] [INFO ] Computed 105 place invariants in 6 ms
[2022-05-15 17:53:50] [INFO ] Implicit Places using invariants in 166 ms returned []
// Phase 1: matrix 434 rows 501 cols
[2022-05-15 17:53:50] [INFO ] Computed 105 place invariants in 2 ms
[2022-05-15 17:53:51] [INFO ] Implicit Places using invariants and state equation in 610 ms returned []
Implicit Place search using SMT with State Equation took 789 ms to find 0 implicit places.
// Phase 1: matrix 434 rows 501 cols
[2022-05-15 17:53:51] [INFO ] Computed 105 place invariants in 6 ms
[2022-05-15 17:53:51] [INFO ] Dead Transitions using invariants and state equation in 212 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 501/510 places, 434/443 transitions.
Finished structural reductions, in 1 iterations. Remains : 501/510 places, 434/443 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR p0 (AND (NOT p1) (NOT p2))), p0, (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), p0, p0]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s21 1), p2:(EQ s21 0), p1:(EQ s8 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 947 reset in 225 ms.
Product exploration explored 100000 steps with 937 reset in 207 ms.
Computed a total of 206 stabilizing places and 178 stable transitions
Graph (complete) has 1135 edges and 501 vertex of which 500 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 206 stabilizing places and 178 stable transitions
Detected a total of 206/501 stabilizing places and 178/434 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 2660 ms. Reduced automaton from 5 states, 11 edges and 3 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 67 ms :[p0, p0]
Finished random walk after 80 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=80 )
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 13 factoid took 423 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 67 ms :[p0, p0]
Stuttering acceptance computed with spot in 59 ms :[p0, p0]
Support contains 1 out of 501 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 501/501 places, 434/434 transitions.
Graph (trivial) has 228 edges and 501 vertex of which 6 / 501 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 1129 edges and 496 vertex of which 495 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 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 494 transition count 376
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 444 transition count 376
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 108 Pre rules applied. Total rules applied 102 place count 444 transition count 268
Deduced a syphon composed of 108 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 236 rules applied. Total rules applied 338 place count 316 transition count 268
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 131
Deduced a syphon composed of 131 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 2 with 267 rules applied. Total rules applied 605 place count 180 transition count 137
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 607 place count 179 transition count 141
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 608 place count 178 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 609 place count 177 transition count 140
Applied a total of 609 rules in 66 ms. Remains 177 /501 variables (removed 324) and now considering 140/434 (removed 294) transitions.
// Phase 1: matrix 140 rows 177 cols
[2022-05-15 17:53:55] [INFO ] Computed 79 place invariants in 11 ms
[2022-05-15 17:53:55] [INFO ] Implicit Places using invariants in 170 ms returned [57, 58]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 171 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 175/501 places, 140/434 transitions.
Applied a total of 0 rules in 9 ms. Remains 175 /175 variables (removed 0) and now considering 140/140 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 175/501 places, 140/434 transitions.
Computed a total of 46 stabilizing places and 33 stable transitions
Computed a total of 46 stabilizing places and 33 stable transitions
Detected a total of 46/175 stabilizing places and 33/140 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 161 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 49 ms :[p0, p0]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 135 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 91 ms :[p0, p0]
Stuttering acceptance computed with spot in 76 ms :[p0, p0]
Stuttering acceptance computed with spot in 73 ms :[p0, p0]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLFireability-13 finished in 5835 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(G((F(p0)&&p1))))))'
Support contains 5 out of 510 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 510/510 places, 443/443 transitions.
Graph (trivial) has 233 edges and 510 vertex of which 6 / 510 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 1140 edges and 505 vertex of which 504 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 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 503 transition count 385
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 453 transition count 385
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 110 Pre rules applied. Total rules applied 102 place count 453 transition count 275
Deduced a syphon composed of 110 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 2 with 240 rules applied. Total rules applied 342 place count 323 transition count 275
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 348 place count 317 transition count 269
Iterating global reduction 2 with 6 rules applied. Total rules applied 354 place count 317 transition count 269
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 2 with 260 rules applied. Total rules applied 614 place count 186 transition count 140
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 616 place count 185 transition count 144
Applied a total of 616 rules in 45 ms. Remains 185 /510 variables (removed 325) and now considering 144/443 (removed 299) transitions.
// Phase 1: matrix 144 rows 185 cols
[2022-05-15 17:53:56] [INFO ] Computed 83 place invariants in 1 ms
[2022-05-15 17:53:56] [INFO ] Implicit Places using invariants in 112 ms returned [1, 2, 3, 4, 5, 8, 9, 33, 34, 35, 36, 43, 44, 45, 55, 56, 57, 58, 62, 63, 64, 179, 181, 183]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 113 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 161/510 places, 144/443 transitions.
Applied a total of 0 rules in 5 ms. Remains 161 /161 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 161/510 places, 144/443 transitions.
Stuttering acceptance computed with spot in 60 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s34 1), p0:(AND (EQ s42 1) (EQ s20 1) (EQ s68 1) (EQ s152 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLFireability-14 finished in 236 ms.
All properties solved by simple procedures.
Total runtime 30349 ms.

BK_STOP 1652637236836

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-17, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r024-tall-165251918500452"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-17.tgz
mv BusinessProcesses-PT-17 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;