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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 122K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 82K 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.5K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 22 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 22 12:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 148K 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-13-00
FORMULA_NAME BusinessProcesses-PT-13-01
FORMULA_NAME BusinessProcesses-PT-13-02
FORMULA_NAME BusinessProcesses-PT-13-03
FORMULA_NAME BusinessProcesses-PT-13-04
FORMULA_NAME BusinessProcesses-PT-13-05
FORMULA_NAME BusinessProcesses-PT-13-06
FORMULA_NAME BusinessProcesses-PT-13-07
FORMULA_NAME BusinessProcesses-PT-13-08
FORMULA_NAME BusinessProcesses-PT-13-09
FORMULA_NAME BusinessProcesses-PT-13-10
FORMULA_NAME BusinessProcesses-PT-13-11
FORMULA_NAME BusinessProcesses-PT-13-12
FORMULA_NAME BusinessProcesses-PT-13-13
FORMULA_NAME BusinessProcesses-PT-13-14
FORMULA_NAME BusinessProcesses-PT-13-15

=== Now, execution of the tool begins

BK_START 1620545657203

Running Version 0
[2021-05-09 07:34:18] [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:34:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 07:34:18] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2021-05-09 07:34:18] [INFO ] Transformed 593 places.
[2021-05-09 07:34:18] [INFO ] Transformed 536 transitions.
[2021-05-09 07:34:18] [INFO ] Found NUPN structural information;
[2021-05-09 07:34:18] [INFO ] Parsed PT model containing 593 places and 536 transitions in 94 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 07:34:18] [INFO ] Initial state test concluded for 4 properties.
Deduced a syphon composed of 8 places in 13 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-13-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 585 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 585/585 places, 528/528 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 580 transition count 528
Discarding 83 places :
Symmetric choice reduction at 1 with 83 rule applications. Total rules 88 place count 497 transition count 445
Iterating global reduction 1 with 83 rules applied. Total rules applied 171 place count 497 transition count 445
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 214 place count 454 transition count 402
Iterating global reduction 1 with 43 rules applied. Total rules applied 257 place count 454 transition count 402
Applied a total of 257 rules in 87 ms. Remains 454 /585 variables (removed 131) and now considering 402/528 (removed 126) transitions.
// Phase 1: matrix 402 rows 454 cols
[2021-05-09 07:34:18] [INFO ] Computed 90 place invariants in 28 ms
[2021-05-09 07:34:19] [INFO ] Implicit Places using invariants in 265 ms returned []
// Phase 1: matrix 402 rows 454 cols
[2021-05-09 07:34:19] [INFO ] Computed 90 place invariants in 12 ms
[2021-05-09 07:34:19] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 656 ms to find 0 implicit places.
// Phase 1: matrix 402 rows 454 cols
[2021-05-09 07:34:19] [INFO ] Computed 90 place invariants in 19 ms
[2021-05-09 07:34:19] [INFO ] Dead Transitions using invariants and state equation in 222 ms returned []
Finished structural reductions, in 1 iterations. Remains : 454/585 places, 402/528 transitions.
[2021-05-09 07:34:19] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-09 07:34:20] [INFO ] Flatten gal took : 52 ms
FORMULA BusinessProcesses-PT-13-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 07:34:20] [INFO ] Flatten gal took : 24 ms
[2021-05-09 07:34:20] [INFO ] Input system was already deterministic with 402 transitions.
Incomplete random walk after 100000 steps, including 714 resets, run finished after 221 ms. (steps per millisecond=452 ) properties (out of 8) seen :5
Running SMT prover for 3 properties.
// Phase 1: matrix 402 rows 454 cols
[2021-05-09 07:34:20] [INFO ] Computed 90 place invariants in 19 ms
[2021-05-09 07:34:20] [INFO ] [Real]Absence check using 52 positive place invariants in 10 ms returned sat
[2021-05-09 07:34:20] [INFO ] [Real]Absence check using 52 positive and 38 generalized place invariants in 6 ms returned sat
[2021-05-09 07:34:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:34:20] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2021-05-09 07:34:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:34:20] [INFO ] [Nat]Absence check using 52 positive place invariants in 17 ms returned sat
[2021-05-09 07:34:20] [INFO ] [Nat]Absence check using 52 positive and 38 generalized place invariants in 9 ms returned sat
[2021-05-09 07:34:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:34:20] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2021-05-09 07:34:20] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 2 ms to minimize.
[2021-05-09 07:34:21] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 1 ms to minimize.
[2021-05-09 07:34:21] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2021-05-09 07:34:21] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 1 ms to minimize.
[2021-05-09 07:34:21] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 2 ms to minimize.
[2021-05-09 07:34:21] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 1 ms to minimize.
[2021-05-09 07:34:21] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 0 ms to minimize.
[2021-05-09 07:34:21] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 0 ms to minimize.
[2021-05-09 07:34:21] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 0 ms to minimize.
[2021-05-09 07:34:21] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 0 ms to minimize.
[2021-05-09 07:34:21] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1058 ms
[2021-05-09 07:34:21] [INFO ] Computed and/alt/rep : 396/773/396 causal constraints (skipped 5 transitions) in 22 ms.
[2021-05-09 07:34:23] [INFO ] Added : 296 causal constraints over 60 iterations in 1815 ms. Result :sat
[2021-05-09 07:34:23] [INFO ] [Real]Absence check using 52 positive place invariants in 21 ms returned sat
[2021-05-09 07:34:23] [INFO ] [Real]Absence check using 52 positive and 38 generalized place invariants in 6 ms returned sat
[2021-05-09 07:34:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:34:23] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2021-05-09 07:34:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:34:23] [INFO ] [Nat]Absence check using 52 positive place invariants in 20 ms returned sat
[2021-05-09 07:34:23] [INFO ] [Nat]Absence check using 52 positive and 38 generalized place invariants in 10 ms returned sat
[2021-05-09 07:34:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:34:24] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2021-05-09 07:34:24] [INFO ] Deduced a trap composed of 73 places in 125 ms of which 1 ms to minimize.
[2021-05-09 07:34:24] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 0 ms to minimize.
[2021-05-09 07:34:24] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 0 ms to minimize.
[2021-05-09 07:34:24] [INFO ] Deduced a trap composed of 81 places in 88 ms of which 0 ms to minimize.
[2021-05-09 07:34:24] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 1 ms to minimize.
[2021-05-09 07:34:24] [INFO ] Deduced a trap composed of 79 places in 92 ms of which 1 ms to minimize.
[2021-05-09 07:34:24] [INFO ] Deduced a trap composed of 72 places in 91 ms of which 0 ms to minimize.
[2021-05-09 07:34:25] [INFO ] Deduced a trap composed of 82 places in 90 ms of which 0 ms to minimize.
[2021-05-09 07:34:25] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 1 ms to minimize.
[2021-05-09 07:34:25] [INFO ] Deduced a trap composed of 77 places in 92 ms of which 1 ms to minimize.
[2021-05-09 07:34:25] [INFO ] Deduced a trap composed of 78 places in 111 ms of which 0 ms to minimize.
[2021-05-09 07:34:25] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 1 ms to minimize.
[2021-05-09 07:34:25] [INFO ] Deduced a trap composed of 76 places in 114 ms of which 1 ms to minimize.
[2021-05-09 07:34:25] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 0 ms to minimize.
[2021-05-09 07:34:25] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 0 ms to minimize.
[2021-05-09 07:34:26] [INFO ] Deduced a trap composed of 76 places in 118 ms of which 1 ms to minimize.
[2021-05-09 07:34:26] [INFO ] Deduced a trap composed of 82 places in 80 ms of which 1 ms to minimize.
[2021-05-09 07:34:26] [INFO ] Deduced a trap composed of 78 places in 79 ms of which 0 ms to minimize.
[2021-05-09 07:34:26] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 0 ms to minimize.
[2021-05-09 07:34:26] [INFO ] Deduced a trap composed of 79 places in 84 ms of which 0 ms to minimize.
[2021-05-09 07:34:26] [INFO ] Deduced a trap composed of 79 places in 94 ms of which 1 ms to minimize.
[2021-05-09 07:34:26] [INFO ] Deduced a trap composed of 76 places in 84 ms of which 1 ms to minimize.
[2021-05-09 07:34:26] [INFO ] Deduced a trap composed of 76 places in 84 ms of which 1 ms to minimize.
[2021-05-09 07:34:26] [INFO ] Deduced a trap composed of 77 places in 94 ms of which 0 ms to minimize.
[2021-05-09 07:34:27] [INFO ] Deduced a trap composed of 78 places in 84 ms of which 0 ms to minimize.
[2021-05-09 07:34:27] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 1 ms to minimize.
[2021-05-09 07:34:27] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 1 ms to minimize.
[2021-05-09 07:34:27] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 0 ms to minimize.
[2021-05-09 07:34:27] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 0 ms to minimize.
[2021-05-09 07:34:27] [INFO ] Deduced a trap composed of 39 places in 31 ms of which 0 ms to minimize.
[2021-05-09 07:34:27] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 3405 ms
[2021-05-09 07:34:27] [INFO ] Computed and/alt/rep : 396/773/396 causal constraints (skipped 5 transitions) in 30 ms.
[2021-05-09 07:34:29] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 0 ms to minimize.
[2021-05-09 07:34:29] [INFO ] Deduced a trap composed of 80 places in 88 ms of which 1 ms to minimize.
[2021-05-09 07:34:29] [INFO ] Deduced a trap composed of 80 places in 120 ms of which 0 ms to minimize.
[2021-05-09 07:34:29] [INFO ] Deduced a trap composed of 83 places in 94 ms of which 0 ms to minimize.
[2021-05-09 07:34:29] [INFO ] Deduced a trap composed of 78 places in 134 ms of which 0 ms to minimize.
[2021-05-09 07:34:29] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 943 ms
[2021-05-09 07:34:29] [INFO ] Added : 297 causal constraints over 60 iterations in 2507 ms. Result :sat
[2021-05-09 07:34:30] [INFO ] [Real]Absence check using 52 positive place invariants in 16 ms returned sat
[2021-05-09 07:34:30] [INFO ] [Real]Absence check using 52 positive and 38 generalized place invariants in 9 ms returned sat
[2021-05-09 07:34:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:34:30] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2021-05-09 07:34:30] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 0 ms to minimize.
[2021-05-09 07:34:30] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 0 ms to minimize.
[2021-05-09 07:34:30] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 0 ms to minimize.
[2021-05-09 07:34:30] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 0 ms to minimize.
[2021-05-09 07:34:30] [INFO ] Deduced a trap composed of 74 places in 97 ms of which 0 ms to minimize.
[2021-05-09 07:34:31] [INFO ] Deduced a trap composed of 73 places in 89 ms of which 1 ms to minimize.
[2021-05-09 07:34:31] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
[2021-05-09 07:34:31] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2021-05-09 07:34:31] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2021-05-09 07:34:31] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 0 ms to minimize.
[2021-05-09 07:34:31] [INFO ] Deduced a trap composed of 75 places in 89 ms of which 0 ms to minimize.
[2021-05-09 07:34:31] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 10 ms to minimize.
[2021-05-09 07:34:31] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2021-05-09 07:34:31] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2021-05-09 07:34:31] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 0 ms to minimize.
[2021-05-09 07:34:31] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1524 ms
[2021-05-09 07:34:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:34:31] [INFO ] [Nat]Absence check using 52 positive place invariants in 21 ms returned sat
[2021-05-09 07:34:31] [INFO ] [Nat]Absence check using 52 positive and 38 generalized place invariants in 21 ms returned sat
[2021-05-09 07:34:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:34:31] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2021-05-09 07:34:32] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 0 ms to minimize.
[2021-05-09 07:34:32] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 1 ms to minimize.
[2021-05-09 07:34:32] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2021-05-09 07:34:32] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
[2021-05-09 07:34:32] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 0 ms to minimize.
[2021-05-09 07:34:32] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2021-05-09 07:34:32] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2021-05-09 07:34:32] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 3 ms to minimize.
[2021-05-09 07:34:32] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2021-05-09 07:34:32] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2021-05-09 07:34:32] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2021-05-09 07:34:32] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 779 ms
[2021-05-09 07:34:32] [INFO ] Computed and/alt/rep : 396/773/396 causal constraints (skipped 5 transitions) in 19 ms.
[2021-05-09 07:34:34] [INFO ] Added : 254 causal constraints over 51 iterations in 1370 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 454 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 454/454 places, 402/402 transitions.
Graph (trivial) has 207 edges and 454 vertex of which 6 / 454 are part of one of the 1 SCC in 4 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 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 448 transition count 349
Reduce places removed 46 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 47 rules applied. Total rules applied 94 place count 402 transition count 348
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 95 place count 401 transition count 348
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 94 Pre rules applied. Total rules applied 95 place count 401 transition count 254
Deduced a syphon composed of 94 places in 2 ms
Ensure Unique test removed 16 places
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 204 rules applied. Total rules applied 299 place count 291 transition count 254
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 304 place count 286 transition count 249
Ensure Unique test removed 1 places
Iterating global reduction 3 with 6 rules applied. Total rules applied 310 place count 285 transition count 249
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 118
Deduced a syphon composed of 118 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 3 with 239 rules applied. Total rules applied 549 place count 164 transition count 131
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 551 place count 163 transition count 135
Applied a total of 551 rules in 101 ms. Remains 163 /454 variables (removed 291) and now considering 135/402 (removed 267) transitions.
// Phase 1: matrix 135 rows 163 cols
[2021-05-09 07:34:34] [INFO ] Computed 70 place invariants in 1 ms
[2021-05-09 07:34:34] [INFO ] Implicit Places using invariants in 110 ms returned [3, 4, 5, 6, 15, 16, 20, 21, 22, 23, 24, 25, 48, 49, 50, 53, 54, 138]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 111 ms to find 18 implicit places.
[2021-05-09 07:34:34] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 135 rows 145 cols
[2021-05-09 07:34:34] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-09 07:34:34] [INFO ] Dead Transitions using invariants and state equation in 68 ms returned []
Starting structural reductions, iteration 1 : 145/454 places, 135/402 transitions.
Applied a total of 0 rules in 8 ms. Remains 145 /145 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2021-05-09 07:34:34] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 135 rows 145 cols
[2021-05-09 07:34:34] [INFO ] Computed 52 place invariants in 0 ms
[2021-05-09 07:34:34] [INFO ] Dead Transitions using invariants and state equation in 59 ms returned []
Finished structural reductions, in 2 iterations. Remains : 145/454 places, 135/402 transitions.
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-13-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s37 0) (EQ s41 1)), p0:(AND (EQ s4 0) (OR (EQ s2 0) (EQ s2 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 15178 reset in 370 ms.
Product exploration explored 100000 steps with 15123 reset in 195 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 15202 reset in 254 ms.
Product exploration explored 100000 steps with 15071 reset in 363 ms.
[2021-05-09 07:34:36] [INFO ] Flatten gal took : 15 ms
[2021-05-09 07:34:36] [INFO ] Flatten gal took : 15 ms
[2021-05-09 07:34:36] [INFO ] Time to serialize gal into /tmp/LTL5648890231544394712.gal : 8 ms
[2021-05-09 07:34:36] [INFO ] Time to serialize properties into /tmp/LTL18146434118557707312.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL5648890231544394712.gal, -t, CGAL, -LTL, /tmp/LTL18146434118557707312.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5648890231544394712.gal -t CGAL -LTL /tmp/LTL18146434118557707312.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F((G("((p220==0)||(p276==1))"))||("((p66==0)&&((p31==0)||(p31==1)))")))))
Formula 0 simplified : !GF("((p66==0)&&((p31==0)||(p31==1)))" | G"((p220==0)||(p276==1))")
Reverse transition relation is NOT exact ! Due to transitions t392, t224.t225.t1.t226, t192.t194.t195.t2.t196, t189.t190.t3.t196, t186.t187.t4.t196, t183.t184.t5.t196, t42.t43.t6, t28.t30.t31.t7, t25.t26.t8, t22.t23.t9, t19.t20.t10, t274.t276, t251.t253, t53.t273.t397.t275.t276.t61, t47.t152.t153.t255.t385.t256.t257.t61, t88.t312.t181.t196.t61, t85.t307.t181.t196.t61, t82.t302.t181.t196.t61, t63.t156.t158.t161.t162.t163.t167.t171.t175.t179.t197.t201.t205.t209.t213.t217.t221.t227.t231.t235.t243.t249.t254.t258.t264.t268.t244.t236.t242.t64.t67.t70.t73.t76.t80.t83.t86.t89.t92.t95.t98.t101.t104.t107.t110.t113.t116.t119.t122.t125.t128.t131.t135.t138.t141.t144.t148.t151.t149.t142.t139.t136.t129.t126.t123.t120.t117.t114.t111.t108.t105.t102.t99.t96.t93.t90.t87.t84.t81.t74.t71.t68.t65.t238.t239.t237, t63.t156.t158.t161.t162.t163.t167.t171.t175.t179.t197.t201.t205.t209.t213.t217.t221.t227.t231.t235.t243.t249.t254.t258.t264.t268.t244.t236.t242.t64.t67.t70.t73.t76.t80.t83.t86.t89.t92.t95.t98.t101.t104.t107.t110.t113.t116.t119.t122.t125.t128.t131.t135.t138.t141.t144.t148.t151.t149.t142.t139.t136.t129.t126.t123.t120.t117.t114.t111.t108.t105.t102.t99.t96.t93.t90.t87.t84.t81.t74.t71.t68.t65.t238.t239.t240.t241, t375.t61.t238.t239.t237, t375.t61.t238.t239.t240.t241, t376.t61.t238.t239.t237, t376.t61.t238.t239.t240.t241, t377.t61.t238.t239.t237, t377.t61.t238.t239.t240.t241, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/73/26/135
Computing Next relation with stutter on 1188 deadlock states
1 unique states visited
0 strongly connected components in search stack
1 transitions explored
1 items max in DFS search stack
208 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.11542,91768,1,0,179,306810,261,89,5830,223705,250
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-13-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property BusinessProcesses-PT-13-01 finished in 4372 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 454 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 454/454 places, 402/402 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 447 transition count 395
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 447 transition count 395
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 446 transition count 394
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 446 transition count 394
Applied a total of 16 rules in 49 ms. Remains 446 /454 variables (removed 8) and now considering 394/402 (removed 8) transitions.
// Phase 1: matrix 394 rows 446 cols
[2021-05-09 07:34:38] [INFO ] Computed 90 place invariants in 7 ms
[2021-05-09 07:34:38] [INFO ] Implicit Places using invariants in 198 ms returned []
// Phase 1: matrix 394 rows 446 cols
[2021-05-09 07:34:38] [INFO ] Computed 90 place invariants in 3 ms
[2021-05-09 07:34:39] [INFO ] Implicit Places using invariants and state equation in 501 ms returned []
Implicit Place search using SMT with State Equation took 703 ms to find 0 implicit places.
// Phase 1: matrix 394 rows 446 cols
[2021-05-09 07:34:39] [INFO ] Computed 90 place invariants in 3 ms
[2021-05-09 07:34:39] [INFO ] Dead Transitions using invariants and state equation in 220 ms returned []
Finished structural reductions, in 1 iterations. Remains : 446/454 places, 394/402 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-06 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:(NEQ s129 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 39 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-13-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-06 finished in 1076 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 454 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 454/454 places, 402/402 transitions.
Graph (trivial) has 210 edges and 454 vertex of which 6 / 454 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 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 448 transition count 348
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 95 place count 401 transition count 348
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 98 Pre rules applied. Total rules applied 95 place count 401 transition count 250
Deduced a syphon composed of 98 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 213 rules applied. Total rules applied 308 place count 286 transition count 250
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 315 place count 279 transition count 243
Ensure Unique test removed 1 places
Iterating global reduction 2 with 8 rules applied. Total rules applied 323 place count 278 transition count 243
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 114
Deduced a syphon composed of 114 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 231 rules applied. Total rules applied 554 place count 161 transition count 129
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 556 place count 160 transition count 133
Applied a total of 556 rules in 40 ms. Remains 160 /454 variables (removed 294) and now considering 133/402 (removed 269) transitions.
// Phase 1: matrix 133 rows 160 cols
[2021-05-09 07:34:39] [INFO ] Computed 69 place invariants in 1 ms
[2021-05-09 07:34:39] [INFO ] Implicit Places using invariants in 78 ms returned [1, 5, 6, 7, 8, 15, 16, 20, 21, 22, 23, 24, 25, 49, 50, 51, 52, 53]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 79 ms to find 18 implicit places.
[2021-05-09 07:34:39] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 133 rows 142 cols
[2021-05-09 07:34:39] [INFO ] Computed 51 place invariants in 1 ms
[2021-05-09 07:34:39] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
Starting structural reductions, iteration 1 : 142/454 places, 133/402 transitions.
Applied a total of 0 rules in 4 ms. Remains 142 /142 variables (removed 0) and now considering 133/133 (removed 0) transitions.
[2021-05-09 07:34:39] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 133 rows 142 cols
[2021-05-09 07:34:39] [INFO ] Computed 51 place invariants in 13 ms
[2021-05-09 07:34:39] [INFO ] Dead Transitions using invariants and state equation in 74 ms returned []
Finished structural reductions, in 2 iterations. Remains : 142/454 places, 133/402 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s18 0) (NEQ s2 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 52916 steps with 11527 reset in 170 ms.
FORMULA BusinessProcesses-PT-13-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-10 finished in 480 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p1)&&p0)))], workingDir=/home/mcc/execution]
Support contains 6 out of 454 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 454/454 places, 402/402 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 449 transition count 397
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 449 transition count 397
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 448 transition count 396
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 448 transition count 396
Applied a total of 12 rules in 26 ms. Remains 448 /454 variables (removed 6) and now considering 396/402 (removed 6) transitions.
// Phase 1: matrix 396 rows 448 cols
[2021-05-09 07:34:40] [INFO ] Computed 90 place invariants in 3 ms
[2021-05-09 07:34:40] [INFO ] Implicit Places using invariants in 187 ms returned []
// Phase 1: matrix 396 rows 448 cols
[2021-05-09 07:34:40] [INFO ] Computed 90 place invariants in 3 ms
[2021-05-09 07:34:40] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 667 ms to find 0 implicit places.
// Phase 1: matrix 396 rows 448 cols
[2021-05-09 07:34:40] [INFO ] Computed 90 place invariants in 3 ms
[2021-05-09 07:34:41] [INFO ] Dead Transitions using invariants and state equation in 241 ms returned []
Finished structural reductions, in 1 iterations. Remains : 448/454 places, 396/402 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-13-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(OR (EQ s249 0) (EQ s306 1)), p0:(AND (OR (EQ s211 0) (EQ s266 1)) (OR (EQ s338 0) (EQ s140 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 130 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-13-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-13 finished in 1067 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 454 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 454/454 places, 402/402 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 448 transition count 396
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 448 transition count 396
Applied a total of 12 rules in 29 ms. Remains 448 /454 variables (removed 6) and now considering 396/402 (removed 6) transitions.
// Phase 1: matrix 396 rows 448 cols
[2021-05-09 07:34:41] [INFO ] Computed 90 place invariants in 6 ms
[2021-05-09 07:34:41] [INFO ] Implicit Places using invariants in 186 ms returned []
// Phase 1: matrix 396 rows 448 cols
[2021-05-09 07:34:41] [INFO ] Computed 90 place invariants in 6 ms
[2021-05-09 07:34:41] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 667 ms to find 0 implicit places.
// Phase 1: matrix 396 rows 448 cols
[2021-05-09 07:34:41] [INFO ] Computed 90 place invariants in 3 ms
[2021-05-09 07:34:42] [INFO ] Dead Transitions using invariants and state equation in 206 ms returned []
Finished structural reductions, in 1 iterations. Remains : 448/454 places, 396/402 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : BusinessProcesses-PT-13-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s390 0) (EQ s200 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 611 ms.
Product exploration explored 100000 steps with 50000 reset in 495 ms.
Graph (complete) has 1023 edges and 448 vertex of which 447 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 50000 reset in 445 ms.
Product exploration explored 100000 steps with 50000 reset in 479 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0), true]
Support contains 2 out of 448 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 448/448 places, 396/396 transitions.
Graph (trivial) has 202 edges and 448 vertex of which 6 / 448 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.
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 443 transition count 390
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 93 Pre rules applied. Total rules applied 43 place count 443 transition count 596
Deduced a syphon composed of 135 places in 1 ms
Iterating global reduction 1 with 93 rules applied. Total rules applied 136 place count 443 transition count 596
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 149 place count 430 transition count 547
Deduced a syphon composed of 122 places in 1 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 162 place count 430 transition count 547
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 246 places in 0 ms
Iterating global reduction 1 with 124 rules applied. Total rules applied 286 place count 430 transition count 547
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 317 place count 399 transition count 516
Deduced a syphon composed of 215 places in 0 ms
Iterating global reduction 1 with 31 rules applied. Total rules applied 348 place count 399 transition count 516
Deduced a syphon composed of 215 places in 0 ms
Applied a total of 348 rules in 86 ms. Remains 399 /448 variables (removed 49) and now considering 516/396 (removed -120) transitions.
[2021-05-09 07:34:44] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 516 rows 399 cols
[2021-05-09 07:34:44] [INFO ] Computed 90 place invariants in 7 ms
[2021-05-09 07:34:44] [INFO ] Dead Transitions using invariants and state equation in 267 ms returned []
Finished structural reductions, in 1 iterations. Remains : 399/448 places, 516/396 transitions.
Product exploration explored 100000 steps with 50000 reset in 1643 ms.
Product exploration explored 100000 steps with 50000 reset in 1388 ms.
[2021-05-09 07:34:48] [INFO ] Flatten gal took : 42 ms
[2021-05-09 07:34:48] [INFO ] Flatten gal took : 31 ms
[2021-05-09 07:34:48] [INFO ] Time to serialize gal into /tmp/LTL8159216780670442132.gal : 5 ms
[2021-05-09 07:34:48] [INFO ] Time to serialize properties into /tmp/LTL13412520155985416373.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL8159216780670442132.gal, -t, CGAL, -LTL, /tmp/LTL13412520155985416373.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8159216780670442132.gal -t CGAL -LTL /tmp/LTL13412520155985416373.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X("((p513==0)||(p236==1))")))
Formula 0 simplified : !X"((p513==0)||(p236==1))"
Detected timeout of ITS tools.
[2021-05-09 07:35:03] [INFO ] Flatten gal took : 25 ms
[2021-05-09 07:35:03] [INFO ] Applying decomposition
[2021-05-09 07:35:03] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph1584122416367734258.txt, -o, /tmp/graph1584122416367734258.bin, -w, /tmp/graph1584122416367734258.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph1584122416367734258.bin, -l, -1, -v, -w, /tmp/graph1584122416367734258.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 07:35:03] [INFO ] Decomposing Gal with order
[2021-05-09 07:35:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 07:35:03] [INFO ] Removed a total of 261 redundant transitions.
[2021-05-09 07:35:03] [INFO ] Flatten gal took : 55 ms
[2021-05-09 07:35:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 15 ms.
[2021-05-09 07:35:03] [INFO ] Time to serialize gal into /tmp/LTL8829252100357869633.gal : 6 ms
[2021-05-09 07:35:03] [INFO ] Time to serialize properties into /tmp/LTL15693655526819328139.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL8829252100357869633.gal, -t, CGAL, -LTL, /tmp/LTL15693655526819328139.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8829252100357869633.gal -t CGAL -LTL /tmp/LTL15693655526819328139.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X("((i17.u134.p513==0)||(i0.i1.u73.p236==1))")))
Formula 0 simplified : !X"((i17.u134.p513==0)||(i0.i1.u73.p236==1))"
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t10, t163, t235, t268, t375, t377, t385, t386, t392, t397, i0.i0.u71.t166, i0.i0.u75.t157, i0.i1.u73.t160, i0.i2.u117.t68, i0.i2.u118.t65, i1.t167, i1.u45.t204, i1.u47.t200, i1.u65.t178, i1.u69.t170, i2.u39.t216, i2.u41.t212, i2.u43.t208, i3.u21.t253, i3.u29.t234, i4.t264, i4.t258, i4.u15.t267, i4.u18.t261, i4.u19.t257, i5.u93.t142, i5.u94.t139, i5.u95.t136, i6.u23.t248, i7.t242, i8.i0.u31.t230, i8.i1.u107.t99, i8.i1.u108.t96, i9.i0.u37.t220, i9.i1.u33.t226, i9.i2.u109.t93, i9.i2.u110.t90, i10.i0.u67.t174, i10.i1.u96.t132, i10.i1.u97.t129, i11.i0.u115.t74, i11.i0.u116.t71, i11.i1.u114.t77, i12.u103.t111, i12.u104.t108, i12.u105.t105, i12.u106.t102, i13.u101.t117, i13.u102.t114, i14.u17.t262, i14.u98.t126, i14.u99.t123, i14.u100.t120, i15.u13.t271, i15.u14.t270, i16.i0.u11.t276, i16.i1.u91.t149, i16.i1.u92.t145, i17.t35, i17.t6, i17.u119.t61, i18.t3, i18.t2, i18.i0.t4, i18.i0.t5, i18.i0.u49.t181, i18.i0.u49.t196, i18.i0.u113.t81, i18.i1.u112.t84, i18.i2.u111.t87, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/279/78/393
Computing Next relation with stutter on 1188 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
640 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.45648,209660,1,0,378796,752,6217,724878,310,1767,1013134
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-13-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property BusinessProcesses-PT-13-14 finished in 29622 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 454 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 454/454 places, 402/402 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 447 transition count 395
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 447 transition count 395
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 446 transition count 394
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 446 transition count 394
Applied a total of 16 rules in 35 ms. Remains 446 /454 variables (removed 8) and now considering 394/402 (removed 8) transitions.
// Phase 1: matrix 394 rows 446 cols
[2021-05-09 07:35:10] [INFO ] Computed 90 place invariants in 6 ms
[2021-05-09 07:35:10] [INFO ] Implicit Places using invariants in 175 ms returned []
// Phase 1: matrix 394 rows 446 cols
[2021-05-09 07:35:10] [INFO ] Computed 90 place invariants in 3 ms
[2021-05-09 07:35:11] [INFO ] Implicit Places using invariants and state equation in 476 ms returned []
Implicit Place search using SMT with State Equation took 651 ms to find 0 implicit places.
// Phase 1: matrix 394 rows 446 cols
[2021-05-09 07:35:11] [INFO ] Computed 90 place invariants in 2 ms
[2021-05-09 07:35:11] [INFO ] Dead Transitions using invariants and state equation in 184 ms returned []
Finished structural reductions, in 1 iterations. Remains : 446/454 places, 394/402 transitions.
Stuttering acceptance computed with spot in 61 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-15 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:(OR (EQ s174 0) (EQ s437 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]]
Product exploration explored 100000 steps with 708 reset in 142 ms.
Product exploration explored 100000 steps with 717 reset in 152 ms.
Graph (complete) has 1021 edges and 446 vertex of which 445 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 719 reset in 167 ms.
Product exploration explored 100000 steps with 712 reset in 154 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 446 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 446/446 places, 394/394 transitions.
Graph (trivial) has 203 edges and 446 vertex of which 6 / 446 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.
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 441 transition count 388
Performed 91 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 91 Pre rules applied. Total rules applied 45 place count 441 transition count 593
Deduced a syphon composed of 135 places in 1 ms
Iterating global reduction 1 with 91 rules applied. Total rules applied 136 place count 441 transition count 593
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 150 place count 427 transition count 543
Deduced a syphon composed of 121 places in 1 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 164 place count 427 transition count 543
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 245 places in 0 ms
Iterating global reduction 1 with 124 rules applied. Total rules applied 288 place count 427 transition count 543
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 320 place count 395 transition count 511
Deduced a syphon composed of 213 places in 1 ms
Iterating global reduction 1 with 32 rules applied. Total rules applied 352 place count 395 transition count 511
Deduced a syphon composed of 213 places in 0 ms
Applied a total of 352 rules in 87 ms. Remains 395 /446 variables (removed 51) and now considering 511/394 (removed -117) transitions.
[2021-05-09 07:35:12] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 511 rows 395 cols
[2021-05-09 07:35:12] [INFO ] Computed 90 place invariants in 10 ms
[2021-05-09 07:35:13] [INFO ] Dead Transitions using invariants and state equation in 280 ms returned []
Finished structural reductions, in 1 iterations. Remains : 395/446 places, 511/394 transitions.
Product exploration explored 100000 steps with 25000 reset in 1102 ms.
Product exploration explored 100000 steps with 25000 reset in 766 ms.
[2021-05-09 07:35:14] [INFO ] Flatten gal took : 38 ms
[2021-05-09 07:35:15] [INFO ] Flatten gal took : 25 ms
[2021-05-09 07:35:15] [INFO ] Time to serialize gal into /tmp/LTL16645934224356176883.gal : 3 ms
[2021-05-09 07:35:15] [INFO ] Time to serialize properties into /tmp/LTL11173025515015428159.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL16645934224356176883.gal, -t, CGAL, -LTL, /tmp/LTL11173025515015428159.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL16645934224356176883.gal -t CGAL -LTL /tmp/LTL11173025515015428159.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(G("((p202==0)||(p584==1))"))))
Formula 0 simplified : !XG"((p202==0)||(p584==1))"
Detected timeout of ITS tools.
[2021-05-09 07:35:30] [INFO ] Flatten gal took : 12 ms
[2021-05-09 07:35:30] [INFO ] Applying decomposition
[2021-05-09 07:35:30] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph5414950937694956240.txt, -o, /tmp/graph5414950937694956240.bin, -w, /tmp/graph5414950937694956240.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph5414950937694956240.bin, -l, -1, -v, -w, /tmp/graph5414950937694956240.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 07:35:30] [INFO ] Decomposing Gal with order
[2021-05-09 07:35:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 07:35:30] [INFO ] Removed a total of 269 redundant transitions.
[2021-05-09 07:35:30] [INFO ] Flatten gal took : 26 ms
[2021-05-09 07:35:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 8 ms.
[2021-05-09 07:35:30] [INFO ] Time to serialize gal into /tmp/LTL4344414856130806292.gal : 4 ms
[2021-05-09 07:35:30] [INFO ] Time to serialize properties into /tmp/LTL14735713758990635610.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4344414856130806292.gal, -t, CGAL, -LTL, /tmp/LTL14735713758990635610.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4344414856130806292.gal -t CGAL -LTL /tmp/LTL14735713758990635610.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(G("((i10.i0.u65.p202==0)||(i10.i0.u153.p584==1))"))))
Formula 0 simplified : !XG"((i10.i0.u65.p202==0)||(i10.i0.u153.p584==1))"
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t10, t163, t235, t258, t375, t376, t377, t384, t386, t392, t397, i0.i0.u76.t157, i0.i0.u118.t65, i0.i1.u72.t166, i0.i2.u115.t74, i0.i2.u116.t71, i0.i2.u117.t68, i1.u46.t204, i1.u48.t200, i2.u38.t220, i3.u32.t230, i3.u40.t216, i4.i0.t264, i4.i0.t268, i4.i0.u12.t276, i4.i0.u14.t271, i4.i0.u15.t270, i4.i0.u16.t267, i4.i0.u96.t132, i4.i1.u92.t145, i4.i1.u93.t142, i5.i0.u18.t262, i5.i0.u19.t261, i5.i1.u97.t129, i5.i1.u98.t126, i5.i1.u99.t123, i6.i0.u20.t257, i6.i1.u91.t149, i7.i0.u22.t253, i7.i0.u24.t248, i8.i0.t242, i8.i1.t6, i8.i1.u119.t61, i9.u30.t234, i10.t5, i10.t3, i10.t2, i10.i0.t4, i10.i0.u50.t181, i10.i0.u50.t196, i10.i0.u111.t87, i10.i0.u113.t81, i10.i1.u112.t84, i11.t167, i11.u68.t174, i11.u70.t170, i12.u74.t160, i13.i0.u42.t212, i13.i0.u44.t208, i13.i1.u114.t77, i14.i0.u34.t226, i14.i1.u108.t96, i14.i1.u109.t93, i14.i1.u110.t90, i15.u105.t105, i15.u106.t102, i15.u107.t99, i16.u100.t120, i16.u101.t117, i16.u102.t114, i16.u103.t111, i16.u104.t108, i17.i0.u66.t178, i17.i1.u94.t139, i17.i1.u95.t136, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/279/78/393
Computing Next relation with stutter on 1188 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
1067 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,10.71,413248,1,0,829989,678,7275,1.58643e+06,286,2055,1633686
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-13-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property BusinessProcesses-PT-13-15 finished in 31977 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620545742984

--------------------
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-13"
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-13, 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-162038143900420"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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