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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 320K
-rw-r--r-- 1 mcc users 7.7K Apr 29 23:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 29 23:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Apr 29 23:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K 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.4K May 9 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 18K May 9 07:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.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-05-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652623793750

Running Version 202205111006
[2022-05-15 14:09:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 14:09:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 14:09:55] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2022-05-15 14:09:55] [INFO ] Transformed 368 places.
[2022-05-15 14:09:55] [INFO ] Transformed 319 transitions.
[2022-05-15 14:09:55] [INFO ] Found NUPN structural information;
[2022-05-15 14:09:55] [INFO ] Parsed PT model containing 368 places and 319 transitions in 202 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-05-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 367 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 367/367 places, 318/318 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 365 transition count 318
Discarding 59 places :
Symmetric choice reduction at 1 with 59 rule applications. Total rules 61 place count 306 transition count 259
Iterating global reduction 1 with 59 rules applied. Total rules applied 120 place count 306 transition count 259
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 121 place count 306 transition count 258
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 152 place count 275 transition count 227
Iterating global reduction 2 with 31 rules applied. Total rules applied 183 place count 275 transition count 227
Applied a total of 183 rules in 92 ms. Remains 275 /367 variables (removed 92) and now considering 227/318 (removed 91) transitions.
// Phase 1: matrix 227 rows 275 cols
[2022-05-15 14:09:55] [INFO ] Computed 55 place invariants in 9 ms
[2022-05-15 14:09:55] [INFO ] Implicit Places using invariants in 261 ms returned []
// Phase 1: matrix 227 rows 275 cols
[2022-05-15 14:09:55] [INFO ] Computed 55 place invariants in 14 ms
[2022-05-15 14:09:55] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 565 ms to find 0 implicit places.
// Phase 1: matrix 227 rows 275 cols
[2022-05-15 14:09:55] [INFO ] Computed 55 place invariants in 3 ms
[2022-05-15 14:09:56] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 275/367 places, 227/318 transitions.
Finished structural reductions, in 1 iterations. Remains : 275/367 places, 227/318 transitions.
Support contains 18 out of 275 places after structural reductions.
[2022-05-15 14:09:56] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2022-05-15 14:09:56] [INFO ] Flatten gal took : 45 ms
FORMULA BusinessProcesses-PT-05-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-15 14:09:56] [INFO ] Flatten gal took : 17 ms
[2022-05-15 14:09:56] [INFO ] Input system was already deterministic with 227 transitions.
Incomplete random walk after 10000 steps, including 97 resets, run finished after 411 ms. (steps per millisecond=24 ) properties (out of 11) seen :7
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 227 rows 275 cols
[2022-05-15 14:09:56] [INFO ] Computed 55 place invariants in 5 ms
[2022-05-15 14:09:57] [INFO ] [Real]Absence check using 55 positive place invariants in 15 ms returned sat
[2022-05-15 14:09:57] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-15 14:09:57] [INFO ] [Nat]Absence check using 55 positive place invariants in 19 ms returned sat
[2022-05-15 14:09:57] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2022-05-15 14:09:57] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 3 ms to minimize.
[2022-05-15 14:09:57] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2022-05-15 14:09:57] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2022-05-15 14:09:57] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
[2022-05-15 14:09:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 257 ms
[2022-05-15 14:09:57] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2022-05-15 14:09:57] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2022-05-15 14:09:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 81 ms
[2022-05-15 14:09:57] [INFO ] After 466ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 30 ms.
[2022-05-15 14:09:57] [INFO ] After 590ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 7 ms.
Support contains 2 out of 275 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 275/275 places, 227/227 transitions.
Graph (trivial) has 138 edges and 275 vertex of which 6 / 275 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 580 edges and 270 vertex of which 269 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 33 place count 269 transition count 187
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 64 place count 238 transition count 187
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 54 Pre rules applied. Total rules applied 64 place count 238 transition count 133
Deduced a syphon composed of 54 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 121 rules applied. Total rules applied 185 place count 171 transition count 133
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 190 place count 166 transition count 128
Iterating global reduction 2 with 5 rules applied. Total rules applied 195 place count 166 transition count 128
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 1 places
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 161 rules applied. Total rules applied 356 place count 85 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 357 place count 84 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 358 place count 83 transition count 47
Applied a total of 358 rules in 46 ms. Remains 83 /275 variables (removed 192) and now considering 47/227 (removed 180) transitions.
Finished structural reductions, in 1 iterations. Remains : 83/275 places, 47/227 transitions.
Finished random walk after 49 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=24 )
Successfully simplified 2 atomic propositions for a total of 7 simplifications.
FORMULA BusinessProcesses-PT-05-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 269 stabilizing places and 219 stable transitions
Graph (complete) has 587 edges and 275 vertex of which 274 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.12 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G(p1)))'
Support contains 4 out of 275 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 275/275 places, 227/227 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 269 transition count 221
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 269 transition count 221
Applied a total of 12 rules in 10 ms. Remains 269 /275 variables (removed 6) and now considering 221/227 (removed 6) transitions.
// Phase 1: matrix 221 rows 269 cols
[2022-05-15 14:09:57] [INFO ] Computed 55 place invariants in 1 ms
[2022-05-15 14:09:58] [INFO ] Implicit Places using invariants in 136 ms returned []
// Phase 1: matrix 221 rows 269 cols
[2022-05-15 14:09:58] [INFO ] Computed 55 place invariants in 2 ms
[2022-05-15 14:09:58] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
// Phase 1: matrix 221 rows 269 cols
[2022-05-15 14:09:58] [INFO ] Computed 55 place invariants in 9 ms
[2022-05-15 14:09:58] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 269/275 places, 221/227 transitions.
Finished structural reductions, in 1 iterations. Remains : 269/275 places, 221/227 transitions.
Stuttering acceptance computed with spot in 260 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(AND (EQ s92 0) (EQ s143 1)), p1:(OR (EQ s233 0) (EQ s267 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 8390 steps with 78 reset in 71 ms.
FORMULA BusinessProcesses-PT-05-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLCardinality-00 finished in 921 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(p0))))'
Support contains 2 out of 275 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 275/275 places, 227/227 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 268 transition count 220
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 268 transition count 220
Applied a total of 14 rules in 9 ms. Remains 268 /275 variables (removed 7) and now considering 220/227 (removed 7) transitions.
// Phase 1: matrix 220 rows 268 cols
[2022-05-15 14:09:58] [INFO ] Computed 55 place invariants in 1 ms
[2022-05-15 14:09:59] [INFO ] Implicit Places using invariants in 283 ms returned []
// Phase 1: matrix 220 rows 268 cols
[2022-05-15 14:09:59] [INFO ] Computed 55 place invariants in 5 ms
[2022-05-15 14:09:59] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
// Phase 1: matrix 220 rows 268 cols
[2022-05-15 14:09:59] [INFO ] Computed 55 place invariants in 5 ms
[2022-05-15 14:09:59] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 268/275 places, 220/227 transitions.
Finished structural reductions, in 1 iterations. Remains : 268/275 places, 220/227 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLCardinality-02 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:(OR (EQ s227 0) (EQ s127 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, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 301 ms.
Product exploration explored 100000 steps with 33333 reset in 298 ms.
Computed a total of 262 stabilizing places and 212 stable transitions
Graph (complete) has 575 edges and 268 vertex of which 267 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 262 stabilizing places and 212 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 61 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA BusinessProcesses-PT-05-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-05-LTLCardinality-02 finished in 1409 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0&&F(p1))||p1)))'
Support contains 2 out of 275 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 275/275 places, 227/227 transitions.
Graph (trivial) has 138 edges and 275 vertex of which 6 / 275 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 581 edges and 270 vertex of which 269 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 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 33 place count 268 transition count 188
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 64 place count 237 transition count 188
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 54 Pre rules applied. Total rules applied 64 place count 237 transition count 134
Deduced a syphon composed of 54 places in 1 ms
Ensure Unique test removed 12 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 184 place count 171 transition count 134
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 190 place count 165 transition count 128
Ensure Unique test removed 2 places
Iterating global reduction 2 with 8 rules applied. Total rules applied 198 place count 163 transition count 128
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 153 rules applied. Total rules applied 351 place count 86 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 352 place count 85 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 353 place count 84 transition count 51
Applied a total of 353 rules in 27 ms. Remains 84 /275 variables (removed 191) and now considering 51/227 (removed 176) transitions.
// Phase 1: matrix 51 rows 84 cols
[2022-05-15 14:10:00] [INFO ] Computed 39 place invariants in 1 ms
[2022-05-15 14:10:00] [INFO ] Implicit Places using invariants in 54 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 57 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 83/275 places, 51/227 transitions.
Applied a total of 0 rules in 3 ms. Remains 83 /83 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 83/275 places, 51/227 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (NEQ s18 0) (NEQ s74 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-05-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLCardinality-08 finished in 131 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(X(p0))||(G(p1)&&p2))))'
Support contains 4 out of 275 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 275/275 places, 227/227 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 269 transition count 221
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 269 transition count 221
Applied a total of 12 rules in 7 ms. Remains 269 /275 variables (removed 6) and now considering 221/227 (removed 6) transitions.
// Phase 1: matrix 221 rows 269 cols
[2022-05-15 14:10:00] [INFO ] Computed 55 place invariants in 1 ms
[2022-05-15 14:10:00] [INFO ] Implicit Places using invariants in 107 ms returned []
// Phase 1: matrix 221 rows 269 cols
[2022-05-15 14:10:00] [INFO ] Computed 55 place invariants in 4 ms
[2022-05-15 14:10:00] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
// Phase 1: matrix 221 rows 269 cols
[2022-05-15 14:10:00] [INFO ] Computed 55 place invariants in 1 ms
[2022-05-15 14:10:00] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 269/275 places, 221/227 transitions.
Finished structural reductions, in 1 iterations. Remains : 269/275 places, 221/227 transitions.
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-05-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p2 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (EQ s127 0) (EQ s220 1)), p2:(OR (AND (EQ s36 0) (EQ s43 1)) (AND (EQ s220 0) (EQ s127 1))), p1:(AND (EQ s36 0) (EQ s43 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, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 226 ms.
Product exploration explored 100000 steps with 33333 reset in 233 ms.
Computed a total of 263 stabilizing places and 213 stable transitions
Graph (complete) has 576 edges and 269 vertex of which 268 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 263 stabilizing places and 213 stable transitions
Detected a total of 263/269 stabilizing places and 213/221 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND p2 p1))), (X (OR (NOT p2) (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 9 factoid took 199 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA BusinessProcesses-PT-05-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-05-LTLCardinality-11 finished in 1361 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(p0))))'
Support contains 1 out of 275 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 275/275 places, 227/227 transitions.
Graph (trivial) has 140 edges and 275 vertex of which 6 / 275 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 581 edges and 270 vertex of which 269 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 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 33 place count 268 transition count 188
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 65 place count 237 transition count 187
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 236 transition count 187
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 66 place count 236 transition count 131
Deduced a syphon composed of 56 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 3 with 125 rules applied. Total rules applied 191 place count 167 transition count 131
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 198 place count 160 transition count 124
Ensure Unique test removed 2 places
Iterating global reduction 3 with 9 rules applied. Total rules applied 207 place count 158 transition count 124
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 153 rules applied. Total rules applied 360 place count 81 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 361 place count 80 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 362 place count 79 transition count 47
Applied a total of 362 rules in 34 ms. Remains 79 /275 variables (removed 196) and now considering 47/227 (removed 180) transitions.
// Phase 1: matrix 47 rows 79 cols
[2022-05-15 14:10:01] [INFO ] Computed 38 place invariants in 1 ms
[2022-05-15 14:10:01] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 47 rows 79 cols
[2022-05-15 14:10:01] [INFO ] Computed 38 place invariants in 1 ms
[2022-05-15 14:10:01] [INFO ] Implicit Places using invariants and state equation in 110 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 15, 16, 18, 20, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 174 ms to find 38 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/275 places, 47/227 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 41 transition count 40
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 34 transition count 40
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 19 place count 29 transition count 35
Iterating global reduction 2 with 5 rules applied. Total rules applied 24 place count 29 transition count 35
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 27 place count 29 transition count 32
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 30 place count 26 transition count 32
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 31 place count 25 transition count 31
Iterating global reduction 4 with 1 rules applied. Total rules applied 32 place count 25 transition count 31
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 42 place count 20 transition count 26
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 43 place count 20 transition count 25
Applied a total of 43 rules in 13 ms. Remains 20 /41 variables (removed 21) and now considering 25/47 (removed 22) transitions.
// Phase 1: matrix 25 rows 20 cols
[2022-05-15 14:10:01] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 14:10:01] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 25 rows 20 cols
[2022-05-15 14:10:01] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 14:10:01] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/275 places, 25/227 transitions.
Finished structural reductions, in 2 iterations. Remains : 20/275 places, 25/227 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-05-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLCardinality-14 finished in 363 ms.
All properties solved by simple procedures.
Total runtime 7160 ms.

BK_STOP 1652623802092

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-05"
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-05, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r024-tall-165251918400355"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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