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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 304K
-rw-r--r-- 1 mcc users 6.3K Apr 29 23:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 29 23:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Apr 29 23:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Apr 29 23:56 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 85K 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-06-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652624494207

Running Version 202205111006
[2022-05-15 14:21:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 14:21:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 14:21:35] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2022-05-15 14:21:35] [INFO ] Transformed 376 places.
[2022-05-15 14:21:35] [INFO ] Transformed 297 transitions.
[2022-05-15 14:21:35] [INFO ] Found NUPN structural information;
[2022-05-15 14:21:35] [INFO ] Parsed PT model containing 376 places and 297 transitions in 198 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-06-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 296/296 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 373 transition count 296
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 42 place count 333 transition count 256
Iterating global reduction 1 with 40 rules applied. Total rules applied 82 place count 333 transition count 256
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 97 place count 318 transition count 241
Iterating global reduction 1 with 15 rules applied. Total rules applied 112 place count 318 transition count 241
Applied a total of 112 rules in 82 ms. Remains 318 /375 variables (removed 57) and now considering 241/296 (removed 55) transitions.
// Phase 1: matrix 241 rows 318 cols
[2022-05-15 14:21:35] [INFO ] Computed 79 place invariants in 23 ms
[2022-05-15 14:21:36] [INFO ] Implicit Places using invariants in 268 ms returned []
// Phase 1: matrix 241 rows 318 cols
[2022-05-15 14:21:36] [INFO ] Computed 79 place invariants in 22 ms
[2022-05-15 14:21:36] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 609 ms to find 0 implicit places.
// Phase 1: matrix 241 rows 318 cols
[2022-05-15 14:21:36] [INFO ] Computed 79 place invariants in 7 ms
[2022-05-15 14:21:36] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 318/375 places, 241/296 transitions.
Finished structural reductions, in 1 iterations. Remains : 318/375 places, 241/296 transitions.
Support contains 34 out of 318 places after structural reductions.
[2022-05-15 14:21:36] [INFO ] Flatten gal took : 44 ms
[2022-05-15 14:21:36] [INFO ] Flatten gal took : 21 ms
[2022-05-15 14:21:36] [INFO ] Input system was already deterministic with 241 transitions.
Support contains 31 out of 318 places (down from 34) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 103 resets, run finished after 695 ms. (steps per millisecond=14 ) properties (out of 27) seen :23
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :1
Running SMT prover for 3 properties.
// Phase 1: matrix 241 rows 318 cols
[2022-05-15 14:21:37] [INFO ] Computed 79 place invariants in 11 ms
[2022-05-15 14:21:37] [INFO ] [Real]Absence check using 40 positive place invariants in 19 ms returned sat
[2022-05-15 14:21:37] [INFO ] [Real]Absence check using 40 positive and 39 generalized place invariants in 23 ms returned sat
[2022-05-15 14:21:37] [INFO ] After 198ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 14:21:38] [INFO ] [Nat]Absence check using 40 positive place invariants in 36 ms returned sat
[2022-05-15 14:21:38] [INFO ] [Nat]Absence check using 40 positive and 39 generalized place invariants in 44 ms returned sat
[2022-05-15 14:21:38] [INFO ] After 410ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2022-05-15 14:21:41] [INFO ] Deduced a trap composed of 17 places in 2701 ms of which 50 ms to minimize.
[2022-05-15 14:21:44] [INFO ] Deduced a trap composed of 20 places in 2729 ms of which 26 ms to minimize.
[2022-05-15 14:21:44] [INFO ] Deduced a trap composed of 18 places in 138 ms of which 1 ms to minimize.
[2022-05-15 14:21:44] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 1 ms to minimize.
[2022-05-15 14:21:45] [INFO ] Deduced a trap composed of 11 places in 621 ms of which 1 ms to minimize.
[2022-05-15 14:21:46] [INFO ] Deduced a trap composed of 20 places in 1058 ms of which 1 ms to minimize.
[2022-05-15 14:21:46] [INFO ] Deduced a trap composed of 19 places in 181 ms of which 1 ms to minimize.
[2022-05-15 14:21:46] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 1 ms to minimize.
[2022-05-15 14:21:46] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 8018 ms
[2022-05-15 14:21:46] [INFO ] After 8548ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 81 ms.
[2022-05-15 14:21:46] [INFO ] After 9093ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 53 ms.
Support contains 2 out of 318 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 318/318 places, 241/241 transitions.
Graph (trivial) has 138 edges and 318 vertex of which 6 / 318 are part of one of the 1 SCC in 33 ms
Free SCC test removed 5 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 620 edges and 313 vertex of which 312 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 31 place count 312 transition count 203
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 60 place count 283 transition count 203
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 66 Pre rules applied. Total rules applied 60 place count 283 transition count 137
Deduced a syphon composed of 66 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 202 place count 207 transition count 137
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 208 place count 201 transition count 131
Iterating global reduction 2 with 6 rules applied. Total rules applied 214 place count 201 transition count 131
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Deduced a syphon composed of 84 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 390 place count 109 transition count 47
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 391 place count 109 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 392 place count 108 transition count 46
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 393 place count 108 transition count 46
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 394 place count 107 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 395 place count 106 transition count 45
Applied a total of 395 rules in 264 ms. Remains 106 /318 variables (removed 212) and now considering 45/241 (removed 196) transitions.
Finished structural reductions, in 1 iterations. Remains : 106/318 places, 45/241 transitions.
Finished random walk after 43 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=21 )
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA BusinessProcesses-PT-06-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 311 stabilizing places and 232 stable transitions
Graph (complete) has 627 edges and 318 vertex of which 317 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(!F((X((X(p0) U p1))||p2)))) U p0))'
Support contains 3 out of 318 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 318/318 places, 241/241 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 311 transition count 234
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 311 transition count 234
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 310 transition count 233
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 310 transition count 233
Applied a total of 16 rules in 79 ms. Remains 310 /318 variables (removed 8) and now considering 233/241 (removed 8) transitions.
// Phase 1: matrix 233 rows 310 cols
[2022-05-15 14:21:48] [INFO ] Computed 79 place invariants in 1 ms
[2022-05-15 14:21:50] [INFO ] Implicit Places using invariants in 2015 ms returned []
// Phase 1: matrix 233 rows 310 cols
[2022-05-15 14:21:50] [INFO ] Computed 79 place invariants in 1 ms
[2022-05-15 14:21:59] [INFO ] Implicit Places using invariants and state equation in 8890 ms returned []
Implicit Place search using SMT with State Equation took 10931 ms to find 0 implicit places.
// Phase 1: matrix 233 rows 310 cols
[2022-05-15 14:21:59] [INFO ] Computed 79 place invariants in 2 ms
[2022-05-15 14:21:59] [INFO ] Dead Transitions using invariants and state equation in 421 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 310/318 places, 233/241 transitions.
Finished structural reductions, in 1 iterations. Remains : 310/318 places, 233/241 transitions.
Stuttering acceptance computed with spot in 817 ms :[(NOT p0), (OR (NOT p0) p1 p2), (OR p1 p2), true, (AND p1 (NOT p2)), (AND p0 p1)]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 3}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s186 1), p2:(NEQ s103 1), p1:(EQ s202 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLFireability-00 finished in 12436 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 318 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 318/318 places, 241/241 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 310 transition count 233
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 310 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 309 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 309 transition count 232
Applied a total of 18 rules in 60 ms. Remains 309 /318 variables (removed 9) and now considering 232/241 (removed 9) transitions.
// Phase 1: matrix 232 rows 309 cols
[2022-05-15 14:22:00] [INFO ] Computed 79 place invariants in 8 ms
[2022-05-15 14:22:04] [INFO ] Implicit Places using invariants in 4298 ms returned []
// Phase 1: matrix 232 rows 309 cols
[2022-05-15 14:22:04] [INFO ] Computed 79 place invariants in 2 ms
[2022-05-15 14:22:06] [INFO ] Implicit Places using invariants and state equation in 1583 ms returned []
Implicit Place search using SMT with State Equation took 5947 ms to find 0 implicit places.
// Phase 1: matrix 232 rows 309 cols
[2022-05-15 14:22:06] [INFO ] Computed 79 place invariants in 10 ms
[2022-05-15 14:22:06] [INFO ] Dead Transitions using invariants and state equation in 407 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 309/318 places, 232/241 transitions.
Finished structural reductions, in 1 iterations. Remains : 309/318 places, 232/241 transitions.
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-03 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:(EQ s37 0)], 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 895 ms.
Product exploration explored 100000 steps with 50000 reset in 664 ms.
Computed a total of 302 stabilizing places and 223 stable transitions
Graph (complete) has 617 edges and 309 vertex of which 308 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 302 stabilizing places and 223 stable transitions
Detected a total of 302/309 stabilizing places and 223/232 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (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 205 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA BusinessProcesses-PT-06-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-06-LTLFireability-03 finished in 8424 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 318 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 318/318 places, 241/241 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 311 transition count 234
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 311 transition count 234
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 310 transition count 233
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 310 transition count 233
Applied a total of 16 rules in 39 ms. Remains 310 /318 variables (removed 8) and now considering 233/241 (removed 8) transitions.
// Phase 1: matrix 233 rows 310 cols
[2022-05-15 14:22:09] [INFO ] Computed 79 place invariants in 1 ms
[2022-05-15 14:22:11] [INFO ] Implicit Places using invariants in 2005 ms returned []
// Phase 1: matrix 233 rows 310 cols
[2022-05-15 14:22:11] [INFO ] Computed 79 place invariants in 2 ms
[2022-05-15 14:22:12] [INFO ] Implicit Places using invariants and state equation in 964 ms returned []
Implicit Place search using SMT with State Equation took 2993 ms to find 0 implicit places.
// Phase 1: matrix 233 rows 310 cols
[2022-05-15 14:22:12] [INFO ] Computed 79 place invariants in 1 ms
[2022-05-15 14:22:12] [INFO ] Dead Transitions using invariants and state equation in 292 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 310/318 places, 233/241 transitions.
Finished structural reductions, in 1 iterations. Remains : 310/318 places, 233/241 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s256 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 529 ms.
Product exploration explored 100000 steps with 33333 reset in 508 ms.
Computed a total of 303 stabilizing places and 224 stable transitions
Graph (complete) has 619 edges and 310 vertex of which 309 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 303 stabilizing places and 224 stable transitions
Detected a total of 303/310 stabilizing places and 224/233 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 254 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA BusinessProcesses-PT-06-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-06-LTLFireability-05 finished in 4881 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)&&p0)))'
Support contains 3 out of 318 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 318/318 places, 241/241 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 312 transition count 235
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 312 transition count 235
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 311 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 311 transition count 234
Applied a total of 14 rules in 42 ms. Remains 311 /318 variables (removed 7) and now considering 234/241 (removed 7) transitions.
// Phase 1: matrix 234 rows 311 cols
[2022-05-15 14:22:13] [INFO ] Computed 79 place invariants in 1 ms
[2022-05-15 14:22:19] [INFO ] Implicit Places using invariants in 5800 ms returned []
// Phase 1: matrix 234 rows 311 cols
[2022-05-15 14:22:19] [INFO ] Computed 79 place invariants in 1 ms
[2022-05-15 14:22:20] [INFO ] Implicit Places using invariants and state equation in 511 ms returned []
Implicit Place search using SMT with State Equation took 6356 ms to find 0 implicit places.
// Phase 1: matrix 234 rows 311 cols
[2022-05-15 14:22:20] [INFO ] Computed 79 place invariants in 1 ms
[2022-05-15 14:22:20] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 311/318 places, 234/241 transitions.
Finished structural reductions, in 1 iterations. Remains : 311/318 places, 234/241 transitions.
Stuttering acceptance computed with spot in 235 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(NEQ s271 1), p0:(AND (EQ s266 0) (EQ s221 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 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLFireability-06 finished in 6912 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F((F(p0)&&F(G(G((p1 U !p2))))))))'
Support contains 5 out of 318 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 318/318 places, 241/241 transitions.
Graph (complete) has 627 edges and 318 vertex of which 317 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 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 316 transition count 211
Reduce places removed 28 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 30 rules applied. Total rules applied 59 place count 288 transition count 209
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 61 place count 286 transition count 209
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 61 place count 286 transition count 143
Deduced a syphon composed of 66 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 203 place count 210 transition count 143
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 210 place count 203 transition count 136
Iterating global reduction 3 with 7 rules applied. Total rules applied 217 place count 203 transition count 136
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 391 place count 112 transition count 53
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 392 place count 112 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 393 place count 111 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 394 place count 110 transition count 51
Applied a total of 394 rules in 119 ms. Remains 110 /318 variables (removed 208) and now considering 51/241 (removed 190) transitions.
// Phase 1: matrix 51 rows 110 cols
[2022-05-15 14:22:20] [INFO ] Computed 60 place invariants in 0 ms
[2022-05-15 14:22:25] [INFO ] Implicit Places using invariants in 4532 ms returned []
// Phase 1: matrix 51 rows 110 cols
[2022-05-15 14:22:25] [INFO ] Computed 60 place invariants in 0 ms
[2022-05-15 14:22:25] [INFO ] Implicit Places using invariants and state equation in 210 ms returned [10, 12, 14, 16, 19, 21, 23, 25, 27, 36, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77]
Discarding 31 places :
Implicit Place search using SMT with State Equation took 4775 ms to find 31 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 79/318 places, 51/241 transitions.
Graph (complete) has 165 edges and 79 vertex of which 71 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 71 transition count 40
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 61 transition count 40
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 41 place count 48 transition count 33
Applied a total of 41 rules in 4 ms. Remains 48 /79 variables (removed 31) and now considering 33/51 (removed 18) transitions.
// Phase 1: matrix 33 rows 48 cols
[2022-05-15 14:22:25] [INFO ] Computed 16 place invariants in 0 ms
[2022-05-15 14:22:25] [INFO ] Implicit Places using invariants in 84 ms returned [45]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 108 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 47/318 places, 33/241 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 32
Applied a total of 2 rules in 8 ms. Remains 46 /47 variables (removed 1) and now considering 32/33 (removed 1) transitions.
// Phase 1: matrix 32 rows 46 cols
[2022-05-15 14:22:25] [INFO ] Computed 15 place invariants in 2 ms
[2022-05-15 14:22:27] [INFO ] Implicit Places using invariants in 1674 ms returned []
// Phase 1: matrix 32 rows 46 cols
[2022-05-15 14:22:27] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-15 14:22:27] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-15 14:22:27] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 1812 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 46/318 places, 32/241 transitions.
Finished structural reductions, in 3 iterations. Remains : 46/318 places, 32/241 transitions.
Stuttering acceptance computed with spot in 270 ms :[(OR (NOT p0) p2), (NOT p0), p2, p2]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND p2 p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p2 p1), acceptance={0} source=2 dest: 3}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p2 p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s42 0), p2:(AND (EQ s8 1) (EQ s37 1) (EQ s44 1)), p1:(EQ s14 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 16013 reset in 363 ms.
Stack based approach found an accepted trace after 108 steps with 12 reset with depth 10 and stack size 10 in 0 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-06-LTLFireability-07 finished in 7524 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(X(G(p1))||p2))))'
Support contains 5 out of 318 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 318/318 places, 241/241 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 310 transition count 233
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 310 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 309 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 309 transition count 232
Applied a total of 18 rules in 62 ms. Remains 309 /318 variables (removed 9) and now considering 232/241 (removed 9) transitions.
// Phase 1: matrix 232 rows 309 cols
[2022-05-15 14:22:28] [INFO ] Computed 79 place invariants in 1 ms
[2022-05-15 14:22:28] [INFO ] Implicit Places using invariants in 269 ms returned []
// Phase 1: matrix 232 rows 309 cols
[2022-05-15 14:22:28] [INFO ] Computed 79 place invariants in 2 ms
[2022-05-15 14:22:29] [INFO ] Implicit Places using invariants and state equation in 591 ms returned []
Implicit Place search using SMT with State Equation took 884 ms to find 0 implicit places.
// Phase 1: matrix 232 rows 309 cols
[2022-05-15 14:22:29] [INFO ] Computed 79 place invariants in 2 ms
[2022-05-15 14:22:29] [INFO ] Dead Transitions using invariants and state equation in 261 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 309/318 places, 232/241 transitions.
Finished structural reductions, in 1 iterations. Remains : 309/318 places, 232/241 transitions.
Stuttering acceptance computed with spot in 280 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-09 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=(AND p0 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (EQ s85 0) (EQ s211 0) (EQ s278 0)), p2:(EQ s166 1), p1:(OR (EQ s166 0) (EQ s41 0))], 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 1029 reset in 611 ms.
Product exploration explored 100000 steps with 1036 reset in 424 ms.
Computed a total of 302 stabilizing places and 223 stable transitions
Graph (complete) has 617 edges and 309 vertex of which 308 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 302 stabilizing places and 223 stable transitions
Detected a total of 302/309 stabilizing places and 223/232 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X p0), (X (AND p0 (NOT p2))), true, (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 780 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 262 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 100 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1222438 steps, run timeout after 3001 ms. (steps per millisecond=407 ) properties seen :{}
Probabilistic random walk after 1222438 steps, saw 170805 distinct states, run finished after 3003 ms. (steps per millisecond=407 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 232 rows 309 cols
[2022-05-15 14:22:35] [INFO ] Computed 79 place invariants in 2 ms
[2022-05-15 14:22:35] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 14:22:35] [INFO ] [Nat]Absence check using 40 positive place invariants in 9 ms returned sat
[2022-05-15 14:22:35] [INFO ] [Nat]Absence check using 40 positive and 39 generalized place invariants in 19 ms returned sat
[2022-05-15 14:22:35] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 14:22:35] [INFO ] Deduced a trap composed of 25 places in 194 ms of which 1 ms to minimize.
[2022-05-15 14:22:36] [INFO ] Deduced a trap composed of 21 places in 937 ms of which 8 ms to minimize.
[2022-05-15 14:22:36] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 1 ms to minimize.
[2022-05-15 14:22:37] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 1 ms to minimize.
[2022-05-15 14:22:37] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 1 ms to minimize.
[2022-05-15 14:22:37] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 0 ms to minimize.
[2022-05-15 14:22:37] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1850 ms
[2022-05-15 14:22:37] [INFO ] After 2043ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 62 ms.
[2022-05-15 14:22:37] [INFO ] After 2250ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 129 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=129 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X p0), (X (AND p0 (NOT p2))), true, (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 7 factoid took 665 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 221 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 673 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 309 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 232/232 transitions.
Applied a total of 0 rules in 4 ms. Remains 309 /309 variables (removed 0) and now considering 232/232 (removed 0) transitions.
// Phase 1: matrix 232 rows 309 cols
[2022-05-15 14:22:39] [INFO ] Computed 79 place invariants in 1 ms
[2022-05-15 14:22:44] [INFO ] Implicit Places using invariants in 5341 ms returned []
// Phase 1: matrix 232 rows 309 cols
[2022-05-15 14:22:44] [INFO ] Computed 79 place invariants in 2 ms
[2022-05-15 14:22:45] [INFO ] Implicit Places using invariants and state equation in 542 ms returned []
Implicit Place search using SMT with State Equation took 5897 ms to find 0 implicit places.
// Phase 1: matrix 232 rows 309 cols
[2022-05-15 14:22:45] [INFO ] Computed 79 place invariants in 1 ms
[2022-05-15 14:22:46] [INFO ] Dead Transitions using invariants and state equation in 1629 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 309/309 places, 232/232 transitions.
Computed a total of 302 stabilizing places and 223 stable transitions
Graph (complete) has 617 edges and 309 vertex of which 308 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 302 stabilizing places and 223 stable transitions
Detected a total of 302/309 stabilizing places and 223/232 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p1, (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 274 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 253 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 101 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 814711 steps, run timeout after 3001 ms. (steps per millisecond=271 ) properties seen :{}
Probabilistic random walk after 814711 steps, saw 117226 distinct states, run finished after 3001 ms. (steps per millisecond=271 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 232 rows 309 cols
[2022-05-15 14:22:50] [INFO ] Computed 79 place invariants in 5 ms
[2022-05-15 14:22:50] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 14:22:50] [INFO ] [Nat]Absence check using 40 positive place invariants in 23 ms returned sat
[2022-05-15 14:22:50] [INFO ] [Nat]Absence check using 40 positive and 39 generalized place invariants in 24 ms returned sat
[2022-05-15 14:22:50] [INFO ] After 159ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 14:22:50] [INFO ] Deduced a trap composed of 25 places in 163 ms of which 1 ms to minimize.
[2022-05-15 14:22:51] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 0 ms to minimize.
[2022-05-15 14:22:51] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 0 ms to minimize.
[2022-05-15 14:22:53] [INFO ] Deduced a trap composed of 22 places in 2782 ms of which 33 ms to minimize.
[2022-05-15 14:22:54] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 1 ms to minimize.
[2022-05-15 14:22:54] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 1 ms to minimize.
[2022-05-15 14:22:54] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3547 ms
[2022-05-15 14:22:54] [INFO ] After 3748ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2022-05-15 14:22:54] [INFO ] After 3948ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 129 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=64 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [p1, (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 355 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 241 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 229 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 277 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1035 reset in 268 ms.
Product exploration explored 100000 steps with 1042 reset in 151 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 270 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 309 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 309/309 places, 232/232 transitions.
Graph (trivial) has 131 edges and 309 vertex of which 6 / 309 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 611 edges and 304 vertex of which 303 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
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 26 rules applied. Total rules applied 28 place count 303 transition count 225
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 37 Pre rules applied. Total rules applied 28 place count 303 transition count 249
Deduced a syphon composed of 63 places in 0 ms
Iterating global reduction 1 with 37 rules applied. Total rules applied 65 place count 303 transition count 249
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 76 place count 292 transition count 228
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 87 place count 292 transition count 228
Performed 113 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 1 with 113 rules applied. Total rules applied 200 place count 292 transition count 228
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 215 place count 277 transition count 213
Deduced a syphon composed of 150 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 230 place count 277 transition count 213
Deduced a syphon composed of 150 places in 0 ms
Applied a total of 230 rules in 130 ms. Remains 277 /309 variables (removed 32) and now considering 213/232 (removed 19) transitions.
[2022-05-15 14:22:56] [INFO ] Redundant transitions in 107 ms returned []
// Phase 1: matrix 213 rows 277 cols
[2022-05-15 14:22:56] [INFO ] Computed 79 place invariants in 3 ms
[2022-05-15 14:23:00] [INFO ] Dead Transitions using invariants and state equation in 3582 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 277/309 places, 213/232 transitions.
Finished structural reductions, in 1 iterations. Remains : 277/309 places, 213/232 transitions.
Entered a terminal (fully accepting) state of product in 61734 steps with 8277 reset in 347 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLFireability-09 finished in 32414 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((X(G(p0))&&G((p1 U F(p1)))))))'
Support contains 2 out of 318 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 318/318 places, 241/241 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 310 transition count 233
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 310 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 309 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 309 transition count 232
Applied a total of 18 rules in 34 ms. Remains 309 /318 variables (removed 9) and now considering 232/241 (removed 9) transitions.
// Phase 1: matrix 232 rows 309 cols
[2022-05-15 14:23:00] [INFO ] Computed 79 place invariants in 5 ms
[2022-05-15 14:23:05] [INFO ] Implicit Places using invariants in 4397 ms returned []
// Phase 1: matrix 232 rows 309 cols
[2022-05-15 14:23:05] [INFO ] Computed 79 place invariants in 3 ms
[2022-05-15 14:23:05] [INFO ] Implicit Places using invariants and state equation in 606 ms returned []
Implicit Place search using SMT with State Equation took 5050 ms to find 0 implicit places.
// Phase 1: matrix 232 rows 309 cols
[2022-05-15 14:23:05] [INFO ] Computed 79 place invariants in 1 ms
[2022-05-15 14:23:05] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 309/318 places, 232/241 transitions.
Finished structural reductions, in 1 iterations. Remains : 309/318 places, 232/241 transitions.
Stuttering acceptance computed with spot in 374 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s279 0), p1:(EQ s34 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][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 94 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLFireability-10 finished in 5663 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (!X(p0)||G(F(p1)))))'
Support contains 2 out of 318 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 318/318 places, 241/241 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 312 transition count 235
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 312 transition count 235
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 311 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 311 transition count 234
Applied a total of 14 rules in 20 ms. Remains 311 /318 variables (removed 7) and now considering 234/241 (removed 7) transitions.
// Phase 1: matrix 234 rows 311 cols
[2022-05-15 14:23:06] [INFO ] Computed 79 place invariants in 14 ms
[2022-05-15 14:23:06] [INFO ] Implicit Places using invariants in 204 ms returned []
// Phase 1: matrix 234 rows 311 cols
[2022-05-15 14:23:06] [INFO ] Computed 79 place invariants in 2 ms
[2022-05-15 14:23:07] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 581 ms to find 0 implicit places.
// Phase 1: matrix 234 rows 311 cols
[2022-05-15 14:23:07] [INFO ] Computed 79 place invariants in 1 ms
[2022-05-15 14:23:07] [INFO ] Dead Transitions using invariants and state equation in 271 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 311/318 places, 234/241 transitions.
Finished structural reductions, in 1 iterations. Remains : 311/318 places, 234/241 transitions.
Stuttering acceptance computed with spot in 525 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, (AND p0 (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 8}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(NOT p0), acceptance={} source=5 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p0:(EQ s217 1), p1:(EQ s242 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 246 ms.
Product exploration explored 100000 steps with 50000 reset in 227 ms.
Computed a total of 304 stabilizing places and 225 stable transitions
Graph (complete) has 619 edges and 311 vertex of which 310 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 304 stabilizing places and 225 stable transitions
Detected a total of 304/311 stabilizing places and 225/234 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT p0))), (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 (NOT p0))
Knowledge based reduction with 10 factoid took 233 ms. Reduced automaton from 9 states, 16 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA BusinessProcesses-PT-06-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-06-LTLFireability-11 finished in 2157 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U ((p1 U p2)&&X((G(X(X(G(p2))))||p3)))))'
Support contains 4 out of 318 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 318/318 places, 241/241 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 310 transition count 233
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 310 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 309 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 309 transition count 232
Applied a total of 18 rules in 15 ms. Remains 309 /318 variables (removed 9) and now considering 232/241 (removed 9) transitions.
// Phase 1: matrix 232 rows 309 cols
[2022-05-15 14:23:08] [INFO ] Computed 79 place invariants in 5 ms
[2022-05-15 14:23:08] [INFO ] Implicit Places using invariants in 148 ms returned []
// Phase 1: matrix 232 rows 309 cols
[2022-05-15 14:23:08] [INFO ] Computed 79 place invariants in 2 ms
[2022-05-15 14:23:09] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
// Phase 1: matrix 232 rows 309 cols
[2022-05-15 14:23:09] [INFO ] Computed 79 place invariants in 5 ms
[2022-05-15 14:23:09] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 309/318 places, 232/241 transitions.
Finished structural reductions, in 1 iterations. Remains : 309/318 places, 232/241 transitions.
Stuttering acceptance computed with spot in 926 ms :[(NOT p2), (NOT p0), (NOT p2), (AND (NOT p0) (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), true, (AND p0 (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 2}, { cond=(OR p2 p1), acceptance={} source=0 dest: 3}, { cond=(OR p2 p1), acceptance={0} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=3 dest: 7}], [{ cond=(OR (AND p2 (NOT p3)) (AND p1 (NOT p3))), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=4 dest: 9}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=4 dest: 10}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=4 dest: 11}, { cond=(OR (AND p2 (NOT p3)) (AND p1 (NOT p3))), acceptance={0} source=4 dest: 12}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=6 dest: 6}], [{ cond=true, acceptance={} source=7 dest: 8}], [{ cond=(NOT p2), acceptance={} source=8 dest: 5}, { cond=p2, acceptance={} source=8 dest: 8}], [{ cond=(NOT p0), acceptance={} source=9 dest: 8}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=10 dest: 2}, { cond=(OR p2 p1), acceptance={} source=10 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=10 dest: 13}, { cond=(OR p2 p1), acceptance={0} source=10 dest: 14}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=11 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=11 dest: 6}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=11 dest: 8}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=11 dest: 13}], [{ cond=(OR (AND p2 (NOT p3)) (AND p1 (NOT p3))), acceptance={} source=12 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=12 dest: 9}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=12 dest: 11}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=12 dest: 15}, { cond=(OR (AND p2 (NOT p3)) (AND p1 (NOT p3))), acceptance={0} source=12 dest: 16}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=13 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=13 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=13 dest: 2}, { cond=(OR (AND p2 p0) (AND p1 p0)), acceptance={} source=13 dest: 3}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=13 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=13 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={} source=13 dest: 8}, { cond=(AND p2 p0), acceptance={} source=13 dest: 14}], [{ cond=(OR (AND p2 (NOT p3)) (AND p1 (NOT p3))), acceptance={} source=14 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=14 dest: 9}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=14 dest: 10}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=14 dest: 11}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=14 dest: 12}, { cond=(AND p2 (NOT p3)), acceptance={} source=14 dest: 16}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=15 dest: 2}, { cond=(OR p2 p1), acceptance={} source=15 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=15 dest: 13}, { cond=p2, acceptance={} source=15 dest: 14}, { cond=(AND (NOT p2) p1), acceptance={0} source=15 dest: 14}], [{ cond=(OR (AND p2 (NOT p3)) (AND p1 (NOT p3))), acceptance={} source=16 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=16 dest: 9}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=16 dest: 11}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=16 dest: 15}, { cond=(AND p2 (NOT p3)), acceptance={} source=16 dest: 16}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=16 dest: 16}]], initial=0, aps=[p2:(EQ s252 1), p1:(EQ s267 1), p0:(EQ s154 1), p3:(EQ s159 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLFireability-12 finished in 1560 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G(p0))&&p1)))'
Support contains 2 out of 318 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 318/318 places, 241/241 transitions.
Graph (trivial) has 140 edges and 318 vertex of which 6 / 318 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 621 edges and 313 vertex of which 312 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 31 place count 311 transition count 204
Reduce places removed 29 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 30 rules applied. Total rules applied 61 place count 282 transition count 203
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 281 transition count 203
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 62 place count 281 transition count 138
Deduced a syphon composed of 65 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 139 rules applied. Total rules applied 201 place count 207 transition count 138
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 209 place count 199 transition count 130
Iterating global reduction 3 with 8 rules applied. Total rules applied 217 place count 199 transition count 130
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 387 place count 110 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 388 place count 109 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 389 place count 108 transition count 48
Applied a total of 389 rules in 33 ms. Remains 108 /318 variables (removed 210) and now considering 48/241 (removed 193) transitions.
// Phase 1: matrix 48 rows 108 cols
[2022-05-15 14:23:10] [INFO ] Computed 61 place invariants in 1 ms
[2022-05-15 14:23:10] [INFO ] Implicit Places using invariants in 73 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 75 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 107/318 places, 48/241 transitions.
Applied a total of 0 rules in 3 ms. Remains 107 /107 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 107/318 places, 48/241 transitions.
Stuttering acceptance computed with spot in 68 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s39 1), p0:(EQ s6 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLFireability-13 finished in 196 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(X(F((X(X(X(X(p0))))||F(p0)))) U p1))'
Support contains 2 out of 318 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 318/318 places, 241/241 transitions.
Graph (trivial) has 140 edges and 318 vertex of which 6 / 318 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 621 edges and 313 vertex of which 312 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 32 place count 311 transition count 203
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 62 place count 281 transition count 203
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 66 Pre rules applied. Total rules applied 62 place count 281 transition count 137
Deduced a syphon composed of 66 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 204 place count 205 transition count 137
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 212 place count 197 transition count 129
Iterating global reduction 2 with 8 rules applied. Total rules applied 220 place count 197 transition count 129
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 388 place count 109 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 389 place count 108 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 390 place count 107 transition count 48
Applied a total of 390 rules in 27 ms. Remains 107 /318 variables (removed 211) and now considering 48/241 (removed 193) transitions.
// Phase 1: matrix 48 rows 107 cols
[2022-05-15 14:23:10] [INFO ] Computed 60 place invariants in 2 ms
[2022-05-15 14:23:10] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 48 rows 107 cols
[2022-05-15 14:23:10] [INFO ] Computed 60 place invariants in 1 ms
[2022-05-15 14:23:10] [INFO ] Implicit Places using invariants and state equation in 113 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 16, 18, 20, 22, 24, 33, 34, 73, 75, 77]
Discarding 22 places :
Implicit Place search using SMT with State Equation took 185 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 85/318 places, 48/241 transitions.
Graph (complete) has 230 edges and 85 vertex of which 77 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 77 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 76 transition count 46
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 5 place count 75 transition count 45
Applied a total of 5 rules in 10 ms. Remains 75 /85 variables (removed 10) and now considering 45/48 (removed 3) transitions.
// Phase 1: matrix 45 rows 75 cols
[2022-05-15 14:23:10] [INFO ] Computed 31 place invariants in 1 ms
[2022-05-15 14:23:10] [INFO ] Implicit Places using invariants in 54 ms returned [74]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 55 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 74/318 places, 45/241 transitions.
Applied a total of 0 rules in 2 ms. Remains 74 /74 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 74/318 places, 45/241 transitions.
Stuttering acceptance computed with spot in 142 ms :[true, p1, p0, (AND p0 p1)]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(OR (EQ s41 1) (EQ s10 1)), p0:(EQ s41 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLFireability-14 finished in 443 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 318 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 318/318 places, 241/241 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 310 transition count 233
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 310 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 309 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 309 transition count 232
Applied a total of 18 rules in 13 ms. Remains 309 /318 variables (removed 9) and now considering 232/241 (removed 9) transitions.
// Phase 1: matrix 232 rows 309 cols
[2022-05-15 14:23:10] [INFO ] Computed 79 place invariants in 2 ms
[2022-05-15 14:23:10] [INFO ] Implicit Places using invariants in 141 ms returned []
// Phase 1: matrix 232 rows 309 cols
[2022-05-15 14:23:10] [INFO ] Computed 79 place invariants in 1 ms
[2022-05-15 14:23:11] [INFO ] Implicit Places using invariants and state equation in 483 ms returned []
Implicit Place search using SMT with State Equation took 632 ms to find 0 implicit places.
// Phase 1: matrix 232 rows 309 cols
[2022-05-15 14:23:11] [INFO ] Computed 79 place invariants in 6 ms
[2022-05-15 14:23:11] [INFO ] Dead Transitions using invariants and state equation in 261 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 309/318 places, 232/241 transitions.
Finished structural reductions, in 1 iterations. Remains : 309/318 places, 232/241 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s6 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 4556 reset in 131 ms.
Stack based approach found an accepted trace after 55 steps with 2 reset with depth 5 and stack size 5 in 0 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-06-LTLFireability-15 finished in 1212 ms.
All properties solved by simple procedures.
Total runtime 96634 ms.

BK_STOP 1652624592063

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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