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-165251918400331.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-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918400331
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 328K
-rw-r--r-- 1 mcc users 9.0K Apr 30 00:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 30 00:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Apr 30 00:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 30 00:01 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.8K May 9 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:09 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 59K 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-02-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652623032720

Running Version 202205111006
[2022-05-15 13:57:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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 13:57:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 13:57:14] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2022-05-15 13:57:14] [INFO ] Transformed 262 places.
[2022-05-15 13:57:14] [INFO ] Transformed 219 transitions.
[2022-05-15 13:57:14] [INFO ] Found NUPN structural information;
[2022-05-15 13:57:14] [INFO ] Parsed PT model containing 262 places and 219 transitions in 208 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 17 places in 4 ms
Reduce places removed 17 places and 15 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-02-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 204/204 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 239 transition count 204
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 38 place count 207 transition count 172
Iterating global reduction 1 with 32 rules applied. Total rules applied 70 place count 207 transition count 172
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 84 place count 193 transition count 158
Iterating global reduction 1 with 14 rules applied. Total rules applied 98 place count 193 transition count 158
Applied a total of 98 rules in 51 ms. Remains 193 /245 variables (removed 52) and now considering 158/204 (removed 46) transitions.
// Phase 1: matrix 158 rows 193 cols
[2022-05-15 13:57:14] [INFO ] Computed 37 place invariants in 23 ms
[2022-05-15 13:57:14] [INFO ] Implicit Places using invariants in 228 ms returned []
// Phase 1: matrix 158 rows 193 cols
[2022-05-15 13:57:14] [INFO ] Computed 37 place invariants in 7 ms
[2022-05-15 13:57:14] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
// Phase 1: matrix 158 rows 193 cols
[2022-05-15 13:57:14] [INFO ] Computed 37 place invariants in 5 ms
[2022-05-15 13:57:14] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 193/245 places, 158/204 transitions.
Finished structural reductions, in 1 iterations. Remains : 193/245 places, 158/204 transitions.
Support contains 16 out of 193 places after structural reductions.
[2022-05-15 13:57:15] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-15 13:57:15] [INFO ] Flatten gal took : 43 ms
FORMULA BusinessProcesses-PT-02-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-15 13:57:15] [INFO ] Flatten gal took : 16 ms
[2022-05-15 13:57:15] [INFO ] Input system was already deterministic with 158 transitions.
Incomplete random walk after 10000 steps, including 133 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 9) seen :8
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 158 rows 193 cols
[2022-05-15 13:57:15] [INFO ] Computed 37 place invariants in 2 ms
[2022-05-15 13:57:15] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 13:57:15] [INFO ] [Nat]Absence check using 24 positive place invariants in 15 ms returned sat
[2022-05-15 13:57:15] [INFO ] [Nat]Absence check using 24 positive and 13 generalized place invariants in 2 ms returned sat
[2022-05-15 13:57:15] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 13:57:15] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 2 ms to minimize.
[2022-05-15 13:57:15] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 0 ms to minimize.
[2022-05-15 13:57:15] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2022-05-15 13:57:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 162 ms
[2022-05-15 13:57:15] [INFO ] After 247ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2022-05-15 13:57:15] [INFO ] After 327ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 193/193 places, 158/158 transitions.
Graph (trivial) has 94 edges and 193 vertex of which 6 / 193 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 375 edges and 188 vertex of which 185 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 26 place count 185 transition count 123
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 50 place count 161 transition count 123
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 50 place count 161 transition count 86
Deduced a syphon composed of 37 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 130 place count 118 transition count 86
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 133 place count 115 transition count 83
Iterating global reduction 2 with 3 rules applied. Total rules applied 136 place count 115 transition count 83
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 240 place count 62 transition count 32
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 241 place count 62 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 242 place count 61 transition count 31
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 243 place count 61 transition count 31
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 244 place count 60 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 245 place count 59 transition count 30
Applied a total of 245 rules in 45 ms. Remains 59 /193 variables (removed 134) and now considering 30/158 (removed 128) transitions.
Finished structural reductions, in 1 iterations. Remains : 59/193 places, 30/158 transitions.
Finished random walk after 15 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=15 )
Computed a total of 186 stabilizing places and 149 stable transitions
Graph (complete) has 382 edges and 193 vertex of which 190 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.9 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 158/158 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 191 transition count 156
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 191 transition count 156
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 189 transition count 154
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 189 transition count 154
Applied a total of 8 rules in 14 ms. Remains 189 /193 variables (removed 4) and now considering 154/158 (removed 4) transitions.
// Phase 1: matrix 154 rows 189 cols
[2022-05-15 13:57:16] [INFO ] Computed 37 place invariants in 2 ms
[2022-05-15 13:57:16] [INFO ] Implicit Places using invariants in 80 ms returned []
// Phase 1: matrix 154 rows 189 cols
[2022-05-15 13:57:16] [INFO ] Computed 37 place invariants in 5 ms
[2022-05-15 13:57:16] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
// Phase 1: matrix 154 rows 189 cols
[2022-05-15 13:57:16] [INFO ] Computed 37 place invariants in 3 ms
[2022-05-15 13:57:16] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 189/193 places, 154/158 transitions.
Finished structural reductions, in 1 iterations. Remains : 189/193 places, 154/158 transitions.
Stuttering acceptance computed with spot in 216 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-02-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s5 0) (EQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 12 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-02-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLCardinality-02 finished in 607 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 158/158 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 190 transition count 155
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 190 transition count 155
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 188 transition count 153
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 188 transition count 153
Applied a total of 10 rules in 19 ms. Remains 188 /193 variables (removed 5) and now considering 153/158 (removed 5) transitions.
// Phase 1: matrix 153 rows 188 cols
[2022-05-15 13:57:16] [INFO ] Computed 37 place invariants in 3 ms
[2022-05-15 13:57:16] [INFO ] Implicit Places using invariants in 72 ms returned []
// Phase 1: matrix 153 rows 188 cols
[2022-05-15 13:57:16] [INFO ] Computed 37 place invariants in 10 ms
[2022-05-15 13:57:16] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
// Phase 1: matrix 153 rows 188 cols
[2022-05-15 13:57:16] [INFO ] Computed 37 place invariants in 2 ms
[2022-05-15 13:57:17] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 188/193 places, 153/158 transitions.
Finished structural reductions, in 1 iterations. Remains : 188/193 places, 153/158 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-02-LTLCardinality-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:(AND (NEQ s28 0) (NEQ s22 1))], 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 2 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-02-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLCardinality-04 finished in 468 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (X(F(G(p1))) U X(p0))))'
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 158/158 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 190 transition count 155
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 190 transition count 155
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 188 transition count 153
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 188 transition count 153
Applied a total of 10 rules in 13 ms. Remains 188 /193 variables (removed 5) and now considering 153/158 (removed 5) transitions.
// Phase 1: matrix 153 rows 188 cols
[2022-05-15 13:57:17] [INFO ] Computed 37 place invariants in 3 ms
[2022-05-15 13:57:17] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 153 rows 188 cols
[2022-05-15 13:57:17] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-15 13:57:17] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
// Phase 1: matrix 153 rows 188 cols
[2022-05-15 13:57:17] [INFO ] Computed 37 place invariants in 7 ms
[2022-05-15 13:57:17] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 188/193 places, 153/158 transitions.
Finished structural reductions, in 1 iterations. Remains : 188/193 places, 153/158 transitions.
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-02-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s10 0) (EQ s146 1)), p1:(OR (EQ s13 0) (EQ s163 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 328 ms.
Product exploration explored 100000 steps with 50000 reset in 196 ms.
Computed a total of 181 stabilizing places and 144 stable transitions
Graph (complete) has 375 edges and 188 vertex of which 185 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Computed a total of 181 stabilizing places and 144 stable transitions
Detected a total of 181/188 stabilizing places and 144/153 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 6 factoid took 120 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA BusinessProcesses-PT-02-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-02-LTLCardinality-08 finished in 1180 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(p0 U (X(X(p0))&&(G(p1) U p2)&&F(p3)))))'
Support contains 6 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 158/158 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 191 transition count 156
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 191 transition count 156
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 190 transition count 155
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 190 transition count 155
Applied a total of 6 rules in 11 ms. Remains 190 /193 variables (removed 3) and now considering 155/158 (removed 3) transitions.
// Phase 1: matrix 155 rows 190 cols
[2022-05-15 13:57:18] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-15 13:57:18] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 155 rows 190 cols
[2022-05-15 13:57:18] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-15 13:57:18] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
// Phase 1: matrix 155 rows 190 cols
[2022-05-15 13:57:18] [INFO ] Computed 37 place invariants in 3 ms
[2022-05-15 13:57:18] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 190/193 places, 155/158 transitions.
Finished structural reductions, in 1 iterations. Remains : 190/193 places, 155/158 transitions.
Stuttering acceptance computed with spot in 761 ms :[(AND p0 p2 p3), (AND p0 p2 p3), p0, (AND p0 p3), (AND p1 p0 p2 p3), (AND p1 p0 p2), p0, true, (AND p3 p0), (AND p1 p3 p2 p0), (AND p1 p2 p0), (AND p1 p3 p0), (AND p1 p0), p3, p1, (AND p1 p3 p2), (AND p1 p2), (AND p1 p3)]
Running random walk in product with property : BusinessProcesses-PT-02-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND p2 p3), acceptance={} source=1 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=1 dest: 4}, { cond=(AND p1 (NOT p2) p3), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 6}], [{ cond=p3, acceptance={} source=3 dest: 6}, { cond=(NOT p3), acceptance={} source=3 dest: 8}], [{ cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=4 dest: 9}, { cond=(AND p1 (NOT p2) p3), acceptance={} source=4 dest: 10}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=4 dest: 11}, { cond=(AND p1 p2 p3), acceptance={} source=4 dest: 12}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 10}, { cond=(AND p1 p2), acceptance={} source=5 dest: 12}], [{ cond=p0, acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(AND p0 p3), acceptance={} source=8 dest: 7}, { cond=(AND p0 (NOT p3)), acceptance={} source=8 dest: 13}], [{ cond=(AND p0 p1 p2 p3), acceptance={} source=9 dest: 14}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={} source=9 dest: 15}, { cond=(AND p0 p1 (NOT p2) p3), acceptance={} source=9 dest: 16}, { cond=(AND p0 p1 p2 (NOT p3)), acceptance={} source=9 dest: 17}], [{ cond=(AND p0 p1 p2), acceptance={} source=10 dest: 14}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=10 dest: 16}], [{ cond=(AND p0 p1 p3), acceptance={} source=11 dest: 14}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=11 dest: 17}], [{ cond=(AND p0 p1), acceptance={} source=12 dest: 14}], [{ cond=p3, acceptance={} source=13 dest: 7}, { cond=(NOT p3), acceptance={} source=13 dest: 13}], [{ cond=p1, acceptance={0} source=14 dest: 14}], [{ cond=(AND p1 p2 p3), acceptance={} source=15 dest: 14}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=15 dest: 15}, { cond=(AND p1 (NOT p2) p3), acceptance={} source=15 dest: 16}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=15 dest: 17}], [{ cond=(AND p1 p2), acceptance={} source=16 dest: 14}, { cond=(AND p1 (NOT p2)), acceptance={} source=16 dest: 16}], [{ cond=(AND p1 p3), acceptance={} source=17 dest: 14}, { cond=(AND p1 (NOT p3)), acceptance={} source=17 dest: 17}]], initial=0, aps=[p0:(EQ s60 1), p2:(EQ s37 1), p3:(OR (EQ s9 0) (EQ s177 1)), p1:(OR (EQ s95 0) (EQ s29 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, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 161 ms.
Product exploration explored 100000 steps with 25000 reset in 230 ms.
Computed a total of 183 stabilizing places and 146 stable transitions
Graph (complete) has 377 edges and 190 vertex of which 187 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 183 stabilizing places and 146 stable transitions
Detected a total of 183/190 stabilizing places and 146/155 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p3 p1), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND p2 p3))), (X (NOT (AND p2 (NOT p3)))), (X (AND p1 (NOT p2) p3)), (X (NOT p0)), true, (X (X p3)), (X (X (NOT (AND p1 p2 p3)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND p1 (NOT p2) p3))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT p0))), (X (X (NOT (AND p1 p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 2227 ms. Reduced automaton from 18 states, 39 edges and 4 AP to 7 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 274 ms :[true, p1, p2, (AND p1 p2), (AND p1 p2 p0), (AND p1 p2 p0), p2]
Incomplete random walk after 10000 steps, including 134 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 155 rows 190 cols
[2022-05-15 13:57:22] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-15 13:57:22] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 13:57:22] [INFO ] [Nat]Absence check using 25 positive place invariants in 5 ms returned sat
[2022-05-15 13:57:22] [INFO ] [Nat]Absence check using 25 positive and 12 generalized place invariants in 2 ms returned sat
[2022-05-15 13:57:22] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 13:57:22] [INFO ] After 66ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2022-05-15 13:57:22] [INFO ] After 138ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 190 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 190/190 places, 155/155 transitions.
Graph (trivial) has 90 edges and 190 vertex of which 6 / 190 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 370 edges and 185 vertex of which 182 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 24 place count 182 transition count 122
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 23 rules applied. Total rules applied 47 place count 160 transition count 121
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 159 transition count 121
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 48 place count 159 transition count 85
Deduced a syphon composed of 36 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 79 rules applied. Total rules applied 127 place count 116 transition count 85
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 128 place count 115 transition count 84
Iterating global reduction 3 with 1 rules applied. Total rules applied 129 place count 115 transition count 84
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 223 place count 67 transition count 38
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 224 place count 67 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 225 place count 66 transition count 37
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 226 place count 66 transition count 37
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 227 place count 65 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 228 place count 64 transition count 36
Applied a total of 228 rules in 22 ms. Remains 64 /190 variables (removed 126) and now considering 36/155 (removed 119) transitions.
Finished structural reductions, in 1 iterations. Remains : 64/190 places, 36/155 transitions.
Finished random walk after 128 steps, including 4 resets, run visited all 1 properties in 1 ms. (steps per millisecond=128 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) p3 p1), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND p2 p3))), (X (NOT (AND p2 (NOT p3)))), (X (AND p1 (NOT p2) p3)), (X (NOT p0)), true, (X (X p3)), (X (X (NOT (AND p1 p2 p3)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND p1 (NOT p2) p3))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT p0))), (X (X (NOT (AND p1 p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p2 p1 p0)), (F (NOT (AND (NOT p2) p1))), (F (AND (NOT p2) p1 p0)), (F (NOT p1)), (F (AND p2 p1)), (F p2)]
Knowledge based reduction with 21 factoid took 1545 ms. Reduced automaton from 7 states, 10 edges and 3 AP to 6 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 224 ms :[p1, (AND p1 p2), (AND p1 p2 p0), (AND p1 p2 p0), (AND p1 p2 p0), (AND p1 p2 p0)]
Stuttering acceptance computed with spot in 236 ms :[p1, (AND p1 p2), (AND p1 p2 p0), (AND p1 p2 p0), (AND p1 p2 p0), (AND p1 p2 p0)]
Support contains 4 out of 190 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 155/155 transitions.
Applied a total of 0 rules in 4 ms. Remains 190 /190 variables (removed 0) and now considering 155/155 (removed 0) transitions.
// Phase 1: matrix 155 rows 190 cols
[2022-05-15 13:57:24] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-15 13:57:24] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 155 rows 190 cols
[2022-05-15 13:57:24] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-15 13:57:24] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
// Phase 1: matrix 155 rows 190 cols
[2022-05-15 13:57:24] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-15 13:57:25] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 190/190 places, 155/155 transitions.
Computed a total of 183 stabilizing places and 146 stable transitions
Graph (complete) has 377 edges and 190 vertex of which 187 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 183 stabilizing places and 146 stable transitions
Detected a total of 183/190 stabilizing places and 146/155 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 211 ms. Reduced automaton from 6 states, 8 edges and 3 AP to 6 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 239 ms :[p1, (AND p1 p2), (AND p1 p2 p0), (AND p1 p2 p0), (AND p1 p2 p0), (AND p1 p2 p0)]
Incomplete random walk after 10000 steps, including 134 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 155 rows 190 cols
[2022-05-15 13:57:25] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-15 13:57:25] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 13:57:25] [INFO ] [Nat]Absence check using 25 positive place invariants in 5 ms returned sat
[2022-05-15 13:57:25] [INFO ] [Nat]Absence check using 25 positive and 12 generalized place invariants in 4 ms returned sat
[2022-05-15 13:57:25] [INFO ] After 59ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 13:57:25] [INFO ] After 75ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-05-15 13:57:25] [INFO ] After 147ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 190 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 190/190 places, 155/155 transitions.
Graph (trivial) has 90 edges and 190 vertex of which 6 / 190 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 370 edges and 185 vertex of which 182 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 24 place count 182 transition count 122
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 23 rules applied. Total rules applied 47 place count 160 transition count 121
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 159 transition count 121
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 48 place count 159 transition count 85
Deduced a syphon composed of 36 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 79 rules applied. Total rules applied 127 place count 116 transition count 85
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 128 place count 115 transition count 84
Iterating global reduction 3 with 1 rules applied. Total rules applied 129 place count 115 transition count 84
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 223 place count 67 transition count 38
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 224 place count 67 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 225 place count 66 transition count 37
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 226 place count 66 transition count 37
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 227 place count 65 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 228 place count 64 transition count 36
Applied a total of 228 rules in 24 ms. Remains 64 /190 variables (removed 126) and now considering 36/155 (removed 119) transitions.
Finished structural reductions, in 1 iterations. Remains : 64/190 places, 36/155 transitions.
Finished random walk after 224 steps, including 7 resets, run visited all 1 properties in 2 ms. (steps per millisecond=112 )
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p1 p0 (NOT p2))), (F (AND p1 p0 p2)), (F (NOT p1)), (F (NOT (AND p1 (NOT p2)))), (F (AND p1 p2))]
Knowledge based reduction with 5 factoid took 326 ms. Reduced automaton from 6 states, 8 edges and 3 AP to 6 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 215 ms :[p1, (AND p1 p2), (AND p1 p2 p0), (AND p1 p2 p0), (AND p1 p2 p0), (AND p1 p2 p0)]
Stuttering acceptance computed with spot in 238 ms :[p1, (AND p1 p2), (AND p1 p2 p0), (AND p1 p2 p0), (AND p1 p2 p0), (AND p1 p2 p0)]
Stuttering acceptance computed with spot in 328 ms :[p1, (AND p1 p2), (AND p1 p2 p0), (AND p1 p2 p0), (AND p1 p2 p0), (AND p1 p2 p0)]
Product exploration explored 100000 steps with 25000 reset in 111 ms.
Product exploration explored 100000 steps with 25000 reset in 107 ms.
Applying partial POR strategy [true, true, true, false, false, false]
Stuttering acceptance computed with spot in 233 ms :[p1, (AND p1 p2), (AND p1 p2 p0), (AND p1 p2 p0), (AND p1 p2 p0), (AND p1 p2 p0)]
Support contains 4 out of 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 155/155 transitions.
Graph (trivial) has 90 edges and 190 vertex of which 6 / 190 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 371 edges and 185 vertex of which 182 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 23 rules applied. Total rules applied 25 place count 182 transition count 146
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 29 Pre rules applied. Total rules applied 25 place count 182 transition count 166
Deduced a syphon composed of 52 places in 1 ms
Iterating global reduction 1 with 29 rules applied. Total rules applied 54 place count 182 transition count 166
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 61 place count 175 transition count 154
Deduced a syphon composed of 46 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 68 place count 175 transition count 154
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 99 places in 0 ms
Iterating global reduction 1 with 53 rules applied. Total rules applied 121 place count 175 transition count 154
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 136 place count 160 transition count 139
Deduced a syphon composed of 84 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 151 place count 160 transition count 139
Deduced a syphon composed of 84 places in 0 ms
Applied a total of 151 rules in 38 ms. Remains 160 /190 variables (removed 30) and now considering 139/155 (removed 16) transitions.
[2022-05-15 13:57:27] [INFO ] Redundant transitions in 23 ms returned []
// Phase 1: matrix 139 rows 160 cols
[2022-05-15 13:57:27] [INFO ] Computed 37 place invariants in 2 ms
[2022-05-15 13:57:27] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 160/190 places, 139/155 transitions.
Finished structural reductions, in 1 iterations. Remains : 160/190 places, 139/155 transitions.
Product exploration explored 100000 steps with 25000 reset in 386 ms.
Product exploration explored 100000 steps with 25000 reset in 332 ms.
Built C files in :
/tmp/ltsmin15105522968840642665
[2022-05-15 13:57:28] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15105522968840642665
Running compilation step : cd /tmp/ltsmin15105522968840642665;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 354 ms.
Running link step : cd /tmp/ltsmin15105522968840642665;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin15105522968840642665;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11246527887267812134.hoa' '--buchi-type=spotba'
LTSmin run took 190 ms.
FORMULA BusinessProcesses-PT-02-LTLCardinality-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-02-LTLCardinality-11 finished in 10788 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(F(F(F(p0)))))))'
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 158/158 transitions.
Graph (trivial) has 93 edges and 193 vertex of which 6 / 193 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 376 edges and 188 vertex of which 185 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 25 place count 184 transition count 125
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 48 place count 161 transition count 125
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 48 place count 161 transition count 87
Deduced a syphon composed of 38 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 83 rules applied. Total rules applied 131 place count 116 transition count 87
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 133 place count 114 transition count 85
Iterating global reduction 2 with 2 rules applied. Total rules applied 135 place count 114 transition count 85
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 237 place count 62 transition count 35
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 238 place count 61 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 239 place count 60 transition count 34
Applied a total of 239 rules in 22 ms. Remains 60 /193 variables (removed 133) and now considering 34/158 (removed 124) transitions.
// Phase 1: matrix 34 rows 60 cols
[2022-05-15 13:57:29] [INFO ] Computed 27 place invariants in 0 ms
[2022-05-15 13:57:29] [INFO ] Implicit Places using invariants in 81 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 82 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/193 places, 34/158 transitions.
Applied a total of 0 rules in 3 ms. Remains 59 /59 variables (removed 0) and now considering 34/34 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 59/193 places, 34/158 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-02-LTLCardinality-13 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:(OR (EQ s47 0) (EQ s50 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 30205 reset in 176 ms.
Product exploration explored 100000 steps with 30076 reset in 132 ms.
Computed a total of 59 stabilizing places and 33 stable transitions
Computed a total of 59 stabilizing places and 33 stable transitions
Detected a total of 59/59 stabilizing places and 33/34 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 131 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 69 ms :[(NOT p0), (NOT p0)]
Finished random walk after 756 steps, including 263 resets, run visited all 1 properties in 11 ms. (steps per millisecond=68 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
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 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 34/34 transitions.
Applied a total of 0 rules in 2 ms. Remains 59 /59 variables (removed 0) and now considering 34/34 (removed 0) transitions.
// Phase 1: matrix 34 rows 59 cols
[2022-05-15 13:57:30] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-15 13:57:30] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 34 rows 59 cols
[2022-05-15 13:57:30] [INFO ] Computed 26 place invariants in 0 ms
[2022-05-15 13:57:30] [INFO ] Implicit Places using invariants and state equation in 64 ms returned [0, 1, 2, 3, 5, 7, 10, 11, 12, 13, 14, 16, 18, 20, 21, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40]
Discarding 25 places :
Implicit Place search using SMT with State Equation took 112 ms to find 25 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/59 places, 34/34 transitions.
Graph (complete) has 65 edges and 34 vertex of which 32 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 32 transition count 28
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 27 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 26 transition count 27
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 15 place count 24 transition count 25
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 24 transition count 25
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 26 place count 19 transition count 21
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 28 place count 18 transition count 20
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 18 transition count 19
Applied a total of 29 rules in 5 ms. Remains 18 /34 variables (removed 16) and now considering 19/34 (removed 15) transitions.
// Phase 1: matrix 19 rows 18 cols
[2022-05-15 13:57:30] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 13:57:30] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 19 rows 18 cols
[2022-05-15 13:57:30] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 13:57:30] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/59 places, 19/34 transitions.
Finished structural reductions, in 2 iterations. Remains : 18/59 places, 19/34 transitions.
Computed a total of 18 stabilizing places and 18 stable transitions
Computed a total of 18 stabilizing places and 18 stable transitions
Detected a total of 18/18 stabilizing places and 18/19 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 124 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 65 ms :[(NOT p0), (NOT p0)]
Finished random walk after 58 steps, including 23 resets, run visited all 1 properties in 2 ms. (steps per millisecond=29 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 154 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 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 32973 reset in 75 ms.
Product exploration explored 100000 steps with 33006 reset in 168 ms.
Built C files in :
/tmp/ltsmin268782385992660848
[2022-05-15 13:57:31] [INFO ] Computing symmetric may disable matrix : 19 transitions.
[2022-05-15 13:57:31] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 13:57:31] [INFO ] Computing symmetric may enable matrix : 19 transitions.
[2022-05-15 13:57:31] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 13:57:31] [INFO ] Computing Do-Not-Accords matrix : 19 transitions.
[2022-05-15 13:57:31] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 13:57:31] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin268782385992660848
Running compilation step : cd /tmp/ltsmin268782385992660848;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 92 ms.
Running link step : cd /tmp/ltsmin268782385992660848;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin268782385992660848;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6572546137930094633.hoa' '--buchi-type=spotba'
LTSmin run took 47 ms.
FORMULA BusinessProcesses-PT-02-LTLCardinality-13 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-02-LTLCardinality-13 finished in 2276 ms.
All properties solved by simple procedures.
Total runtime 17492 ms.

BK_STOP 1652623051499

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-02"
export BK_EXAMINATION="LTLCardinality"
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-02, examination is LTLCardinality"
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-165251918400331"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-02.tgz
mv BusinessProcesses-PT-02 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;