fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r030-smll-174853813500206
Last Updated
June 24, 2025

About the Execution of ITS-Tools for CANConstruction-PT-050

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 3600000.00 0.00 0.00 ?FFFTFTFTFTFTT?F normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r030-smll-174853813500206.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 CANConstruction-PT-050, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-smll-174853813500206
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.3M
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 3.8M 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 CANConstruction-PT-050-ReachabilityCardinality-2024-01
FORMULA_NAME CANConstruction-PT-050-ReachabilityCardinality-2025-00
FORMULA_NAME CANConstruction-PT-050-ReachabilityCardinality-2025-02
FORMULA_NAME CANConstruction-PT-050-ReachabilityCardinality-2025-03
FORMULA_NAME CANConstruction-PT-050-ReachabilityCardinality-2025-04
FORMULA_NAME CANConstruction-PT-050-ReachabilityCardinality-2025-05
FORMULA_NAME CANConstruction-PT-050-ReachabilityCardinality-2025-06
FORMULA_NAME CANConstruction-PT-050-ReachabilityCardinality-2025-07
FORMULA_NAME CANConstruction-PT-050-ReachabilityCardinality-2025-08
FORMULA_NAME CANConstruction-PT-050-ReachabilityCardinality-2025-09
FORMULA_NAME CANConstruction-PT-050-ReachabilityCardinality-2025-10
FORMULA_NAME CANConstruction-PT-050-ReachabilityCardinality-2025-11
FORMULA_NAME CANConstruction-PT-050-ReachabilityCardinality-2025-12
FORMULA_NAME CANConstruction-PT-050-ReachabilityCardinality-2025-13
FORMULA_NAME CANConstruction-PT-050-ReachabilityCardinality-2025-14
FORMULA_NAME CANConstruction-PT-050-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1748671360132

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-050
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-05-31 06:02:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-31 06:02:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 06:02:43] [INFO ] Load time of PNML (sax parser for PT used): 765 ms
[2025-05-31 06:02:43] [INFO ] Transformed 5602 places.
[2025-05-31 06:02:43] [INFO ] Transformed 10400 transitions.
[2025-05-31 06:02:43] [INFO ] Parsed PT model containing 5602 places and 10400 transitions and 31000 arcs in 1086 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 46 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (42 resets) in 3836 ms. (10 steps per ms) remains 7/16 properties
FORMULA CANConstruction-PT-050-ReachabilityCardinality-2025-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityCardinality-2025-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityCardinality-2025-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityCardinality-2025-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityCardinality-2025-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityCardinality-2025-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 1688 ms. (23 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 221 ms. (180 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 451 ms. (88 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 587 ms. (68 steps per ms) remains 7/7 properties
// Phase 1: matrix 10400 rows 5602 cols
[2025-05-31 06:02:46] [INFO ] Flatten gal took : 1296 ms
[2025-05-31 06:02:46] [INFO ] Computed 101 invariants in 227 ms
[2025-05-31 06:02:46] [INFO ] State equation strengthened by 4950 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
[2025-05-31 06:02:46] [INFO ] Flatten gal took : 413 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 06:02:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15745766809561118292.gal : 302 ms
[2025-05-31 06:02:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3787740906457192645.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15745766809561118292.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3787740906457192645.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem CANConstruction-PT-050-ReachabilityCardinality-2025-05 is UNSAT
FORMULA CANConstruction-PT-050-ReachabilityCardinality-2025-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem CANConstruction-PT-050-ReachabilityCardinality-2025-12 is UNSAT
FORMULA CANConstruction-PT-050-ReachabilityCardinality-2025-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 5403/5549 variables, 48/48 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Loading property file /tmp/ReachabilityCardinality3787740906457192645.prop.
At refinement iteration 2 (INCLUDED_ONLY) 0/5549 variables, 1/49 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5549 variables, 0/49 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 3/5552 variables, 3/52 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5552 variables, 0/52 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 49/5601 variables, 49/101 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5601 variables, 0/101 constraints. Problems are: Problem set: 2 solved, 5 unsolved
SMT process timed out in 5830ms, After SMT, problems are : Problem set: 2 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 110 out of 5602 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5602/5602 places, 10400/10400 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 317 transitions
Trivial Post-agglo rules discarded 317 transitions
Performed 317 trivial Post agglomeration. Transition count delta: 317
Iterating post reduction 0 with 317 rules applied. Total rules applied 317 place count 5602 transition count 10083
Reduce places removed 317 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 327 rules applied. Total rules applied 644 place count 5285 transition count 10073
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 654 place count 5275 transition count 10073
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 654 place count 5275 transition count 10066
Deduced a syphon composed of 7 places in 10 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 668 place count 5268 transition count 10066
Discarding 2355 places :
Symmetric choice reduction at 3 with 2355 rule applications. Total rules 3023 place count 2913 transition count 5356
Iterating global reduction 3 with 2355 rules applied. Total rules applied 5378 place count 2913 transition count 5356
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 4 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 5462 place count 2871 transition count 5314
Free-agglomeration rule applied 36 times.
Iterating global reduction 3 with 36 rules applied. Total rules applied 5498 place count 2871 transition count 5278
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 3 with 36 rules applied. Total rules applied 5534 place count 2835 transition count 5278
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 5540 place count 2835 transition count 5272
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 5546 place count 2829 transition count 5272
Partial Free-agglomeration rule applied 65 times.
Drop transitions (Partial Free agglomeration) removed 65 transitions
Iterating global reduction 5 with 65 rules applied. Total rules applied 5611 place count 2829 transition count 5272
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 5614 place count 2829 transition count 5272
Applied a total of 5614 rules in 4440 ms. Remains 2829 /5602 variables (removed 2773) and now considering 5272/10400 (removed 5128) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4454 ms. Remains : 2829/5602 places, 5272/10400 transitions.
RANDOM walk for 40000 steps (107 resets) in 1363 ms. (29 steps per ms) remains 2/5 properties
FORMULA CANConstruction-PT-050-ReachabilityCardinality-2025-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityCardinality-2025-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 336 ms. (118 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 228 ms. (174 steps per ms) remains 2/2 properties
// Phase 1: matrix 5272 rows 2829 cols
[2025-05-31 06:02:57] [INFO ] Computed 101 invariants in 62 ms
[2025-05-31 06:02:57] [INFO ] State equation strengthened by 5021 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2669/2773 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2773 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2773 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 6/2779 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2779 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 49/2828 variables, 49/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2828 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 5272/8100 variables, 2828/2929 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8100 variables, 5021/7950 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8100 variables, 0/7950 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/8101 variables, 1/7951 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/8101 variables, 0/7951 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/8101 variables, 0/7951 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8101/8101 variables, and 7951 constraints, problems are : Problem set: 0 solved, 2 unsolved in 8855 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 2829/2829 constraints, ReadFeed: 5021/5021 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2669/2773 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2773 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:10] [INFO ] Deduced a trap composed of 2 places in 3707 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:26] [INFO ] Deduced a trap composed of 54 places in 15185 ms of which 12019 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:34] [INFO ] Deduced a trap composed of 53 places in 7873 ms of which 4637 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 52
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :52 after 53
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :53 after 55
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :55 after 58
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :58 after 64
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :64 after 75
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :75 after 97
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :97 after 106
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :106 after 118
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :118 after 134
[2025-05-31 06:03:47] [INFO ] Deduced a trap composed of 53 places in 13070 ms of which 10068 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:53] [INFO ] Deduced a trap composed of 53 places in 5695 ms of which 2538 ms to minimize.
SMT process timed out in 55880ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 104 out of 2829 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2829/2829 places, 5272/5272 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2827 transition count 5270
Applied a total of 4 rules in 698 ms. Remains 2827 /2829 variables (removed 2) and now considering 5270/5272 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 698 ms. Remains : 2827/2829 places, 5270/5272 transitions.
RANDOM walk for 40000 steps (107 resets) in 1485 ms. (26 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 432 ms. (92 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 237 ms. (168 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 77555 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :0 out of 2
Probabilistic random walk after 77555 steps, saw 39464 distinct states, run finished after 3010 ms. (steps per millisecond=25 ) properties seen :0
// Phase 1: matrix 5270 rows 2827 cols
[2025-05-31 06:03:57] [INFO ] Computed 101 invariants in 39 ms
[2025-05-31 06:03:57] [INFO ] State equation strengthened by 5023 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2667/2771 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2771 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2771 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 6/2777 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2777 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 49/2826 variables, 49/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2826 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 5270/8096 variables, 2826/2927 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8096 variables, 5023/7950 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8096 variables, 0/7950 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/8097 variables, 1/7951 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/8097 variables, 0/7951 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/8097 variables, 0/7951 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8097/8097 variables, and 7951 constraints, problems are : Problem set: 0 solved, 2 unsolved in 8611 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 2827/2827 constraints, ReadFeed: 5023/5023 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2667/2771 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2771 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:04:11] [INFO ] Deduced a trap composed of 2 places in 4397 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :2651 after 2697
[2025-05-31 06:04:22] [INFO ] Deduced a trap composed of 53 places in 11215 ms of which 8104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:04:28] [INFO ] Deduced a trap composed of 53 places in 6246 ms of which 3178 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,7 properties remain. new max is 8192
SDD size :2697 after 2795
[2025-05-31 06:04:44] [INFO ] Deduced a trap composed of 54 places in 15178 ms of which 12006 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:04:59] [INFO ] Deduced a trap composed of 54 places in 15152 ms of which 12016 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,7 properties remain. new max is 16384
SDD size :2795 after 2999
[2025-05-31 06:05:14] [INFO ] Deduced a trap composed of 54 places in 15164 ms of which 12006 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:05:18] [INFO ] Deduced a trap composed of 2 places in 3664 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:05:22] [INFO ] Deduced a trap composed of 53 places in 4419 ms of which 1097 ms to minimize.
SMT process timed out in 85497ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 104 out of 2827 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2827/2827 places, 5270/5270 transitions.
Applied a total of 0 rules in 480 ms. Remains 2827 /2827 variables (removed 0) and now considering 5270/5270 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 483 ms. Remains : 2827/2827 places, 5270/5270 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2827/2827 places, 5270/5270 transitions.
Applied a total of 0 rules in 417 ms. Remains 2827 /2827 variables (removed 0) and now considering 5270/5270 (removed 0) transitions.
[2025-05-31 06:05:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
SDD proceeding with computation,7 properties remain. new max is 32768
SDD size :2999 after 3503
[2025-05-31 06:05:28] [INFO ] Implicit Places using invariants in 5243 ms returned [5, 12, 18, 22, 28, 34, 38, 44, 48, 54, 60, 66, 72, 76, 81, 88, 94, 100, 107, 111, 117, 121, 129, 133, 137, 141, 147, 153, 161, 165, 171, 179, 185, 189, 195, 206, 213, 219, 226, 232, 236, 242, 246, 253, 261, 267, 273, 277, 283]
Discarding 49 places :
Implicit Place search using SMT only with invariants took 5274 ms to find 49 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2778/2827 places, 5270/5270 transitions.
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 2778 transition count 5239
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 2747 transition count 5239
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 66 place count 2743 transition count 5235
Iterating global reduction 2 with 4 rules applied. Total rules applied 70 place count 2743 transition count 5235
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 114 place count 2721 transition count 5213
Applied a total of 114 rules in 1216 ms. Remains 2721 /2778 variables (removed 57) and now considering 5213/5270 (removed 57) transitions.
// Phase 1: matrix 5213 rows 2721 cols
[2025-05-31 06:05:30] [INFO ] Computed 52 invariants in 80 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:05:35] [INFO ] Implicit Places using invariants in 5028 ms returned []
[2025-05-31 06:05:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:05:38] [INFO ] State equation strengthened by 4952 read => feed constraints.
[2025-05-31 06:06:09] [INFO ] Performed 494/2721 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-05-31 06:06:39] [INFO ] Performed 953/2721 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2025-05-31 06:07:09] [INFO ] Performed 1420/2721 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2025-05-31 06:07:39] [INFO ] Performed 1907/2721 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2025-05-31 06:07:39] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2025-05-31 06:07:39] [INFO ] Implicit Places using invariants and state equation in 123947 ms returned []
Implicit Place search using SMT with State Equation took 128978 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2721/2827 places, 5213/5270 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 135887 ms. Remains : 2721/2827 places, 5213/5270 transitions.
RANDOM walk for 40000 steps (107 resets) in 717 ms. (55 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 261 ms. (152 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 74355 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :0 out of 2
Probabilistic random walk after 74355 steps, saw 39221 distinct states, run finished after 3005 ms. (steps per millisecond=24 ) properties seen :0
[2025-05-31 06:07:42] [INFO ] Invariant cache hit.
[2025-05-31 06:07:42] [INFO ] State equation strengthened by 4952 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2610/2714 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2714 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2714 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 6/2720 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2720 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 5213/7933 variables, 2720/2772 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/7933 variables, 4952/7724 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/7933 variables, 0/7724 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/7934 variables, 1/7725 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,7 properties remain. new max is 65536
SDD size :3503 after 8816
At refinement iteration 10 (INCLUDED_ONLY) 0/7934 variables, 0/7725 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/7934 variables, 0/7725 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7934/7934 variables, and 7725 constraints, problems are : Problem set: 0 solved, 2 unsolved in 6645 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 2721/2721 constraints, ReadFeed: 4952/4952 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2610/2714 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2714 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:07:54] [INFO ] Deduced a trap composed of 2 places in 4390 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:08:10] [INFO ] Deduced a trap composed of 53 places in 16137 ms of which 12006 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:08:26] [INFO ] Deduced a trap composed of 54 places in 15348 ms of which 12005 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:08:41] [INFO ] Deduced a trap composed of 53 places in 15242 ms of which 12008 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:08:57] [INFO ] Deduced a trap composed of 53 places in 15684 ms of which 12004 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:09:12] [INFO ] Deduced a trap composed of 53 places in 15332 ms of which 12005 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:09:28] [INFO ] Deduced a trap composed of 54 places in 15797 ms of which 12006 ms to minimize.
SMT process timed out in 105846ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 104 out of 2721 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2721/2721 places, 5213/5213 transitions.
Applied a total of 0 rules in 402 ms. Remains 2721 /2721 variables (removed 0) and now considering 5213/5213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 402 ms. Remains : 2721/2721 places, 5213/5213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2721/2721 places, 5213/5213 transitions.
Applied a total of 0 rules in 397 ms. Remains 2721 /2721 variables (removed 0) and now considering 5213/5213 (removed 0) transitions.
[2025-05-31 06:09:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:09:33] [INFO ] Implicit Places using invariants in 4116 ms returned []
[2025-05-31 06:09:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:09:36] [INFO ] State equation strengthened by 4952 read => feed constraints.
[2025-05-31 06:10:07] [INFO ] Performed 497/2721 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-05-31 06:10:37] [INFO ] Performed 931/2721 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2025-05-31 06:11:07] [INFO ] Performed 1381/2721 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2025-05-31 06:11:37] [INFO ] Performed 1837/2721 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2025-05-31 06:11:37] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2025-05-31 06:11:37] [INFO ] Implicit Places using invariants and state equation in 123765 ms returned []
Implicit Place search using SMT with State Equation took 127888 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 06:11:37] [INFO ] Redundant transitions in 737 ms returned []
Running 5163 sub problems to find dead transitions.
[2025-05-31 06:11:37] [INFO ] Invariant cache hit.
[2025-05-31 06:11:38] [INFO ] State equation strengthened by 4952 read => feed constraints.
SDD proceeding with computation,7 properties remain. new max is 131072
SDD size :8816 after 11915
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2720 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5163 unsolved
SMT process timed out in 34576ms, After SMT, problems are : Problem set: 0 solved, 5163 unsolved
Search for dead transitions found 0 dead transitions in 34610ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163669 ms. Remains : 2721/2721 places, 5213/5213 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 4770 edges and 2721 vertex of which 2024 / 2721 are part of one of the 41 SCC in 9 ms
Free SCC test removed 1983 places
Drop transitions (Empty/Sink Transition effects.) removed 3925 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 3927 transitions.
Graph (complete) has 1481 edges and 738 vertex of which 676 are kept as prefixes of interest. Removing 62 places using SCC suffix rule.1 ms
Discarding 62 places :
Also discarding 13 output transitions
Drop transitions (Output transitions of discarded places.) removed 13 transitions
Drop transitions (Empty/Sink Transition effects.) removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 332 transitions
Trivial Post-agglo rules discarded 332 transitions
Performed 332 trivial Post agglomeration. Transition count delta: 332
Iterating post reduction 0 with 412 rules applied. Total rules applied 414 place count 676 transition count 861
Reduce places removed 332 places and 0 transitions.
Ensure Unique test removed 325 transitions
Reduce isomorphic transitions removed 325 transitions.
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Iterating post reduction 1 with 752 rules applied. Total rules applied 1166 place count 344 transition count 441
Reduce places removed 95 places and 0 transitions.
Ensure Unique test removed 93 transitions
Reduce isomorphic transitions removed 93 transitions.
Iterating post reduction 2 with 188 rules applied. Total rules applied 1354 place count 249 transition count 348
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 1354 place count 249 transition count 338
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 1374 place count 239 transition count 338
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1380 place count 233 transition count 332
Iterating global reduction 3 with 6 rules applied. Total rules applied 1386 place count 233 transition count 332
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1388 place count 232 transition count 331
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 1398 place count 227 transition count 340
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 1405 place count 227 transition count 333
Free-agglomeration rule applied 23 times.
Iterating global reduction 3 with 23 rules applied. Total rules applied 1428 place count 227 transition count 310
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 1451 place count 204 transition count 310
Partial Free-agglomeration rule applied 24 times.
Drop transitions (Partial Free agglomeration) removed 24 transitions
Iterating global reduction 4 with 24 rules applied. Total rules applied 1475 place count 204 transition count 310
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 1490 place count 189 transition count 295
Iterating global reduction 4 with 15 rules applied. Total rules applied 1505 place count 189 transition count 295
Reduce places removed 14 places and 14 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 1519 place count 175 transition count 281
Applied a total of 1519 rules in 130 ms. Remains 175 /2721 variables (removed 2546) and now considering 281/5213 (removed 4932) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 281 rows 175 cols
[2025-05-31 06:12:12] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 06:12:12] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 06:12:13] [INFO ] [Nat]Absence check using 11 positive place invariants in 12 ms returned sat
[2025-05-31 06:12:13] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 5 ms returned sat
[2025-05-31 06:12:13] [INFO ] After 131ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-05-31 06:12:13] [INFO ] After 227ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-05-31 06:12:13] [INFO ] After 503ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2025-05-31 06:12:13] [INFO ] Flatten gal took : 16 ms
[2025-05-31 06:12:13] [INFO ] Flatten gal took : 11 ms
[2025-05-31 06:12:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3020974669250452033.gal : 2 ms
[2025-05-31 06:12:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4778518680863890737.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3020974669250452033.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4778518680863890737.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality4778518680863890737.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :6 after 108
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :108 after 1296
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1296 after 51840
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :51840 after 2.23949e+07
Detected timeout of ITS tools.
[2025-05-31 06:12:28] [INFO ] Flatten gal took : 8 ms
[2025-05-31 06:12:28] [INFO ] Applying decomposition
[2025-05-31 06:12:28] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7210661439437018102.txt' '-o' '/tmp/graph7210661439437018102.bin' '-w' '/tmp/graph7210661439437018102.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7210661439437018102.bin' '-l' '-1' '-v' '-w' '/tmp/graph7210661439437018102.weights' '-q' '0' '-e' '0.001'
[2025-05-31 06:12:28] [INFO ] Decomposing Gal with order
[2025-05-31 06:12:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 06:12:28] [INFO ] Removed a total of 39 redundant transitions.
[2025-05-31 06:12:28] [INFO ] Flatten gal took : 96 ms
[2025-05-31 06:12:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 7 ms.
[2025-05-31 06:12:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15755596837643079123.gal : 5 ms
[2025-05-31 06:12:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality775447952986577013.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15755596837643079123.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality775447952986577013.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality775447952986577013.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :6 after 27
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :27 after 648
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :648 after 54432
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :54432 after 933120
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 31376 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-31 06:12:44] [INFO ] Flatten gal took : 497 ms
[2025-05-31 06:12:44] [INFO ] Applying decomposition
[2025-05-31 06:12:45] [INFO ] Flatten gal took : 357 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11917987634272397473.txt' '-o' '/tmp/graph11917987634272397473.bin' '-w' '/tmp/graph11917987634272397473.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11917987634272397473.bin' '-l' '-1' '-v' '-w' '/tmp/graph11917987634272397473.weights' '-q' '0' '-e' '0.001'
[2025-05-31 06:12:46] [INFO ] Decomposing Gal with order
[2025-05-31 06:12:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 06:12:48] [INFO ] Removed a total of 6252 redundant transitions.
[2025-05-31 06:12:48] [INFO ] Flatten gal took : 964 ms
[2025-05-31 06:12:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 1223 labels/synchronizations in 393 ms.
[2025-05-31 06:12:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16503863094608382794.gal : 130 ms
[2025-05-31 06:12:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14064560230178692958.prop : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16503863094608382794.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14064560230178692958.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality14064560230178692958.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 30
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :30 after 31
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :31 after 36
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :36 after 51
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :51 after 59
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :59 after 63
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :63 after 65
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :65 after 67
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :67 after 107
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :107 after 115
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :115 after 129
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :129 after 4579
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :4579 after 5861
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :5861 after 6955
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :6955 after 223831
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :223831 after 255076
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :255076 after 264013
SDD proceeding with computation,2 properties remain. new max is 524288
SDD size :264013 after 6.62082e+06
SDD proceeding with computation,2 properties remain. new max is 1048576
SDD size :6.62082e+06 after 7.1124e+06
Detected timeout of ITS tools.
[2025-05-31 06:42:57] [INFO ] Flatten gal took : 2587 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7502374890623269072
[2025-05-31 06:42:59] [INFO ] Too many transitions (5213) to apply POR reductions. Disabling POR matrices.
[2025-05-31 06:42:59] [INFO ] Applying decomposition
[2025-05-31 06:43:00] [INFO ] Built C files in 1777ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7502374890623269072
Running compilation step : cd /tmp/ltsmin7502374890623269072;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' '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'
[2025-05-31 06:43:02] [INFO ] Flatten gal took : 2575 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6974728994874828769.txt' '-o' '/tmp/graph6974728994874828769.bin' '-w' '/tmp/graph6974728994874828769.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6974728994874828769.bin' '-l' '-1' '-v' '-w' '/tmp/graph6974728994874828769.weights' '-q' '0' '-e' '0.001'
[2025-05-31 06:43:11] [INFO ] Decomposing Gal with order
[2025-05-31 06:43:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 06:43:15] [INFO ] Removed a total of 5142 redundant transitions.
[2025-05-31 06:43:16] [INFO ] Flatten gal took : 4151 ms
[2025-05-31 06:43:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 4882 labels/synchronizations in 1264 ms.
[2025-05-31 06:43:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1058663072600549338.gal : 97 ms
[2025-05-31 06:43:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5761469628481934726.prop : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1058663072600549338.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5761469628481934726.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality5761469628481934726.prop.
Compilation finished in 34065 ms.
Running link step : cd /tmp/ltsmin7502374890623269072;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 121 ms.
Running LTSmin : cd /tmp/ltsmin7502374890623269072;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'CANConstructionPT050ReachabilityCardinality202401==true'
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 33
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :33 after 34
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :34 after 36
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :36 after 465
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin7502374890623269072;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'CANConstructionPT050ReachabilityCardinality202401==true'
Running LTSmin : cd /tmp/ltsmin7502374890623269072;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'CANConstructionPT050ReachabilityCardinality202514==true'

BK_TIME_CONFINEMENT_REACHED

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="CANConstruction-PT-050"
export BK_EXAMINATION="ReachabilityCardinality"
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 CANConstruction-PT-050, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r030-smll-174853813500206"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-050.tgz
mv CANConstruction-PT-050 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;