About the Execution of LTSMin+red for ShieldPPPt-PT-050B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1230.487 | 475751.00 | 630266.00 | 902.00 | F???TTF??T???F?? | 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.r528-tall-171683761600687.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 ShieldPPPt-PT-050B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683761600687
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 9.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 114K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 14:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 170K Apr 11 14:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 11 14:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 11 14:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 955K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-2024-00
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717260579083
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-050B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:49:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 16:49:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:49:40] [INFO ] Load time of PNML (sax parser for PT used): 216 ms
[2024-06-01 16:49:40] [INFO ] Transformed 3903 places.
[2024-06-01 16:49:40] [INFO ] Transformed 3553 transitions.
[2024-06-01 16:49:40] [INFO ] Found NUPN structural information;
[2024-06-01 16:49:40] [INFO ] Parsed PT model containing 3903 places and 3553 transitions and 8906 arcs in 497 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 1660 ms. (24 steps per ms) remains 12/16 properties
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 254 ms. (156 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 317 ms. (125 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 156 ms. (254 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 12/12 properties
// Phase 1: matrix 3553 rows 3903 cols
[2024-06-01 16:49:42] [INFO ] Computed 551 invariants in 52 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 161/161 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3609/3770 variables, 530/691 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3770 variables, 3609/4300 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3770 variables, 0/4300 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 133/3903 variables, 21/4321 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3903 variables, 133/4454 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3903 variables, 0/4454 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 3553/7456 variables, 3903/8357 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 7456/7456 variables, and 8357 constraints, problems are : Problem set: 0 solved, 12 unsolved in 5104 ms.
Refiners :[Domain max(s): 3903/3903 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 3903/3903 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 161/161 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3609/3770 variables, 530/691 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3770 variables, 3609/4300 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-01 16:49:50] [INFO ] Deduced a trap composed of 23 places in 1259 ms of which 133 ms to minimize.
[2024-06-01 16:49:51] [INFO ] Deduced a trap composed of 28 places in 1188 ms of which 28 ms to minimize.
[2024-06-01 16:49:53] [INFO ] Deduced a trap composed of 20 places in 1991 ms of which 15 ms to minimize.
SMT process timed out in 11142ms, After SMT, problems are : Problem set: 0 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 161 out of 3903 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3903/3903 places, 3553/3553 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 821 transitions
Trivial Post-agglo rules discarded 821 transitions
Performed 821 trivial Post agglomeration. Transition count delta: 821
Iterating post reduction 0 with 821 rules applied. Total rules applied 821 place count 3903 transition count 2732
Reduce places removed 821 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 823 rules applied. Total rules applied 1644 place count 3082 transition count 2730
Reduce places removed 1 places and 0 transitions.
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Iterating post reduction 2 with 58 rules applied. Total rules applied 1702 place count 3081 transition count 2673
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 3 with 57 rules applied. Total rules applied 1759 place count 3024 transition count 2673
Performed 206 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 206 Pre rules applied. Total rules applied 1759 place count 3024 transition count 2467
Deduced a syphon composed of 206 places in 8 ms
Reduce places removed 206 places and 0 transitions.
Iterating global reduction 4 with 412 rules applied. Total rules applied 2171 place count 2818 transition count 2467
Discarding 326 places :
Symmetric choice reduction at 4 with 326 rule applications. Total rules 2497 place count 2492 transition count 2141
Iterating global reduction 4 with 326 rules applied. Total rules applied 2823 place count 2492 transition count 2141
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 121 Pre rules applied. Total rules applied 2823 place count 2492 transition count 2020
Deduced a syphon composed of 121 places in 15 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 4 with 242 rules applied. Total rules applied 3065 place count 2371 transition count 2020
Performed 779 Post agglomeration using F-continuation condition.Transition count delta: 779
Deduced a syphon composed of 779 places in 5 ms
Reduce places removed 779 places and 0 transitions.
Iterating global reduction 4 with 1558 rules applied. Total rules applied 4623 place count 1592 transition count 1241
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4825 place count 1491 transition count 1241
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 15 places in 4 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 4855 place count 1476 transition count 1241
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 4860 place count 1476 transition count 1236
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 4865 place count 1471 transition count 1236
Partial Free-agglomeration rule applied 137 times.
Drop transitions (Partial Free agglomeration) removed 137 transitions
Iterating global reduction 5 with 137 rules applied. Total rules applied 5002 place count 1471 transition count 1236
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 5003 place count 1471 transition count 1236
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 5004 place count 1470 transition count 1235
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 5005 place count 1469 transition count 1235
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 5005 place count 1469 transition count 1233
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 5009 place count 1467 transition count 1233
Applied a total of 5009 rules in 1928 ms. Remains 1467 /3903 variables (removed 2436) and now considering 1233/3553 (removed 2320) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1942 ms. Remains : 1467/3903 places, 1233/3553 transitions.
RANDOM walk for 40000 steps (8 resets) in 1129 ms. (35 steps per ms) remains 11/12 properties
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 486 ms. (82 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 345 ms. (115 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 259 ms. (153 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 282 ms. (141 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 223 ms. (178 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 250 ms. (159 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 289 ms. (137 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 374 ms. (106 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 314 ms. (126 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 335 ms. (119 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 340 ms. (117 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 83923 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 11
Probabilistic random walk after 83923 steps, saw 53089 distinct states, run finished after 3011 ms. (steps per millisecond=27 ) properties seen :0
// Phase 1: matrix 1233 rows 1467 cols
[2024-06-01 16:50:00] [INFO ] Computed 550 invariants in 5 ms
[2024-06-01 16:50:00] [INFO ] State equation strengthened by 245 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 1265/1425 variables, 530/530 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1425 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 15/1440 variables, 7/537 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1440 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 1220/2660 variables, 1440/1977 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2660 variables, 243/2220 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2660 variables, 0/2220 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 26/2686 variables, 17/2237 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2686 variables, 7/2244 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2686 variables, 1/2245 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2686 variables, 0/2245 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 1/2687 variables, 1/2246 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2687 variables, 1/2247 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2687 variables, 0/2247 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 1/2688 variables, 1/2248 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2688 variables, 1/2249 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2688 variables, 0/2249 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (OVERLAPS) 10/2698 variables, 6/2255 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2698 variables, 2/2257 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2698 variables, 1/2258 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2698 variables, 0/2258 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 22 (OVERLAPS) 1/2699 variables, 1/2259 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2699 variables, 1/2260 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2699 variables, 0/2260 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 25 (OVERLAPS) 1/2700 variables, 1/2261 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2700 variables, 1/2262 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2700 variables, 0/2262 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 28 (OVERLAPS) 0/2700 variables, 0/2262 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2700/2700 variables, and 2262 constraints, problems are : Problem set: 0 solved, 11 unsolved in 7806 ms.
Refiners :[Positive P Invariants (semi-flows): 550/550 constraints, State Equation: 1467/1467 constraints, ReadFeed: 245/245 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 1265/1425 variables, 530/530 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 16:50:08] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 2 ms to minimize.
[2024-06-01 16:50:08] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 3 ms to minimize.
[2024-06-01 16:50:08] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 3 ms to minimize.
[2024-06-01 16:50:08] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 2 ms to minimize.
[2024-06-01 16:50:08] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 2 ms to minimize.
[2024-06-01 16:50:09] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 3 ms to minimize.
[2024-06-01 16:50:09] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 3 ms to minimize.
[2024-06-01 16:50:09] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 4 ms to minimize.
[2024-06-01 16:50:09] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 2 ms to minimize.
[2024-06-01 16:50:09] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 2 ms to minimize.
[2024-06-01 16:50:09] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 3 ms to minimize.
[2024-06-01 16:50:09] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 2 ms to minimize.
[2024-06-01 16:50:10] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 2 ms to minimize.
[2024-06-01 16:50:10] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 2 ms to minimize.
[2024-06-01 16:50:10] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 2 ms to minimize.
[2024-06-01 16:50:10] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 2 ms to minimize.
[2024-06-01 16:50:10] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 2 ms to minimize.
[2024-06-01 16:50:10] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 2 ms to minimize.
[2024-06-01 16:50:10] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 2 ms to minimize.
[2024-06-01 16:50:10] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1425 variables, 20/550 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 16:50:11] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 3 ms to minimize.
[2024-06-01 16:50:11] [INFO ] Deduced a trap composed of 5 places in 122 ms of which 2 ms to minimize.
[2024-06-01 16:50:11] [INFO ] Deduced a trap composed of 8 places in 124 ms of which 2 ms to minimize.
[2024-06-01 16:50:11] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 4 ms to minimize.
[2024-06-01 16:50:11] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 2 ms to minimize.
[2024-06-01 16:50:11] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 2 ms to minimize.
[2024-06-01 16:50:11] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 2 ms to minimize.
[2024-06-01 16:50:12] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 3 ms to minimize.
[2024-06-01 16:50:12] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 3 ms to minimize.
[2024-06-01 16:50:12] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 2 ms to minimize.
[2024-06-01 16:50:12] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 3 ms to minimize.
[2024-06-01 16:50:12] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 3 ms to minimize.
[2024-06-01 16:50:12] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 2 ms to minimize.
[2024-06-01 16:50:12] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 3 ms to minimize.
[2024-06-01 16:50:13] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 2 ms to minimize.
[2024-06-01 16:50:13] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 3 ms to minimize.
[2024-06-01 16:50:13] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 2 ms to minimize.
[2024-06-01 16:50:13] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 2 ms to minimize.
[2024-06-01 16:50:13] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 2 ms to minimize.
[2024-06-01 16:50:13] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1425 variables, 20/570 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 16:50:13] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 2 ms to minimize.
[2024-06-01 16:50:14] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 2 ms to minimize.
[2024-06-01 16:50:14] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 2 ms to minimize.
[2024-06-01 16:50:14] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 2 ms to minimize.
[2024-06-01 16:50:14] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 2 ms to minimize.
[2024-06-01 16:50:14] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 2 ms to minimize.
[2024-06-01 16:50:14] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 3 ms to minimize.
[2024-06-01 16:50:14] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 3 ms to minimize.
[2024-06-01 16:50:14] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 2 ms to minimize.
[2024-06-01 16:50:15] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 2 ms to minimize.
[2024-06-01 16:50:15] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 2 ms to minimize.
[2024-06-01 16:50:15] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 2 ms to minimize.
[2024-06-01 16:50:15] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 5 ms to minimize.
[2024-06-01 16:50:15] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 2 ms to minimize.
[2024-06-01 16:50:15] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1425 variables, 15/585 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 16:50:16] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 2 ms to minimize.
[2024-06-01 16:50:16] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1425 variables, 2/587 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 16:50:16] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 2 ms to minimize.
[2024-06-01 16:50:16] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1425 variables, 2/589 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1425 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 15/1440 variables, 7/596 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1440 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 1220/2660 variables, 1440/2036 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2660 variables, 243/2279 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2660 variables, 9/2288 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 16:50:20] [INFO ] Deduced a trap composed of 8 places in 256 ms of which 5 ms to minimize.
[2024-06-01 16:50:21] [INFO ] Deduced a trap composed of 5 places in 261 ms of which 6 ms to minimize.
[2024-06-01 16:50:21] [INFO ] Deduced a trap composed of 8 places in 255 ms of which 5 ms to minimize.
[2024-06-01 16:50:21] [INFO ] Deduced a trap composed of 7 places in 261 ms of which 5 ms to minimize.
[2024-06-01 16:50:22] [INFO ] Deduced a trap composed of 8 places in 257 ms of which 4 ms to minimize.
[2024-06-01 16:50:22] [INFO ] Deduced a trap composed of 10 places in 251 ms of which 4 ms to minimize.
[2024-06-01 16:50:22] [INFO ] Deduced a trap composed of 11 places in 249 ms of which 4 ms to minimize.
[2024-06-01 16:50:23] [INFO ] Deduced a trap composed of 11 places in 243 ms of which 4 ms to minimize.
[2024-06-01 16:50:23] [INFO ] Deduced a trap composed of 20 places in 239 ms of which 4 ms to minimize.
[2024-06-01 16:50:23] [INFO ] Deduced a trap composed of 5 places in 236 ms of which 5 ms to minimize.
[2024-06-01 16:50:24] [INFO ] Deduced a trap composed of 8 places in 220 ms of which 4 ms to minimize.
[2024-06-01 16:50:24] [INFO ] Deduced a trap composed of 7 places in 228 ms of which 4 ms to minimize.
[2024-06-01 16:50:25] [INFO ] Deduced a trap composed of 12 places in 215 ms of which 4 ms to minimize.
[2024-06-01 16:50:25] [INFO ] Deduced a trap composed of 7 places in 206 ms of which 4 ms to minimize.
[2024-06-01 16:50:25] [INFO ] Deduced a trap composed of 8 places in 203 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2660 variables, 15/2303 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 16:50:29] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 3 ms to minimize.
[2024-06-01 16:50:29] [INFO ] Deduced a trap composed of 10 places in 159 ms of which 3 ms to minimize.
[2024-06-01 16:50:29] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2660 variables, 3/2306 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2660 variables, 0/2306 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (OVERLAPS) 26/2686 variables, 17/2323 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2686 variables, 7/2330 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2686 variables, 1/2331 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2686 variables, 2/2333 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 16:50:35] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 3 ms to minimize.
[2024-06-01 16:50:35] [INFO ] Deduced a trap composed of 12 places in 157 ms of which 3 ms to minimize.
[2024-06-01 16:50:36] [INFO ] Deduced a trap composed of 3 places in 150 ms of which 3 ms to minimize.
[2024-06-01 16:50:37] [INFO ] Deduced a trap composed of 16 places in 151 ms of which 3 ms to minimize.
[2024-06-01 16:50:37] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 3 ms to minimize.
[2024-06-01 16:50:37] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/2686 variables, 6/2339 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 16:50:40] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/2686 variables, 1/2340 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2686 variables, 0/2340 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 23 (OVERLAPS) 1/2687 variables, 1/2341 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2687 variables, 1/2342 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2687 variables, 0/2342 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 26 (OVERLAPS) 1/2688 variables, 1/2343 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2688 variables, 1/2344 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2688 variables, 0/2344 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 29 (OVERLAPS) 10/2698 variables, 6/2350 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2698 variables, 2/2352 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2698 variables, 1/2353 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2698 variables, 0/2353 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 33 (OVERLAPS) 1/2699 variables, 1/2354 constraints. Problems are: Problem set: 0 solved, 11 unsolved
SMT process timed out in 52921ms, After SMT, problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 160 out of 1467 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1467/1467 places, 1233/1233 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1466 transition count 1232
Applied a total of 2 rules in 95 ms. Remains 1466 /1467 variables (removed 1) and now considering 1232/1233 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 1466/1467 places, 1232/1233 transitions.
RANDOM walk for 40000 steps (8 resets) in 608 ms. (65 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 248 ms. (160 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 192 ms. (207 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 199 ms. (200 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 236 ms. (168 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 219 ms. (181 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 241 ms. (165 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 218 ms. (182 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 85647 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :0 out of 11
Probabilistic random walk after 85647 steps, saw 53993 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
// Phase 1: matrix 1232 rows 1466 cols
[2024-06-01 16:50:57] [INFO ] Computed 550 invariants in 5 ms
[2024-06-01 16:50:57] [INFO ] State equation strengthened by 245 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 1264/1424 variables, 530/530 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1424 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 15/1439 variables, 7/537 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1439 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 1219/2658 variables, 1439/1976 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2658 variables, 243/2219 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2658 variables, 0/2219 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 26/2684 variables, 17/2236 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2684 variables, 7/2243 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2684 variables, 1/2244 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2684 variables, 0/2244 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 1/2685 variables, 1/2245 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2685 variables, 1/2246 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2685 variables, 0/2246 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 1/2686 variables, 1/2247 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2686 variables, 1/2248 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2686 variables, 0/2248 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (OVERLAPS) 10/2696 variables, 6/2254 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2696 variables, 2/2256 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2696 variables, 1/2257 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2696 variables, 0/2257 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 22 (OVERLAPS) 1/2697 variables, 1/2258 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2697 variables, 1/2259 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2697 variables, 0/2259 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 25 (OVERLAPS) 1/2698 variables, 1/2260 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2698 variables, 1/2261 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2698 variables, 0/2261 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 28 (OVERLAPS) 0/2698 variables, 0/2261 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2698/2698 variables, and 2261 constraints, problems are : Problem set: 0 solved, 11 unsolved in 7595 ms.
Refiners :[Positive P Invariants (semi-flows): 550/550 constraints, State Equation: 1466/1466 constraints, ReadFeed: 245/245 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 1264/1424 variables, 530/530 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 16:51:05] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 3 ms to minimize.
[2024-06-01 16:51:05] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 2 ms to minimize.
[2024-06-01 16:51:05] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 3 ms to minimize.
[2024-06-01 16:51:05] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 2 ms to minimize.
[2024-06-01 16:51:05] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 2 ms to minimize.
[2024-06-01 16:51:05] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 2 ms to minimize.
[2024-06-01 16:51:05] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 2 ms to minimize.
[2024-06-01 16:51:05] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 2 ms to minimize.
[2024-06-01 16:51:06] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2024-06-01 16:51:06] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 3 ms to minimize.
[2024-06-01 16:51:06] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 2 ms to minimize.
[2024-06-01 16:51:06] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 2 ms to minimize.
[2024-06-01 16:51:06] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 3 ms to minimize.
[2024-06-01 16:51:06] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 2 ms to minimize.
[2024-06-01 16:51:06] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2024-06-01 16:51:06] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 2 ms to minimize.
[2024-06-01 16:51:06] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 2 ms to minimize.
[2024-06-01 16:51:06] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 2 ms to minimize.
[2024-06-01 16:51:07] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 2 ms to minimize.
[2024-06-01 16:51:07] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1424 variables, 20/550 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 16:51:07] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 2 ms to minimize.
[2024-06-01 16:51:07] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 2 ms to minimize.
[2024-06-01 16:51:07] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 2 ms to minimize.
[2024-06-01 16:51:07] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 2 ms to minimize.
[2024-06-01 16:51:07] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 2 ms to minimize.
[2024-06-01 16:51:07] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 2 ms to minimize.
[2024-06-01 16:51:07] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 2 ms to minimize.
[2024-06-01 16:51:08] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 2 ms to minimize.
[2024-06-01 16:51:08] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 2 ms to minimize.
[2024-06-01 16:51:08] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 2 ms to minimize.
[2024-06-01 16:51:08] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 2 ms to minimize.
[2024-06-01 16:51:08] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
[2024-06-01 16:51:08] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 2 ms to minimize.
[2024-06-01 16:51:08] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 2 ms to minimize.
[2024-06-01 16:51:08] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 2 ms to minimize.
[2024-06-01 16:51:09] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 2 ms to minimize.
[2024-06-01 16:51:09] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 2 ms to minimize.
[2024-06-01 16:51:09] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 2 ms to minimize.
[2024-06-01 16:51:09] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 2 ms to minimize.
[2024-06-01 16:51:09] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1424 variables, 20/570 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 16:51:09] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 3 ms to minimize.
[2024-06-01 16:51:09] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 2 ms to minimize.
[2024-06-01 16:51:09] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 2 ms to minimize.
[2024-06-01 16:51:09] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 2 ms to minimize.
[2024-06-01 16:51:10] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 2 ms to minimize.
[2024-06-01 16:51:10] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 2 ms to minimize.
[2024-06-01 16:51:10] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1424 variables, 7/577 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 16:51:10] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 2 ms to minimize.
[2024-06-01 16:51:11] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 2 ms to minimize.
[2024-06-01 16:51:11] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 2 ms to minimize.
[2024-06-01 16:51:11] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 2 ms to minimize.
[2024-06-01 16:51:11] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 2 ms to minimize.
[2024-06-01 16:51:11] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1424 variables, 6/583 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 16:51:11] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 2 ms to minimize.
[2024-06-01 16:51:12] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 2 ms to minimize.
[2024-06-01 16:51:12] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-06-01 16:51:12] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1424 variables, 4/587 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1424 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 15/1439 variables, 7/594 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 16:51:12] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1439 variables, 1/595 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1439 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 1219/2658 variables, 1439/2034 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2658 variables, 243/2277 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2658 variables, 9/2286 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 16:51:16] [INFO ] Deduced a trap composed of 5 places in 224 ms of which 5 ms to minimize.
[2024-06-01 16:51:17] [INFO ] Deduced a trap composed of 5 places in 228 ms of which 4 ms to minimize.
[2024-06-01 16:51:17] [INFO ] Deduced a trap composed of 9 places in 218 ms of which 5 ms to minimize.
[2024-06-01 16:51:17] [INFO ] Deduced a trap composed of 8 places in 217 ms of which 4 ms to minimize.
[2024-06-01 16:51:18] [INFO ] Deduced a trap composed of 8 places in 220 ms of which 4 ms to minimize.
[2024-06-01 16:51:18] [INFO ] Deduced a trap composed of 9 places in 232 ms of which 4 ms to minimize.
[2024-06-01 16:51:18] [INFO ] Deduced a trap composed of 14 places in 215 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2658 variables, 7/2293 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2658 variables, 0/2293 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (OVERLAPS) 26/2684 variables, 17/2310 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2684 variables, 7/2317 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2684 variables, 1/2318 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2684 variables, 2/2320 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 16:51:26] [INFO ] Deduced a trap composed of 5 places in 195 ms of which 4 ms to minimize.
[2024-06-01 16:51:26] [INFO ] Deduced a trap composed of 21 places in 234 ms of which 4 ms to minimize.
[2024-06-01 16:51:26] [INFO ] Deduced a trap composed of 7 places in 190 ms of which 4 ms to minimize.
[2024-06-01 16:51:27] [INFO ] Deduced a trap composed of 12 places in 193 ms of which 4 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/2684 variables, 4/2324 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 16:51:29] [INFO ] Deduced a trap composed of 11 places in 188 ms of which 3 ms to minimize.
[2024-06-01 16:51:29] [INFO ] Deduced a trap composed of 15 places in 188 ms of which 3 ms to minimize.
[2024-06-01 16:51:29] [INFO ] Deduced a trap composed of 14 places in 197 ms of which 4 ms to minimize.
[2024-06-01 16:51:30] [INFO ] Deduced a trap composed of 12 places in 162 ms of which 4 ms to minimize.
[2024-06-01 16:51:30] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 4 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/2684 variables, 5/2329 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2684 variables, 0/2329 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 23 (OVERLAPS) 1/2685 variables, 1/2330 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2685 variables, 1/2331 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 16:51:35] [INFO ] Deduced a trap composed of 8 places in 172 ms of which 3 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/2685 variables, 1/2332 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2685 variables, 0/2332 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 27 (OVERLAPS) 1/2686 variables, 1/2333 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2686 variables, 1/2334 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2686 variables, 0/2334 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 30 (OVERLAPS) 10/2696 variables, 6/2340 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2696 variables, 2/2342 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2696 variables, 1/2343 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2696 variables, 0/2343 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 34 (OVERLAPS) 1/2697 variables, 1/2344 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2697 variables, 1/2345 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2697 variables, 0/2345 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 37 (OVERLAPS) 1/2698 variables, 1/2346 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2698 variables, 1/2347 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/2698 variables, 0/2347 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 40 (OVERLAPS) 0/2698 variables, 0/2347 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2698/2698 variables, and 2347 constraints, problems are : Problem set: 0 solved, 11 unsolved in 45296 ms.
Refiners :[Positive P Invariants (semi-flows): 550/550 constraints, State Equation: 1466/1466 constraints, ReadFeed: 245/245 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 75/75 constraints]
After SMT, in 52936ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 6 different solutions.
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-2024-13 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 19563 ms.
Support contains 139 out of 1466 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1466/1466 places, 1232/1232 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1466 transition count 1230
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1464 transition count 1230
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 4 place count 1464 transition count 1223
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 18 place count 1457 transition count 1223
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 1456 transition count 1222
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 1456 transition count 1222
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 52 place count 1440 transition count 1206
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 58 place count 1437 transition count 1206
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 1437 transition count 1206
Applied a total of 59 rules in 195 ms. Remains 1437 /1466 variables (removed 29) and now considering 1206/1232 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 195 ms. Remains : 1437/1466 places, 1206/1232 transitions.
RANDOM walk for 40000 steps (8 resets) in 578 ms. (69 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 335 ms. (119 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 219 ms. (181 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 204 ms. (195 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 248 ms. (160 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 232 ms. (171 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 251 ms. (158 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 241 ms. (165 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 89018 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :0 out of 10
Probabilistic random walk after 89018 steps, saw 55348 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
// Phase 1: matrix 1206 rows 1437 cols
[2024-06-01 16:52:13] [INFO ] Computed 550 invariants in 4 ms
[2024-06-01 16:52:13] [INFO ] State equation strengthened by 251 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1251/1390 variables, 528/528 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1390 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 20/1410 variables, 9/537 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1410 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 1193/2603 variables, 1410/1947 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2603 variables, 249/2196 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2603 variables, 0/2196 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 26/2629 variables, 17/2213 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2629 variables, 7/2220 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2629 variables, 1/2221 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2629 variables, 0/2221 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 1/2630 variables, 1/2222 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2630 variables, 1/2223 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2630 variables, 0/2223 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 1/2631 variables, 1/2224 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2631 variables, 1/2225 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2631 variables, 0/2225 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (OVERLAPS) 10/2641 variables, 6/2231 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2641 variables, 2/2233 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2641 variables, 1/2234 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2641 variables, 0/2234 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (OVERLAPS) 1/2642 variables, 1/2235 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2642 variables, 1/2236 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2642 variables, 0/2236 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 25 (OVERLAPS) 1/2643 variables, 1/2237 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2643 variables, 1/2238 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2643 variables, 0/2238 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 28 (OVERLAPS) 0/2643 variables, 0/2238 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2643/2643 variables, and 2238 constraints, problems are : Problem set: 0 solved, 10 unsolved in 7167 ms.
Refiners :[Positive P Invariants (semi-flows): 550/550 constraints, State Equation: 1437/1437 constraints, ReadFeed: 251/251 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1251/1390 variables, 528/528 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-01 16:52:21] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 1 ms to minimize.
[2024-06-01 16:52:21] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 2 ms to minimize.
[2024-06-01 16:52:21] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 2 ms to minimize.
[2024-06-01 16:52:21] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 2 ms to minimize.
[2024-06-01 16:52:21] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-06-01 16:52:21] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 2 ms to minimize.
[2024-06-01 16:52:21] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 2 ms to minimize.
[2024-06-01 16:52:21] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 2 ms to minimize.
[2024-06-01 16:52:21] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 1 ms to minimize.
[2024-06-01 16:52:22] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2024-06-01 16:52:22] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 2 ms to minimize.
[2024-06-01 16:52:22] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 2 ms to minimize.
[2024-06-01 16:52:22] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 2 ms to minimize.
[2024-06-01 16:52:22] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 2 ms to minimize.
[2024-06-01 16:52:22] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-06-01 16:52:22] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 1 ms to minimize.
[2024-06-01 16:52:22] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-06-01 16:52:22] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 2 ms to minimize.
[2024-06-01 16:52:22] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 2 ms to minimize.
[2024-06-01 16:52:22] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1390 variables, 20/548 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-01 16:52:23] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 2 ms to minimize.
[2024-06-01 16:52:23] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
[2024-06-01 16:52:23] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 2 ms to minimize.
[2024-06-01 16:52:23] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 2 ms to minimize.
[2024-06-01 16:52:23] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 2 ms to minimize.
[2024-06-01 16:52:23] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-06-01 16:52:23] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-06-01 16:52:23] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 2 ms to minimize.
[2024-06-01 16:52:23] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-06-01 16:52:23] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 2 ms to minimize.
[2024-06-01 16:52:23] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 2 ms to minimize.
[2024-06-01 16:52:24] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-06-01 16:52:24] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-06-01 16:52:24] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-06-01 16:52:24] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 2 ms to minimize.
[2024-06-01 16:52:24] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 2 ms to minimize.
[2024-06-01 16:52:24] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 1 ms to minimize.
[2024-06-01 16:52:24] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 2 ms to minimize.
[2024-06-01 16:52:24] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 2 ms to minimize.
[2024-06-01 16:52:24] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1390 variables, 20/568 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-01 16:52:25] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 2 ms to minimize.
[2024-06-01 16:52:25] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 2 ms to minimize.
[2024-06-01 16:52:25] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 2 ms to minimize.
[2024-06-01 16:52:25] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 2 ms to minimize.
[2024-06-01 16:52:25] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 2 ms to minimize.
[2024-06-01 16:52:25] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 2 ms to minimize.
[2024-06-01 16:52:25] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 2 ms to minimize.
[2024-06-01 16:52:25] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2024-06-01 16:52:26] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 2 ms to minimize.
[2024-06-01 16:52:26] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 2 ms to minimize.
[2024-06-01 16:52:26] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 2 ms to minimize.
[2024-06-01 16:52:26] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 1 ms to minimize.
[2024-06-01 16:52:26] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1390 variables, 13/581 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-01 16:52:26] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 2 ms to minimize.
[2024-06-01 16:52:26] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 2 ms to minimize.
[2024-06-01 16:52:27] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 2 ms to minimize.
[2024-06-01 16:52:27] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 2 ms to minimize.
[2024-06-01 16:52:27] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1390 variables, 5/586 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-01 16:52:27] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 2 ms to minimize.
[2024-06-01 16:52:27] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1390 variables, 2/588 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-01 16:52:28] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 2 ms to minimize.
[2024-06-01 16:52:28] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1390 variables, 2/590 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1390 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 20/1410 variables, 9/599 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-01 16:52:28] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1410 variables, 1/600 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1410 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 1193/2603 variables, 1410/2010 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2603 variables, 249/2259 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2603 variables, 8/2267 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-01 16:52:31] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 3 ms to minimize.
[2024-06-01 16:52:32] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 3 ms to minimize.
[2024-06-01 16:52:32] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 3 ms to minimize.
[2024-06-01 16:52:32] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 3 ms to minimize.
[2024-06-01 16:52:32] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 3 ms to minimize.
[2024-06-01 16:52:33] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 3 ms to minimize.
[2024-06-01 16:52:33] [INFO ] Deduced a trap composed of 14 places in 149 ms of which 3 ms to minimize.
[2024-06-01 16:52:33] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 3 ms to minimize.
[2024-06-01 16:52:33] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 3 ms to minimize.
[2024-06-01 16:52:33] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 3 ms to minimize.
[2024-06-01 16:52:34] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 3 ms to minimize.
[2024-06-01 16:52:34] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 3 ms to minimize.
[2024-06-01 16:52:35] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/2603 variables, 13/2280 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-01 16:52:35] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 2 ms to minimize.
[2024-06-01 16:52:36] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 3 ms to minimize.
[2024-06-01 16:52:36] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/2603 variables, 3/2283 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2603 variables, 0/2283 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (OVERLAPS) 26/2629 variables, 17/2300 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2629 variables, 7/2307 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2629 variables, 1/2308 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2629 variables, 2/2310 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-01 16:52:42] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 3 ms to minimize.
[2024-06-01 16:52:42] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 3 ms to minimize.
[2024-06-01 16:52:43] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 2 ms to minimize.
[2024-06-01 16:52:43] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 3 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/2629 variables, 4/2314 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2629 variables, 0/2314 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 24 (OVERLAPS) 1/2630 variables, 1/2315 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2630 variables, 1/2316 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2630 variables, 0/2316 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 27 (OVERLAPS) 1/2631 variables, 1/2317 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2631 variables, 1/2318 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2631 variables, 0/2318 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 30 (OVERLAPS) 10/2641 variables, 6/2324 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2641 variables, 2/2326 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2641 variables, 1/2327 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2641 variables, 0/2327 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 34 (OVERLAPS) 1/2642 variables, 1/2328 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2642 variables, 1/2329 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2642 variables, 0/2329 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 37 (OVERLAPS) 1/2643 variables, 1/2330 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2643 variables, 1/2331 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/2643 variables, 0/2331 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 40 (OVERLAPS) 0/2643 variables, 0/2331 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2643/2643 variables, and 2331 constraints, problems are : Problem set: 0 solved, 10 unsolved in 37893 ms.
Refiners :[Positive P Invariants (semi-flows): 550/550 constraints, State Equation: 1437/1437 constraints, ReadFeed: 251/251 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 83/83 constraints]
After SMT, in 45100ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 22600 ms.
Support contains 139 out of 1437 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1437/1437 places, 1206/1206 transitions.
Applied a total of 0 rules in 43 ms. Remains 1437 /1437 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 1437/1437 places, 1206/1206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1437/1437 places, 1206/1206 transitions.
Applied a total of 0 rules in 41 ms. Remains 1437 /1437 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2024-06-01 16:53:21] [INFO ] Invariant cache hit.
[2024-06-01 16:53:22] [INFO ] Implicit Places using invariants in 724 ms returned [1417, 1421]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 740 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1435/1437 places, 1206/1206 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1433 transition count 1204
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1433 transition count 1204
Applied a total of 4 rules in 65 ms. Remains 1433 /1435 variables (removed 2) and now considering 1204/1206 (removed 2) transitions.
// Phase 1: matrix 1204 rows 1433 cols
[2024-06-01 16:53:22] [INFO ] Computed 548 invariants in 9 ms
[2024-06-01 16:53:22] [INFO ] Implicit Places using invariants in 715 ms returned []
[2024-06-01 16:53:22] [INFO ] Invariant cache hit.
[2024-06-01 16:53:23] [INFO ] State equation strengthened by 249 read => feed constraints.
[2024-06-01 16:53:28] [INFO ] Implicit Places using invariants and state equation in 5146 ms returned []
Implicit Place search using SMT with State Equation took 5864 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1433/1437 places, 1204/1206 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 6712 ms. Remains : 1433/1437 places, 1204/1206 transitions.
RANDOM walk for 40000 steps (8 resets) in 542 ms. (73 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 237 ms. (168 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 214 ms. (186 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 200 ms. (199 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 211 ms. (188 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 199 ms. (200 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 243 ms. (163 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 243 ms. (163 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 252 ms. (158 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 87623 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :0 out of 10
Probabilistic random walk after 87623 steps, saw 53857 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
[2024-06-01 16:53:31] [INFO ] Invariant cache hit.
[2024-06-01 16:53:31] [INFO ] State equation strengthened by 249 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1251/1390 variables, 528/528 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1390 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 20/1410 variables, 9/537 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1410 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 1193/2603 variables, 1410/1947 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2603 variables, 249/2196 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2603 variables, 0/2196 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 25/2628 variables, 17/2213 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2628 variables, 8/2221 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2628 variables, 0/2221 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 9/2637 variables, 6/2227 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2637 variables, 3/2230 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2637 variables, 0/2230 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 0/2637 variables, 0/2230 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2637/2637 variables, and 2230 constraints, problems are : Problem set: 0 solved, 10 unsolved in 3704 ms.
Refiners :[Positive P Invariants (semi-flows): 548/548 constraints, State Equation: 1433/1433 constraints, ReadFeed: 249/249 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1251/1390 variables, 528/528 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-01 16:53:35] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 2 ms to minimize.
[2024-06-01 16:53:35] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2024-06-01 16:53:36] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 2 ms to minimize.
[2024-06-01 16:53:36] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 2 ms to minimize.
[2024-06-01 16:53:36] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2024-06-01 16:53:36] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 2 ms to minimize.
[2024-06-01 16:53:36] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-06-01 16:53:36] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-06-01 16:53:36] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 2 ms to minimize.
[2024-06-01 16:53:36] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 2 ms to minimize.
[2024-06-01 16:53:36] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 2 ms to minimize.
[2024-06-01 16:53:36] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-06-01 16:53:36] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 2 ms to minimize.
[2024-06-01 16:53:37] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-06-01 16:53:37] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-06-01 16:53:37] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-06-01 16:53:37] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-06-01 16:53:37] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-06-01 16:53:37] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-06-01 16:53:37] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1390 variables, 20/548 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-01 16:53:37] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-06-01 16:53:37] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-06-01 16:53:37] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 2 ms to minimize.
[2024-06-01 16:53:37] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2024-06-01 16:53:37] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-06-01 16:53:38] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2024-06-01 16:53:38] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 1 ms to minimize.
[2024-06-01 16:53:38] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-06-01 16:53:38] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-06-01 16:53:38] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 2 ms to minimize.
[2024-06-01 16:53:38] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 2 ms to minimize.
[2024-06-01 16:53:38] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-06-01 16:53:38] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 1 ms to minimize.
[2024-06-01 16:53:38] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 2 ms to minimize.
[2024-06-01 16:53:39] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 1 ms to minimize.
[2024-06-01 16:53:39] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1390 variables, 16/564 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-01 16:53:39] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 1 ms to minimize.
[2024-06-01 16:53:39] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-06-01 16:53:39] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 2 ms to minimize.
[2024-06-01 16:53:39] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 2 ms to minimize.
[2024-06-01 16:53:39] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 2 ms to minimize.
[2024-06-01 16:53:40] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1390 variables, 6/570 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-01 16:53:40] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1390 variables, 1/571 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1390 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 20/1410 variables, 9/580 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-01 16:53:40] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2024-06-01 16:53:41] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1410 variables, 2/582 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-01 16:53:41] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1410 variables, 1/583 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1410 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 1193/2603 variables, 1410/1993 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2603 variables, 249/2242 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2603 variables, 8/2250 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-01 16:53:43] [INFO ] Deduced a trap composed of 5 places in 188 ms of which 3 ms to minimize.
[2024-06-01 16:53:43] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 4 ms to minimize.
[2024-06-01 16:53:44] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 3 ms to minimize.
[2024-06-01 16:53:44] [INFO ] Deduced a trap composed of 11 places in 181 ms of which 3 ms to minimize.
[2024-06-01 16:53:44] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 3 ms to minimize.
[2024-06-01 16:53:44] [INFO ] Deduced a trap composed of 9 places in 172 ms of which 3 ms to minimize.
[2024-06-01 16:53:44] [INFO ] Deduced a trap composed of 12 places in 179 ms of which 4 ms to minimize.
[2024-06-01 16:53:45] [INFO ] Deduced a trap composed of 14 places in 198 ms of which 3 ms to minimize.
[2024-06-01 16:53:45] [INFO ] Deduced a trap composed of 14 places in 169 ms of which 3 ms to minimize.
[2024-06-01 16:53:46] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 3 ms to minimize.
[2024-06-01 16:53:46] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 3 ms to minimize.
[2024-06-01 16:53:47] [INFO ] Deduced a trap composed of 5 places in 142 ms of which 3 ms to minimize.
[2024-06-01 16:53:47] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 3 ms to minimize.
[2024-06-01 16:53:47] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 3 ms to minimize.
[2024-06-01 16:53:47] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2603 variables, 15/2265 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2603 variables, 0/2265 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 25/2628 variables, 17/2282 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2628 variables, 8/2290 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2628 variables, 2/2292 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-01 16:53:53] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 3 ms to minimize.
[2024-06-01 16:53:53] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 3 ms to minimize.
[2024-06-01 16:53:54] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 3 ms to minimize.
[2024-06-01 16:53:54] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 2 ms to minimize.
[2024-06-01 16:53:54] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 2 ms to minimize.
[2024-06-01 16:53:54] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 3 ms to minimize.
[2024-06-01 16:53:54] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 3 ms to minimize.
[2024-06-01 16:53:55] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 2 ms to minimize.
[2024-06-01 16:53:56] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/2628 variables, 9/2301 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2628 variables, 0/2301 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (OVERLAPS) 9/2637 variables, 6/2307 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2637 variables, 3/2310 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2637 variables, 0/2310 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 24 (OVERLAPS) 0/2637 variables, 0/2310 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2637/2637 variables, and 2310 constraints, problems are : Problem set: 0 solved, 10 unsolved in 28819 ms.
Refiners :[Positive P Invariants (semi-flows): 548/548 constraints, State Equation: 1433/1433 constraints, ReadFeed: 249/249 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 70/70 constraints]
After SMT, in 32570ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 16217 ms.
Support contains 139 out of 1433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1433/1433 places, 1204/1204 transitions.
Applied a total of 0 rules in 49 ms. Remains 1433 /1433 variables (removed 0) and now considering 1204/1204 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 1433/1433 places, 1204/1204 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1433/1433 places, 1204/1204 transitions.
Applied a total of 0 rules in 38 ms. Remains 1433 /1433 variables (removed 0) and now considering 1204/1204 (removed 0) transitions.
[2024-06-01 16:54:20] [INFO ] Invariant cache hit.
[2024-06-01 16:54:21] [INFO ] Implicit Places using invariants in 704 ms returned []
[2024-06-01 16:54:21] [INFO ] Invariant cache hit.
[2024-06-01 16:54:22] [INFO ] State equation strengthened by 249 read => feed constraints.
[2024-06-01 16:54:26] [INFO ] Implicit Places using invariants and state equation in 5352 ms returned []
Implicit Place search using SMT with State Equation took 6062 ms to find 0 implicit places.
[2024-06-01 16:54:26] [INFO ] Redundant transitions in 72 ms returned []
Running 1197 sub problems to find dead transitions.
[2024-06-01 16:54:26] [INFO ] Invariant cache hit.
[2024-06-01 16:54:26] [INFO ] State equation strengthened by 249 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1427 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1197 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1427/2637 variables, and 13 constraints, problems are : Problem set: 0 solved, 1197 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 13/548 constraints, State Equation: 0/1433 constraints, ReadFeed: 0/249 constraints, PredecessorRefiner: 1197/1197 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1197 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1427 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1197 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1427 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1197 unsolved
At refinement iteration 2 (OVERLAPS) 6/1433 variables, 535/548 constraints. Problems are: Problem set: 0 solved, 1197 unsolved
[2024-06-01 16:55:25] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2024-06-01 16:55:26] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-06-01 16:55:26] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2024-06-01 16:55:26] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-06-01 16:55:26] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-06-01 16:55:26] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
[2024-06-01 16:55:26] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 0 ms to minimize.
[2024-06-01 16:55:27] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 1 ms to minimize.
[2024-06-01 16:55:27] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1433/2637 variables, and 557 constraints, problems are : Problem set: 0 solved, 1197 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 548/548 constraints, State Equation: 0/1433 constraints, ReadFeed: 0/249 constraints, PredecessorRefiner: 0/1197 constraints, Known Traps: 9/9 constraints]
After SMT, in 60372ms problems are : Problem set: 0 solved, 1197 unsolved
Search for dead transitions found 0 dead transitions in 60387ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66588 ms. Remains : 1433/1433 places, 1204/1204 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 245 times.
Drop transitions (Partial Free agglomeration) removed 245 transitions
Iterating global reduction 0 with 245 rules applied. Total rules applied 245 place count 1433 transition count 1204
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 246 place count 1433 transition count 1203
Applied a total of 246 rules in 129 ms. Remains 1433 /1433 variables (removed 0) and now considering 1203/1204 (removed 1) transitions.
Running SMT prover for 10 properties.
// Phase 1: matrix 1203 rows 1433 cols
[2024-06-01 16:55:27] [INFO ] Computed 548 invariants in 12 ms
[2024-06-01 16:55:27] [INFO ] After 445ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-06-01 16:55:28] [INFO ] [Nat]Absence check using 548 positive place invariants in 96 ms returned sat
[2024-06-01 16:55:29] [INFO ] After 1305ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2024-06-01 16:55:29] [INFO ] State equation strengthened by 217 read => feed constraints.
[2024-06-01 16:55:31] [INFO ] After 2036ms SMT Verify possible using 217 Read/Feed constraints in natural domain returned unsat :0 sat :10
TRAPS : Iteration 0
[2024-06-01 16:55:32] [INFO ] Deduced a trap composed of 5 places in 187 ms of which 4 ms to minimize.
[2024-06-01 16:55:32] [INFO ] Deduced a trap composed of 9 places in 175 ms of which 3 ms to minimize.
[2024-06-01 16:55:32] [INFO ] Deduced a trap composed of 8 places in 181 ms of which 4 ms to minimize.
[2024-06-01 16:55:32] [INFO ] Deduced a trap composed of 8 places in 178 ms of which 3 ms to minimize.
[2024-06-01 16:55:33] [INFO ] Deduced a trap composed of 10 places in 186 ms of which 3 ms to minimize.
[2024-06-01 16:55:33] [INFO ] Deduced a trap composed of 11 places in 179 ms of which 3 ms to minimize.
[2024-06-01 16:55:33] [INFO ] Deduced a trap composed of 9 places in 172 ms of which 3 ms to minimize.
[2024-06-01 16:55:33] [INFO ] Deduced a trap composed of 5 places in 172 ms of which 4 ms to minimize.
[2024-06-01 16:55:34] [INFO ] Deduced a trap composed of 8 places in 170 ms of which 3 ms to minimize.
[2024-06-01 16:55:34] [INFO ] Deduced a trap composed of 12 places in 177 ms of which 3 ms to minimize.
[2024-06-01 16:55:34] [INFO ] Deduced a trap composed of 8 places in 166 ms of which 4 ms to minimize.
[2024-06-01 16:55:34] [INFO ] Deduced a trap composed of 8 places in 170 ms of which 3 ms to minimize.
[2024-06-01 16:55:34] [INFO ] Deduced a trap composed of 10 places in 168 ms of which 4 ms to minimize.
[2024-06-01 16:55:35] [INFO ] Deduced a trap composed of 9 places in 163 ms of which 3 ms to minimize.
[2024-06-01 16:55:35] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 3 ms to minimize.
[2024-06-01 16:55:35] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 3 ms to minimize.
[2024-06-01 16:55:35] [INFO ] Deduced a trap composed of 10 places in 164 ms of which 3 ms to minimize.
[2024-06-01 16:55:36] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 3 ms to minimize.
[2024-06-01 16:55:36] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 3 ms to minimize.
[2024-06-01 16:55:36] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 3 ms to minimize.
[2024-06-01 16:55:36] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 4 ms to minimize.
[2024-06-01 16:55:36] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 3 ms to minimize.
[2024-06-01 16:55:37] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 3 ms to minimize.
[2024-06-01 16:55:37] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 3 ms to minimize.
[2024-06-01 16:55:37] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 5320 ms
[2024-06-01 16:55:37] [INFO ] Deduced a trap composed of 9 places in 276 ms of which 5 ms to minimize.
[2024-06-01 16:55:38] [INFO ] Deduced a trap composed of 12 places in 260 ms of which 4 ms to minimize.
[2024-06-01 16:55:38] [INFO ] Deduced a trap composed of 8 places in 241 ms of which 4 ms to minimize.
[2024-06-01 16:55:39] [INFO ] Deduced a trap composed of 13 places in 259 ms of which 5 ms to minimize.
[2024-06-01 16:55:39] [INFO ] Deduced a trap composed of 10 places in 275 ms of which 4 ms to minimize.
[2024-06-01 16:55:39] [INFO ] Deduced a trap composed of 8 places in 267 ms of which 4 ms to minimize.
[2024-06-01 16:55:39] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2128 ms
[2024-06-01 16:55:40] [INFO ] Deduced a trap composed of 14 places in 292 ms of which 5 ms to minimize.
[2024-06-01 16:55:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 417 ms
[2024-06-01 16:55:40] [INFO ] Deduced a trap composed of 12 places in 290 ms of which 6 ms to minimize.
[2024-06-01 16:55:41] [INFO ] Deduced a trap composed of 12 places in 288 ms of which 5 ms to minimize.
[2024-06-01 16:55:41] [INFO ] Deduced a trap composed of 8 places in 284 ms of which 5 ms to minimize.
[2024-06-01 16:55:41] [INFO ] Deduced a trap composed of 14 places in 282 ms of which 5 ms to minimize.
[2024-06-01 16:55:42] [INFO ] Deduced a trap composed of 12 places in 290 ms of which 5 ms to minimize.
[2024-06-01 16:55:42] [INFO ] Deduced a trap composed of 8 places in 309 ms of which 6 ms to minimize.
[2024-06-01 16:55:42] [INFO ] Deduced a trap composed of 8 places in 290 ms of which 5 ms to minimize.
[2024-06-01 16:55:43] [INFO ] Deduced a trap composed of 11 places in 286 ms of which 5 ms to minimize.
[2024-06-01 16:55:43] [INFO ] Deduced a trap composed of 13 places in 280 ms of which 4 ms to minimize.
[2024-06-01 16:55:43] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3229 ms
[2024-06-01 16:55:43] [INFO ] Deduced a trap composed of 10 places in 294 ms of which 6 ms to minimize.
[2024-06-01 16:55:44] [INFO ] Deduced a trap composed of 8 places in 282 ms of which 4 ms to minimize.
[2024-06-01 16:55:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 785 ms
[2024-06-01 16:55:46] [INFO ] Deduced a trap composed of 10 places in 313 ms of which 4 ms to minimize.
[2024-06-01 16:55:46] [INFO ] Deduced a trap composed of 10 places in 285 ms of which 5 ms to minimize.
[2024-06-01 16:55:47] [INFO ] Deduced a trap composed of 14 places in 288 ms of which 5 ms to minimize.
[2024-06-01 16:55:47] [INFO ] Deduced a trap composed of 4 places in 273 ms of which 5 ms to minimize.
[2024-06-01 16:55:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1463 ms
[2024-06-01 16:55:48] [INFO ] Deduced a trap composed of 9 places in 288 ms of which 5 ms to minimize.
[2024-06-01 16:55:48] [INFO ] Deduced a trap composed of 7 places in 272 ms of which 4 ms to minimize.
[2024-06-01 16:55:48] [INFO ] Deduced a trap composed of 7 places in 260 ms of which 5 ms to minimize.
[2024-06-01 16:55:49] [INFO ] Deduced a trap composed of 7 places in 253 ms of which 4 ms to minimize.
[2024-06-01 16:55:49] [INFO ] Deduced a trap composed of 12 places in 246 ms of which 5 ms to minimize.
[2024-06-01 16:55:49] [INFO ] Deduced a trap composed of 10 places in 238 ms of which 4 ms to minimize.
[2024-06-01 16:55:50] [INFO ] Deduced a trap composed of 11 places in 246 ms of which 5 ms to minimize.
[2024-06-01 16:55:50] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2285 ms
[2024-06-01 16:55:50] [INFO ] Deduced a trap composed of 3 places in 241 ms of which 4 ms to minimize.
[2024-06-01 16:55:51] [INFO ] Deduced a trap composed of 8 places in 259 ms of which 4 ms to minimize.
[2024-06-01 16:55:51] [INFO ] Deduced a trap composed of 10 places in 259 ms of which 5 ms to minimize.
[2024-06-01 16:55:51] [INFO ] Deduced a trap composed of 10 places in 261 ms of which 5 ms to minimize.
[2024-06-01 16:55:51] [INFO ] Deduced a trap composed of 13 places in 255 ms of which 5 ms to minimize.
[2024-06-01 16:55:52] [INFO ] Deduced a trap composed of 10 places in 244 ms of which 5 ms to minimize.
[2024-06-01 16:55:52] [INFO ] Deduced a trap composed of 12 places in 249 ms of which 4 ms to minimize.
[2024-06-01 16:55:52] [INFO ] Deduced a trap composed of 7 places in 252 ms of which 5 ms to minimize.
[2024-06-01 16:55:53] [INFO ] Deduced a trap composed of 8 places in 250 ms of which 4 ms to minimize.
[2024-06-01 16:55:53] [INFO ] Deduced a trap composed of 11 places in 254 ms of which 5 ms to minimize.
[2024-06-01 16:55:53] [INFO ] Deduced a trap composed of 7 places in 249 ms of which 4 ms to minimize.
[2024-06-01 16:55:54] [INFO ] Deduced a trap composed of 7 places in 245 ms of which 5 ms to minimize.
[2024-06-01 16:55:54] [INFO ] Deduced a trap composed of 7 places in 238 ms of which 4 ms to minimize.
[2024-06-01 16:55:54] [INFO ] Deduced a trap composed of 7 places in 234 ms of which 4 ms to minimize.
[2024-06-01 16:55:54] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 4371 ms
TRAPS : Iteration 1
[2024-06-01 16:55:55] [INFO ] Deduced a trap composed of 7 places in 237 ms of which 4 ms to minimize.
[2024-06-01 16:55:55] [INFO ] Deduced a trap composed of 10 places in 229 ms of which 4 ms to minimize.
[2024-06-01 16:55:55] [INFO ] Deduced a trap composed of 7 places in 232 ms of which 4 ms to minimize.
[2024-06-01 16:55:56] [INFO ] Deduced a trap composed of 11 places in 229 ms of which 4 ms to minimize.
[2024-06-01 16:55:56] [INFO ] Deduced a trap composed of 12 places in 242 ms of which 4 ms to minimize.
[2024-06-01 16:55:56] [INFO ] Deduced a trap composed of 9 places in 239 ms of which 4 ms to minimize.
[2024-06-01 16:55:56] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1792 ms
[2024-06-01 16:55:57] [INFO ] Deduced a trap composed of 11 places in 226 ms of which 4 ms to minimize.
[2024-06-01 16:55:57] [INFO ] Deduced a trap composed of 11 places in 213 ms of which 4 ms to minimize.
[2024-06-01 16:55:57] [INFO ] Deduced a trap composed of 8 places in 223 ms of which 4 ms to minimize.
[2024-06-01 16:55:57] [INFO ] Deduced a trap composed of 11 places in 222 ms of which 4 ms to minimize.
[2024-06-01 16:55:58] [INFO ] Deduced a trap composed of 11 places in 232 ms of which 4 ms to minimize.
[2024-06-01 16:55:58] [INFO ] Deduced a trap composed of 7 places in 219 ms of which 4 ms to minimize.
[2024-06-01 16:55:58] [INFO ] Deduced a trap composed of 7 places in 213 ms of which 4 ms to minimize.
[2024-06-01 16:55:59] [INFO ] Deduced a trap composed of 4 places in 208 ms of which 4 ms to minimize.
[2024-06-01 16:55:59] [INFO ] Deduced a trap composed of 10 places in 206 ms of which 4 ms to minimize.
[2024-06-01 16:55:59] [INFO ] Deduced a trap composed of 10 places in 191 ms of which 4 ms to minimize.
[2024-06-01 16:55:59] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2751 ms
[2024-06-01 16:56:01] [INFO ] Deduced a trap composed of 10 places in 236 ms of which 4 ms to minimize.
[2024-06-01 16:56:01] [INFO ] Deduced a trap composed of 9 places in 231 ms of which 4 ms to minimize.
[2024-06-01 16:56:01] [INFO ] Deduced a trap composed of 12 places in 227 ms of which 4 ms to minimize.
[2024-06-01 16:56:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 964 ms
[2024-06-01 16:56:03] [INFO ] Deduced a trap composed of 7 places in 238 ms of which 4 ms to minimize.
[2024-06-01 16:56:04] [INFO ] Deduced a trap composed of 11 places in 229 ms of which 4 ms to minimize.
[2024-06-01 16:56:04] [INFO ] Deduced a trap composed of 14 places in 215 ms of which 4 ms to minimize.
[2024-06-01 16:56:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 949 ms
[2024-06-01 16:56:05] [INFO ] Deduced a trap composed of 9 places in 220 ms of which 4 ms to minimize.
[2024-06-01 16:56:05] [INFO ] Deduced a trap composed of 12 places in 225 ms of which 4 ms to minimize.
[2024-06-01 16:56:05] [INFO ] Deduced a trap composed of 11 places in 232 ms of which 4 ms to minimize.
[2024-06-01 16:56:05] [INFO ] Deduced a trap composed of 8 places in 226 ms of which 4 ms to minimize.
[2024-06-01 16:56:06] [INFO ] Deduced a trap composed of 13 places in 229 ms of which 4 ms to minimize.
[2024-06-01 16:56:06] [INFO ] Deduced a trap composed of 10 places in 228 ms of which 4 ms to minimize.
[2024-06-01 16:56:06] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1771 ms
TRAPS : Iteration 2
[2024-06-01 16:56:07] [INFO ] Deduced a trap composed of 8 places in 217 ms of which 4 ms to minimize.
[2024-06-01 16:56:07] [INFO ] Deduced a trap composed of 9 places in 209 ms of which 4 ms to minimize.
[2024-06-01 16:56:07] [INFO ] Deduced a trap composed of 8 places in 207 ms of which 3 ms to minimize.
[2024-06-01 16:56:07] [INFO ] Deduced a trap composed of 9 places in 206 ms of which 3 ms to minimize.
[2024-06-01 16:56:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1108 ms
[2024-06-01 16:56:08] [INFO ] Deduced a trap composed of 9 places in 208 ms of which 4 ms to minimize.
[2024-06-01 16:56:08] [INFO ] Deduced a trap composed of 10 places in 213 ms of which 4 ms to minimize.
[2024-06-01 16:56:09] [INFO ] Deduced a trap composed of 5 places in 208 ms of which 3 ms to minimize.
[2024-06-01 16:56:09] [INFO ] Deduced a trap composed of 9 places in 206 ms of which 4 ms to minimize.
[2024-06-01 16:56:09] [INFO ] Deduced a trap composed of 12 places in 206 ms of which 3 ms to minimize.
[2024-06-01 16:56:09] [INFO ] Deduced a trap composed of 6 places in 194 ms of which 4 ms to minimize.
[2024-06-01 16:56:10] [INFO ] Deduced a trap composed of 7 places in 186 ms of which 3 ms to minimize.
[2024-06-01 16:56:10] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1872 ms
[2024-06-01 16:56:12] [INFO ] Deduced a trap composed of 10 places in 299 ms of which 5 ms to minimize.
[2024-06-01 16:56:13] [INFO ] Deduced a trap composed of 13 places in 293 ms of which 5 ms to minimize.
[2024-06-01 16:56:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 768 ms
[2024-06-01 16:56:13] [INFO ] Deduced a trap composed of 7 places in 270 ms of which 5 ms to minimize.
[2024-06-01 16:56:14] [INFO ] Deduced a trap composed of 9 places in 274 ms of which 4 ms to minimize.
[2024-06-01 16:56:14] [INFO ] Deduced a trap composed of 11 places in 267 ms of which 5 ms to minimize.
[2024-06-01 16:56:14] [INFO ] Deduced a trap composed of 8 places in 254 ms of which 5 ms to minimize.
[2024-06-01 16:56:15] [INFO ] Deduced a trap composed of 7 places in 264 ms of which 4 ms to minimize.
[2024-06-01 16:56:15] [INFO ] Deduced a trap composed of 7 places in 261 ms of which 4 ms to minimize.
[2024-06-01 16:56:15] [INFO ] Deduced a trap composed of 9 places in 251 ms of which 5 ms to minimize.
[2024-06-01 16:56:15] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2321 ms
[2024-06-01 16:56:16] [INFO ] Deduced a trap composed of 8 places in 247 ms of which 5 ms to minimize.
[2024-06-01 16:56:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 362 ms
TRAPS : Iteration 3
[2024-06-01 16:56:16] [INFO ] Deduced a trap composed of 9 places in 220 ms of which 4 ms to minimize.
[2024-06-01 16:56:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 333 ms
[2024-06-01 16:56:18] [INFO ] Deduced a trap composed of 12 places in 203 ms of which 4 ms to minimize.
[2024-06-01 16:56:18] [INFO ] Deduced a trap composed of 7 places in 196 ms of which 4 ms to minimize.
[2024-06-01 16:56:18] [INFO ] Deduced a trap composed of 8 places in 194 ms of which 4 ms to minimize.
[2024-06-01 16:56:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 888 ms
[2024-06-01 16:56:22] [INFO ] Deduced a trap composed of 7 places in 205 ms of which 4 ms to minimize.
[2024-06-01 16:56:22] [INFO ] Deduced a trap composed of 12 places in 209 ms of which 4 ms to minimize.
[2024-06-01 16:56:22] [INFO ] Deduced a trap composed of 10 places in 205 ms of which 4 ms to minimize.
[2024-06-01 16:56:23] [INFO ] Deduced a trap composed of 9 places in 202 ms of which 3 ms to minimize.
[2024-06-01 16:56:23] [INFO ] Deduced a trap composed of 10 places in 196 ms of which 4 ms to minimize.
[2024-06-01 16:56:23] [INFO ] Deduced a trap composed of 11 places in 200 ms of which 4 ms to minimize.
[2024-06-01 16:56:23] [INFO ] Deduced a trap composed of 9 places in 194 ms of which 4 ms to minimize.
[2024-06-01 16:56:24] [INFO ] Deduced a trap composed of 14 places in 193 ms of which 4 ms to minimize.
[2024-06-01 16:56:24] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 4 ms to minimize.
[2024-06-01 16:56:24] [INFO ] Deduced a trap composed of 10 places in 182 ms of which 3 ms to minimize.
[2024-06-01 16:56:24] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 3 ms to minimize.
[2024-06-01 16:56:25] [INFO ] Deduced a trap composed of 14 places in 177 ms of which 4 ms to minimize.
[2024-06-01 16:56:25] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3257 ms
[2024-06-01 16:56:25] [INFO ] Deduced a trap composed of 10 places in 221 ms of which 4 ms to minimize.
[2024-06-01 16:56:26] [INFO ] Deduced a trap composed of 12 places in 222 ms of which 4 ms to minimize.
[2024-06-01 16:56:26] [INFO ] Deduced a trap composed of 12 places in 214 ms of which 4 ms to minimize.
[2024-06-01 16:56:26] [INFO ] Deduced a trap composed of 11 places in 206 ms of which 4 ms to minimize.
[2024-06-01 16:56:26] [INFO ] Deduced a trap composed of 10 places in 209 ms of which 4 ms to minimize.
[2024-06-01 16:56:27] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1455 ms
[2024-06-01 16:56:27] [INFO ] Deduced a trap composed of 13 places in 217 ms of which 4 ms to minimize.
[2024-06-01 16:56:27] [INFO ] Deduced a trap composed of 11 places in 222 ms of which 4 ms to minimize.
[2024-06-01 16:56:28] [INFO ] Deduced a trap composed of 12 places in 241 ms of which 4 ms to minimize.
[2024-06-01 16:56:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 929 ms
TRAPS : Iteration 4
[2024-06-01 16:56:30] [INFO ] Deduced a trap composed of 8 places in 197 ms of which 3 ms to minimize.
[2024-06-01 16:56:30] [INFO ] Deduced a trap composed of 13 places in 187 ms of which 3 ms to minimize.
[2024-06-01 16:56:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 608 ms
[2024-06-01 16:56:31] [INFO ] Deduced a trap composed of 10 places in 171 ms of which 4 ms to minimize.
[2024-06-01 16:56:31] [INFO ] Deduced a trap composed of 10 places in 161 ms of which 3 ms to minimize.
[2024-06-01 16:56:31] [INFO ] Deduced a trap composed of 12 places in 161 ms of which 3 ms to minimize.
[2024-06-01 16:56:31] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 3 ms to minimize.
[2024-06-01 16:56:32] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 3 ms to minimize.
[2024-06-01 16:56:32] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 3 ms to minimize.
[2024-06-01 16:56:32] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1441 ms
[2024-06-01 16:56:32] [INFO ] Deduced a trap composed of 9 places in 171 ms of which 3 ms to minimize.
[2024-06-01 16:56:33] [INFO ] Deduced a trap composed of 9 places in 178 ms of which 3 ms to minimize.
[2024-06-01 16:56:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 525 ms
[2024-06-01 16:56:33] [INFO ] Deduced a trap composed of 10 places in 161 ms of which 3 ms to minimize.
[2024-06-01 16:56:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 270 ms
TRAPS : Iteration 5
[2024-06-01 16:56:35] [INFO ] Deduced a trap composed of 12 places in 282 ms of which 5 ms to minimize.
[2024-06-01 16:56:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 401 ms
[2024-06-01 16:56:37] [INFO ] Deduced a trap composed of 13 places in 252 ms of which 5 ms to minimize.
[2024-06-01 16:56:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 385 ms
[2024-06-01 16:56:38] [INFO ] Deduced a trap composed of 11 places in 258 ms of which 5 ms to minimize.
[2024-06-01 16:56:38] [INFO ] Deduced a trap composed of 11 places in 265 ms of which 5 ms to minimize.
[2024-06-01 16:56:38] [INFO ] Deduced a trap composed of 10 places in 264 ms of which 5 ms to minimize.
[2024-06-01 16:56:39] [INFO ] Deduced a trap composed of 10 places in 262 ms of which 5 ms to minimize.
[2024-06-01 16:56:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1338 ms
TRAPS : Iteration 6
[2024-06-01 16:56:39] [INFO ] Deduced a trap composed of 10 places in 230 ms of which 4 ms to minimize.
[2024-06-01 16:56:39] [INFO ] Deduced a trap composed of 12 places in 236 ms of which 5 ms to minimize.
[2024-06-01 16:56:40] [INFO ] Deduced a trap composed of 9 places in 230 ms of which 5 ms to minimize.
[2024-06-01 16:56:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 911 ms
[2024-06-01 16:56:40] [INFO ] Deduced a trap composed of 7 places in 215 ms of which 4 ms to minimize.
[2024-06-01 16:56:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 325 ms
[2024-06-01 16:56:41] [INFO ] Deduced a trap composed of 10 places in 207 ms of which 4 ms to minimize.
[2024-06-01 16:56:41] [INFO ] Deduced a trap composed of 10 places in 201 ms of which 3 ms to minimize.
[2024-06-01 16:56:41] [INFO ] Deduced a trap composed of 8 places in 196 ms of which 4 ms to minimize.
[2024-06-01 16:56:41] [INFO ] Deduced a trap composed of 9 places in 198 ms of which 4 ms to minimize.
[2024-06-01 16:56:42] [INFO ] Deduced a trap composed of 13 places in 197 ms of which 4 ms to minimize.
[2024-06-01 16:56:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1341 ms
[2024-06-01 16:56:42] [INFO ] Deduced a trap composed of 11 places in 206 ms of which 3 ms to minimize.
[2024-06-01 16:56:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 314 ms
[2024-06-01 16:56:43] [INFO ] Deduced a trap composed of 7 places in 200 ms of which 3 ms to minimize.
[2024-06-01 16:56:43] [INFO ] Deduced a trap composed of 7 places in 193 ms of which 3 ms to minimize.
[2024-06-01 16:56:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 562 ms
[2024-06-01 16:56:45] [INFO ] Deduced a trap composed of 10 places in 306 ms of which 6 ms to minimize.
[2024-06-01 16:56:46] [INFO ] Deduced a trap composed of 14 places in 300 ms of which 5 ms to minimize.
[2024-06-01 16:56:46] [INFO ] Deduced a trap composed of 15 places in 309 ms of which 6 ms to minimize.
[2024-06-01 16:56:47] [INFO ] Deduced a trap composed of 9 places in 306 ms of which 6 ms to minimize.
[2024-06-01 16:56:47] [INFO ] Deduced a trap composed of 10 places in 310 ms of which 6 ms to minimize.
[2024-06-01 16:56:47] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1928 ms
[2024-06-01 16:56:48] [INFO ] Deduced a trap composed of 9 places in 238 ms of which 4 ms to minimize.
[2024-06-01 16:56:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 356 ms
[2024-06-01 16:56:48] [INFO ] Deduced a trap composed of 7 places in 248 ms of which 5 ms to minimize.
[2024-06-01 16:56:49] [INFO ] Deduced a trap composed of 13 places in 240 ms of which 5 ms to minimize.
[2024-06-01 16:56:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 657 ms
TRAPS : Iteration 7
[2024-06-01 16:56:49] [INFO ] Deduced a trap composed of 11 places in 209 ms of which 4 ms to minimize.
[2024-06-01 16:56:49] [INFO ] Deduced a trap composed of 11 places in 206 ms of which 4 ms to minimize.
[2024-06-01 16:56:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 591 ms
[2024-06-01 16:56:50] [INFO ] Deduced a trap composed of 11 places in 214 ms of which 4 ms to minimize.
[2024-06-01 16:56:50] [INFO ] Deduced a trap composed of 13 places in 220 ms of which 5 ms to minimize.
[2024-06-01 16:56:51] [INFO ] Deduced a trap composed of 11 places in 215 ms of which 4 ms to minimize.
[2024-06-01 16:56:51] [INFO ] Deduced a trap composed of 14 places in 219 ms of which 4 ms to minimize.
[2024-06-01 16:56:51] [INFO ] Deduced a trap composed of 14 places in 216 ms of which 4 ms to minimize.
[2024-06-01 16:56:51] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1484 ms
[2024-06-01 16:56:52] [INFO ] Deduced a trap composed of 17 places in 193 ms of which 4 ms to minimize.
[2024-06-01 16:56:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 298 ms
[2024-06-01 16:56:53] [INFO ] Deduced a trap composed of 9 places in 173 ms of which 4 ms to minimize.
[2024-06-01 16:56:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 304 ms
[2024-06-01 16:56:55] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 3 ms to minimize.
[2024-06-01 16:56:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 303 ms
[2024-06-01 16:56:56] [INFO ] Deduced a trap composed of 9 places in 300 ms of which 7 ms to minimize.
[2024-06-01 16:56:56] [INFO ] Deduced a trap composed of 8 places in 263 ms of which 5 ms to minimize.
[2024-06-01 16:56:57] [INFO ] Deduced a trap composed of 7 places in 255 ms of which 4 ms to minimize.
[2024-06-01 16:56:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1079 ms
TRAPS : Iteration 8
[2024-06-01 16:56:58] [INFO ] Deduced a trap composed of 8 places in 238 ms of which 4 ms to minimize.
[2024-06-01 16:56:58] [INFO ] Deduced a trap composed of 11 places in 225 ms of which 4 ms to minimize.
[2024-06-01 16:56:58] [INFO ] Deduced a trap composed of 11 places in 216 ms of which 5 ms to minimize.
[2024-06-01 16:56:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 914 ms
[2024-06-01 16:56:59] [INFO ] Deduced a trap composed of 10 places in 209 ms of which 4 ms to minimize.
[2024-06-01 16:56:59] [INFO ] Deduced a trap composed of 13 places in 205 ms of which 4 ms to minimize.
[2024-06-01 16:56:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 591 ms
[2024-06-01 16:57:00] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 4 ms to minimize.
[2024-06-01 16:57:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 297 ms
[2024-06-01 16:57:01] [INFO ] Deduced a trap composed of 8 places in 170 ms of which 3 ms to minimize.
[2024-06-01 16:57:01] [INFO ] Deduced a trap composed of 9 places in 170 ms of which 3 ms to minimize.
[2024-06-01 16:57:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 542 ms
[2024-06-01 16:57:02] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 3 ms to minimize.
[2024-06-01 16:57:02] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 3 ms to minimize.
[2024-06-01 16:57:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 496 ms
[2024-06-01 16:57:03] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 3 ms to minimize.
[2024-06-01 16:57:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 276 ms
[2024-06-01 16:57:04] [INFO ] Deduced a trap composed of 6 places in 178 ms of which 3 ms to minimize.
[2024-06-01 16:57:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 297 ms
TRAPS : Iteration 9
[2024-06-01 16:57:07] [INFO ] Deduced a trap composed of 10 places in 211 ms of which 3 ms to minimize.
[2024-06-01 16:57:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 340 ms
[2024-06-01 16:57:08] [INFO ] Deduced a trap composed of 10 places in 190 ms of which 3 ms to minimize.
[2024-06-01 16:57:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 316 ms
[2024-06-01 16:57:09] [INFO ] Deduced a trap composed of 10 places in 171 ms of which 3 ms to minimize.
[2024-06-01 16:57:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 291 ms
[2024-06-01 16:57:10] [INFO ] Deduced a trap composed of 7 places in 190 ms of which 4 ms to minimize.
[2024-06-01 16:57:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 309 ms
TRAPS : Iteration 10
[2024-06-01 16:57:10] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 3 ms to minimize.
[2024-06-01 16:57:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 291 ms
[2024-06-01 16:57:11] [INFO ] Deduced a trap composed of 10 places in 163 ms of which 3 ms to minimize.
[2024-06-01 16:57:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 282 ms
[2024-06-01 16:57:11] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 3 ms to minimize.
[2024-06-01 16:57:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 275 ms
[2024-06-01 16:57:14] [INFO ] Deduced a trap composed of 13 places in 234 ms of which 4 ms to minimize.
[2024-06-01 16:57:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 351 ms
[2024-06-01 16:57:15] [INFO ] Deduced a trap composed of 14 places in 188 ms of which 3 ms to minimize.
[2024-06-01 16:57:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 302 ms
[2024-06-01 16:57:15] [INFO ] Deduced a trap composed of 10 places in 214 ms of which 4 ms to minimize.
[2024-06-01 16:57:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 327 ms
TRAPS : Iteration 11
[2024-06-01 16:57:15] [INFO ] Deduced a trap composed of 11 places in 176 ms of which 3 ms to minimize.
[2024-06-01 16:57:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 284 ms
[2024-06-01 16:57:16] [INFO ] Deduced a trap composed of 10 places in 180 ms of which 4 ms to minimize.
[2024-06-01 16:57:16] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 3 ms to minimize.
[2024-06-01 16:57:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 529 ms
[2024-06-01 16:57:19] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 3 ms to minimize.
[2024-06-01 16:57:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 315 ms
TRAPS : Iteration 12
[2024-06-01 16:57:21] [INFO ] Deduced a trap composed of 7 places in 200 ms of which 4 ms to minimize.
[2024-06-01 16:57:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 314 ms
[2024-06-01 16:57:22] [INFO ] Deduced a trap composed of 9 places in 179 ms of which 4 ms to minimize.
[2024-06-01 16:57:22] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 4 ms to minimize.
[2024-06-01 16:57:23] [INFO ] Deduced a trap composed of 14 places in 183 ms of which 4 ms to minimize.
[2024-06-01 16:57:23] [INFO ] Deduced a trap composed of 7 places in 180 ms of which 3 ms to minimize.
[2024-06-01 16:57:23] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 3 ms to minimize.
[2024-06-01 16:57:23] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1295 ms
[2024-06-01 16:57:25] [INFO ] Deduced a trap composed of 17 places in 166 ms of which 3 ms to minimize.
[2024-06-01 16:57:25] [INFO ] Deduced a trap composed of 14 places in 149 ms of which 3 ms to minimize.
[2024-06-01 16:57:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 505 ms
[2024-06-01 16:57:25] [INFO ] Deduced a trap composed of 8 places in 169 ms of which 3 ms to minimize.
[2024-06-01 16:57:26] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 3 ms to minimize.
[2024-06-01 16:57:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 514 ms
[2024-06-01 16:57:26] [INFO ] Deduced a trap composed of 12 places in 167 ms of which 3 ms to minimize.
[2024-06-01 16:57:26] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 3 ms to minimize.
[2024-06-01 16:57:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 514 ms
TRAPS : Iteration 13
[2024-06-01 16:57:30] [INFO ] After 120945ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
[2024-06-01 16:57:34] [INFO ] After 126233ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Over-approximation ignoring read arcs solved 0 properties in 126851 ms.
[2024-06-01 16:57:34] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2024-06-01 16:57:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1433 places, 1204 transitions and 5122 arcs took 10 ms.
[2024-06-01 16:57:34] [INFO ] Flatten gal took : 139 ms
Total runtime 474039 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : ShieldPPPt-PT-050B-ReachabilityFireability-2024-01
Could not compute solution for formula : ShieldPPPt-PT-050B-ReachabilityFireability-2024-02
Could not compute solution for formula : ShieldPPPt-PT-050B-ReachabilityFireability-2024-03
Could not compute solution for formula : ShieldPPPt-PT-050B-ReachabilityFireability-2024-07
Could not compute solution for formula : ShieldPPPt-PT-050B-ReachabilityFireability-2024-08
Could not compute solution for formula : ShieldPPPt-PT-050B-ReachabilityFireability-2024-10
Could not compute solution for formula : ShieldPPPt-PT-050B-ReachabilityFireability-2024-11
Could not compute solution for formula : ShieldPPPt-PT-050B-ReachabilityFireability-2024-12
Could not compute solution for formula : ShieldPPPt-PT-050B-ReachabilityFireability-2024-14
Could not compute solution for formula : ShieldPPPt-PT-050B-ReachabilityFireability-2024-15
BK_STOP 1717261054834
--------------------
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:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
++ sed s/.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 ShieldPPPt-PT-050B-ReachabilityFireability-2024-01
rfs formula type AG
rfs formula formula --invariant=/tmp/2248/inv_0_
rfs formula name ShieldPPPt-PT-050B-ReachabilityFireability-2024-02
rfs formula type EF
rfs formula formula --invariant=/tmp/2248/inv_1_
rfs formula name ShieldPPPt-PT-050B-ReachabilityFireability-2024-03
rfs formula type EF
rfs formula formula --invariant=/tmp/2248/inv_2_
rfs formula name ShieldPPPt-PT-050B-ReachabilityFireability-2024-07
rfs formula type AG
rfs formula formula --invariant=/tmp/2248/inv_3_
rfs formula name ShieldPPPt-PT-050B-ReachabilityFireability-2024-08
rfs formula type EF
rfs formula formula --invariant=/tmp/2248/inv_4_
rfs formula name ShieldPPPt-PT-050B-ReachabilityFireability-2024-10
rfs formula type AG
rfs formula formula --invariant=/tmp/2248/inv_5_
rfs formula name ShieldPPPt-PT-050B-ReachabilityFireability-2024-11
rfs formula type AG
rfs formula formula --invariant=/tmp/2248/inv_6_
rfs formula name ShieldPPPt-PT-050B-ReachabilityFireability-2024-12
rfs formula type EF
rfs formula formula --invariant=/tmp/2248/inv_7_
rfs formula name ShieldPPPt-PT-050B-ReachabilityFireability-2024-14
rfs formula type EF
rfs formula formula --invariant=/tmp/2248/inv_8_
rfs formula name ShieldPPPt-PT-050B-ReachabilityFireability-2024-15
rfs formula type EF
rfs formula formula --invariant=/tmp/2248/inv_9_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPt-PT-050B"
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 ShieldPPPt-PT-050B, 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 r528-tall-171683761600687"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-050B.tgz
mv ShieldPPPt-PT-050B 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 '
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 ;