MCC'2024- Execution of r464-smll-171620117800071

About the Execution of LTSMin+red for ASLink-PT-04b

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
901.972	368128.00	421893.00	771.70	TTF??T?FFTFFTT??	normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r464-smll-171620117800071.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool ltsminxred
Input is ASLink-PT-04b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r464-smll-171620117800071
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 17:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 669K May 18 16:42 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 ASLink-PT-04b-ReachabilityFireability-2024-00
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-2024-01
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-2024-02
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-2023-03
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-2024-04
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-2024-05
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-2024-06
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-2023-07
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-2024-08
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-2024-09
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-2024-10
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-2023-11
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-2024-12
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-2024-13
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-2023-14
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717197545398

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-04b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 23:19:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 23:19:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 23:19:07] [INFO ] Load time of PNML (sax parser for PT used): 324 ms
[2024-05-31 23:19:07] [INFO ] Transformed 2034 places.
[2024-05-31 23:19:07] [INFO ] Transformed 2567 transitions.
[2024-05-31 23:19:07] [INFO ] Found NUPN structural information;
[2024-05-31 23:19:07] [INFO ] Parsed PT model containing 2034 places and 2567 transitions and 7875 arcs in 535 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (83 resets) in 2021 ms. (19 steps per ms) remains 12/16 properties
FORMULA ASLink-PT-04b-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (13 resets) in 390 ms. (102 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (18 resets) in 1005 ms. (39 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (12 resets) in 238 ms. (167 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (12 resets) in 307 ms. (129 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (14 resets) in 173 ms. (229 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (11 resets) in 305 ms. (130 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (14 resets) in 120 ms. (330 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (13 resets) in 234 ms. (170 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (13 resets) in 157 ms. (253 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (18 resets) in 260 ms. (153 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (13 resets) in 168 ms. (236 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (10 resets) in 93 ms. (425 steps per ms) remains 12/12 properties
// Phase 1: matrix 2567 rows 2034 cols
[2024-05-31 23:19:10] [INFO ] Computed 199 invariants in 244 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/288 variables, 288/288 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/288 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 403/691 variables, 40/328 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/691 variables, 403/731 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/691 variables, 1/732 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/691 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 74/765 variables, 8/740 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/765 variables, 74/814 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/765 variables, 0/814 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem ASLink-PT-04b-ReachabilityFireability-2023-07 is UNSAT
FORMULA ASLink-PT-04b-ReachabilityFireability-2023-07 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (OVERLAPS) 1248/2013 variables, 147/961 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2013 variables, 1248/2209 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2013 variables, 0/2209 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 21/2034 variables, 3/2212 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2034 variables, 21/2233 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2034 variables, 0/2233 constraints. Problems are: Problem set: 1 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4601/4601 variables, and 4267 constraints, problems are : Problem set: 1 solved, 11 unsolved in 5064 ms.
Refiners :[Domain max(s): 2034/2034 constraints, Positive P Invariants (semi-flows): 48/48 constraints, Generalized P Invariants (flows): 151/151 constraints, State Equation: 2034/2034 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 255/255 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/255 variables, 0/255 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 403/658 variables, 39/294 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/658 variables, 403/697 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/658 variables, 1/698 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/658 variables, 0/698 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 80/738 variables, 9/707 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/738 variables, 80/787 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/738 variables, 0/787 constraints. Problems are: Problem set: 1 solved, 11 unsolved
Problem ASLink-PT-04b-ReachabilityFireability-2024-12 is UNSAT
FORMULA ASLink-PT-04b-ReachabilityFireability-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-04b-ReachabilityFireability-2024-13 is UNSAT
FORMULA ASLink-PT-04b-ReachabilityFireability-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (OVERLAPS) 1268/2006 variables, 145/932 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2006 variables, 1268/2200 constraints. Problems are: Problem set: 3 solved, 9 unsolved
[2024-05-31 23:19:18] [INFO ] Deduced a trap composed of 22 places in 1638 ms of which 147 ms to minimize.
[2024-05-31 23:19:20] [INFO ] Deduced a trap composed of 46 places in 1160 ms of which 13 ms to minimize.
[2024-05-31 23:19:21] [INFO ] Deduced a trap composed of 199 places in 1274 ms of which 13 ms to minimize.
SMT process timed out in 11685ms, After SMT, problems are : Problem set: 3 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 198 out of 2034 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2034/2034 places, 2567/2567 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 357 transitions
Trivial Post-agglo rules discarded 357 transitions
Performed 357 trivial Post agglomeration. Transition count delta: 357
Iterating post reduction 0 with 357 rules applied. Total rules applied 357 place count 2034 transition count 2210
Reduce places removed 357 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 373 rules applied. Total rules applied 730 place count 1677 transition count 2194
Reduce places removed 4 places and 0 transitions.
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Iterating post reduction 2 with 38 rules applied. Total rules applied 768 place count 1673 transition count 2160
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 35 rules applied. Total rules applied 803 place count 1639 transition count 2159
Performed 413 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 413 Pre rules applied. Total rules applied 803 place count 1639 transition count 1746
Deduced a syphon composed of 413 places in 7 ms
Ensure Unique test removed 35 places
Reduce places removed 448 places and 0 transitions.
Iterating global reduction 4 with 861 rules applied. Total rules applied 1664 place count 1191 transition count 1746
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 4 with 24 rules applied. Total rules applied 1688 place count 1187 transition count 1726
Reduce places removed 20 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 5 with 23 rules applied. Total rules applied 1711 place count 1167 transition count 1723
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 1714 place count 1164 transition count 1723
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 9 Pre rules applied. Total rules applied 1714 place count 1164 transition count 1714
Deduced a syphon composed of 9 places in 11 ms
Ensure Unique test removed 4 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 1736 place count 1151 transition count 1714
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 4 Pre rules applied. Total rules applied 1736 place count 1151 transition count 1710
Deduced a syphon composed of 4 places in 6 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1744 place count 1147 transition count 1710
Discarding 53 places :
Symmetric choice reduction at 7 with 53 rule applications. Total rules 1797 place count 1094 transition count 1657
Iterating global reduction 7 with 53 rules applied. Total rules applied 1850 place count 1094 transition count 1657
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1851 place count 1094 transition count 1656
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 13 Pre rules applied. Total rules applied 1851 place count 1094 transition count 1643
Deduced a syphon composed of 13 places in 10 ms
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 8 with 27 rules applied. Total rules applied 1878 place count 1080 transition count 1643
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1878 place count 1080 transition count 1642
Deduced a syphon composed of 1 places in 10 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 1881 place count 1078 transition count 1642
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1884 place count 1075 transition count 1621
Iterating global reduction 8 with 3 rules applied. Total rules applied 1887 place count 1075 transition count 1621
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1887 place count 1075 transition count 1620
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1889 place count 1074 transition count 1620
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 8 with 199 rules applied. Total rules applied 2088 place count 974 transition count 1521
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2089 place count 973 transition count 1520
Ensure Unique test removed 1 places
Iterating global reduction 8 with 2 rules applied. Total rules applied 2091 place count 972 transition count 1520
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2093 place count 971 transition count 1529
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 2095 place count 971 transition count 1527
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 2097 place count 970 transition count 1526
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2098 place count 969 transition count 1526
Free-agglomeration rule applied 12 times.
Iterating global reduction 10 with 12 rules applied. Total rules applied 2110 place count 969 transition count 1514
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 10 with 12 rules applied. Total rules applied 2122 place count 957 transition count 1514
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 11 with 5 rules applied. Total rules applied 2127 place count 957 transition count 1509
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 2132 place count 952 transition count 1509
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 2133 place count 951 transition count 1508
Reduce places removed 4 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 12 with 5 rules applied. Total rules applied 2138 place count 947 transition count 1507
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 2139 place count 946 transition count 1507
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 7 Pre rules applied. Total rules applied 2139 place count 946 transition count 1500
Deduced a syphon composed of 7 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 14 with 15 rules applied. Total rules applied 2154 place count 938 transition count 1500
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 14 with 2 rules applied. Total rules applied 2156 place count 936 transition count 1500
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 15 with 6 rules applied. Total rules applied 2162 place count 933 transition count 1497
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 2163 place count 932 transition count 1496
Iterating global reduction 15 with 1 rules applied. Total rules applied 2164 place count 932 transition count 1496
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 2165 place count 931 transition count 1495
Iterating global reduction 15 with 1 rules applied. Total rules applied 2166 place count 931 transition count 1495
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 2167 place count 931 transition count 1494
Free-agglomeration rule applied 1 times.
Iterating global reduction 16 with 1 rules applied. Total rules applied 2168 place count 931 transition count 1493
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 2169 place count 930 transition count 1493
Applied a total of 2169 rules in 1457 ms. Remains 930 /2034 variables (removed 1104) and now considering 1493/2567 (removed 1074) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1473 ms. Remains : 930/2034 places, 1493/2567 transitions.
RANDOM walk for 40000 steps (272 resets) in 644 ms. (62 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (41 resets) in 154 ms. (258 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (54 resets) in 286 ms. (139 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (49 resets) in 229 ms. (173 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (52 resets) in 239 ms. (166 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (52 resets) in 146 ms. (272 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (51 resets) in 118 ms. (336 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (48 resets) in 285 ms. (139 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (50 resets) in 170 ms. (233 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (47 resets) in 145 ms. (273 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 189110 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 9
Probabilistic random walk after 189110 steps, saw 41979 distinct states, run finished after 3007 ms. (steps per millisecond=62 ) properties seen :0
// Phase 1: matrix 1493 rows 930 cols
[2024-05-31 23:19:26] [INFO ] Computed 144 invariants in 77 ms
[2024-05-31 23:19:26] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 274/472 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 12/484 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/484 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 437/921 variables, 104/142 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/921 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 9/930 variables, 2/144 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/930 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 1493/2423 variables, 930/1074 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2423 variables, 6/1080 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2423 variables, 0/1080 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 0/2423 variables, 0/1080 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2423/2423 variables, and 1080 constraints, problems are : Problem set: 0 solved, 9 unsolved in 4608 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 107/107 constraints, State Equation: 930/930 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 274/472 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 12/484 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/484 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 437/921 variables, 104/142 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-31 23:19:33] [INFO ] Deduced a trap composed of 29 places in 664 ms of which 8 ms to minimize.
[2024-05-31 23:19:33] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2024-05-31 23:19:33] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 2 ms to minimize.
[2024-05-31 23:19:33] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/921 variables, 4/146 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-31 23:19:33] [INFO ] Deduced a trap composed of 36 places in 145 ms of which 3 ms to minimize.
[2024-05-31 23:19:34] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 1 ms to minimize.
[2024-05-31 23:19:34] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/921 variables, 3/149 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-31 23:19:34] [INFO ] Deduced a trap composed of 10 places in 244 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/921 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/921 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 9/930 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-31 23:19:35] [INFO ] Deduced a trap composed of 101 places in 279 ms of which 4 ms to minimize.
[2024-05-31 23:19:36] [INFO ] Deduced a trap composed of 37 places in 165 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/930 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-31 23:19:36] [INFO ] Deduced a trap composed of 124 places in 421 ms of which 5 ms to minimize.
[2024-05-31 23:19:37] [INFO ] Deduced a trap composed of 108 places in 390 ms of which 5 ms to minimize.
[2024-05-31 23:19:37] [INFO ] Deduced a trap composed of 108 places in 364 ms of which 5 ms to minimize.
[2024-05-31 23:19:38] [INFO ] Deduced a trap composed of 106 places in 383 ms of which 5 ms to minimize.
[2024-05-31 23:19:38] [INFO ] Deduced a trap composed of 27 places in 250 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/930 variables, 5/159 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/930 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem ASLink-PT-04b-ReachabilityFireability-2024-02 is UNSAT
FORMULA ASLink-PT-04b-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-04b-ReachabilityFireability-2024-10 is UNSAT
FORMULA ASLink-PT-04b-ReachabilityFireability-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-04b-ReachabilityFireability-2023-11 is UNSAT
FORMULA ASLink-PT-04b-ReachabilityFireability-2023-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 15 (OVERLAPS) 1493/2423 variables, 930/1089 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2423 variables, 6/1095 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2423 variables, 6/1101 constraints. Problems are: Problem set: 3 solved, 6 unsolved
[2024-05-31 23:20:15] [INFO ] Deduced a trap composed of 53 places in 195 ms of which 2 ms to minimize.
[2024-05-31 23:20:15] [INFO ] Deduced a trap composed of 51 places in 164 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2423/2423 variables, and 1103 constraints, problems are : Problem set: 3 solved, 6 unsolved in 45013 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 107/107 constraints, State Equation: 930/930 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/9 constraints, Known Traps: 17/17 constraints]
After SMT, in 49836ms problems are : Problem set: 3 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 155 out of 930 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 930/930 places, 1493/1493 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 930 transition count 1488
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 925 transition count 1487
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 924 transition count 1487
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 12 place count 924 transition count 1462
Deduced a syphon composed of 25 places in 3 ms
Ensure Unique test removed 3 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 53 rules applied. Total rules applied 65 place count 896 transition count 1462
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 65 place count 896 transition count 1461
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 67 place count 895 transition count 1461
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 68 place count 894 transition count 1460
Iterating global reduction 3 with 1 rules applied. Total rules applied 69 place count 894 transition count 1460
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 79 place count 889 transition count 1455
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 81 place count 889 transition count 1453
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 84 place count 887 transition count 1452
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 85 place count 887 transition count 1451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 86 place count 886 transition count 1451
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 88 place count 884 transition count 1449
Applied a total of 88 rules in 254 ms. Remains 884 /930 variables (removed 46) and now considering 1449/1493 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 255 ms. Remains : 884/930 places, 1449/1493 transitions.
RANDOM walk for 40000 steps (288 resets) in 533 ms. (74 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (65 resets) in 256 ms. (155 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (57 resets) in 117 ms. (339 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (60 resets) in 204 ms. (195 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (56 resets) in 103 ms. (384 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (54 resets) in 132 ms. (300 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (53 resets) in 80 ms. (493 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 208995 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :0 out of 6
Probabilistic random walk after 208995 steps, saw 44480 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
// Phase 1: matrix 1449 rows 884 cols
[2024-05-31 23:20:20] [INFO ] Computed 141 invariants in 22 ms
[2024-05-31 23:20:20] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 229/384 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 14/398 variables, 5/34 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 476/874 variables, 104/138 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/874 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 10/884 variables, 3/141 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/884 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1449/2333 variables, 884/1025 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2333 variables, 7/1032 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2333 variables, 0/1032 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/2333 variables, 0/1032 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2333/2333 variables, and 1032 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3385 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 108/108 constraints, State Equation: 884/884 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 229/384 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 14/398 variables, 5/34 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 23:20:24] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 23:20:24] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 476/874 variables, 104/140 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 23:20:24] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 2 ms to minimize.
[2024-05-31 23:20:25] [INFO ] Deduced a trap composed of 94 places in 617 ms of which 6 ms to minimize.
[2024-05-31 23:20:25] [INFO ] Deduced a trap composed of 31 places in 178 ms of which 3 ms to minimize.
[2024-05-31 23:20:25] [INFO ] Deduced a trap composed of 80 places in 160 ms of which 2 ms to minimize.
[2024-05-31 23:20:26] [INFO ] Deduced a trap composed of 80 places in 187 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/874 variables, 5/145 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 23:20:26] [INFO ] Deduced a trap composed of 34 places in 548 ms of which 7 ms to minimize.
[2024-05-31 23:20:27] [INFO ] Deduced a trap composed of 137 places in 448 ms of which 6 ms to minimize.
[2024-05-31 23:20:27] [INFO ] Deduced a trap composed of 93 places in 538 ms of which 7 ms to minimize.
[2024-05-31 23:20:28] [INFO ] Deduced a trap composed of 120 places in 528 ms of which 6 ms to minimize.
[2024-05-31 23:20:28] [INFO ] Deduced a trap composed of 79 places in 145 ms of which 3 ms to minimize.
[2024-05-31 23:20:29] [INFO ] Deduced a trap composed of 29 places in 519 ms of which 7 ms to minimize.
[2024-05-31 23:20:29] [INFO ] Deduced a trap composed of 80 places in 522 ms of which 15 ms to minimize.
[2024-05-31 23:20:30] [INFO ] Deduced a trap composed of 113 places in 524 ms of which 6 ms to minimize.
[2024-05-31 23:20:30] [INFO ] Deduced a trap composed of 85 places in 142 ms of which 3 ms to minimize.
[2024-05-31 23:20:30] [INFO ] Deduced a trap composed of 57 places in 133 ms of which 3 ms to minimize.
[2024-05-31 23:20:30] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/874 variables, 11/156 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 23:20:31] [INFO ] Deduced a trap composed of 63 places in 632 ms of which 7 ms to minimize.
[2024-05-31 23:20:31] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/874 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/874 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 10/884 variables, 3/161 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/884 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 1449/2333 variables, 884/1045 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2333 variables, 7/1052 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2333 variables, 6/1058 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 23:20:48] [INFO ] Deduced a trap composed of 27 places in 185 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/2333 variables, 1/1059 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2333/2333 variables, and 1059 constraints, problems are : Problem set: 0 solved, 6 unsolved in 75013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 108/108 constraints, State Equation: 884/884 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 21/21 constraints]
After SMT, in 78501ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 155 out of 884 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 884/884 places, 1449/1449 transitions.
Applied a total of 0 rules in 29 ms. Remains 884 /884 variables (removed 0) and now considering 1449/1449 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 884/884 places, 1449/1449 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 884/884 places, 1449/1449 transitions.
Applied a total of 0 rules in 28 ms. Remains 884 /884 variables (removed 0) and now considering 1449/1449 (removed 0) transitions.
[2024-05-31 23:21:39] [INFO ] Invariant cache hit.
[2024-05-31 23:21:39] [INFO ] Implicit Places using invariants in 823 ms returned [30, 150, 154, 165, 179, 180, 191, 207, 211, 238, 256, 280, 300, 354, 370, 371, 377, 414, 471, 508, 513, 514, 526, 527, 532, 554, 573, 641, 644, 655, 656, 690, 693, 737, 741, 762, 766, 787, 799, 805, 811, 817, 824, 836, 842, 848]
[2024-05-31 23:21:39] [INFO ] Actually due to overlaps returned [238, 377, 532, 554, 741, 526, 693, 211, 527, 737, 762, 354, 513, 514, 207, 371, 414, 573, 690, 817, 836, 30, 191, 256, 280, 300, 370, 641, 655, 766, 787, 799, 805, 811, 824, 842, 848]
Discarding 37 places :
Implicit Place search using SMT only with invariants took 836 ms to find 37 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 847/884 places, 1449/1449 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 844 transition count 1425
Reduce places removed 24 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 1 with 39 rules applied. Total rules applied 66 place count 820 transition count 1410
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 81 place count 805 transition count 1410
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 81 place count 805 transition count 1402
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 97 place count 797 transition count 1402
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 98 place count 796 transition count 1402
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 104 place count 790 transition count 1396
Iterating global reduction 4 with 6 rules applied. Total rules applied 110 place count 790 transition count 1396
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 110 place count 790 transition count 1395
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 112 place count 789 transition count 1395
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 113 place count 788 transition count 1394
Iterating global reduction 4 with 1 rules applied. Total rules applied 114 place count 788 transition count 1394
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 115 place count 787 transition count 1392
Iterating global reduction 4 with 1 rules applied. Total rules applied 116 place count 787 transition count 1392
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 3 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 168 place count 761 transition count 1366
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 169 place count 760 transition count 1365
Iterating global reduction 4 with 1 rules applied. Total rules applied 170 place count 760 transition count 1365
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 171 place count 760 transition count 1364
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 172 place count 759 transition count 1364
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 5 with 10 rules applied. Total rules applied 182 place count 759 transition count 1354
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 192 place count 749 transition count 1354
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 193 place count 749 transition count 1353
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 200 place count 749 transition count 1353
Applied a total of 200 rules in 297 ms. Remains 749 /847 variables (removed 98) and now considering 1353/1449 (removed 96) transitions.
// Phase 1: matrix 1353 rows 749 cols
[2024-05-31 23:21:40] [INFO ] Computed 100 invariants in 15 ms
[2024-05-31 23:21:40] [INFO ] Implicit Places using invariants in 641 ms returned [147, 151, 174, 175, 185, 312, 336, 337, 338, 437, 563, 566, 572, 575]
[2024-05-31 23:21:40] [INFO ] Actually due to overlaps returned [337, 338, 147, 174, 185, 312, 336, 437, 563, 566, 572, 575]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 645 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 737/884 places, 1353/1449 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 735 transition count 1351
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 733 transition count 1351
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 732 transition count 1350
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 732 transition count 1350
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 2 with 2 rules applied. Total rules applied 10 place count 731 transition count 1349
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 731 transition count 1348
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 730 transition count 1348
Applied a total of 12 rules in 135 ms. Remains 730 /737 variables (removed 7) and now considering 1348/1353 (removed 5) transitions.
// Phase 1: matrix 1348 rows 730 cols
[2024-05-31 23:21:40] [INFO ] Computed 86 invariants in 14 ms
[2024-05-31 23:21:41] [INFO ] Implicit Places using invariants in 604 ms returned []
[2024-05-31 23:21:41] [INFO ] Invariant cache hit.
[2024-05-31 23:21:42] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-31 23:21:44] [INFO ] Implicit Places using invariants and state equation in 2529 ms returned []
Implicit Place search using SMT with State Equation took 3139 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 730/884 places, 1348/1449 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 5080 ms. Remains : 730/884 places, 1348/1449 transitions.
RANDOM walk for 40000 steps (299 resets) in 159 ms. (250 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (75 resets) in 135 ms. (294 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (66 resets) in 72 ms. (547 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (68 resets) in 125 ms. (317 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (63 resets) in 92 ms. (430 steps per ms) remains 5/6 properties
FORMULA ASLink-PT-04b-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (59 resets) in 101 ms. (392 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (67 resets) in 65 ms. (606 steps per ms) remains 5/5 properties
[2024-05-31 23:21:44] [INFO ] Invariant cache hit.
[2024-05-31 23:21:44] [INFO ] State equation strengthened by 10 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 198/322 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 25/347 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/347 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 383/730 variables, 61/86 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/730 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1348/2078 variables, 730/816 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2078 variables, 10/826 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2078 variables, 0/826 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/2078 variables, 0/826 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2078/2078 variables, and 826 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2279 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 62/62 constraints, State Equation: 730/730 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 198/322 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 25/347 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 23:21:46] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 5 ms to minimize.
[2024-05-31 23:21:46] [INFO ] Deduced a trap composed of 51 places in 63 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/347 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/347 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 383/730 variables, 61/88 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 23:21:47] [INFO ] Deduced a trap composed of 39 places in 476 ms of which 6 ms to minimize.
[2024-05-31 23:21:48] [INFO ] Deduced a trap composed of 77 places in 447 ms of which 6 ms to minimize.
[2024-05-31 23:21:48] [INFO ] Deduced a trap composed of 76 places in 147 ms of which 3 ms to minimize.
[2024-05-31 23:21:48] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 3 ms to minimize.
[2024-05-31 23:21:48] [INFO ] Deduced a trap composed of 58 places in 125 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/730 variables, 5/93 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/730 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1348/2078 variables, 730/823 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2078 variables, 10/833 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2078 variables, 5/838 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 23:22:15] [INFO ] Deduced a trap composed of 55 places in 318 ms of which 5 ms to minimize.
[2024-05-31 23:22:20] [INFO ] Deduced a trap composed of 64 places in 392 ms of which 5 ms to minimize.
[2024-05-31 23:22:20] [INFO ] Deduced a trap composed of 64 places in 400 ms of which 6 ms to minimize.
[2024-05-31 23:22:37] [INFO ] Deduced a trap composed of 18 places in 465 ms of which 6 ms to minimize.
[2024-05-31 23:22:38] [INFO ] Deduced a trap composed of 7 places in 511 ms of which 6 ms to minimize.
[2024-05-31 23:22:39] [INFO ] Deduced a trap composed of 24 places in 454 ms of which 5 ms to minimize.
[2024-05-31 23:22:39] [INFO ] Deduced a trap composed of 39 places in 398 ms of which 5 ms to minimize.
[2024-05-31 23:22:40] [INFO ] Deduced a trap composed of 8 places in 465 ms of which 10 ms to minimize.
[2024-05-31 23:22:40] [INFO ] Deduced a trap composed of 20 places in 462 ms of which 6 ms to minimize.
[2024-05-31 23:22:41] [INFO ] Deduced a trap composed of 33 places in 368 ms of which 5 ms to minimize.
[2024-05-31 23:22:41] [INFO ] Deduced a trap composed of 47 places in 393 ms of which 4 ms to minimize.
[2024-05-31 23:22:42] [INFO ] Deduced a trap composed of 41 places in 374 ms of which 4 ms to minimize.
[2024-05-31 23:22:52] [INFO ] Deduced a trap composed of 42 places in 466 ms of which 5 ms to minimize.
[2024-05-31 23:22:52] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2078 variables, 14/852 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 23:22:55] [INFO ] Deduced a trap composed of 31 places in 165 ms of which 3 ms to minimize.
[2024-05-31 23:22:55] [INFO ] Deduced a trap composed of 46 places in 156 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2078 variables, 2/854 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 23:23:13] [INFO ] Deduced a trap composed of 46 places in 339 ms of which 4 ms to minimize.
[2024-05-31 23:23:13] [INFO ] Deduced a trap composed of 40 places in 155 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2078/2078 variables, and 856 constraints, problems are : Problem set: 0 solved, 5 unsolved in 90014 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 62/62 constraints, State Equation: 730/730 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 25/25 constraints]
After SMT, in 92339ms problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 124 out of 730 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 730/730 places, 1348/1348 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 730 transition count 1343
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 725 transition count 1342
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 724 transition count 1342
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 12 place count 724 transition count 1327
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 42 place count 709 transition count 1327
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 43 place count 708 transition count 1321
Iterating global reduction 3 with 1 rules applied. Total rules applied 44 place count 708 transition count 1321
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 58 place count 701 transition count 1314
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 700 transition count 1313
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 700 transition count 1311
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 66 place count 700 transition count 1307
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 70 place count 696 transition count 1307
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 71 place count 696 transition count 1307
Applied a total of 71 rules in 155 ms. Remains 696 /730 variables (removed 34) and now considering 1307/1348 (removed 41) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 156 ms. Remains : 696/730 places, 1307/1348 transitions.
RANDOM walk for 40000 steps (358 resets) in 456 ms. (87 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (84 resets) in 367 ms. (108 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (79 resets) in 336 ms. (118 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (78 resets) in 333 ms. (119 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (77 resets) in 317 ms. (125 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (77 resets) in 318 ms. (125 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 217288 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :0 out of 5
Probabilistic random walk after 217288 steps, saw 46754 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
// Phase 1: matrix 1307 rows 696 cols
[2024-05-31 23:23:20] [INFO ] Computed 86 invariants in 14 ms
[2024-05-31 23:23:20] [INFO ] State equation strengthened by 10 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 184/308 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 19/327 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 369/696 variables, 60/86 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/696 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1307/2003 variables, 696/782 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2003 variables, 10/792 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2003 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/2003 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2003/2003 variables, and 792 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2041 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 61/61 constraints, State Equation: 696/696 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 184/308 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 23:23:22] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 19/327 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 369/696 variables, 60/87 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 23:23:23] [INFO ] Deduced a trap composed of 54 places in 101 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/696 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 23:23:23] [INFO ] Deduced a trap composed of 50 places in 128 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/696 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/696 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1307/2003 variables, 696/785 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2003 variables, 10/795 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2003 variables, 5/800 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 23:24:03] [INFO ] Deduced a trap composed of 47 places in 218 ms of which 3 ms to minimize.
[2024-05-31 23:24:04] [INFO ] Deduced a trap composed of 56 places in 337 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2003 variables, 2/802 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2003 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 23:24:14] [INFO ] Deduced a trap composed of 62 places in 189 ms of which 3 ms to minimize.
[2024-05-31 23:24:14] [INFO ] Deduced a trap composed of 62 places in 169 ms of which 2 ms to minimize.
[2024-05-31 23:24:15] [INFO ] Deduced a trap composed of 68 places in 175 ms of which 2 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/2003 variables, 3/805 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 23:24:20] [INFO ] Deduced a trap composed of 46 places in 270 ms of which 3 ms to minimize.
[2024-05-31 23:24:20] [INFO ] Deduced a trap composed of 43 places in 273 ms of which 3 ms to minimize.
[2024-05-31 23:24:21] [INFO ] Deduced a trap composed of 41 places in 224 ms of which 3 ms to minimize.
[2024-05-31 23:24:21] [INFO ] Deduced a trap composed of 49 places in 284 ms of which 3 ms to minimize.
[2024-05-31 23:24:21] [INFO ] Deduced a trap composed of 46 places in 169 ms of which 3 ms to minimize.
[2024-05-31 23:24:22] [INFO ] Deduced a trap composed of 32 places in 253 ms of which 3 ms to minimize.
[2024-05-31 23:24:22] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 2 ms to minimize.
[2024-05-31 23:24:23] [INFO ] Deduced a trap composed of 30 places in 342 ms of which 4 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/2003 variables, 8/813 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 23:24:56] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 2 ms to minimize.
[2024-05-31 23:24:57] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/2003 variables, 2/815 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 23:24:58] [INFO ] Deduced a trap composed of 68 places in 237 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/2003 variables, 1/816 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2003/2003 variables, and 816 constraints, problems are : Problem set: 0 solved, 5 unsolved in 105010 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 61/61 constraints, State Equation: 696/696 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 19/19 constraints]
After SMT, in 107103ms problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 124 out of 696 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 696/696 places, 1307/1307 transitions.
Applied a total of 0 rules in 19 ms. Remains 696 /696 variables (removed 0) and now considering 1307/1307 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 696/696 places, 1307/1307 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 696/696 places, 1307/1307 transitions.
Applied a total of 0 rules in 18 ms. Remains 696 /696 variables (removed 0) and now considering 1307/1307 (removed 0) transitions.
[2024-05-31 23:25:07] [INFO ] Invariant cache hit.
[2024-05-31 23:25:08] [INFO ] Implicit Places using invariants in 772 ms returned [44, 329, 537, 551]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 775 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 692/696 places, 1307/1307 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 692 transition count 1303
Reduce places removed 4 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 7 rules applied. Total rules applied 11 place count 688 transition count 1300
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 14 place count 685 transition count 1300
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 14 place count 685 transition count 1299
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 16 place count 684 transition count 1299
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 24 place count 680 transition count 1295
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 680 transition count 1294
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 26 place count 679 transition count 1294
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 27 place count 679 transition count 1294
Applied a total of 27 rules in 80 ms. Remains 679 /692 variables (removed 13) and now considering 1294/1307 (removed 13) transitions.
// Phase 1: matrix 1294 rows 679 cols
[2024-05-31 23:25:08] [INFO ] Computed 82 invariants in 13 ms
[2024-05-31 23:25:09] [INFO ] Implicit Places using invariants in 776 ms returned [389, 514]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 778 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 677/696 places, 1294/1307 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 676 transition count 1293
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 676 transition count 1292
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 675 transition count 1292
Applied a total of 4 rules in 52 ms. Remains 675 /677 variables (removed 2) and now considering 1292/1294 (removed 2) transitions.
// Phase 1: matrix 1292 rows 675 cols
[2024-05-31 23:25:09] [INFO ] Computed 80 invariants in 13 ms
[2024-05-31 23:25:10] [INFO ] Implicit Places using invariants in 684 ms returned []
[2024-05-31 23:25:10] [INFO ] Invariant cache hit.
[2024-05-31 23:25:10] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-31 23:25:12] [INFO ] Implicit Places using invariants and state equation in 2551 ms returned []
Implicit Place search using SMT with State Equation took 3240 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 675/696 places, 1292/1307 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 4946 ms. Remains : 675/696 places, 1292/1307 transitions.
[2024-05-31 23:25:12] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2024-05-31 23:25:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 675 places, 1292 transitions and 4910 arcs took 16 ms.
[2024-05-31 23:25:13] [INFO ] Flatten gal took : 244 ms
Total runtime 365995 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 : ASLink-PT-04b-ReachabilityFireability-2023-03
Could not compute solution for formula : ASLink-PT-04b-ReachabilityFireability-2024-04
Could not compute solution for formula : ASLink-PT-04b-ReachabilityFireability-2024-06
Could not compute solution for formula : ASLink-PT-04b-ReachabilityFireability-2023-14
Could not compute solution for formula : ASLink-PT-04b-ReachabilityFireability-2024-15

BK_STOP 1717197913526

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name ASLink-PT-04b-ReachabilityFireability-2023-03
rfs formula type AG
rfs formula formula --invariant=/tmp/852/inv_0_
rfs formula name ASLink-PT-04b-ReachabilityFireability-2024-04
rfs formula type AG
rfs formula formula --invariant=/tmp/852/inv_1_
rfs formula name ASLink-PT-04b-ReachabilityFireability-2024-06
rfs formula type EF
rfs formula formula --invariant=/tmp/852/inv_2_
rfs formula name ASLink-PT-04b-ReachabilityFireability-2023-14
rfs formula type EF
rfs formula formula --invariant=/tmp/852/inv_3_
rfs formula name ASLink-PT-04b-ReachabilityFireability-2024-15
rfs formula type AG
rfs formula formula --invariant=/tmp/852/inv_4_
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="ASLink-PT-04b"
export BK_EXAMINATION="ReachabilityFireability"
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 ASLink-PT-04b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r464-smll-171620117800071"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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