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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K 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.1K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 3.7K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K 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 14K 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 85K 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-05-00
FORMULA_NAME BusinessProcesses-PT-05-01
FORMULA_NAME BusinessProcesses-PT-05-02
FORMULA_NAME BusinessProcesses-PT-05-03
FORMULA_NAME BusinessProcesses-PT-05-04
FORMULA_NAME BusinessProcesses-PT-05-05
FORMULA_NAME BusinessProcesses-PT-05-06
FORMULA_NAME BusinessProcesses-PT-05-07
FORMULA_NAME BusinessProcesses-PT-05-08
FORMULA_NAME BusinessProcesses-PT-05-09
FORMULA_NAME BusinessProcesses-PT-05-10
FORMULA_NAME BusinessProcesses-PT-05-11
FORMULA_NAME BusinessProcesses-PT-05-12
FORMULA_NAME BusinessProcesses-PT-05-13
FORMULA_NAME BusinessProcesses-PT-05-14
FORMULA_NAME BusinessProcesses-PT-05-15

=== Now, execution of the tool begins

BK_START 1620543038536

Running Version 0
[2021-05-09 06:50:40] [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 06:50:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 06:50:40] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2021-05-09 06:50:40] [INFO ] Transformed 368 places.
[2021-05-09 06:50:40] [INFO ] Transformed 319 transitions.
[2021-05-09 06:50:40] [INFO ] Found NUPN structural information;
[2021-05-09 06:50:40] [INFO ] Parsed PT model containing 368 places and 319 transitions in 98 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 06:50:40] [INFO ] Initial state test concluded for 3 properties.
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-05-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 367 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 367/367 places, 318/318 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 366 transition count 318
Discarding 56 places :
Symmetric choice reduction at 1 with 56 rule applications. Total rules 57 place count 310 transition count 262
Iterating global reduction 1 with 56 rules applied. Total rules applied 113 place count 310 transition count 262
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 114 place count 310 transition count 261
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 144 place count 280 transition count 231
Iterating global reduction 2 with 30 rules applied. Total rules applied 174 place count 280 transition count 231
Applied a total of 174 rules in 116 ms. Remains 280 /367 variables (removed 87) and now considering 231/318 (removed 87) transitions.
// Phase 1: matrix 231 rows 280 cols
[2021-05-09 06:50:40] [INFO ] Computed 56 place invariants in 25 ms
[2021-05-09 06:50:41] [INFO ] Implicit Places using invariants in 402 ms returned []
// Phase 1: matrix 231 rows 280 cols
[2021-05-09 06:50:41] [INFO ] Computed 56 place invariants in 12 ms
[2021-05-09 06:50:41] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 720 ms to find 0 implicit places.
// Phase 1: matrix 231 rows 280 cols
[2021-05-09 06:50:41] [INFO ] Computed 56 place invariants in 9 ms
[2021-05-09 06:50:41] [INFO ] Dead Transitions using invariants and state equation in 153 ms returned []
Finished structural reductions, in 1 iterations. Remains : 280/367 places, 231/318 transitions.
[2021-05-09 06:50:41] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-09 06:50:41] [INFO ] Flatten gal took : 55 ms
FORMULA BusinessProcesses-PT-05-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 06:50:41] [INFO ] Flatten gal took : 23 ms
[2021-05-09 06:50:42] [INFO ] Input system was already deterministic with 231 transitions.
Incomplete random walk after 100000 steps, including 950 resets, run finished after 292 ms. (steps per millisecond=342 ) properties (out of 13) seen :7
Running SMT prover for 6 properties.
// Phase 1: matrix 231 rows 280 cols
[2021-05-09 06:50:42] [INFO ] Computed 56 place invariants in 5 ms
[2021-05-09 06:50:42] [INFO ] [Real]Absence check using 40 positive place invariants in 11 ms returned unsat
[2021-05-09 06:50:42] [INFO ] [Real]Absence check using 40 positive place invariants in 12 ms returned sat
[2021-05-09 06:50:42] [INFO ] [Real]Absence check using 40 positive and 16 generalized place invariants in 4 ms returned sat
[2021-05-09 06:50:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:50:42] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2021-05-09 06:50:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:50:42] [INFO ] [Nat]Absence check using 40 positive place invariants in 10 ms returned unsat
[2021-05-09 06:50:42] [INFO ] [Real]Absence check using 40 positive place invariants in 12 ms returned sat
[2021-05-09 06:50:42] [INFO ] [Real]Absence check using 40 positive and 16 generalized place invariants in 4 ms returned sat
[2021-05-09 06:50:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:50:42] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2021-05-09 06:50:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:50:42] [INFO ] [Nat]Absence check using 40 positive place invariants in 6 ms returned unsat
[2021-05-09 06:50:42] [INFO ] [Real]Absence check using 40 positive place invariants in 8 ms returned sat
[2021-05-09 06:50:42] [INFO ] [Real]Absence check using 40 positive and 16 generalized place invariants in 2 ms returned sat
[2021-05-09 06:50:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:50:42] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2021-05-09 06:50:43] [INFO ] Deduced a trap composed of 50 places in 72 ms of which 3 ms to minimize.
[2021-05-09 06:50:43] [INFO ] Deduced a trap composed of 49 places in 78 ms of which 1 ms to minimize.
[2021-05-09 06:50:43] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2021-05-09 06:50:43] [INFO ] Deduced a trap composed of 53 places in 75 ms of which 2 ms to minimize.
[2021-05-09 06:50:43] [INFO ] Deduced a trap composed of 51 places in 66 ms of which 1 ms to minimize.
[2021-05-09 06:50:43] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 0 ms to minimize.
[2021-05-09 06:50:43] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 1 ms to minimize.
[2021-05-09 06:50:43] [INFO ] Deduced a trap composed of 49 places in 50 ms of which 0 ms to minimize.
[2021-05-09 06:50:43] [INFO ] Deduced a trap composed of 52 places in 53 ms of which 1 ms to minimize.
[2021-05-09 06:50:43] [INFO ] Deduced a trap composed of 38 places in 30 ms of which 1 ms to minimize.
[2021-05-09 06:50:43] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 1 ms to minimize.
[2021-05-09 06:50:43] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2021-05-09 06:50:43] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2021-05-09 06:50:43] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 868 ms
[2021-05-09 06:50:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:50:43] [INFO ] [Nat]Absence check using 40 positive place invariants in 10 ms returned sat
[2021-05-09 06:50:43] [INFO ] [Nat]Absence check using 40 positive and 16 generalized place invariants in 3 ms returned sat
[2021-05-09 06:50:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:50:43] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2021-05-09 06:50:44] [INFO ] Deduced a trap composed of 50 places in 42 ms of which 0 ms to minimize.
[2021-05-09 06:50:44] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 1 ms to minimize.
[2021-05-09 06:50:44] [INFO ] Deduced a trap composed of 51 places in 49 ms of which 1 ms to minimize.
[2021-05-09 06:50:44] [INFO ] Deduced a trap composed of 50 places in 45 ms of which 1 ms to minimize.
[2021-05-09 06:50:44] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 1 ms to minimize.
[2021-05-09 06:50:44] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2021-05-09 06:50:44] [INFO ] Deduced a trap composed of 51 places in 42 ms of which 1 ms to minimize.
[2021-05-09 06:50:44] [INFO ] Deduced a trap composed of 38 places in 25 ms of which 1 ms to minimize.
[2021-05-09 06:50:44] [INFO ] Deduced a trap composed of 11 places in 13 ms of which 1 ms to minimize.
[2021-05-09 06:50:44] [INFO ] Deduced a trap composed of 25 places in 13 ms of which 0 ms to minimize.
[2021-05-09 06:50:44] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 461 ms
[2021-05-09 06:50:44] [INFO ] Computed and/alt/rep : 229/429/229 causal constraints (skipped 1 transitions) in 11 ms.
[2021-05-09 06:50:44] [INFO ] Added : 145 causal constraints over 29 iterations in 391 ms. Result :sat
[2021-05-09 06:50:44] [INFO ] [Real]Absence check using 40 positive place invariants in 12 ms returned sat
[2021-05-09 06:50:44] [INFO ] [Real]Absence check using 40 positive and 16 generalized place invariants in 3 ms returned sat
[2021-05-09 06:50:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:50:44] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2021-05-09 06:50:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:50:44] [INFO ] [Nat]Absence check using 40 positive place invariants in 5 ms returned unsat
[2021-05-09 06:50:45] [INFO ] [Real]Absence check using 40 positive place invariants in 10 ms returned sat
[2021-05-09 06:50:45] [INFO ] [Real]Absence check using 40 positive and 16 generalized place invariants in 6 ms returned sat
[2021-05-09 06:50:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:50:45] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2021-05-09 06:50:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:50:45] [INFO ] [Nat]Absence check using 40 positive place invariants in 4 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 9 simplifications.
[2021-05-09 06:50:45] [INFO ] Initial state test concluded for 4 properties.
FORMULA BusinessProcesses-PT-05-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 280/280 places, 231/231 transitions.
Graph (trivial) has 145 edges and 280 vertex of which 6 / 280 are part of one of the 1 SCC in 5 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 586 edges and 275 vertex of which 274 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 37 place count 273 transition count 189
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 72 place count 238 transition count 189
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 55 Pre rules applied. Total rules applied 72 place count 238 transition count 134
Deduced a syphon composed of 55 places in 5 ms
Ensure Unique test removed 13 places
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 123 rules applied. Total rules applied 195 place count 170 transition count 134
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 202 place count 163 transition count 127
Iterating global reduction 2 with 7 rules applied. Total rules applied 209 place count 163 transition count 127
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 366 place count 83 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 367 place count 82 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 368 place count 81 transition count 49
Applied a total of 368 rules in 80 ms. Remains 81 /280 variables (removed 199) and now considering 49/231 (removed 182) transitions.
// Phase 1: matrix 49 rows 81 cols
[2021-05-09 06:50:45] [INFO ] Computed 38 place invariants in 1 ms
[2021-05-09 06:50:45] [INFO ] Implicit Places using invariants in 76 ms returned []
// Phase 1: matrix 49 rows 81 cols
[2021-05-09 06:50:45] [INFO ] Computed 38 place invariants in 1 ms
[2021-05-09 06:50:45] [INFO ] Implicit Places using invariants and state equation in 79 ms returned [15, 16, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 55, 56, 58, 60, 62]
Discarding 25 places :
Implicit Place search using SMT with State Equation took 159 ms to find 25 implicit places.
[2021-05-09 06:50:45] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 49 rows 56 cols
[2021-05-09 06:50:45] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-09 06:50:45] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Starting structural reductions, iteration 1 : 56/280 places, 49/231 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 56 transition count 41
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 48 transition count 41
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 21 place count 43 transition count 36
Iterating global reduction 2 with 5 rules applied. Total rules applied 26 place count 43 transition count 36
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 29 place count 43 transition count 33
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 32 place count 40 transition count 33
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 35 transition count 28
Applied a total of 42 rules in 7 ms. Remains 35 /56 variables (removed 21) and now considering 28/49 (removed 21) transitions.
// Phase 1: matrix 28 rows 35 cols
[2021-05-09 06:50:45] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-09 06:50:45] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 28 rows 35 cols
[2021-05-09 06:50:45] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-09 06:50:45] [INFO ] State equation strengthened by 18 read => feed constraints.
[2021-05-09 06:50:45] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 35/280 places, 28/231 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-05-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s28 0) (EQ s1 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 41868 steps with 7094 reset in 152 ms.
FORMULA BusinessProcesses-PT-05-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-01 finished in 703 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((p0 U (p1||G(p0))) U (((p0 U (p1||G(p0)))&&p2)||G(p3)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 280/280 places, 231/231 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 271 transition count 222
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 271 transition count 222
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 268 transition count 219
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 268 transition count 219
Applied a total of 24 rules in 22 ms. Remains 268 /280 variables (removed 12) and now considering 219/231 (removed 12) transitions.
// Phase 1: matrix 219 rows 268 cols
[2021-05-09 06:50:45] [INFO ] Computed 56 place invariants in 5 ms
[2021-05-09 06:50:46] [INFO ] Implicit Places using invariants in 87 ms returned []
// Phase 1: matrix 219 rows 268 cols
[2021-05-09 06:50:46] [INFO ] Computed 56 place invariants in 1 ms
[2021-05-09 06:50:46] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
// Phase 1: matrix 219 rows 268 cols
[2021-05-09 06:50:46] [INFO ] Computed 56 place invariants in 1 ms
[2021-05-09 06:50:46] [INFO ] Dead Transitions using invariants and state equation in 108 ms returned []
Finished structural reductions, in 1 iterations. Remains : 268/280 places, 219/231 transitions.
Stuttering acceptance computed with spot in 197 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), true, (NOT p3), (AND (NOT p1) (NOT p0)), (AND (NOT p3) (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-05-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p3) (NOT p2) p1) (AND (NOT p3) (NOT p2) p0)), acceptance={0} source=1 dest: 1}, { cond=(OR (AND p3 (NOT p2) p1) (AND p3 (NOT p2) p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={} source=1 dest: 4}, { cond=(AND p3 p2 (NOT p1) p0), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={} source=3 dest: 2}, { cond=p3, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={} source=5 dest: 4}, { cond=(AND p3 (NOT p1) p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p3:(OR (AND (NEQ s229 0) (NEQ s152 1)) (AND (NEQ s5 0) (NEQ s118 1) (NEQ s229 0) (NEQ s152 1))), p2:(AND (NEQ s232 0) (NEQ s264 1)), p1:(AND (NEQ s5 0) (NEQ s118 1) (NEQ s229 0) (NEQ s152 1)), p0:(AND (NEQ s229 0) (NEQ s152 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-05-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-05 finished in 610 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 280/280 places, 231/231 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 279 transition count 231
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 272 transition count 224
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 272 transition count 224
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 270 transition count 222
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 270 transition count 222
Applied a total of 19 rules in 11 ms. Remains 270 /280 variables (removed 10) and now considering 222/231 (removed 9) transitions.
// Phase 1: matrix 222 rows 270 cols
[2021-05-09 06:50:46] [INFO ] Computed 55 place invariants in 1 ms
[2021-05-09 06:50:46] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 222 rows 270 cols
[2021-05-09 06:50:46] [INFO ] Computed 55 place invariants in 2 ms
[2021-05-09 06:50:46] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
// Phase 1: matrix 222 rows 270 cols
[2021-05-09 06:50:46] [INFO ] Computed 55 place invariants in 3 ms
[2021-05-09 06:50:46] [INFO ] Dead Transitions using invariants and state equation in 102 ms returned []
Finished structural reductions, in 1 iterations. Remains : 270/280 places, 222/231 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-05-07 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}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s242 0) (EQ s254 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, 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-05-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-07 finished in 485 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 280 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 280/280 places, 231/231 transitions.
Graph (trivial) has 145 edges and 280 vertex of which 6 / 280 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 586 edges and 275 vertex of which 274 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 37 place count 273 transition count 189
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 72 place count 238 transition count 189
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 55 Pre rules applied. Total rules applied 72 place count 238 transition count 134
Deduced a syphon composed of 55 places in 1 ms
Ensure Unique test removed 12 places
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 122 rules applied. Total rules applied 194 place count 171 transition count 134
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 202 place count 163 transition count 126
Iterating global reduction 2 with 8 rules applied. Total rules applied 210 place count 163 transition count 126
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 159 rules applied. Total rules applied 369 place count 82 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 370 place count 81 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 371 place count 80 transition count 47
Applied a total of 371 rules in 30 ms. Remains 80 /280 variables (removed 200) and now considering 47/231 (removed 184) transitions.
// Phase 1: matrix 47 rows 80 cols
[2021-05-09 06:50:47] [INFO ] Computed 39 place invariants in 0 ms
[2021-05-09 06:50:47] [INFO ] Implicit Places using invariants in 43 ms returned [71]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
[2021-05-09 06:50:47] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 47 rows 79 cols
[2021-05-09 06:50:47] [INFO ] Computed 38 place invariants in 0 ms
[2021-05-09 06:50:47] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Starting structural reductions, iteration 1 : 79/280 places, 47/231 transitions.
Applied a total of 0 rules in 4 ms. Remains 79 /79 variables (removed 0) and now considering 47/47 (removed 0) transitions.
[2021-05-09 06:50:47] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 47 rows 79 cols
[2021-05-09 06:50:47] [INFO ] Computed 38 place invariants in 1 ms
[2021-05-09 06:50:47] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 2 iterations. Remains : 79/280 places, 47/231 transitions.
Stuttering acceptance computed with spot in 42 ms :[true, (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-05-11 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:(EQ s9 0)], 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 5175 steps with 1155 reset in 26 ms.
FORMULA BusinessProcesses-PT-05-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-11 finished in 250 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 280/280 places, 231/231 transitions.
Graph (trivial) has 145 edges and 280 vertex of which 6 / 280 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 586 edges and 275 vertex of which 274 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 37 place count 273 transition count 189
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 72 place count 238 transition count 189
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 55 Pre rules applied. Total rules applied 72 place count 238 transition count 134
Deduced a syphon composed of 55 places in 1 ms
Ensure Unique test removed 12 places
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 122 rules applied. Total rules applied 194 place count 171 transition count 134
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 202 place count 163 transition count 126
Iterating global reduction 2 with 8 rules applied. Total rules applied 210 place count 163 transition count 126
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 159 rules applied. Total rules applied 369 place count 82 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 370 place count 81 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 371 place count 80 transition count 47
Applied a total of 371 rules in 44 ms. Remains 80 /280 variables (removed 200) and now considering 47/231 (removed 184) transitions.
// Phase 1: matrix 47 rows 80 cols
[2021-05-09 06:50:47] [INFO ] Computed 39 place invariants in 1 ms
[2021-05-09 06:50:47] [INFO ] Implicit Places using invariants in 53 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 55 ms to find 1 implicit places.
[2021-05-09 06:50:47] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 47 rows 79 cols
[2021-05-09 06:50:47] [INFO ] Computed 38 place invariants in 0 ms
[2021-05-09 06:50:47] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Starting structural reductions, iteration 1 : 79/280 places, 47/231 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 47/47 (removed 0) transitions.
[2021-05-09 06:50:47] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 47 rows 79 cols
[2021-05-09 06:50:47] [INFO ] Computed 38 place invariants in 0 ms
[2021-05-09 06:50:47] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 2 iterations. Remains : 79/280 places, 47/231 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-05-15 automaton TGBA [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:(AND (NEQ s64 0) (NEQ s42 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-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-15 finished in 268 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620543047657

--------------------
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-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 r026-tajo-162038143800356"
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 ;