Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r072-tall-174860067200291.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is DLCshifumi-PT-2a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r072-tall-174860067200291
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 656K
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 213K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748687843139

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCshifumi-PT-2a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-31 10:37:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-31 10:37:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 10:37:24] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2025-05-31 10:37:24] [INFO ] Transformed 188 places.
[2025-05-31 10:37:24] [INFO ] Transformed 888 transitions.
[2025-05-31 10:37:24] [INFO ] Found NUPN structural information;
[2025-05-31 10:37:24] [INFO ] Parsed PT model containing 188 places and 888 transitions and 3166 arcs in 184 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
FORMULA DLCshifumi-PT-2a-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-2a-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-2a-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-2a-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-2a-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-2a-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-2a-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 760/760 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 159 transition count 613
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 159 transition count 613
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 70 place count 159 transition count 601
Drop transitions (Redundant composition of simpler transitions.) removed 156 transitions
Redundant transition composition rules discarded 156 transitions
Iterating global reduction 1 with 156 rules applied. Total rules applied 226 place count 159 transition count 445
Applied a total of 226 rules in 63 ms. Remains 159 /188 variables (removed 29) and now considering 445/760 (removed 315) transitions.
[2025-05-31 10:37:24] [INFO ] Flow matrix only has 143 transitions (discarded 302 similar events)
// Phase 1: matrix 143 rows 159 cols
[2025-05-31 10:37:24] [INFO ] Computed 79 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 10:37:25] [INFO ] Implicit Places using invariants in 391 ms returned [98, 99, 102, 103, 104, 105, 106, 107, 108, 109, 110, 113, 114, 115, 116, 117, 118, 119, 120, 121, 125, 127, 128, 131, 132, 133, 134, 135, 138, 139, 140, 141, 142, 143, 144, 146, 147, 148, 149, 150, 151, 152, 153, 154, 156, 157, 158]
Discarding 47 places :
Ensure Unique test removed 187 transitions
Reduce isomorphic transitions removed 187 transitions.
Implicit Place search using SMT only with invariants took 423 ms to find 47 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 112/188 places, 258/760 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 71 transitions
Redundant transition composition rules discarded 71 transitions
Iterating global reduction 0 with 71 rules applied. Total rules applied 71 place count 112 transition count 187
Applied a total of 71 rules in 5 ms. Remains 112 /112 variables (removed 0) and now considering 187/258 (removed 71) transitions.
[2025-05-31 10:37:25] [INFO ] Flow matrix only has 143 transitions (discarded 44 similar events)
// Phase 1: matrix 143 rows 112 cols
[2025-05-31 10:37:25] [INFO ] Computed 32 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 10:37:25] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-05-31 10:37:25] [INFO ] Flow matrix only has 143 transitions (discarded 44 similar events)
[2025-05-31 10:37:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 10:37:25] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-31 10:37:25] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 112/188 places, 187/760 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 644 ms. Remains : 112/188 places, 187/760 transitions.
Support contains 34 out of 112 places after structural reductions.
[2025-05-31 10:37:25] [INFO ] Flatten gal took : 27 ms
[2025-05-31 10:37:25] [INFO ] Flatten gal took : 11 ms
[2025-05-31 10:37:25] [INFO ] Input system was already deterministic with 187 transitions.
Support contains 32 out of 112 places (down from 34) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1307 ms. (30 steps per ms) remains 5/22 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 157 ms. (253 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 101 ms. (392 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 5/5 properties
[2025-05-31 10:37:26] [INFO ] Flow matrix only has 143 transitions (discarded 44 similar events)
[2025-05-31 10:37:26] [INFO ] Invariant cache hit.
[2025-05-31 10:37:26] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp1 is UNSAT
At refinement iteration 1 (OVERLAPS) 10/20 variables, 10/10 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 92/112 variables, 22/32 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 142/254 variables, 112/144 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 2/146 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 0/146 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/255 variables, 1/147 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/255 variables, 0/147 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/255 variables, 0/147 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 255/255 variables, and 147 constraints, problems are : Problem set: 1 solved, 4 unsolved in 198 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, State Equation: 112/112 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp17 is UNSAT
After SMT solving in domain Int declared 18/255 variables, and 8 constraints, problems are : Problem set: 5 solved, 0 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 8/32 constraints, State Equation: 0/112 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 0/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 258ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA DLCshifumi-PT-2a-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 5 atomic propositions for a total of 8 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA DLCshifumi-PT-2a-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-2a-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 16 stabilizing places and 1 stable transitions
Graph (complete) has 224 edges and 112 vertex of which 99 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.3 ms
FORMULA DLCshifumi-PT-2a-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&X(p0)))))'
Support contains 1 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 187/187 transitions.
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 99 transition count 187
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 19 place count 93 transition count 175
Iterating global reduction 1 with 6 rules applied. Total rules applied 25 place count 93 transition count 175
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 28 place count 93 transition count 172
Applied a total of 28 rules in 7 ms. Remains 93 /112 variables (removed 19) and now considering 172/187 (removed 15) transitions.
[2025-05-31 10:37:26] [INFO ] Flow matrix only has 135 transitions (discarded 37 similar events)
// Phase 1: matrix 135 rows 93 cols
[2025-05-31 10:37:26] [INFO ] Computed 18 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 10:37:26] [INFO ] Implicit Places using invariants in 31 ms returned [92]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 92/112 places, 172/187 transitions.
Applied a total of 0 rules in 1 ms. Remains 92 /92 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42 ms. Remains : 92/112 places, 172/187 transitions.
Stuttering acceptance computed with spot in 268 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : DLCshifumi-PT-2a-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 22 steps with 5 reset in 3 ms.
FORMULA DLCshifumi-PT-2a-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2a-LTLCardinality-00 finished in 375 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(((F(p0) U p1) U (p2 U X(X(p3)))))||G(p4)))'
Support contains 7 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 187/187 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 101 transition count 187
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 15 place count 97 transition count 179
Iterating global reduction 1 with 4 rules applied. Total rules applied 19 place count 97 transition count 179
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 22 place count 97 transition count 176
Applied a total of 22 rules in 8 ms. Remains 97 /112 variables (removed 15) and now considering 176/187 (removed 11) transitions.
[2025-05-31 10:37:27] [INFO ] Flow matrix only has 136 transitions (discarded 40 similar events)
// Phase 1: matrix 136 rows 97 cols
[2025-05-31 10:37:27] [INFO ] Computed 21 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 10:37:27] [INFO ] Implicit Places using invariants in 41 ms returned [93]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 42 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 96/112 places, 176/187 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 96 transition count 174
Applied a total of 2 rules in 4 ms. Remains 96 /96 variables (removed 0) and now considering 174/176 (removed 2) transitions.
[2025-05-31 10:37:27] [INFO ] Flow matrix only has 136 transitions (discarded 38 similar events)
// Phase 1: matrix 136 rows 96 cols
[2025-05-31 10:37:27] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 10:37:27] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-05-31 10:37:27] [INFO ] Flow matrix only has 136 transitions (discarded 38 similar events)
[2025-05-31 10:37:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 10:37:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 10:37:27] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 96/112 places, 174/187 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 167 ms. Remains : 96/112 places, 174/187 transitions.
Stuttering acceptance computed with spot in 1419 ms :[(AND (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p3) (NOT p4)), (AND (NOT p0) (NOT p3) (NOT p4) p1), (AND (NOT p1) (NOT p3) (NOT p4)), (AND (NOT p0) p1 (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p4)), (AND (NOT p0) (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p3) (NOT p4)), (AND (NOT p0) p1 (NOT p3) (NOT p4)), (AND (NOT p0) (NOT p4) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p4)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p4)), (AND (NOT p1) (NOT p4))]
Running random walk in product with property : DLCshifumi-PT-2a-LTLCardinality-02
Product exploration explored 100000 steps with 25057 reset in 395 ms.
Product exploration explored 100000 steps with 25066 reset in 291 ms.
Computed a total of 4 stabilizing places and 1 stable transitions
Graph (complete) has 193 edges and 96 vertex of which 93 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 4 stabilizing places and 1 stable transitions
Detected a total of 4/96 stabilizing places and 1/174 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/5 atomic propositions.
Knowledge obtained : [(AND (NOT p4) p2 p1 p0 (NOT p3)), (X (NOT p2)), (X (NOT (AND (NOT p4) (NOT p2) (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X p4), (X (NOT (AND (NOT p4) p2 (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p4) (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p4 p2 (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p4 (NOT p2) (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (AND p4 (NOT p2) (NOT p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p4) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p4) p1 (NOT p0))))), (X (X (NOT (AND (NOT p4) (NOT p1))))), (X (X p4)), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p4 (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p4) p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND (NOT p4) (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p4 p2 p1 (NOT p0))))), (X (X (NOT (AND (NOT p4) p2 p1 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p4) (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p4 p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND p4 p1 (NOT p0))))), (X (X (NOT (AND (NOT p4) (NOT p1) (NOT p0))))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X (AND p4 (NOT p1)))), (X (X (NOT (AND p4 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p4 (NOT p1) (NOT p0)))), (X (X (NOT (AND p4 (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND p4 (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND p4 (NOT p2) (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (X (X (AND p4 (NOT p2) (NOT p1)))), (X (X (NOT (AND p4 (NOT p2) (NOT p1)))))]
Knowledge based reduction with 33 factoid took 1006 ms. Reduced automaton from 27 states, 86 edges and 5 AP (stutter sensitive) to 11 states, 20 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 539 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 472 ms. (84 steps per ms) remains 8/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 225 ms. (177 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 303 ms. (131 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 161 ms. (246 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 63 ms. (625 steps per ms) remains 8/8 properties
[2025-05-31 10:37:31] [INFO ] Flow matrix only has 136 transitions (discarded 38 similar events)
[2025-05-31 10:37:31] [INFO ] Invariant cache hit.
[2025-05-31 10:37:31] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem apf3 is UNSAT
Problem apf6 is UNSAT
Problem apf12 is UNSAT
At refinement iteration 1 (OVERLAPS) 21/28 variables, 7/7 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 68/96 variables, 13/20 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/20 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 135/231 variables, 96/116 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/116 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1/232 variables, 1/117 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 0/117 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/232 variables, 0/117 constraints. Problems are: Problem set: 3 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 232/232 variables, and 117 constraints, problems are : Problem set: 3 solved, 5 unsolved in 189 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 96/96 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 5 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 5 unsolved
Problem apf1 is UNSAT
Problem apf2 is UNSAT
Problem apf7 is UNSAT
Problem apf9 is UNSAT
Problem apf11 is UNSAT
After SMT solving in domain Int declared 28/232 variables, and 7 constraints, problems are : Problem set: 8 solved, 0 unsolved in 41 ms.
Refiners :[Positive P Invariants (semi-flows): 7/20 constraints, State Equation: 0/96 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 241ms problems are : Problem set: 8 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 8 invariant AP formulas.
Knowledge obtained : [(AND (NOT p4) p2 p1 p0 (NOT p3)), (X (NOT p2)), (X (NOT (AND (NOT p4) (NOT p2) (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X p4), (X (NOT (AND (NOT p4) p2 (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p4) (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p4 p2 (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p4 (NOT p2) (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (AND p4 (NOT p2) (NOT p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p4) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p4) p1 (NOT p0))))), (X (X (NOT (AND (NOT p4) (NOT p1))))), (X (X p4)), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p4 (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p4) p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND (NOT p4) (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p4 p2 p1 (NOT p0))))), (X (X (NOT (AND (NOT p4) p2 p1 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p4) (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p4 p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND p4 p1 (NOT p0))))), (X (X (NOT (AND (NOT p4) (NOT p1) (NOT p0))))), (F (OR (G p3) (G (NOT p3)))), (G (OR p1 p2 p3)), (G (OR p1 p3)), (G (OR (NOT p1) p2 p0 p3)), (G (OR p1 (NOT p2) p0 p3)), (G (OR (NOT p1) (NOT p2) p0 p3)), (G (OR p0 p3)), (G (OR p1 p2 p0 p3)), (G (OR p1 p0 p3))]
False Knowledge obtained : [(X (X (AND p4 (NOT p1)))), (X (X (NOT (AND p4 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p4 (NOT p1) (NOT p0)))), (X (X (NOT (AND p4 (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND p4 (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND p4 (NOT p2) (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (X (X (AND p4 (NOT p2) (NOT p1)))), (X (X (NOT (AND p4 (NOT p2) (NOT p1))))), (F p3), (F (NOT p1)), (F (NOT (OR p1 p0))), (F (NOT p2)), (F (NOT p0))]
Knowledge based reduction with 41 factoid took 1291 ms. Reduced automaton from 11 states, 20 edges and 4 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 138 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3)]
[2025-05-31 10:37:33] [INFO ] Flow matrix only has 136 transitions (discarded 38 similar events)
[2025-05-31 10:37:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 10:37:33] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2025-05-31 10:37:33] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2025-05-31 10:37:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 10:37:33] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-05-31 10:37:33] [INFO ] Computed and/alt/rep : 134/277/134 causal constraints (skipped 1 transitions) in 7 ms.
[2025-05-31 10:37:33] [INFO ] Added : 0 causal constraints over 0 iterations in 21 ms. Result :sat
Could not prove EG (NOT p3)
Support contains 1 out of 96 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 174/174 transitions.
Applied a total of 0 rules in 2 ms. Remains 96 /96 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2025-05-31 10:37:33] [INFO ] Flow matrix only has 136 transitions (discarded 38 similar events)
[2025-05-31 10:37:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 10:37:33] [INFO ] Implicit Places using invariants in 29 ms returned []
[2025-05-31 10:37:33] [INFO ] Flow matrix only has 136 transitions (discarded 38 similar events)
[2025-05-31 10:37:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 10:37:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 10:37:33] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Running 173 sub problems to find dead transitions.
[2025-05-31 10:37:33] [INFO ] Flow matrix only has 136 transitions (discarded 38 similar events)
[2025-05-31 10:37:33] [INFO ] Invariant cache hit.
[2025-05-31 10:37:33] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (OVERLAPS) 3/96 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (OVERLAPS) 135/231 variables, 96/116 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (OVERLAPS) 1/232 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 9 (OVERLAPS) 0/232 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 232/232 variables, and 117 constraints, problems are : Problem set: 0 solved, 173 unsolved in 7582 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 96/96 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 173 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (OVERLAPS) 3/96 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (OVERLAPS) 135/231 variables, 96/116 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 173/289 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 8 (OVERLAPS) 1/232 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/232 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 10 (OVERLAPS) 0/232 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Int declared 232/232 variables, and 290 constraints, problems are : Problem set: 0 solved, 173 unsolved in 6646 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 96/96 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14261ms problems are : Problem set: 0 solved, 173 unsolved
Search for dead transitions found 0 dead transitions in 14263ms
Finished structural reductions in LTL mode , in 1 iterations and 14355 ms. Remains : 96/96 places, 174/174 transitions.
Computed a total of 4 stabilizing places and 1 stable transitions
Graph (complete) has 193 edges and 96 vertex of which 93 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Computed a total of 4 stabilizing places and 1 stable transitions
Detected a total of 4/96 stabilizing places and 1/174 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p3), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3)]
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p3), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F p3)]
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 156 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3)]
[2025-05-31 10:37:48] [INFO ] Flow matrix only has 136 transitions (discarded 38 similar events)
[2025-05-31 10:37:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 10:37:48] [INFO ] [Real]Absence check using 20 positive place invariants in 2 ms returned sat
[2025-05-31 10:37:48] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-05-31 10:37:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 10:37:48] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-05-31 10:37:48] [INFO ] Computed and/alt/rep : 134/277/134 causal constraints (skipped 1 transitions) in 7 ms.
[2025-05-31 10:37:48] [INFO ] Added : 0 causal constraints over 0 iterations in 23 ms. Result :sat
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 159 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Product exploration explored 100000 steps with 25000 reset in 205 ms.
Product exploration explored 100000 steps with 25000 reset in 209 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 165 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 174/174 transitions.
Graph (trivial) has 173 edges and 96 vertex of which 92 / 96 are part of one of the 17 SCC in 4 ms
Free SCC test removed 75 places
Ensure Unique test removed 156 transitions
Reduce isomorphic transitions removed 156 transitions.
Graph (complete) has 37 edges and 21 vertex of which 19 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 18 place count 3 transition count 2
Iterating global reduction 0 with 16 rules applied. Total rules applied 34 place count 3 transition count 2
Applied a total of 34 rules in 16 ms. Remains 3 /96 variables (removed 93) and now considering 2/174 (removed 172) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 10:37:49] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
// Phase 1: matrix 2 rows 3 cols
[2025-05-31 10:37:49] [INFO ] Computed 2 invariants in 0 ms
[2025-05-31 10:37:49] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/4 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/5 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/5 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5/5 variables, and 6 constraints, problems are : Problem set: 0 solved, 1 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/4 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/5 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/5 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5/5 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 30 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 65ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 65ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3/96 places, 2/174 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 87 ms. Remains : 3/96 places, 2/174 transitions.
Built C files in :
/tmp/ltsmin6869860716231318895
[2025-05-31 10:37:49] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6869860716231318895
Running compilation step : cd /tmp/ltsmin6869860716231318895;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 349 ms.
Running link step : cd /tmp/ltsmin6869860716231318895;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin6869860716231318895;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13019916392524052384.hoa' '--buchi-type=spotba'
LTSmin run took 196 ms.
FORMULA DLCshifumi-PT-2a-LTLCardinality-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DLCshifumi-PT-2a-LTLCardinality-02 finished in 23262 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(F(p0)))))))'
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 187/187 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 100 transition count 187
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 18 place count 94 transition count 175
Iterating global reduction 1 with 6 rules applied. Total rules applied 24 place count 94 transition count 175
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 27 place count 94 transition count 172
Applied a total of 27 rules in 6 ms. Remains 94 /112 variables (removed 18) and now considering 172/187 (removed 15) transitions.
[2025-05-31 10:37:50] [INFO ] Flow matrix only has 135 transitions (discarded 37 similar events)
// Phase 1: matrix 135 rows 94 cols
[2025-05-31 10:37:50] [INFO ] Computed 19 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 10:37:50] [INFO ] Implicit Places using invariants in 35 ms returned [92]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 36 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 93/112 places, 172/187 transitions.
Applied a total of 0 rules in 1 ms. Remains 93 /93 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 45 ms. Remains : 93/112 places, 172/187 transitions.
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DLCshifumi-PT-2a-LTLCardinality-10
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DLCshifumi-PT-2a-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2a-LTLCardinality-10 finished in 258 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 187/187 transitions.
Graph (trivial) has 180 edges and 112 vertex of which 90 / 112 are part of one of the 17 SCC in 0 ms
Free SCC test removed 73 places
Ensure Unique test removed 156 transitions
Reduce isomorphic transitions removed 156 transitions.
Graph (complete) has 68 edges and 39 vertex of which 26 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (trivial) has 11 edges and 8 vertex of which 5 / 8 are part of one of the 1 SCC in 0 ms
Free SCC test removed 4 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 35 rules applied. Total rules applied 37 place count 4 transition count 13
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 48 place count 2 transition count 4
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 2 transition count 3
Applied a total of 49 rules in 5 ms. Remains 2 /112 variables (removed 110) and now considering 3/187 (removed 184) transitions.
// Phase 1: matrix 3 rows 2 cols
[2025-05-31 10:37:50] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 10:37:50] [INFO ] Implicit Places using invariants in 16 ms returned []
[2025-05-31 10:37:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 10:37:50] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 10:37:50] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2025-05-31 10:37:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 21 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 22 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 47ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/112 places, 3/187 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 92 ms. Remains : 2/112 places, 3/187 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCshifumi-PT-2a-LTLCardinality-12
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA DLCshifumi-PT-2a-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2a-LTLCardinality-12 finished in 183 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 4 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 187/187 transitions.
Graph (trivial) has 172 edges and 112 vertex of which 83 / 112 are part of one of the 16 SCC in 1 ms
Free SCC test removed 67 places
Ensure Unique test removed 145 transitions
Reduce isomorphic transitions removed 145 transitions.
Graph (complete) has 79 edges and 45 vertex of which 32 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 32 transition count 41
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 5 rules applied. Total rules applied 8 place count 31 transition count 37
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 13 place count 27 transition count 36
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 25 place count 15 transition count 24
Iterating global reduction 3 with 12 rules applied. Total rules applied 37 place count 15 transition count 24
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 39 place count 14 transition count 23
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 41 place count 13 transition count 23
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 43 place count 13 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 45 place count 13 transition count 19
Applied a total of 45 rules in 14 ms. Remains 13 /112 variables (removed 99) and now considering 19/187 (removed 168) transitions.
[2025-05-31 10:37:50] [INFO ] Flow matrix only has 12 transitions (discarded 7 similar events)
// Phase 1: matrix 12 rows 13 cols
[2025-05-31 10:37:50] [INFO ] Computed 7 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 10:37:50] [INFO ] Implicit Places using invariants in 20 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 21 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/112 places, 19/187 transitions.
Graph (trivial) has 8 edges and 12 vertex of which 2 / 12 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 11 transition count 15
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 10 transition count 14
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 10 transition count 14
Applied a total of 4 rules in 2 ms. Remains 10 /12 variables (removed 2) and now considering 14/19 (removed 5) transitions.
[2025-05-31 10:37:50] [INFO ] Flow matrix only has 10 transitions (discarded 4 similar events)
// Phase 1: matrix 10 rows 10 cols
[2025-05-31 10:37:50] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 10:37:50] [INFO ] Implicit Places using invariants in 17 ms returned []
[2025-05-31 10:37:50] [INFO ] Flow matrix only has 10 transitions (discarded 4 similar events)
[2025-05-31 10:37:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 10:37:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 10:37:50] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/112 places, 14/187 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 85 ms. Remains : 10/112 places, 14/187 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DLCshifumi-PT-2a-LTLCardinality-13
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DLCshifumi-PT-2a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2a-LTLCardinality-13 finished in 219 ms.
All properties solved by simple procedures.
Total runtime 26616 ms.

BK_STOP 1748687871004

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="DLCshifumi-PT-2a"
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-5832"
echo " Executing tool itstools"
echo " Input is DLCshifumi-PT-2a, 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 r072-tall-174860067200291"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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