Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r516-tajo-171654446800297.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PolyORBLF-PT-S04J06T08, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446800297
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.5M
-rw-r--r-- 1 mcc users 22K Apr 11 16:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 125K Apr 11 16:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 127K Apr 11 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 570K Apr 11 16:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 13K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 41K Apr 11 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 205K Apr 11 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 138K Apr 11 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 670K Apr 11 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.4K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 3.5M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-PT-S04J06T08-CTLCardinality-2024-00
FORMULA_NAME PolyORBLF-PT-S04J06T08-CTLCardinality-2024-01
FORMULA_NAME PolyORBLF-PT-S04J06T08-CTLCardinality-2024-02
FORMULA_NAME PolyORBLF-PT-S04J06T08-CTLCardinality-2024-03
FORMULA_NAME PolyORBLF-PT-S04J06T08-CTLCardinality-2024-04
FORMULA_NAME PolyORBLF-PT-S04J06T08-CTLCardinality-2024-05
FORMULA_NAME PolyORBLF-PT-S04J06T08-CTLCardinality-2024-06
FORMULA_NAME PolyORBLF-PT-S04J06T08-CTLCardinality-2024-07
FORMULA_NAME PolyORBLF-PT-S04J06T08-CTLCardinality-2024-08
FORMULA_NAME PolyORBLF-PT-S04J06T08-CTLCardinality-2024-09
FORMULA_NAME PolyORBLF-PT-S04J06T08-CTLCardinality-2024-10
FORMULA_NAME PolyORBLF-PT-S04J06T08-CTLCardinality-2024-11
FORMULA_NAME PolyORBLF-PT-S04J06T08-CTLCardinality-2024-12
FORMULA_NAME PolyORBLF-PT-S04J06T08-CTLCardinality-2024-13
FORMULA_NAME PolyORBLF-PT-S04J06T08-CTLCardinality-2024-14
FORMULA_NAME PolyORBLF-PT-S04J06T08-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717254662600

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S04J06T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:11:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 15:11:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:11:04] [INFO ] Load time of PNML (sax parser for PT used): 282 ms
[2024-06-01 15:11:04] [INFO ] Transformed 792 places.
[2024-06-01 15:11:04] [INFO ] Transformed 4268 transitions.
[2024-06-01 15:11:04] [INFO ] Parsed PT model containing 792 places and 4268 transitions and 28832 arcs in 448 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 24 ms.
Ensure Unique test removed 2168 transitions
Reduce redundant transitions removed 2168 transitions.
Support contains 515 out of 792 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 792/792 places, 2100/2100 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 788 transition count 2100
Applied a total of 4 rules in 65 ms. Remains 788 /792 variables (removed 4) and now considering 2100/2100 (removed 0) transitions.
Running 2096 sub problems to find dead transitions.
[2024-06-01 15:11:04] [INFO ] Flow matrix only has 2068 transitions (discarded 32 similar events)
// Phase 1: matrix 2068 rows 788 cols
[2024-06-01 15:11:04] [INFO ] Computed 54 invariants in 142 ms
[2024-06-01 15:11:04] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/784 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
SMT process timed out in 28237ms, After SMT, problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 28289ms
[2024-06-01 15:11:33] [INFO ] Flow matrix only has 2068 transitions (discarded 32 similar events)
[2024-06-01 15:11:33] [INFO ] Invariant cache hit.
[2024-06-01 15:11:33] [INFO ] Implicit Places using invariants in 641 ms returned []
[2024-06-01 15:11:33] [INFO ] Flow matrix only has 2068 transitions (discarded 32 similar events)
[2024-06-01 15:11:33] [INFO ] Invariant cache hit.
[2024-06-01 15:11:34] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 15:11:52] [INFO ] Implicit Places using invariants and state equation in 18449 ms returned []
Implicit Place search using SMT with State Equation took 19102 ms to find 0 implicit places.
Running 2096 sub problems to find dead transitions.
[2024-06-01 15:11:52] [INFO ] Flow matrix only has 2068 transitions (discarded 32 similar events)
[2024-06-01 15:11:52] [INFO ] Invariant cache hit.
[2024-06-01 15:11:52] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/784 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/784 variables, 31/50 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-06-01 15:12:20] [INFO ] Deduced a trap composed of 83 places in 126 ms of which 16 ms to minimize.
[2024-06-01 15:12:20] [INFO ] Deduced a trap composed of 84 places in 101 ms of which 2 ms to minimize.
[2024-06-01 15:12:21] [INFO ] Deduced a trap composed of 84 places in 86 ms of which 1 ms to minimize.
[2024-06-01 15:12:21] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 2 ms to minimize.
[2024-06-01 15:12:21] [INFO ] Deduced a trap composed of 83 places in 71 ms of which 1 ms to minimize.
[2024-06-01 15:12:21] [INFO ] Deduced a trap composed of 84 places in 65 ms of which 2 ms to minimize.
[2024-06-01 15:12:21] [INFO ] Deduced a trap composed of 84 places in 69 ms of which 1 ms to minimize.
[2024-06-01 15:12:22] [INFO ] Deduced a trap composed of 375 places in 559 ms of which 8 ms to minimize.
[2024-06-01 15:12:23] [INFO ] Deduced a trap composed of 432 places in 519 ms of which 4 ms to minimize.
[2024-06-01 15:12:23] [INFO ] Deduced a trap composed of 437 places in 496 ms of which 10 ms to minimize.
[2024-06-01 15:12:24] [INFO ] Deduced a trap composed of 146 places in 516 ms of which 6 ms to minimize.
[2024-06-01 15:12:24] [INFO ] Deduced a trap composed of 334 places in 540 ms of which 6 ms to minimize.
[2024-06-01 15:12:25] [INFO ] Deduced a trap composed of 203 places in 548 ms of which 5 ms to minimize.
[2024-06-01 15:12:26] [INFO ] Deduced a trap composed of 83 places in 566 ms of which 6 ms to minimize.
[2024-06-01 15:12:27] [INFO ] Deduced a trap composed of 434 places in 563 ms of which 5 ms to minimize.
[2024-06-01 15:12:28] [INFO ] Deduced a trap composed of 81 places in 296 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 784/2856 variables, and 66 constraints, problems are : Problem set: 0 solved, 2096 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 31/35 constraints, State Equation: 0/788 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2096/2096 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/784 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/784 variables, 31/50 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/784 variables, 16/66 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-06-01 15:12:53] [INFO ] Deduced a trap composed of 381 places in 547 ms of which 6 ms to minimize.
[2024-06-01 15:12:53] [INFO ] Deduced a trap composed of 496 places in 573 ms of which 5 ms to minimize.
[2024-06-01 15:12:54] [INFO ] Deduced a trap composed of 567 places in 569 ms of which 6 ms to minimize.
[2024-06-01 15:12:55] [INFO ] Deduced a trap composed of 571 places in 555 ms of which 5 ms to minimize.
[2024-06-01 15:12:55] [INFO ] Deduced a trap composed of 534 places in 488 ms of which 4 ms to minimize.
[2024-06-01 15:12:56] [INFO ] Deduced a trap composed of 574 places in 685 ms of which 8 ms to minimize.
[2024-06-01 15:12:56] [INFO ] Deduced a trap composed of 492 places in 557 ms of which 4 ms to minimize.
[2024-06-01 15:12:58] [INFO ] Deduced a trap composed of 19 places in 392 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 784/2856 variables, and 74 constraints, problems are : Problem set: 0 solved, 2096 unsolved in 30063 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 31/35 constraints, State Equation: 0/788 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/2096 constraints, Known Traps: 24/24 constraints]
After SMT, in 68837ms problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 68873ms
Starting structural reductions in LTL mode, iteration 1 : 788/792 places, 2100/2100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 116396 ms. Remains : 788/792 places, 2100/2100 transitions.
Support contains 515 out of 788 places after structural reductions.
[2024-06-01 15:13:01] [INFO ] Flatten gal took : 267 ms
[2024-06-01 15:13:02] [INFO ] Flatten gal took : 191 ms
[2024-06-01 15:13:02] [INFO ] Input system was already deterministic with 2100 transitions.
RANDOM walk for 40000 steps (10 resets) in 2813 ms. (14 steps per ms) remains 65/92 properties
BEST_FIRST walk for 4002 steps (8 resets) in 125 ms. (31 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 76 ms. (51 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 55 ms. (71 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 107 ms. (37 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 65 ms. (60 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 71 ms. (55 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (8 resets) in 50 ms. (78 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 72 ms. (54 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (8 resets) in 65 ms. (60 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 48 ms. (81 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (8 resets) in 44 ms. (88 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (8 resets) in 38 ms. (102 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 60 ms. (65 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 63 ms. (62 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 123 ms. (32 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 71 ms. (55 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (8 resets) in 59 ms. (66 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 57 ms. (69 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 95 ms. (41 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (8 resets) in 45 ms. (86 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 58 ms. (67 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 53 ms. (74 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 50 ms. (78 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 48 ms. (81 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 77 ms. (51 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (8 resets) in 53 ms. (74 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (8 resets) in 41 ms. (95 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (8 resets) in 65 ms. (60 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (8 resets) in 80 ms. (49 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 127 ms. (31 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 62 ms. (63 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 48 ms. (81 steps per ms) remains 65/65 properties
[2024-06-01 15:13:04] [INFO ] Flow matrix only has 2068 transitions (discarded 32 similar events)
[2024-06-01 15:13:04] [INFO ] Invariant cache hit.
[2024-06-01 15:13:04] [INFO ] State equation strengthened by 160 read => feed constraints.
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp21 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 63 unsolved
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp64 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 2/5 constraints. Problems are: Problem set: 4 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 0/5 constraints. Problems are: Problem set: 4 solved, 61 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp85 is UNSAT
Problem AtomicPropp88 is UNSAT
Problem AtomicPropp90 is UNSAT
At refinement iteration 3 (OVERLAPS) 174/538 variables, 13/18 constraints. Problems are: Problem set: 20 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 0/18 constraints. Problems are: Problem set: 20 solved, 45 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp79 is UNSAT
Problem AtomicPropp80 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp82 is UNSAT
Problem AtomicPropp83 is UNSAT
Problem AtomicPropp84 is UNSAT
Problem AtomicPropp89 is UNSAT
At refinement iteration 5 (OVERLAPS) 240/778 variables, 33/51 constraints. Problems are: Problem set: 61 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/778 variables, 0/51 constraints. Problems are: Problem set: 61 solved, 4 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp56 is UNSAT
At refinement iteration 7 (OVERLAPS) 10/788 variables, 3/54 constraints. Problems are: Problem set: 64 solved, 1 unsolved
[2024-06-01 15:13:07] [INFO ] Deduced a trap composed of 84 places in 662 ms of which 6 ms to minimize.
[2024-06-01 15:13:08] [INFO ] Deduced a trap composed of 83 places in 510 ms of which 8 ms to minimize.
[2024-06-01 15:13:08] [INFO ] Deduced a trap composed of 83 places in 593 ms of which 5 ms to minimize.
[2024-06-01 15:13:09] [INFO ] Deduced a trap composed of 84 places in 593 ms of which 5 ms to minimize.
[2024-06-01 15:13:09] [INFO ] Deduced a trap composed of 83 places in 639 ms of which 4 ms to minimize.
[2024-06-01 15:13:10] [INFO ] Deduced a trap composed of 85 places in 625 ms of which 6 ms to minimize.
SMT process timed out in 5721ms, After SMT, problems are : Problem set: 64 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 788 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 788/788 places, 2100/2100 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 788 transition count 2028
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 716 transition count 2028
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 144 place count 716 transition count 1932
Deduced a syphon composed of 96 places in 3 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 336 place count 620 transition count 1932
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 2 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 494 place count 541 transition count 1853
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 510 place count 541 transition count 1837
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 526 place count 525 transition count 1837
Applied a total of 526 rules in 280 ms. Remains 525 /788 variables (removed 263) and now considering 1837/2100 (removed 263) transitions.
Running 1833 sub problems to find dead transitions.
[2024-06-01 15:13:10] [INFO ] Flow matrix only has 1805 transitions (discarded 32 similar events)
// Phase 1: matrix 1805 rows 525 cols
[2024-06-01 15:13:10] [INFO ] Computed 54 invariants in 64 ms
[2024-06-01 15:13:10] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/521 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1833 unsolved
SMT process timed out in 32398ms, After SMT, problems are : Problem set: 0 solved, 1833 unsolved
Search for dead transitions found 0 dead transitions in 32413ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32699 ms. Remains : 525/788 places, 1837/2100 transitions.
RANDOM walk for 40000 steps (9 resets) in 776 ms. (51 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (9 resets) in 246 ms. (161 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 121496 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :0 out of 1
Probabilistic random walk after 121496 steps, saw 90790 distinct states, run finished after 3018 ms. (steps per millisecond=40 ) properties seen :0
[2024-06-01 15:13:46] [INFO ] Flow matrix only has 1805 transitions (discarded 32 similar events)
[2024-06-01 15:13:46] [INFO ] Invariant cache hit.
[2024-06-01 15:13:46] [INFO ] State equation strengthened by 160 read => feed constraints.
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) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 440/450 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/450 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 24/474 variables, 15/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/474 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 49/523 variables, 21/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 15:13:47] [INFO ] Deduced a trap composed of 50 places in 500 ms of which 5 ms to minimize.
[2024-06-01 15:13:47] [INFO ] Deduced a trap composed of 50 places in 373 ms of which 5 ms to minimize.
[2024-06-01 15:13:48] [INFO ] Deduced a trap composed of 50 places in 493 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/523 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/523 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2328/2330 variables, and 579 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6646 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 523/525 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
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) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 440/450 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 15:13:53] [INFO ] Deduced a trap composed of 120 places in 382 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/450 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/450 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 24/474 variables, 15/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/474 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 49/523 variables, 21/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/523 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 15:13:54] [INFO ] Deduced a trap composed of 50 places in 510 ms of which 7 ms to minimize.
[2024-06-01 15:13:54] [INFO ] Deduced a trap composed of 50 places in 86 ms of which 2 ms to minimize.
[2024-06-01 15:13:54] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 1 ms to minimize.
[2024-06-01 15:13:54] [INFO ] Deduced a trap composed of 51 places in 64 ms of which 1 ms to minimize.
Problem AtomicPropp46 is UNSAT
After SMT solving in domain Int declared 523/2330 variables, and 61 constraints, problems are : Problem set: 1 solved, 0 unsolved in 1405 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 0/525 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 8088ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 65 atomic propositions for a total of 16 simplifications.
[2024-06-01 15:13:54] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2024-06-01 15:13:54] [INFO ] Flatten gal took : 119 ms
[2024-06-01 15:13:54] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA PolyORBLF-PT-S04J06T08-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T08-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T08-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T08-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T08-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T08-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 15:13:55] [INFO ] Flatten gal took : 148 ms
[2024-06-01 15:13:55] [INFO ] Input system was already deterministic with 2100 transitions.
Support contains 65 out of 788 places (down from 185) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 788/788 places, 2100/2100 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 780 transition count 2092
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 780 transition count 2092
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 772 transition count 2084
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 772 transition count 2084
Applied a total of 32 rules in 79 ms. Remains 772 /788 variables (removed 16) and now considering 2084/2100 (removed 16) transitions.
Running 2080 sub problems to find dead transitions.
[2024-06-01 15:13:55] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
// Phase 1: matrix 2052 rows 772 cols
[2024-06-01 15:13:55] [INFO ] Computed 54 invariants in 71 ms
[2024-06-01 15:13:55] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/768 variables, 29/49 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 768/2824 variables, and 49 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 20/21 constraints, Generalized P Invariants (flows): 29/33 constraints, State Equation: 0/772 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2080/2080 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/768 variables, 29/49 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-06-01 15:14:28] [INFO ] Deduced a trap composed of 374 places in 399 ms of which 5 ms to minimize.
[2024-06-01 15:14:28] [INFO ] Deduced a trap composed of 130 places in 298 ms of which 5 ms to minimize.
[2024-06-01 15:14:29] [INFO ] Deduced a trap composed of 175 places in 404 ms of which 5 ms to minimize.
[2024-06-01 15:14:31] [INFO ] Deduced a trap composed of 390 places in 382 ms of which 4 ms to minimize.
[2024-06-01 15:14:31] [INFO ] Deduced a trap composed of 367 places in 356 ms of which 4 ms to minimize.
[2024-06-01 15:14:32] [INFO ] Deduced a trap composed of 71 places in 253 ms of which 3 ms to minimize.
[2024-06-01 15:14:32] [INFO ] Deduced a trap composed of 19 places in 220 ms of which 3 ms to minimize.
[2024-06-01 15:14:33] [INFO ] Deduced a trap composed of 331 places in 340 ms of which 4 ms to minimize.
[2024-06-01 15:14:38] [INFO ] Deduced a trap composed of 82 places in 200 ms of which 3 ms to minimize.
[2024-06-01 15:14:38] [INFO ] Deduced a trap composed of 81 places in 163 ms of which 2 ms to minimize.
[2024-06-01 15:14:38] [INFO ] Deduced a trap composed of 81 places in 115 ms of which 2 ms to minimize.
[2024-06-01 15:14:38] [INFO ] Deduced a trap composed of 81 places in 64 ms of which 2 ms to minimize.
[2024-06-01 15:14:38] [INFO ] Deduced a trap composed of 81 places in 85 ms of which 1 ms to minimize.
[2024-06-01 15:14:38] [INFO ] Deduced a trap composed of 81 places in 101 ms of which 1 ms to minimize.
[2024-06-01 15:14:39] [INFO ] Deduced a trap composed of 83 places in 102 ms of which 2 ms to minimize.
[2024-06-01 15:14:43] [INFO ] Deduced a trap composed of 423 places in 448 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 768/2824 variables, and 65 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 20/21 constraints, Generalized P Invariants (flows): 29/33 constraints, State Equation: 0/772 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/2080 constraints, Known Traps: 16/16 constraints]
After SMT, in 49113ms problems are : Problem set: 0 solved, 2080 unsolved
Search for dead transitions found 0 dead transitions in 49131ms
Finished structural reductions in LTL mode , in 1 iterations and 49215 ms. Remains : 772/788 places, 2084/2100 transitions.
[2024-06-01 15:14:44] [INFO ] Flatten gal took : 76 ms
[2024-06-01 15:14:44] [INFO ] Flatten gal took : 69 ms
[2024-06-01 15:14:44] [INFO ] Input system was already deterministic with 2084 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 788/788 places, 2100/2100 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 788 transition count 2044
Reduce places removed 56 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 64 rules applied. Total rules applied 120 place count 732 transition count 2036
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 128 place count 724 transition count 2036
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 128 place count 724 transition count 1940
Deduced a syphon composed of 96 places in 1 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 320 place count 628 transition count 1940
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 480 place count 548 transition count 1860
Applied a total of 480 rules in 146 ms. Remains 548 /788 variables (removed 240) and now considering 1860/2100 (removed 240) transitions.
Running 1856 sub problems to find dead transitions.
[2024-06-01 15:14:45] [INFO ] Flow matrix only has 1828 transitions (discarded 32 similar events)
// Phase 1: matrix 1828 rows 548 cols
[2024-06-01 15:14:45] [INFO ] Computed 54 invariants in 25 ms
[2024-06-01 15:14:45] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/544 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/544 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
[2024-06-01 15:15:07] [INFO ] Deduced a trap composed of 53 places in 139 ms of which 2 ms to minimize.
[2024-06-01 15:15:07] [INFO ] Deduced a trap composed of 53 places in 91 ms of which 2 ms to minimize.
[2024-06-01 15:15:07] [INFO ] Deduced a trap composed of 53 places in 72 ms of which 1 ms to minimize.
[2024-06-01 15:15:07] [INFO ] Deduced a trap composed of 54 places in 57 ms of which 2 ms to minimize.
[2024-06-01 15:15:08] [INFO ] Deduced a trap composed of 54 places in 54 ms of which 1 ms to minimize.
[2024-06-01 15:15:08] [INFO ] Deduced a trap composed of 54 places in 57 ms of which 1 ms to minimize.
[2024-06-01 15:15:08] [INFO ] Deduced a trap composed of 251 places in 485 ms of which 4 ms to minimize.
[2024-06-01 15:15:09] [INFO ] Deduced a trap composed of 174 places in 431 ms of which 5 ms to minimize.
[2024-06-01 15:15:09] [INFO ] Deduced a trap composed of 53 places in 62 ms of which 1 ms to minimize.
[2024-06-01 15:15:09] [INFO ] Deduced a trap composed of 53 places in 66 ms of which 1 ms to minimize.
[2024-06-01 15:15:10] [INFO ] Deduced a trap composed of 33 places in 342 ms of which 3 ms to minimize.
[2024-06-01 15:15:11] [INFO ] Deduced a trap composed of 41 places in 233 ms of which 3 ms to minimize.
[2024-06-01 15:15:13] [INFO ] Deduced a trap composed of 19 places in 297 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.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 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.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)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 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 4.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.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 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 (/ 1.0 3.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 (/ 1.0 3.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 0.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)
(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 3.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 1.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 1.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 0.0)
(s183 0.0)
(s184 6.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 1.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 1.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 1.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 8.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 1.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 9.0)
(s284 0.0)
(s285 0.0)
(s286 1.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 544/2376 variables, and 63 constraints, problems are : Problem set: 0 solved, 1856 unsolved in 20062 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 34/37 constraints, State Equation: 0/548 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1856/1856 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1856 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/544 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/544 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/544 variables, 13/63 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
[2024-06-01 15:15:30] [INFO ] Deduced a trap composed of 321 places in 423 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 544/2376 variables, and 64 constraints, problems are : Problem set: 0 solved, 1856 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 34/37 constraints, State Equation: 0/548 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1856 constraints, Known Traps: 14/14 constraints]
After SMT, in 49351ms problems are : Problem set: 0 solved, 1856 unsolved
Search for dead transitions found 0 dead transitions in 49367ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 49517 ms. Remains : 548/788 places, 1860/2100 transitions.
[2024-06-01 15:15:34] [INFO ] Flatten gal took : 67 ms
[2024-06-01 15:15:34] [INFO ] Flatten gal took : 68 ms
[2024-06-01 15:15:34] [INFO ] Input system was already deterministic with 1860 transitions.
Starting structural reductions in LTL mode, iteration 0 : 788/788 places, 2100/2100 transitions.
Applied a total of 0 rules in 21 ms. Remains 788 /788 variables (removed 0) and now considering 2100/2100 (removed 0) transitions.
Running 2096 sub problems to find dead transitions.
[2024-06-01 15:15:34] [INFO ] Flow matrix only has 2068 transitions (discarded 32 similar events)
// Phase 1: matrix 2068 rows 788 cols
[2024-06-01 15:15:34] [INFO ] Computed 54 invariants in 83 ms
[2024-06-01 15:15:34] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/784 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
SMT process timed out in 30534ms, After SMT, problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 30552ms
Finished structural reductions in LTL mode , in 1 iterations and 30579 ms. Remains : 788/788 places, 2100/2100 transitions.
[2024-06-01 15:16:05] [INFO ] Flatten gal took : 76 ms
[2024-06-01 15:16:05] [INFO ] Flatten gal took : 89 ms
[2024-06-01 15:16:05] [INFO ] Input system was already deterministic with 2100 transitions.
Starting structural reductions in LTL mode, iteration 0 : 788/788 places, 2100/2100 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 780 transition count 2092
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 780 transition count 2092
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 772 transition count 2084
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 772 transition count 2084
Applied a total of 32 rules in 41 ms. Remains 772 /788 variables (removed 16) and now considering 2084/2100 (removed 16) transitions.
Running 2080 sub problems to find dead transitions.
[2024-06-01 15:16:05] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
// Phase 1: matrix 2052 rows 772 cols
[2024-06-01 15:16:05] [INFO ] Computed 54 invariants in 84 ms
[2024-06-01 15:16:05] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/768 variables, 29/49 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-06-01 15:16:37] [INFO ] Deduced a trap composed of 384 places in 374 ms of which 4 ms to minimize.
SMT process timed out in 31458ms, After SMT, problems are : Problem set: 0 solved, 2080 unsolved
Search for dead transitions found 0 dead transitions in 31484ms
Finished structural reductions in LTL mode , in 1 iterations and 31530 ms. Remains : 772/788 places, 2084/2100 transitions.
[2024-06-01 15:16:37] [INFO ] Flatten gal took : 64 ms
[2024-06-01 15:16:37] [INFO ] Flatten gal took : 68 ms
[2024-06-01 15:16:37] [INFO ] Input system was already deterministic with 2084 transitions.
Starting structural reductions in LTL mode, iteration 0 : 788/788 places, 2100/2100 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 780 transition count 2092
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 780 transition count 2092
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 772 transition count 2084
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 772 transition count 2084
Applied a total of 32 rules in 40 ms. Remains 772 /788 variables (removed 16) and now considering 2084/2100 (removed 16) transitions.
Running 2080 sub problems to find dead transitions.
[2024-06-01 15:16:37] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-06-01 15:16:37] [INFO ] Invariant cache hit.
[2024-06-01 15:16:37] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/768 variables, 29/49 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 768/2824 variables, and 49 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 20/21 constraints, Generalized P Invariants (flows): 29/33 constraints, State Equation: 0/772 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2080/2080 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/768 variables, 29/49 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-06-01 15:17:12] [INFO ] Deduced a trap composed of 130 places in 379 ms of which 4 ms to minimize.
[2024-06-01 15:17:13] [INFO ] Deduced a trap composed of 175 places in 391 ms of which 5 ms to minimize.
[2024-06-01 15:17:14] [INFO ] Deduced a trap composed of 374 places in 414 ms of which 5 ms to minimize.
[2024-06-01 15:17:15] [INFO ] Deduced a trap composed of 353 places in 386 ms of which 5 ms to minimize.
[2024-06-01 15:17:15] [INFO ] Deduced a trap composed of 331 places in 362 ms of which 4 ms to minimize.
[2024-06-01 15:17:16] [INFO ] Deduced a trap composed of 367 places in 353 ms of which 3 ms to minimize.
[2024-06-01 15:17:17] [INFO ] Deduced a trap composed of 66 places in 256 ms of which 4 ms to minimize.
[2024-06-01 15:17:18] [INFO ] Deduced a trap composed of 81 places in 197 ms of which 3 ms to minimize.
[2024-06-01 15:17:18] [INFO ] Deduced a trap composed of 81 places in 137 ms of which 2 ms to minimize.
[2024-06-01 15:17:18] [INFO ] Deduced a trap composed of 82 places in 125 ms of which 2 ms to minimize.
[2024-06-01 15:17:18] [INFO ] Deduced a trap composed of 81 places in 81 ms of which 1 ms to minimize.
[2024-06-01 15:17:18] [INFO ] Deduced a trap composed of 83 places in 83 ms of which 2 ms to minimize.
[2024-06-01 15:17:18] [INFO ] Deduced a trap composed of 82 places in 86 ms of which 1 ms to minimize.
[2024-06-01 15:17:20] [INFO ] Deduced a trap composed of 410 places in 559 ms of which 6 ms to minimize.
[2024-06-01 15:17:24] [INFO ] Deduced a trap composed of 81 places in 82 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 768/2824 variables, and 64 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 20/21 constraints, Generalized P Invariants (flows): 29/33 constraints, State Equation: 0/772 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/2080 constraints, Known Traps: 15/15 constraints]
After SMT, in 49305ms problems are : Problem set: 0 solved, 2080 unsolved
Search for dead transitions found 0 dead transitions in 49329ms
Finished structural reductions in LTL mode , in 1 iterations and 49375 ms. Remains : 772/788 places, 2084/2100 transitions.
[2024-06-01 15:17:27] [INFO ] Flatten gal took : 60 ms
[2024-06-01 15:17:27] [INFO ] Flatten gal took : 64 ms
[2024-06-01 15:17:27] [INFO ] Input system was already deterministic with 2084 transitions.
Starting structural reductions in LTL mode, iteration 0 : 788/788 places, 2100/2100 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 780 transition count 2092
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 780 transition count 2092
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 772 transition count 2084
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 772 transition count 2084
Applied a total of 32 rules in 42 ms. Remains 772 /788 variables (removed 16) and now considering 2084/2100 (removed 16) transitions.
Running 2080 sub problems to find dead transitions.
[2024-06-01 15:17:27] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-06-01 15:17:27] [INFO ] Invariant cache hit.
[2024-06-01 15:17:27] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/768 variables, 29/49 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-06-01 15:17:56] [INFO ] Deduced a trap composed of 374 places in 311 ms of which 4 ms to minimize.
[2024-06-01 15:17:57] [INFO ] Deduced a trap composed of 130 places in 375 ms of which 5 ms to minimize.
[2024-06-01 15:17:57] [INFO ] Deduced a trap composed of 175 places in 336 ms of which 3 ms to minimize.
SMT process timed out in 30419ms, After SMT, problems are : Problem set: 0 solved, 2080 unsolved
Search for dead transitions found 0 dead transitions in 30434ms
Finished structural reductions in LTL mode , in 1 iterations and 30480 ms. Remains : 772/788 places, 2084/2100 transitions.
[2024-06-01 15:17:57] [INFO ] Flatten gal took : 81 ms
[2024-06-01 15:17:57] [INFO ] Flatten gal took : 86 ms
[2024-06-01 15:17:58] [INFO ] Input system was already deterministic with 2084 transitions.
Starting structural reductions in LTL mode, iteration 0 : 788/788 places, 2100/2100 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 780 transition count 2092
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 780 transition count 2092
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 772 transition count 2084
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 772 transition count 2084
Applied a total of 32 rules in 50 ms. Remains 772 /788 variables (removed 16) and now considering 2084/2100 (removed 16) transitions.
Running 2080 sub problems to find dead transitions.
[2024-06-01 15:17:58] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-06-01 15:17:58] [INFO ] Invariant cache hit.
[2024-06-01 15:17:58] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/768 variables, 29/49 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-06-01 15:18:26] [INFO ] Deduced a trap composed of 374 places in 395 ms of which 5 ms to minimize.
[2024-06-01 15:18:27] [INFO ] Deduced a trap composed of 130 places in 406 ms of which 5 ms to minimize.
SMT process timed out in 29331ms, After SMT, problems are : Problem set: 0 solved, 2080 unsolved
Search for dead transitions found 0 dead transitions in 29356ms
Finished structural reductions in LTL mode , in 1 iterations and 29412 ms. Remains : 772/788 places, 2084/2100 transitions.
[2024-06-01 15:18:27] [INFO ] Flatten gal took : 101 ms
[2024-06-01 15:18:27] [INFO ] Flatten gal took : 112 ms
[2024-06-01 15:18:27] [INFO ] Input system was already deterministic with 2084 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 788/788 places, 2100/2100 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 788 transition count 2028
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 716 transition count 2028
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 144 place count 716 transition count 1932
Deduced a syphon composed of 96 places in 1 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 336 place count 620 transition count 1932
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 494 place count 541 transition count 1853
Applied a total of 494 rules in 123 ms. Remains 541 /788 variables (removed 247) and now considering 1853/2100 (removed 247) transitions.
Running 1849 sub problems to find dead transitions.
[2024-06-01 15:18:28] [INFO ] Flow matrix only has 1821 transitions (discarded 32 similar events)
// Phase 1: matrix 1821 rows 541 cols
[2024-06-01 15:18:28] [INFO ] Computed 54 invariants in 59 ms
[2024-06-01 15:18:28] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1849 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 29/45 constraints. Problems are: Problem set: 0 solved, 1849 unsolved
[2024-06-01 15:18:49] [INFO ] Deduced a trap composed of 3 places in 112 ms of which 2 ms to minimize.
[2024-06-01 15:18:51] [INFO ] Deduced a trap composed of 35 places in 178 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.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 1.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 1.0)
(s32 0.0)
(s33 1.0)
(s34 1.0)
(s35 0.0)
(s36 2.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 1.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s51 0.0)
(s52 2.0)
(s53 0.0)
(s54 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 4.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 1.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 1.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 2.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 2.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 1.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 4.0)
(s124 0.0)
(s125 1.0)
(s126 3.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 2.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 1.0)
(s151 0.0)
(s152 1.0)
(s153 4.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 1.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 1.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 1.0)
(s181 4.0)
(s182 10.0)
(s183 0.0)
(s184 3.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 4.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 1.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 1.0)
(s213 2.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 1.0)
(s218 1.0)
(s219 0.0)
(s220 1.0)
(s221 1.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 1.0)
(s233 0.0)
(s234 1.0)
(s235 1.0)
(s236 0.0)
(s237 0.0)
(s238 4.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 1.0)
(s246 0.0)
(s247 0.0)
(s248 1.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 4.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 2.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 0.0)
(s268 4.0)
(s269 6.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 1.0)
(s274 0.0)
(s275 2.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 2.0)
(s280 9.0)
(s281 0.0)
(s282 0.0)
(s283 1.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 1.0)
(s288 0.0)
(s289 1.0)
(s290 1.0)
(s291 0.0)
(s292 0.0)
(s293 4.0)
(s294 1.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 3.0)
(s299 1.0)
(s300 2.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 1.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 1.0)
(s311 0.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 0.0)
(s316 0.0)
(s317 1.0)
(s318 0.0)
(s319 0.0)
(s320 1.0)
(s321 1.0)
(s322 0.0)
(s323 0.0)
(s324 1.0)
(s325 1.0)
(s326 0.0)
(s327 1.0)
(s328 0.0)
(s329 3.0)
(s330 1.0)
(s331 1.0)
(s332 0.0)
(s333 1.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 4.0)
(s342 0.0)
(s343 0.0)
(s344 2.0)
(s345 1.0)
(s346 0.0)
(s347 1.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 1.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 1.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 1.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 1.0)
(s376 0.0)
(s377 0.0)
(s378 1.0)
(s379 4.0)
(s380 1.0)
(s381 1.0)
(s382 0.0)
(s383 0.0)
(s384 1.0)
(s385 0.0)
(s386 2.0)
(s387 0.0)
(s388 0.0)
(s389 1.0)
(s390 0.0)
(s391 0.0)
(s392 1.0)
(s393 0.0)
(s394 0.0)
(s395 1.0)
(s396 0.0)
(s397 0.0)
(s398 timeout
0.0)
(s399 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 537/2362 variables, and 47 constraints, problems are : Problem set: 0 solved, 1849 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 16/18 constraints, Generalized P Invariants (flows): 29/36 constraints, State Equation: 0/541 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1849/1849 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1849 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1849 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 29/45 constraints. Problems are: Problem set: 0 solved, 1849 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/537 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 1849 unsolved
[2024-06-01 15:18:58] [INFO ] Deduced a trap composed of 52 places in 373 ms of which 3 ms to minimize.
[2024-06-01 15:18:58] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 1 ms to minimize.
[2024-06-01 15:18:58] [INFO ] Deduced a trap composed of 53 places in 64 ms of which 1 ms to minimize.
[2024-06-01 15:18:59] [INFO ] Deduced a trap composed of 52 places in 61 ms of which 1 ms to minimize.
[2024-06-01 15:18:59] [INFO ] Deduced a trap composed of 33 places in 352 ms of which 3 ms to minimize.
[2024-06-01 15:18:59] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 1 ms to minimize.
[2024-06-01 15:19:00] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 1 ms to minimize.
[2024-06-01 15:19:00] [INFO ] Deduced a trap composed of 53 places in 62 ms of which 1 ms to minimize.
[2024-06-01 15:19:00] [INFO ] Deduced a trap composed of 45 places in 251 ms of which 2 ms to minimize.
[2024-06-01 15:19:00] [INFO ] Deduced a trap composed of 69 places in 236 ms of which 2 ms to minimize.
[2024-06-01 15:19:01] [INFO ] Deduced a trap composed of 53 places in 62 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 537/2362 variables, and 58 constraints, problems are : Problem set: 0 solved, 1849 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 16/18 constraints, Generalized P Invariants (flows): 29/36 constraints, State Equation: 0/541 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1849 constraints, Known Traps: 13/13 constraints]
After SMT, in 48453ms problems are : Problem set: 0 solved, 1849 unsolved
Search for dead transitions found 0 dead transitions in 48472ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 48601 ms. Remains : 541/788 places, 1853/2100 transitions.
[2024-06-01 15:19:16] [INFO ] Flatten gal took : 51 ms
[2024-06-01 15:19:16] [INFO ] Flatten gal took : 55 ms
[2024-06-01 15:19:16] [INFO ] Input system was already deterministic with 1853 transitions.
Starting structural reductions in LTL mode, iteration 0 : 788/788 places, 2100/2100 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 780 transition count 2092
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 780 transition count 2092
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 772 transition count 2084
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 772 transition count 2084
Applied a total of 32 rules in 35 ms. Remains 772 /788 variables (removed 16) and now considering 2084/2100 (removed 16) transitions.
Running 2080 sub problems to find dead transitions.
[2024-06-01 15:19:16] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
// Phase 1: matrix 2052 rows 772 cols
[2024-06-01 15:19:16] [INFO ] Computed 54 invariants in 67 ms
[2024-06-01 15:19:16] [INFO ] State equation strengthened by 160 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
SMT process timed out in 28222ms, After SMT, problems are : Problem set: 0 solved, 2080 unsolved
Search for dead transitions found 0 dead transitions in 28239ms
Finished structural reductions in LTL mode , in 1 iterations and 28279 ms. Remains : 772/788 places, 2084/2100 transitions.
[2024-06-01 15:19:45] [INFO ] Flatten gal took : 138 ms
[2024-06-01 15:19:45] [INFO ] Flatten gal took : 114 ms
[2024-06-01 15:19:45] [INFO ] Input system was already deterministic with 2084 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 788/788 places, 2100/2100 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 788 transition count 2028
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 716 transition count 2028
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 144 place count 716 transition count 1933
Deduced a syphon composed of 95 places in 1 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 334 place count 621 transition count 1933
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 492 place count 542 transition count 1854
Applied a total of 492 rules in 125 ms. Remains 542 /788 variables (removed 246) and now considering 1854/2100 (removed 246) transitions.
Running 1850 sub problems to find dead transitions.
[2024-06-01 15:19:45] [INFO ] Flow matrix only has 1822 transitions (discarded 32 similar events)
// Phase 1: matrix 1822 rows 542 cols
[2024-06-01 15:19:45] [INFO ] Computed 54 invariants in 57 ms
[2024-06-01 15:19:45] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 32/50 constraints. Problems are: Problem set: 0 solved, 1850 unsolved
[2024-06-01 15:20:07] [INFO ] Deduced a trap composed of 52 places in 114 ms of which 2 ms to minimize.
[2024-06-01 15:20:07] [INFO ] Deduced a trap composed of 53 places in 88 ms of which 1 ms to minimize.
[2024-06-01 15:20:07] [INFO ] Deduced a trap composed of 52 places in 69 ms of which 1 ms to minimize.
[2024-06-01 15:20:07] [INFO ] Deduced a trap composed of 52 places in 43 ms of which 0 ms to minimize.
[2024-06-01 15:20:07] [INFO ] Deduced a trap composed of 54 places in 49 ms of which 1 ms to minimize.
[2024-06-01 15:20:08] [INFO ] Deduced a trap composed of 175 places in 361 ms of which 4 ms to minimize.
[2024-06-01 15:20:08] [INFO ] Deduced a trap composed of 52 places in 59 ms of which 1 ms to minimize.
[2024-06-01 15:20:08] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 1 ms to minimize.
[2024-06-01 15:20:08] [INFO ] Deduced a trap composed of 53 places in 49 ms of which 1 ms to minimize.
[2024-06-01 15:20:09] [INFO ] Deduced a trap composed of 33 places in 274 ms of which 3 ms to minimize.
[2024-06-01 15:20:10] [INFO ] Deduced a trap composed of 19 places in 208 ms of which 3 ms to minimize.
[2024-06-01 15:20:12] [INFO ] Deduced a trap composed of 83 places in 447 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 538/2364 variables, and 62 constraints, problems are : Problem set: 0 solved, 1850 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 32/36 constraints, State Equation: 0/542 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1850/1850 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1850 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 32/50 constraints. Problems are: Problem set: 0 solved, 1850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/538 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 1850 unsolved
[2024-06-01 15:20:26] [INFO ] Deduced a trap composed of 251 places in 458 ms of which 4 ms to minimize.
[2024-06-01 15:20:27] [INFO ] Deduced a trap composed of 231 places in 419 ms of which 3 ms to minimize.
[2024-06-01 15:20:30] [INFO ] Deduced a trap composed of 225 places in 488 ms of which 4 ms to minimize.
[2024-06-01 15:20:30] [INFO ] Deduced a trap composed of 241 places in 434 ms of which 3 ms to minimize.
[2024-06-01 15:20:31] [INFO ] Deduced a trap composed of 225 places in 469 ms of which 4 ms to minimize.
[2024-06-01 15:20:34] [INFO ] Deduced a trap composed of 252 places in 440 ms of which 4 ms to minimize.
SMT process timed out in 48839ms, After SMT, problems are : Problem set: 0 solved, 1850 unsolved
Search for dead transitions found 0 dead transitions in 48864ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 48997 ms. Remains : 542/788 places, 1854/2100 transitions.
[2024-06-01 15:20:34] [INFO ] Flatten gal took : 56 ms
[2024-06-01 15:20:34] [INFO ] Flatten gal took : 64 ms
[2024-06-01 15:20:34] [INFO ] Input system was already deterministic with 1854 transitions.
[2024-06-01 15:20:34] [INFO ] Flatten gal took : 76 ms
[2024-06-01 15:20:34] [INFO ] Flatten gal took : 77 ms
[2024-06-01 15:20:34] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-01 15:20:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 788 places, 2100 transitions and 10452 arcs took 15 ms.
Total runtime 570903 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : PolyORBLF-PT-S04J06T08-CTLCardinality-2024-00
Could not compute solution for formula : PolyORBLF-PT-S04J06T08-CTLCardinality-2024-02
Could not compute solution for formula : PolyORBLF-PT-S04J06T08-CTLCardinality-2024-06
Could not compute solution for formula : PolyORBLF-PT-S04J06T08-CTLCardinality-2024-08
Could not compute solution for formula : PolyORBLF-PT-S04J06T08-CTLCardinality-2024-09
Could not compute solution for formula : PolyORBLF-PT-S04J06T08-CTLCardinality-2024-10
Could not compute solution for formula : PolyORBLF-PT-S04J06T08-CTLCardinality-2024-11
Could not compute solution for formula : PolyORBLF-PT-S04J06T08-CTLCardinality-2024-12
Could not compute solution for formula : PolyORBLF-PT-S04J06T08-CTLCardinality-2024-13
Could not compute solution for formula : PolyORBLF-PT-S04J06T08-CTLCardinality-2024-15

BK_STOP 1717255235391

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name PolyORBLF-PT-S04J06T08-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/992/ctl_0_
ctl formula name PolyORBLF-PT-S04J06T08-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/992/ctl_1_
ctl formula name PolyORBLF-PT-S04J06T08-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/992/ctl_2_
ctl formula name PolyORBLF-PT-S04J06T08-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/992/ctl_3_
ctl formula name PolyORBLF-PT-S04J06T08-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/992/ctl_4_
ctl formula name PolyORBLF-PT-S04J06T08-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/992/ctl_5_
ctl formula name PolyORBLF-PT-S04J06T08-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/992/ctl_6_
ctl formula name PolyORBLF-PT-S04J06T08-CTLCardinality-2024-12
ctl formula formula --ctl=/tmp/992/ctl_7_
ctl formula name PolyORBLF-PT-S04J06T08-CTLCardinality-2024-13
ctl formula formula --ctl=/tmp/992/ctl_8_
ctl formula name PolyORBLF-PT-S04J06T08-CTLCardinality-2024-15
ctl formula formula --ctl=/tmp/992/ctl_9_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="PolyORBLF-PT-S04J06T08"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is PolyORBLF-PT-S04J06T08, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r516-tajo-171654446800297"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S04J06T08.tgz
mv PolyORBLF-PT-S04J06T08 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;