Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 126K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 12:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 104K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620544634163

Running Version 0
[2021-05-09 07:17:17] [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]
[2021-05-09 07:17:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 07:17:17] [INFO ] Load time of PNML (sax parser for PT used): 137 ms
[2021-05-09 07:17:17] [INFO ] Transformed 403 places.
[2021-05-09 07:17:17] [INFO ] Transformed 374 transitions.
[2021-05-09 07:17:17] [INFO ] Found NUPN structural information;
[2021-05-09 07:17:17] [INFO ] Parsed PT model containing 403 places and 374 transitions in 274 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 39 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 07:17:17] [INFO ] Initial state test concluded for 4 properties.
FORMULA BusinessProcesses-PT-09-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 403 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 403/403 places, 374/374 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 402 transition count 374
Discarding 55 places :
Symmetric choice reduction at 1 with 55 rule applications. Total rules 56 place count 347 transition count 319
Iterating global reduction 1 with 55 rules applied. Total rules applied 111 place count 347 transition count 319
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 135 place count 323 transition count 295
Iterating global reduction 1 with 24 rules applied. Total rules applied 159 place count 323 transition count 295
Applied a total of 159 rules in 91 ms. Remains 323 /403 variables (removed 80) and now considering 295/374 (removed 79) transitions.
// Phase 1: matrix 295 rows 323 cols
[2021-05-09 07:17:18] [INFO ] Computed 64 place invariants in 22 ms
[2021-05-09 07:17:18] [INFO ] Implicit Places using invariants in 551 ms returned []
// Phase 1: matrix 295 rows 323 cols
[2021-05-09 07:17:18] [INFO ] Computed 64 place invariants in 19 ms
[2021-05-09 07:17:19] [INFO ] Implicit Places using invariants and state equation in 581 ms returned []
Implicit Place search using SMT with State Equation took 1162 ms to find 0 implicit places.
// Phase 1: matrix 295 rows 323 cols
[2021-05-09 07:17:19] [INFO ] Computed 64 place invariants in 4 ms
[2021-05-09 07:17:19] [INFO ] Dead Transitions using invariants and state equation in 248 ms returned []
Finished structural reductions, in 1 iterations. Remains : 323/403 places, 295/374 transitions.
[2021-05-09 07:17:19] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-09 07:17:19] [INFO ] Flatten gal took : 99 ms
FORMULA BusinessProcesses-PT-09-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 07:17:19] [INFO ] Flatten gal took : 33 ms
[2021-05-09 07:17:19] [INFO ] Input system was already deterministic with 295 transitions.
Incomplete random walk after 100000 steps, including 1045 resets, run finished after 300 ms. (steps per millisecond=333 ) properties (out of 12) seen :9
Running SMT prover for 3 properties.
// Phase 1: matrix 295 rows 323 cols
[2021-05-09 07:17:20] [INFO ] Computed 64 place invariants in 14 ms
[2021-05-09 07:17:20] [INFO ] [Real]Absence check using 34 positive place invariants in 9 ms returned sat
[2021-05-09 07:17:20] [INFO ] [Real]Absence check using 34 positive and 30 generalized place invariants in 7 ms returned sat
[2021-05-09 07:17:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:17:20] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2021-05-09 07:17:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:17:20] [INFO ] [Nat]Absence check using 34 positive place invariants in 236 ms returned sat
[2021-05-09 07:17:20] [INFO ] [Nat]Absence check using 34 positive and 30 generalized place invariants in 17 ms returned sat
[2021-05-09 07:17:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:17:20] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2021-05-09 07:17:23] [INFO ] Deduced a trap composed of 48 places in 2331 ms of which 41 ms to minimize.
[2021-05-09 07:17:23] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 1 ms to minimize.
[2021-05-09 07:17:23] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 1 ms to minimize.
[2021-05-09 07:17:23] [INFO ] Deduced a trap composed of 61 places in 125 ms of which 1 ms to minimize.
[2021-05-09 07:17:23] [INFO ] Deduced a trap composed of 63 places in 106 ms of which 1 ms to minimize.
[2021-05-09 07:17:24] [INFO ] Deduced a trap composed of 58 places in 130 ms of which 0 ms to minimize.
[2021-05-09 07:17:24] [INFO ] Deduced a trap composed of 58 places in 108 ms of which 0 ms to minimize.
[2021-05-09 07:17:24] [INFO ] Deduced a trap composed of 58 places in 65 ms of which 0 ms to minimize.
[2021-05-09 07:17:24] [INFO ] Deduced a trap composed of 58 places in 65 ms of which 2 ms to minimize.
[2021-05-09 07:17:24] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 0 ms to minimize.
[2021-05-09 07:17:24] [INFO ] Deduced a trap composed of 55 places in 64 ms of which 0 ms to minimize.
[2021-05-09 07:17:24] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 0 ms to minimize.
[2021-05-09 07:17:24] [INFO ] Deduced a trap composed of 66 places in 62 ms of which 1 ms to minimize.
[2021-05-09 07:17:24] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 1 ms to minimize.
[2021-05-09 07:17:24] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 0 ms to minimize.
[2021-05-09 07:17:25] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 0 ms to minimize.
[2021-05-09 07:17:25] [INFO ] Deduced a trap composed of 73 places in 61 ms of which 0 ms to minimize.
[2021-05-09 07:17:25] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 1 ms to minimize.
[2021-05-09 07:17:25] [INFO ] Deduced a trap composed of 68 places in 88 ms of which 0 ms to minimize.
[2021-05-09 07:17:25] [INFO ] Deduced a trap composed of 72 places in 106 ms of which 0 ms to minimize.
[2021-05-09 07:17:25] [INFO ] Deduced a trap composed of 75 places in 74 ms of which 0 ms to minimize.
[2021-05-09 07:17:25] [INFO ] Deduced a trap composed of 68 places in 99 ms of which 0 ms to minimize.
[2021-05-09 07:17:25] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 0 ms to minimize.
[2021-05-09 07:17:26] [INFO ] Deduced a trap composed of 65 places in 380 ms of which 0 ms to minimize.
[2021-05-09 07:17:26] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 0 ms to minimize.
[2021-05-09 07:17:26] [INFO ] Deduced a trap composed of 65 places in 112 ms of which 0 ms to minimize.
[2021-05-09 07:17:26] [INFO ] Deduced a trap composed of 61 places in 53 ms of which 1 ms to minimize.
[2021-05-09 07:17:26] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 0 ms to minimize.
[2021-05-09 07:17:26] [INFO ] Deduced a trap composed of 71 places in 64 ms of which 0 ms to minimize.
[2021-05-09 07:17:26] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 1 ms to minimize.
[2021-05-09 07:17:26] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2021-05-09 07:17:26] [INFO ] Deduced a trap composed of 70 places in 167 ms of which 0 ms to minimize.
[2021-05-09 07:17:27] [INFO ] Deduced a trap composed of 62 places in 116 ms of which 1 ms to minimize.
[2021-05-09 07:17:27] [INFO ] Deduced a trap composed of 66 places in 60 ms of which 0 ms to minimize.
[2021-05-09 07:17:27] [INFO ] Deduced a trap composed of 67 places in 60 ms of which 0 ms to minimize.
[2021-05-09 07:17:27] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 6256 ms
[2021-05-09 07:17:27] [INFO ] Computed and/alt/rep : 289/604/289 causal constraints (skipped 5 transitions) in 17 ms.
[2021-05-09 07:17:28] [INFO ] Added : 188 causal constraints over 38 iterations in 795 ms. Result :sat
[2021-05-09 07:17:28] [INFO ] [Real]Absence check using 34 positive place invariants in 245 ms returned sat
[2021-05-09 07:17:28] [INFO ] [Real]Absence check using 34 positive and 30 generalized place invariants in 82 ms returned sat
[2021-05-09 07:17:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:17:28] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2021-05-09 07:17:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:17:28] [INFO ] [Nat]Absence check using 34 positive place invariants in 10 ms returned sat
[2021-05-09 07:17:28] [INFO ] [Nat]Absence check using 34 positive and 30 generalized place invariants in 8 ms returned sat
[2021-05-09 07:17:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:17:28] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2021-05-09 07:17:28] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2021-05-09 07:17:28] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2021-05-09 07:17:28] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 0 ms to minimize.
[2021-05-09 07:17:28] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2021-05-09 07:17:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 200 ms
[2021-05-09 07:17:28] [INFO ] Computed and/alt/rep : 289/604/289 causal constraints (skipped 5 transitions) in 17 ms.
[2021-05-09 07:17:29] [INFO ] Added : 187 causal constraints over 38 iterations in 970 ms. Result :sat
[2021-05-09 07:17:30] [INFO ] [Real]Absence check using 34 positive place invariants in 35 ms returned sat
[2021-05-09 07:17:30] [INFO ] [Real]Absence check using 34 positive and 30 generalized place invariants in 7 ms returned sat
[2021-05-09 07:17:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:17:30] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2021-05-09 07:17:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:17:30] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2021-05-09 07:17:30] [INFO ] [Nat]Absence check using 34 positive and 30 generalized place invariants in 6 ms returned sat
[2021-05-09 07:17:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:17:30] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2021-05-09 07:17:30] [INFO ] Deduced a trap composed of 63 places in 87 ms of which 1 ms to minimize.
[2021-05-09 07:17:30] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 0 ms to minimize.
[2021-05-09 07:17:30] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 0 ms to minimize.
[2021-05-09 07:17:30] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 9 ms to minimize.
[2021-05-09 07:17:30] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 1 ms to minimize.
[2021-05-09 07:17:30] [INFO ] Deduced a trap composed of 57 places in 68 ms of which 0 ms to minimize.
[2021-05-09 07:17:31] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
[2021-05-09 07:17:31] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 716 ms
[2021-05-09 07:17:31] [INFO ] Computed and/alt/rep : 289/604/289 causal constraints (skipped 5 transitions) in 17 ms.
[2021-05-09 07:17:31] [INFO ] Added : 194 causal constraints over 39 iterations in 719 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 323 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 323/323 places, 295/295 transitions.
Graph (trivial) has 146 edges and 323 vertex of which 6 / 323 are part of one of the 1 SCC in 15 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 317 transition count 258
Reduce places removed 30 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 287 transition count 257
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 286 transition count 257
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 63 place count 286 transition count 189
Deduced a syphon composed of 68 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 146 rules applied. Total rules applied 209 place count 208 transition count 189
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 213 place count 204 transition count 185
Iterating global reduction 3 with 4 rules applied. Total rules applied 217 place count 204 transition count 185
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 217 place count 204 transition count 184
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 219 place count 203 transition count 184
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 159 rules applied. Total rules applied 378 place count 123 transition count 105
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 380 place count 122 transition count 108
Applied a total of 380 rules in 156 ms. Remains 122 /323 variables (removed 201) and now considering 108/295 (removed 187) transitions.
// Phase 1: matrix 108 rows 122 cols
[2021-05-09 07:17:31] [INFO ] Computed 53 place invariants in 3 ms
[2021-05-09 07:17:32] [INFO ] Implicit Places using invariants in 232 ms returned [1, 2, 3, 14, 39, 40, 41, 42, 43, 44, 45, 100, 102]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 238 ms to find 13 implicit places.
[2021-05-09 07:17:32] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 108 rows 109 cols
[2021-05-09 07:17:32] [INFO ] Computed 40 place invariants in 1 ms
[2021-05-09 07:17:32] [INFO ] Dead Transitions using invariants and state equation in 646 ms returned []
Starting structural reductions, iteration 1 : 109/323 places, 108/295 transitions.
Applied a total of 0 rules in 14 ms. Remains 109 /109 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2021-05-09 07:17:32] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 108 rows 109 cols
[2021-05-09 07:17:32] [INFO ] Computed 40 place invariants in 1 ms
[2021-05-09 07:17:33] [INFO ] Dead Transitions using invariants and state equation in 279 ms returned []
Finished structural reductions, in 2 iterations. Remains : 109/323 places, 108/295 transitions.
Stuttering acceptance computed with spot in 270 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-09-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s6 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-09-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-00 finished in 1685 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&G((F(G(p0))&&F(p1))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 323 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 323/323 places, 295/295 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 320 transition count 292
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 320 transition count 292
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 319 transition count 291
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 319 transition count 291
Applied a total of 8 rules in 44 ms. Remains 319 /323 variables (removed 4) and now considering 291/295 (removed 4) transitions.
// Phase 1: matrix 291 rows 319 cols
[2021-05-09 07:17:33] [INFO ] Computed 64 place invariants in 5 ms
[2021-05-09 07:17:33] [INFO ] Implicit Places using invariants in 240 ms returned []
// Phase 1: matrix 291 rows 319 cols
[2021-05-09 07:17:33] [INFO ] Computed 64 place invariants in 4 ms
[2021-05-09 07:17:34] [INFO ] Implicit Places using invariants and state equation in 482 ms returned []
Implicit Place search using SMT with State Equation took 739 ms to find 0 implicit places.
// Phase 1: matrix 291 rows 319 cols
[2021-05-09 07:17:34] [INFO ] Computed 64 place invariants in 3 ms
[2021-05-09 07:17:43] [INFO ] Dead Transitions using invariants and state equation in 9216 ms returned []
Finished structural reductions, in 1 iterations. Remains : 319/323 places, 291/295 transitions.
Stuttering acceptance computed with spot in 287 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-09-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 3}, { cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s243 0) (EQ s76 1)), p1:(EQ s178 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 112 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-09-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-01 finished in 10334 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U p1)&&G(F(!p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 323 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 323/323 places, 295/295 transitions.
Graph (trivial) has 143 edges and 323 vertex of which 4 / 323 are part of one of the 1 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 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 32 place count 319 transition count 260
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 63 place count 288 transition count 260
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 63 place count 288 transition count 193
Deduced a syphon composed of 67 places in 14 ms
Ensure Unique test removed 10 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 207 place count 211 transition count 193
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 211 place count 207 transition count 189
Iterating global reduction 2 with 4 rules applied. Total rules applied 215 place count 207 transition count 189
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 215 place count 207 transition count 188
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 217 place count 206 transition count 188
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 157 rules applied. Total rules applied 374 place count 126 transition count 111
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 376 place count 125 transition count 114
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 382 place count 125 transition count 114
Applied a total of 382 rules in 77 ms. Remains 125 /323 variables (removed 198) and now considering 114/295 (removed 181) transitions.
// Phase 1: matrix 114 rows 125 cols
[2021-05-09 07:17:43] [INFO ] Computed 51 place invariants in 1 ms
[2021-05-09 07:17:44] [INFO ] Implicit Places using invariants in 492 ms returned [1, 2, 3, 11, 36, 37, 38, 39, 40, 41, 42]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 493 ms to find 11 implicit places.
[2021-05-09 07:17:44] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 114 rows 114 cols
[2021-05-09 07:17:44] [INFO ] Computed 40 place invariants in 1 ms
[2021-05-09 07:17:44] [INFO ] Dead Transitions using invariants and state equation in 89 ms returned []
Starting structural reductions, iteration 1 : 114/323 places, 114/295 transitions.
Applied a total of 0 rules in 5 ms. Remains 114 /114 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2021-05-09 07:17:44] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 114 rows 114 cols
[2021-05-09 07:17:44] [INFO ] Computed 40 place invariants in 2 ms
[2021-05-09 07:17:44] [INFO ] Dead Transitions using invariants and state equation in 110 ms returned []
Finished structural reductions, in 2 iterations. Remains : 114/323 places, 114/295 transitions.
Stuttering acceptance computed with spot in 253 ms :[true, true, (NOT p1), p1, p1]
Running random walk in product with property : BusinessProcesses-PT-09-03 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}, { cond=(OR p1 p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s74 0) (EQ s34 1)), p0:(OR (EQ s13 0) (EQ s94 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-09-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-03 finished in 1173 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||X(G(p0)))))], workingDir=/home/mcc/execution]
Support contains 1 out of 323 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 323/323 places, 295/295 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 318 transition count 290
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 318 transition count 290
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 317 transition count 289
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 317 transition count 289
Applied a total of 12 rules in 100 ms. Remains 317 /323 variables (removed 6) and now considering 289/295 (removed 6) transitions.
// Phase 1: matrix 289 rows 317 cols
[2021-05-09 07:17:45] [INFO ] Computed 64 place invariants in 2 ms
[2021-05-09 07:17:45] [INFO ] Implicit Places using invariants in 187 ms returned []
// Phase 1: matrix 289 rows 317 cols
[2021-05-09 07:17:45] [INFO ] Computed 64 place invariants in 2 ms
[2021-05-09 07:17:45] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 554 ms to find 0 implicit places.
// Phase 1: matrix 289 rows 317 cols
[2021-05-09 07:17:45] [INFO ] Computed 64 place invariants in 3 ms
[2021-05-09 07:17:45] [INFO ] Dead Transitions using invariants and state equation in 203 ms returned []
Finished structural reductions, in 1 iterations. Remains : 317/323 places, 289/295 transitions.
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-09-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s68 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-09-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-06 finished in 1018 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 323 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 323/323 places, 295/295 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 318 transition count 290
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 318 transition count 290
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 317 transition count 289
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 317 transition count 289
Applied a total of 12 rules in 29 ms. Remains 317 /323 variables (removed 6) and now considering 289/295 (removed 6) transitions.
// Phase 1: matrix 289 rows 317 cols
[2021-05-09 07:17:46] [INFO ] Computed 64 place invariants in 1 ms
[2021-05-09 07:17:46] [INFO ] Implicit Places using invariants in 217 ms returned []
// Phase 1: matrix 289 rows 317 cols
[2021-05-09 07:17:46] [INFO ] Computed 64 place invariants in 14 ms
[2021-05-09 07:17:46] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 679 ms to find 0 implicit places.
// Phase 1: matrix 289 rows 317 cols
[2021-05-09 07:17:46] [INFO ] Computed 64 place invariants in 18 ms
[2021-05-09 07:17:46] [INFO ] Dead Transitions using invariants and state equation in 149 ms returned []
Finished structural reductions, in 1 iterations. Remains : 317/323 places, 289/295 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-09-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (NEQ s44 0) (NEQ s217 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-09-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-08 finished in 1006 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(F(p0))&&(F(p1)||X(p2)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 323 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 323/323 places, 295/295 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 319 transition count 291
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 319 transition count 291
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 318 transition count 290
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 318 transition count 290
Applied a total of 10 rules in 13 ms. Remains 318 /323 variables (removed 5) and now considering 290/295 (removed 5) transitions.
// Phase 1: matrix 290 rows 318 cols
[2021-05-09 07:17:47] [INFO ] Computed 64 place invariants in 15 ms
[2021-05-09 07:17:47] [INFO ] Implicit Places using invariants in 140 ms returned []
// Phase 1: matrix 290 rows 318 cols
[2021-05-09 07:17:47] [INFO ] Computed 64 place invariants in 2 ms
[2021-05-09 07:17:47] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 573 ms to find 0 implicit places.
// Phase 1: matrix 290 rows 318 cols
[2021-05-09 07:17:47] [INFO ] Computed 64 place invariants in 1 ms
[2021-05-09 07:17:47] [INFO ] Dead Transitions using invariants and state equation in 211 ms returned []
Finished structural reductions, in 1 iterations. Remains : 318/323 places, 290/295 transitions.
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-09-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s67 0) (EQ s229 1)), p0:(AND (OR (EQ s21 0) (EQ s28 1)) (EQ s11 1)), p2:(EQ s11 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2260 reset in 357 ms.
Stack based approach found an accepted trace after 444 steps with 11 reset with depth 6 and stack size 6 in 2 ms.
FORMULA BusinessProcesses-PT-09-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-12 finished in 1415 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 3 out of 323 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 323/323 places, 295/295 transitions.
Graph (trivial) has 145 edges and 323 vertex of which 6 / 323 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.
Reduce places removed 1 places and 1 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 32 place count 317 transition count 257
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 63 place count 286 transition count 257
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 63 place count 286 transition count 192
Deduced a syphon composed of 65 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 203 place count 211 transition count 192
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 207 place count 207 transition count 188
Iterating global reduction 2 with 4 rules applied. Total rules applied 211 place count 207 transition count 188
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 211 place count 207 transition count 187
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 213 place count 206 transition count 187
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 3 places
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 163 rules applied. Total rules applied 376 place count 123 transition count 107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 378 place count 122 transition count 110
Applied a total of 378 rules in 21 ms. Remains 122 /323 variables (removed 201) and now considering 110/295 (removed 185) transitions.
// Phase 1: matrix 110 rows 122 cols
[2021-05-09 07:17:48] [INFO ] Computed 51 place invariants in 1 ms
[2021-05-09 07:17:48] [INFO ] Implicit Places using invariants in 84 ms returned [1, 2, 3, 12, 38, 39, 40, 41, 42, 43, 44]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 98 ms to find 11 implicit places.
[2021-05-09 07:17:48] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 110 rows 111 cols
[2021-05-09 07:17:48] [INFO ] Computed 40 place invariants in 3 ms
[2021-05-09 07:17:49] [INFO ] Dead Transitions using invariants and state equation in 991 ms returned []
Starting structural reductions, iteration 1 : 111/323 places, 110/295 transitions.
Applied a total of 0 rules in 6 ms. Remains 111 /111 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2021-05-09 07:17:49] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 110 rows 111 cols
[2021-05-09 07:17:49] [INFO ] Computed 40 place invariants in 4 ms
[2021-05-09 07:17:49] [INFO ] Dead Transitions using invariants and state equation in 84 ms returned []
Finished structural reductions, in 2 iterations. Remains : 111/323 places, 110/295 transitions.
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-09-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s4 1) (EQ s16 0) (EQ s69 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][true, true]]
Entered a terminal (fully accepting) state of product in 25671 steps with 3660 reset in 110 ms.
FORMULA BusinessProcesses-PT-09-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-13 finished in 1431 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 323 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 323/323 places, 295/295 transitions.
Graph (trivial) has 145 edges and 323 vertex of which 6 / 323 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.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 317 transition count 258
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 61 place count 287 transition count 258
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 68 Pre rules applied. Total rules applied 61 place count 287 transition count 190
Deduced a syphon composed of 68 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 207 place count 209 transition count 190
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 210 place count 206 transition count 187
Iterating global reduction 2 with 3 rules applied. Total rules applied 213 place count 206 transition count 187
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 213 place count 206 transition count 186
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 215 place count 205 transition count 186
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 3 places
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 163 rules applied. Total rules applied 378 place count 122 transition count 106
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 380 place count 121 transition count 109
Applied a total of 380 rules in 34 ms. Remains 121 /323 variables (removed 202) and now considering 109/295 (removed 186) transitions.
// Phase 1: matrix 109 rows 121 cols
[2021-05-09 07:17:49] [INFO ] Computed 51 place invariants in 1 ms
[2021-05-09 07:17:50] [INFO ] Implicit Places using invariants in 120 ms returned [1, 2, 3, 11, 36, 37, 38, 39, 40, 41, 42]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 121 ms to find 11 implicit places.
[2021-05-09 07:17:50] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 109 rows 110 cols
[2021-05-09 07:17:50] [INFO ] Computed 40 place invariants in 1 ms
[2021-05-09 07:17:50] [INFO ] Dead Transitions using invariants and state equation in 79 ms returned []
Starting structural reductions, iteration 1 : 110/323 places, 109/295 transitions.
Applied a total of 0 rules in 4 ms. Remains 110 /110 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2021-05-09 07:17:50] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 109 rows 110 cols
[2021-05-09 07:17:50] [INFO ] Computed 40 place invariants in 1 ms
[2021-05-09 07:17:56] [INFO ] Dead Transitions using invariants and state equation in 5909 ms returned []
Finished structural reductions, in 2 iterations. Remains : 110/323 places, 109/295 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-09-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s79 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-09-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-14 finished in 6265 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620544676408

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-09"
export BK_EXAMINATION="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-09, 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 r026-tajo-162038143800388"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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