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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 336K
-rw-r--r-- 1 mcc users 7.2K Apr 29 23:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 29 23:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 29 23:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 29 23:49 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.6K May 9 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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.7K 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 91K 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-08-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652625884687

Running Version 202205111006
[2022-05-15 14:44:45] [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 14:44:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 14:44:45] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2022-05-15 14:44:46] [INFO ] Transformed 393 places.
[2022-05-15 14:44:46] [INFO ] Transformed 344 transitions.
[2022-05-15 14:44:46] [INFO ] Found NUPN structural information;
[2022-05-15 14:44:46] [INFO ] Parsed PT model containing 393 places and 344 transitions in 208 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 13 places in 6 ms
Reduce places removed 13 places and 13 transitions.
FORMULA BusinessProcesses-PT-08-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 331/331 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 372 transition count 331
Discarding 65 places :
Symmetric choice reduction at 1 with 65 rule applications. Total rules 73 place count 307 transition count 266
Iterating global reduction 1 with 65 rules applied. Total rules applied 138 place count 307 transition count 266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 139 place count 307 transition count 265
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 179 place count 267 transition count 225
Iterating global reduction 2 with 40 rules applied. Total rules applied 219 place count 267 transition count 225
Applied a total of 219 rules in 81 ms. Remains 267 /380 variables (removed 113) and now considering 225/331 (removed 106) transitions.
// Phase 1: matrix 225 rows 267 cols
[2022-05-15 14:44:46] [INFO ] Computed 50 place invariants in 18 ms
[2022-05-15 14:44:46] [INFO ] Implicit Places using invariants in 261 ms returned []
// Phase 1: matrix 225 rows 267 cols
[2022-05-15 14:44:46] [INFO ] Computed 50 place invariants in 7 ms
[2022-05-15 14:44:46] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
// Phase 1: matrix 225 rows 267 cols
[2022-05-15 14:44:46] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-15 14:44:46] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 267/380 places, 225/331 transitions.
Finished structural reductions, in 1 iterations. Remains : 267/380 places, 225/331 transitions.
Support contains 21 out of 267 places after structural reductions.
[2022-05-15 14:44:47] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-15 14:44:47] [INFO ] Flatten gal took : 47 ms
[2022-05-15 14:44:47] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA BusinessProcesses-PT-08-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-15 14:44:47] [INFO ] Flatten gal took : 23 ms
[2022-05-15 14:44:47] [INFO ] Input system was already deterministic with 225 transitions.
Support contains 19 out of 267 places (down from 21) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 88 resets, run finished after 425 ms. (steps per millisecond=23 ) properties (out of 12) seen :6
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :2
Running SMT prover for 4 properties.
// Phase 1: matrix 225 rows 267 cols
[2022-05-15 14:44:47] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-15 14:44:47] [INFO ] [Real]Absence check using 50 positive place invariants in 11 ms returned sat
[2022-05-15 14:44:47] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-15 14:44:47] [INFO ] [Nat]Absence check using 50 positive place invariants in 19 ms returned sat
[2022-05-15 14:44:48] [INFO ] After 118ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2022-05-15 14:44:48] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 5 ms to minimize.
[2022-05-15 14:44:48] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2022-05-15 14:44:48] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2022-05-15 14:44:48] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2022-05-15 14:44:48] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2022-05-15 14:44:48] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2022-05-15 14:44:48] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2022-05-15 14:44:48] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2022-05-15 14:44:48] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 0 ms to minimize.
[2022-05-15 14:44:48] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 459 ms
[2022-05-15 14:44:48] [INFO ] After 628ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 41 ms.
[2022-05-15 14:44:48] [INFO ] After 764ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 2 properties in 19 ms.
Support contains 2 out of 267 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 267/267 places, 225/225 transitions.
Graph (trivial) has 136 edges and 267 vertex of which 6 / 267 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 553 edges and 262 vertex of which 261 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 33 place count 261 transition count 185
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 64 place count 230 transition count 185
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 55 Pre rules applied. Total rules applied 64 place count 230 transition count 130
Deduced a syphon composed of 55 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 121 rules applied. Total rules applied 185 place count 164 transition count 130
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 192 place count 157 transition count 123
Iterating global reduction 2 with 7 rules applied. Total rules applied 199 place count 157 transition count 123
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 199 place count 157 transition count 122
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 201 place count 156 transition count 122
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 147 rules applied. Total rules applied 348 place count 81 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 349 place count 80 transition count 49
Applied a total of 349 rules in 39 ms. Remains 80 /267 variables (removed 187) and now considering 49/225 (removed 176) transitions.
Finished structural reductions, in 1 iterations. Remains : 80/267 places, 49/225 transitions.
Finished random walk after 27 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=13 )
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
FORMULA BusinessProcesses-PT-08-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 95 stabilizing places and 91 stable transitions
Graph (complete) has 565 edges and 267 vertex of which 266 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F((F(p0)||p1))))'
Support contains 4 out of 267 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 267/267 places, 225/225 transitions.
Graph (trivial) has 134 edges and 267 vertex of which 6 / 267 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 558 edges and 262 vertex of which 261 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 34 place count 261 transition count 186
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 66 place count 229 transition count 186
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 53 Pre rules applied. Total rules applied 66 place count 229 transition count 133
Deduced a syphon composed of 53 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 117 rules applied. Total rules applied 183 place count 165 transition count 133
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 188 place count 160 transition count 128
Iterating global reduction 2 with 5 rules applied. Total rules applied 193 place count 160 transition count 128
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 153 rules applied. Total rules applied 346 place count 82 transition count 53
Applied a total of 346 rules in 32 ms. Remains 82 /267 variables (removed 185) and now considering 53/225 (removed 172) transitions.
// Phase 1: matrix 53 rows 82 cols
[2022-05-15 14:44:48] [INFO ] Computed 36 place invariants in 1 ms
[2022-05-15 14:44:49] [INFO ] Implicit Places using invariants in 76 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 79 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/267 places, 53/225 transitions.
Applied a total of 0 rules in 4 ms. Remains 81 /81 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 81/267 places, 53/225 transitions.
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-08-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s34 0) (NEQ s21 1)), p1:(AND (NEQ s22 0) (NEQ s65 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 3 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-08-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-LTLCardinality-00 finished in 349 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 225/225 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 260 transition count 218
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 260 transition count 218
Applied a total of 14 rules in 18 ms. Remains 260 /267 variables (removed 7) and now considering 218/225 (removed 7) transitions.
// Phase 1: matrix 218 rows 260 cols
[2022-05-15 14:44:49] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-15 14:44:49] [INFO ] Implicit Places using invariants in 82 ms returned []
// Phase 1: matrix 218 rows 260 cols
[2022-05-15 14:44:49] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-15 14:44:49] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
// Phase 1: matrix 218 rows 260 cols
[2022-05-15 14:44:49] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-15 14:44:49] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 260/267 places, 218/225 transitions.
Finished structural reductions, in 1 iterations. Remains : 260/267 places, 218/225 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-08-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s108 0) (EQ s154 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]]
Product exploration explored 100000 steps with 50000 reset in 304 ms.
Product exploration explored 100000 steps with 50000 reset in 224 ms.
Computed a total of 91 stabilizing places and 87 stable transitions
Graph (complete) has 552 edges and 260 vertex of which 259 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 91 stabilizing places and 87 stable transitions
Detected a total of 91/260 stabilizing places and 87/218 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 : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 75 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA BusinessProcesses-PT-08-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-08-LTLCardinality-02 finished in 1107 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0 U X(p1)))&&p0)))'
Support contains 3 out of 267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 225/225 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 260 transition count 218
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 260 transition count 218
Applied a total of 14 rules in 13 ms. Remains 260 /267 variables (removed 7) and now considering 218/225 (removed 7) transitions.
// Phase 1: matrix 218 rows 260 cols
[2022-05-15 14:44:50] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-15 14:44:50] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 218 rows 260 cols
[2022-05-15 14:44:50] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-15 14:44:50] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
// Phase 1: matrix 218 rows 260 cols
[2022-05-15 14:44:50] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-15 14:44:50] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 260/267 places, 218/225 transitions.
Finished structural reductions, in 1 iterations. Remains : 260/267 places, 218/225 transitions.
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-08-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 2}]], initial=0, aps=[p0:(OR (EQ s194 0) (EQ s68 1)), p1:(OR (EQ s104 0) (EQ s194 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 21513 reset in 234 ms.
Stack based approach found an accepted trace after 22422 steps with 4912 reset with depth 7 and stack size 7 in 55 ms.
FORMULA BusinessProcesses-PT-08-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-08-LTLCardinality-05 finished in 933 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(G(F(p0))))))'
Support contains 1 out of 267 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 267/267 places, 225/225 transitions.
Graph (trivial) has 137 edges and 267 vertex of which 6 / 267 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 558 edges and 262 vertex of which 261 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 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 35 place count 260 transition count 184
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 68 place count 227 transition count 184
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 54 Pre rules applied. Total rules applied 68 place count 227 transition count 130
Deduced a syphon composed of 54 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 119 rules applied. Total rules applied 187 place count 162 transition count 130
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 193 place count 156 transition count 124
Iterating global reduction 2 with 6 rules applied. Total rules applied 199 place count 156 transition count 124
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 199 place count 156 transition count 123
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 201 place count 155 transition count 123
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 149 rules applied. Total rules applied 350 place count 79 transition count 50
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 352 place count 77 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 353 place count 76 transition count 48
Applied a total of 353 rules in 28 ms. Remains 76 /267 variables (removed 191) and now considering 48/225 (removed 177) transitions.
// Phase 1: matrix 48 rows 76 cols
[2022-05-15 14:44:51] [INFO ] Computed 35 place invariants in 1 ms
[2022-05-15 14:44:51] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 48 rows 76 cols
[2022-05-15 14:44:51] [INFO ] Computed 35 place invariants in 0 ms
[2022-05-15 14:44:51] [INFO ] Implicit Places using invariants and state equation in 84 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 15, 17, 19, 20, 21, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 136 ms to find 38 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 38/267 places, 48/225 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 38 transition count 41
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 31 transition count 41
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 20 place count 25 transition count 35
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 25 transition count 35
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 29 place count 25 transition count 32
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 32 place count 22 transition count 32
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 38 place count 19 transition count 29
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 39 place count 19 transition count 28
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 42 place count 19 transition count 28
Applied a total of 42 rules in 16 ms. Remains 19 /38 variables (removed 19) and now considering 28/48 (removed 20) transitions.
// Phase 1: matrix 28 rows 19 cols
[2022-05-15 14:44:51] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 14:44:51] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 28 rows 19 cols
[2022-05-15 14:44:51] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 14:44:51] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/267 places, 28/225 transitions.
Finished structural reductions, in 2 iterations. Remains : 19/267 places, 28/225 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-08-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-08-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-LTLCardinality-06 finished in 341 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U p0)))'
Support contains 2 out of 267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 225/225 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 260 transition count 218
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 260 transition count 218
Applied a total of 14 rules in 7 ms. Remains 260 /267 variables (removed 7) and now considering 218/225 (removed 7) transitions.
// Phase 1: matrix 218 rows 260 cols
[2022-05-15 14:44:51] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-15 14:44:51] [INFO ] Implicit Places using invariants in 88 ms returned []
// Phase 1: matrix 218 rows 260 cols
[2022-05-15 14:44:51] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-15 14:44:51] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
// Phase 1: matrix 218 rows 260 cols
[2022-05-15 14:44:51] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-15 14:44:52] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 260/267 places, 218/225 transitions.
Finished structural reductions, in 1 iterations. Remains : 260/267 places, 218/225 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : BusinessProcesses-PT-08-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s42 0) (EQ s246 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 208 ms.
Product exploration explored 100000 steps with 50000 reset in 223 ms.
Computed a total of 90 stabilizing places and 86 stable transitions
Graph (complete) has 554 edges and 260 vertex of which 259 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 90 stabilizing places and 86 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA BusinessProcesses-PT-08-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-08-LTLCardinality-09 finished in 985 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(X(p0))||G(p1))))'
Support contains 4 out of 267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 225/225 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 261 transition count 219
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 261 transition count 219
Applied a total of 12 rules in 6 ms. Remains 261 /267 variables (removed 6) and now considering 219/225 (removed 6) transitions.
// Phase 1: matrix 219 rows 261 cols
[2022-05-15 14:44:52] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-15 14:44:52] [INFO ] Implicit Places using invariants in 84 ms returned []
// Phase 1: matrix 219 rows 261 cols
[2022-05-15 14:44:52] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-15 14:44:52] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
// Phase 1: matrix 219 rows 261 cols
[2022-05-15 14:44:52] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-15 14:44:53] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 261/267 places, 219/225 transitions.
Finished structural reductions, in 1 iterations. Remains : 261/267 places, 219/225 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-08-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s172 0) (EQ s132 1)), p0:(AND (EQ s179 0) (EQ s167 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 851 reset in 234 ms.
Product exploration explored 100000 steps with 852 reset in 189 ms.
Computed a total of 92 stabilizing places and 88 stable transitions
Graph (complete) has 553 edges and 261 vertex of which 260 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 92 stabilizing places and 88 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 261 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 84 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1089476 steps, run timeout after 3001 ms. (steps per millisecond=363 ) properties seen :{}
Probabilistic random walk after 1089476 steps, saw 141852 distinct states, run finished after 3002 ms. (steps per millisecond=362 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 219 rows 261 cols
[2022-05-15 14:44:57] [INFO ] Computed 50 place invariants in 3 ms
[2022-05-15 14:44:57] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 14:44:57] [INFO ] [Nat]Absence check using 50 positive place invariants in 11 ms returned sat
[2022-05-15 14:44:57] [INFO ] After 94ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 14:44:57] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2022-05-15 14:44:57] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2022-05-15 14:44:57] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2022-05-15 14:44:57] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2022-05-15 14:44:57] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2022-05-15 14:44:57] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 292 ms
[2022-05-15 14:44:57] [INFO ] After 423ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 20 ms.
[2022-05-15 14:44:57] [INFO ] After 515ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 128 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=64 )
Parikh walk visited 2 properties in 2 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 225 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 261 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 219/219 transitions.
Applied a total of 0 rules in 7 ms. Remains 261 /261 variables (removed 0) and now considering 219/219 (removed 0) transitions.
// Phase 1: matrix 219 rows 261 cols
[2022-05-15 14:44:58] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-15 14:44:58] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 219 rows 261 cols
[2022-05-15 14:44:58] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-15 14:44:58] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
// Phase 1: matrix 219 rows 261 cols
[2022-05-15 14:44:58] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-15 14:44:58] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 261/261 places, 219/219 transitions.
Computed a total of 92 stabilizing places and 88 stable transitions
Graph (complete) has 553 edges and 261 vertex of which 260 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 92 stabilizing places and 88 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 176 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 84 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 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 15 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1139539 steps, run timeout after 3001 ms. (steps per millisecond=379 ) properties seen :{}
Probabilistic random walk after 1139539 steps, saw 148115 distinct states, run finished after 3001 ms. (steps per millisecond=379 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 219 rows 261 cols
[2022-05-15 14:45:01] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-15 14:45:02] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 14:45:02] [INFO ] [Nat]Absence check using 50 positive place invariants in 10 ms returned sat
[2022-05-15 14:45:02] [INFO ] After 93ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 14:45:02] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2022-05-15 14:45:02] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2022-05-15 14:45:02] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2022-05-15 14:45:02] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2022-05-15 14:45:02] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2022-05-15 14:45:02] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 266 ms
[2022-05-15 14:45:02] [INFO ] After 399ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 25 ms.
[2022-05-15 14:45:02] [INFO ] After 491ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 128 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=42 )
Parikh walk visited 2 properties in 3 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 258 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 839 reset in 172 ms.
Product exploration explored 100000 steps with 848 reset in 203 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 261 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 261/261 places, 219/219 transitions.
Graph (trivial) has 128 edges and 261 vertex of which 6 / 261 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 546 edges and 256 vertex of which 255 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
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 32 rules applied. Total rules applied 34 place count 255 transition count 212
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 34 Pre rules applied. Total rules applied 34 place count 255 transition count 240
Deduced a syphon composed of 66 places in 1 ms
Iterating global reduction 1 with 34 rules applied. Total rules applied 68 place count 255 transition count 240
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 78 place count 245 transition count 224
Deduced a syphon composed of 56 places in 1 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 88 place count 245 transition count 224
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 150 places in 0 ms
Iterating global reduction 1 with 94 rules applied. Total rules applied 182 place count 245 transition count 224
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 205 place count 222 transition count 201
Deduced a syphon composed of 127 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 228 place count 222 transition count 201
Deduced a syphon composed of 127 places in 0 ms
Applied a total of 228 rules in 43 ms. Remains 222 /261 variables (removed 39) and now considering 201/219 (removed 18) transitions.
[2022-05-15 14:45:03] [INFO ] Redundant transitions in 25 ms returned []
// Phase 1: matrix 201 rows 222 cols
[2022-05-15 14:45:03] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-15 14:45:03] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 222/261 places, 201/219 transitions.
Finished structural reductions, in 1 iterations. Remains : 222/261 places, 201/219 transitions.
Product exploration explored 100000 steps with 20000 reset in 427 ms.
Product exploration explored 100000 steps with 20000 reset in 488 ms.
Built C files in :
/tmp/ltsmin11440210938802258709
[2022-05-15 14:45:04] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11440210938802258709
Running compilation step : cd /tmp/ltsmin11440210938802258709;'/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 433 ms.
Running link step : cd /tmp/ltsmin11440210938802258709;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin11440210938802258709;'/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/stateBased15938767442553795365.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 261 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 219/219 transitions.
Applied a total of 0 rules in 6 ms. Remains 261 /261 variables (removed 0) and now considering 219/219 (removed 0) transitions.
// Phase 1: matrix 219 rows 261 cols
[2022-05-15 14:45:19] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-15 14:45:20] [INFO ] Implicit Places using invariants in 104 ms returned []
// Phase 1: matrix 219 rows 261 cols
[2022-05-15 14:45:20] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-15 14:45:20] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
// Phase 1: matrix 219 rows 261 cols
[2022-05-15 14:45:20] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-15 14:45:20] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 261/261 places, 219/219 transitions.
Built C files in :
/tmp/ltsmin10177600611321682116
[2022-05-15 14:45:20] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10177600611321682116
Running compilation step : cd /tmp/ltsmin10177600611321682116;'/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 322 ms.
Running link step : cd /tmp/ltsmin10177600611321682116;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin10177600611321682116;'/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/stateBased3686505934989805832.hoa' '--buchi-type=spotba'
LTSmin run took 1049 ms.
FORMULA BusinessProcesses-PT-08-LTLCardinality-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-08-LTLCardinality-10 finished in 29157 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 267 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 267/267 places, 225/225 transitions.
Graph (trivial) has 137 edges and 267 vertex of which 6 / 267 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 558 edges and 262 vertex of which 261 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 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 35 place count 260 transition count 184
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 68 place count 227 transition count 184
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 54 Pre rules applied. Total rules applied 68 place count 227 transition count 130
Deduced a syphon composed of 54 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 119 rules applied. Total rules applied 187 place count 162 transition count 130
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 193 place count 156 transition count 124
Iterating global reduction 2 with 6 rules applied. Total rules applied 199 place count 156 transition count 124
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 150 rules applied. Total rules applied 349 place count 80 transition count 50
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 2 with 2 rules applied. Total rules applied 351 place count 79 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 352 place count 78 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 353 place count 77 transition count 48
Applied a total of 353 rules in 32 ms. Remains 77 /267 variables (removed 190) and now considering 48/225 (removed 177) transitions.
// Phase 1: matrix 48 rows 77 cols
[2022-05-15 14:45:21] [INFO ] Computed 36 place invariants in 1 ms
[2022-05-15 14:45:21] [INFO ] Implicit Places using invariants in 54 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 70 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 76/267 places, 48/225 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 76/267 places, 48/225 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-08-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s63 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 1 ms.
FORMULA BusinessProcesses-PT-08-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-LTLCardinality-14 finished in 181 ms.
All properties solved by simple procedures.
Total runtime 36161 ms.

BK_STOP 1652625922077

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-08"
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-08, 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-165251918400379"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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