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-171683760900335.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 ShieldIIPt-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-171683760900335
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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.5K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 20:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 12 20:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 12 20:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 12 20:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 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 860K 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 ShieldIIPt-PT-050B-ReachabilityFireability-2024-00
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717239993077

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-050B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:06:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 11:06:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:06:34] [INFO ] Load time of PNML (sax parser for PT used): 200 ms
[2024-06-01 11:06:34] [INFO ] Transformed 3503 places.
[2024-06-01 11:06:34] [INFO ] Transformed 3253 transitions.
[2024-06-01 11:06:34] [INFO ] Found NUPN structural information;
[2024-06-01 11:06:34] [INFO ] Parsed PT model containing 3503 places and 3253 transitions and 8106 arcs in 435 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 3117 ms. (12 steps per ms) remains 11/16 properties
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 226 ms. (176 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 390 ms. (102 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 922 ms. (43 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 234 ms. (170 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 40003 steps (8 resets) in 120 ms. (330 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 11/11 properties
// Phase 1: matrix 3253 rows 3503 cols
[2024-06-01 11:06:36] [INFO ] Computed 451 invariants in 45 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 268/268 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/268 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 2128/2396 variables, 273/541 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2396 variables, 2128/2669 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2396 variables, 0/2669 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 1107/3503 variables, 178/2847 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3503 variables, 1107/3954 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3503 variables, 0/3954 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 3253/6756 variables, 3503/7457 constraints. Problems are: Problem set: 0 solved, 11 unsolved
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 Real declared 6756/6756 variables, and 7457 constraints, problems are : Problem set: 0 solved, 11 unsolved in 5058 ms.
Refiners :[Domain max(s): 3503/3503 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 3503/3503 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/268 variables, 268/268 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/268 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 2128/2396 variables, 273/541 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2396 variables, 2128/2669 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 11:06:42] [INFO ] Deduced a trap composed of 21 places in 363 ms of which 44 ms to minimize.
[2024-06-01 11:06:43] [INFO ] Deduced a trap composed of 30 places in 285 ms of which 5 ms to minimize.
[2024-06-01 11:06:43] [INFO ] Deduced a trap composed of 23 places in 244 ms of which 5 ms to minimize.
[2024-06-01 11:06:43] [INFO ] Deduced a trap composed of 35 places in 231 ms of which 5 ms to minimize.
[2024-06-01 11:06:44] [INFO ] Deduced a trap composed of 38 places in 232 ms of which 5 ms to minimize.
[2024-06-01 11:06:44] [INFO ] Deduced a trap composed of 39 places in 216 ms of which 5 ms to minimize.
[2024-06-01 11:06:44] [INFO ] Deduced a trap composed of 20 places in 215 ms of which 5 ms to minimize.
[2024-06-01 11:06:44] [INFO ] Deduced a trap composed of 36 places in 211 ms of which 4 ms to minimize.
[2024-06-01 11:06:45] [INFO ] Deduced a trap composed of 38 places in 209 ms of which 5 ms to minimize.
[2024-06-01 11:06:45] [INFO ] Deduced a trap composed of 33 places in 251 ms of which 5 ms to minimize.
[2024-06-01 11:06:45] [INFO ] Deduced a trap composed of 30 places in 250 ms of which 4 ms to minimize.
[2024-06-01 11:06:45] [INFO ] Deduced a trap composed of 33 places in 206 ms of which 4 ms to minimize.
[2024-06-01 11:06:46] [INFO ] Deduced a trap composed of 43 places in 197 ms of which 4 ms to minimize.
[2024-06-01 11:06:46] [INFO ] Deduced a trap composed of 44 places in 186 ms of which 4 ms to minimize.
[2024-06-01 11:06:46] [INFO ] Deduced a trap composed of 32 places in 176 ms of which 4 ms to minimize.
[2024-06-01 11:06:46] [INFO ] Deduced a trap composed of 42 places in 172 ms of which 4 ms to minimize.
[2024-06-01 11:06:47] [INFO ] Deduced a trap composed of 40 places in 182 ms of which 3 ms to minimize.
SMT process timed out in 10383ms, After SMT, problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 268 out of 3503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3503/3503 places, 3253/3253 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 645 transitions
Trivial Post-agglo rules discarded 645 transitions
Performed 645 trivial Post agglomeration. Transition count delta: 645
Iterating post reduction 0 with 645 rules applied. Total rules applied 645 place count 3503 transition count 2608
Reduce places removed 645 places and 0 transitions.
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Iterating post reduction 1 with 715 rules applied. Total rules applied 1360 place count 2858 transition count 2538
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 2 with 70 rules applied. Total rules applied 1430 place count 2788 transition count 2538
Performed 214 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 214 Pre rules applied. Total rules applied 1430 place count 2788 transition count 2324
Deduced a syphon composed of 214 places in 16 ms
Reduce places removed 214 places and 0 transitions.
Iterating global reduction 3 with 428 rules applied. Total rules applied 1858 place count 2574 transition count 2324
Discarding 313 places :
Symmetric choice reduction at 3 with 313 rule applications. Total rules 2171 place count 2261 transition count 2011
Iterating global reduction 3 with 313 rules applied. Total rules applied 2484 place count 2261 transition count 2011
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 3 with 2 rules applied. Total rules applied 2486 place count 2261 transition count 2009
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2487 place count 2260 transition count 2009
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 102 Pre rules applied. Total rules applied 2487 place count 2260 transition count 1907
Deduced a syphon composed of 102 places in 14 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 5 with 204 rules applied. Total rules applied 2691 place count 2158 transition count 1907
Performed 726 Post agglomeration using F-continuation condition.Transition count delta: 726
Deduced a syphon composed of 726 places in 3 ms
Reduce places removed 726 places and 0 transitions.
Iterating global reduction 5 with 1452 rules applied. Total rules applied 4143 place count 1432 transition count 1181
Renaming transitions due to excessive name length > 1024 char.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: -42
Deduced a syphon composed of 100 places in 3 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 5 with 200 rules applied. Total rules applied 4343 place count 1332 transition count 1223
Free-agglomeration rule applied 11 times.
Iterating global reduction 5 with 11 rules applied. Total rules applied 4354 place count 1332 transition count 1212
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 4365 place count 1321 transition count 1212
Partial Free-agglomeration rule applied 39 times.
Drop transitions (Partial Free agglomeration) removed 39 transitions
Iterating global reduction 6 with 39 rules applied. Total rules applied 4404 place count 1321 transition count 1212
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 4405 place count 1320 transition count 1211
Applied a total of 4405 rules in 1232 ms. Remains 1320 /3503 variables (removed 2183) and now considering 1211/3253 (removed 2042) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1249 ms. Remains : 1320/3503 places, 1211/3253 transitions.
RANDOM walk for 40000 steps (8 resets) in 1054 ms. (37 steps per ms) remains 8/11 properties
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 396 ms. (100 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 408 ms. (97 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 264 ms. (150 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 361 ms. (110 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 205 ms. (194 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 226 ms. (176 steps per ms) remains 8/8 properties
// Phase 1: matrix 1211 rows 1320 cols
[2024-06-01 11:06:49] [INFO ] Computed 451 invariants in 6 ms
[2024-06-01 11:06:49] [INFO ] State equation strengthened by 183 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, 8 unsolved
At refinement iteration 1 (OVERLAPS) 532/692 variables, 186/186 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/692 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 451/1143 variables, 192/378 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1143 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1082/2225 variables, 1143/1521 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2225 variables, 174/1695 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2225 variables, 0/1695 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 188/2413 variables, 98/1793 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2413 variables, 31/1824 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2413 variables, 5/1829 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2413 variables, 0/1829 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 20/2433 variables, 15/1844 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2433 variables, 8/1852 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2433 variables, 0/1852 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 14/2447 variables, 7/1859 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2447 variables, 0/1859 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 74/2521 variables, 64/1923 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2521 variables, 15/1938 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2521 variables, 4/1942 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2521 variables, 0/1942 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 3/2524 variables, 3/1945 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2524 variables, 1/1946 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2524 variables, 0/1946 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (OVERLAPS) 7/2531 variables, 6/1952 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2531 variables, 2/1954 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2531 variables, 0/1954 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (OVERLAPS) 0/2531 variables, 0/1954 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2531/2531 variables, and 1954 constraints, problems are : Problem set: 0 solved, 8 unsolved in 4393 ms.
Refiners :[Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 1320/1320 constraints, ReadFeed: 183/183 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 532/692 variables, 186/186 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 11:06:54] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 2 ms to minimize.
[2024-06-01 11:06:54] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 1 ms to minimize.
[2024-06-01 11:06:54] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2024-06-01 11:06:54] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-06-01 11:06:54] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-06-01 11:06:54] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-06-01 11:06:54] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-06-01 11:06:54] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 2 ms to minimize.
[2024-06-01 11:06:54] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-06-01 11:06:54] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:06:54] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2024-06-01 11:06:54] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 2 ms to minimize.
[2024-06-01 11:06:54] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-06-01 11:06:55] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 2 ms to minimize.
[2024-06-01 11:06:55] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/692 variables, 15/201 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 11:06:55] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-06-01 11:06:55] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 1 ms to minimize.
[2024-06-01 11:06:55] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-06-01 11:06:55] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 1 ms to minimize.
[2024-06-01 11:06:55] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/692 variables, 5/206 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/692 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 451/1143 variables, 192/398 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 11:06:55] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 2 ms to minimize.
[2024-06-01 11:06:56] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 2 ms to minimize.
[2024-06-01 11:06:56] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 1 ms to minimize.
[2024-06-01 11:06:56] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 2 ms to minimize.
[2024-06-01 11:06:56] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 2 ms to minimize.
[2024-06-01 11:06:56] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-06-01 11:06:56] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 2 ms to minimize.
[2024-06-01 11:06:56] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2024-06-01 11:06:56] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 1 ms to minimize.
[2024-06-01 11:06:56] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 2 ms to minimize.
[2024-06-01 11:06:56] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 2 ms to minimize.
[2024-06-01 11:06:56] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 2 ms to minimize.
[2024-06-01 11:06:57] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 2 ms to minimize.
[2024-06-01 11:06:57] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 2 ms to minimize.
[2024-06-01 11:06:57] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 2 ms to minimize.
[2024-06-01 11:06:57] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 1 ms to minimize.
[2024-06-01 11:06:57] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 2 ms to minimize.
[2024-06-01 11:06:57] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 2 ms to minimize.
[2024-06-01 11:06:57] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 5 ms to minimize.
[2024-06-01 11:06:57] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1143 variables, 20/418 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 11:06:57] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 2 ms to minimize.
[2024-06-01 11:06:58] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 2 ms to minimize.
[2024-06-01 11:06:58] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 2 ms to minimize.
[2024-06-01 11:06:58] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 2 ms to minimize.
[2024-06-01 11:06:58] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 2 ms to minimize.
[2024-06-01 11:06:58] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 2 ms to minimize.
[2024-06-01 11:06:58] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 3 ms to minimize.
[2024-06-01 11:06:58] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 2 ms to minimize.
[2024-06-01 11:06:58] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 2 ms to minimize.
[2024-06-01 11:06:58] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 2 ms to minimize.
[2024-06-01 11:06:59] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 2 ms to minimize.
[2024-06-01 11:06:59] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 1 ms to minimize.
[2024-06-01 11:06:59] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1143 variables, 13/431 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 11:06:59] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 2 ms to minimize.
[2024-06-01 11:06:59] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-06-01 11:06:59] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1143 variables, 3/434 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 11:07:00] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1143 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1143 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 1082/2225 variables, 1143/1578 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2225 variables, 174/1752 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2225 variables, 5/1757 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 11:07:01] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 3 ms to minimize.
[2024-06-01 11:07:01] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 2 ms to minimize.
[2024-06-01 11:07:01] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 3 ms to minimize.
[2024-06-01 11:07:01] [INFO ] Deduced a trap composed of 6 places in 121 ms of which 3 ms to minimize.
[2024-06-01 11:07:02] [INFO ] Deduced a trap composed of 6 places in 115 ms of which 2 ms to minimize.
[2024-06-01 11:07:02] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 2 ms to minimize.
[2024-06-01 11:07:02] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2225 variables, 7/1764 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 11:07:03] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/2225 variables, 1/1765 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2225 variables, 0/1765 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 188/2413 variables, 98/1863 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2413 variables, 31/1894 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2413 variables, 5/1899 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2413 variables, 3/1902 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 11:07:06] [INFO ] Deduced a trap composed of 5 places in 174 ms of which 4 ms to minimize.
[2024-06-01 11:07:06] [INFO ] Deduced a trap composed of 5 places in 171 ms of which 3 ms to minimize.
[2024-06-01 11:07:07] [INFO ] Deduced a trap composed of 6 places in 171 ms of which 4 ms to minimize.
[2024-06-01 11:07:07] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 3 ms to minimize.
[2024-06-01 11:07:07] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 3 ms to minimize.
[2024-06-01 11:07:07] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 3 ms to minimize.
[2024-06-01 11:07:07] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 3 ms to minimize.
[2024-06-01 11:07:08] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 3 ms to minimize.
[2024-06-01 11:07:08] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 3 ms to minimize.
[2024-06-01 11:07:09] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 3 ms to minimize.
[2024-06-01 11:07:09] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/2413 variables, 11/1913 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2413 variables, 0/1913 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (OVERLAPS) 20/2433 variables, 15/1928 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2433 variables, 8/1936 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 11:07:11] [INFO ] Deduced a trap composed of 5 places in 122 ms of which 2 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/2433 variables, 1/1937 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2433 variables, 0/1937 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (OVERLAPS) 14/2447 variables, 7/1944 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2447 variables, 0/1944 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 29 (OVERLAPS) 74/2521 variables, 64/2008 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2521 variables, 15/2023 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2521 variables, 4/2027 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2521 variables, 0/2027 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 33 (OVERLAPS) 3/2524 variables, 3/2030 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2524 variables, 1/2031 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2524 variables, 0/2031 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 36 (OVERLAPS) 7/2531 variables, 6/2037 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2531 variables, 2/2039 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2531 variables, 0/2039 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 11:07:17] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 2 ms to minimize.
At refinement iteration 39 (OVERLAPS) 0/2531 variables, 1/2040 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 11:07:18] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 2 ms to minimize.
[2024-06-01 11:07:18] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 2 ms to minimize.
[2024-06-01 11:07:18] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 3 ms to minimize.
At refinement iteration 40 (INCLUDED_ONLY) 0/2531 variables, 3/2043 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/2531 variables, 0/2043 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 42 (OVERLAPS) 0/2531 variables, 0/2043 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2531/2531 variables, and 2043 constraints, problems are : Problem set: 0 solved, 8 unsolved in 28157 ms.
Refiners :[Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 1320/1320 constraints, ReadFeed: 183/183 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 81/81 constraints]
After SMT, in 32618ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 13475 ms.
Support contains 160 out of 1320 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1320/1320 places, 1211/1211 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 1320 transition count 1193
Reduce places removed 18 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 20 rules applied. Total rules applied 38 place count 1302 transition count 1191
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 40 place count 1300 transition count 1191
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 40 place count 1300 transition count 1165
Deduced a syphon composed of 26 places in 2 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 92 place count 1274 transition count 1165
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 95 place count 1271 transition count 1162
Iterating global reduction 3 with 3 rules applied. Total rules applied 98 place count 1271 transition count 1162
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 98 place count 1271 transition count 1161
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 100 place count 1270 transition count 1161
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 2 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 242 place count 1199 transition count 1090
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 276 place count 1182 transition count 1105
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 278 place count 1182 transition count 1103
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 280 place count 1180 transition count 1103
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 286 place count 1180 transition count 1103
Reduce places removed 9 places and 9 transitions.
Iterating global reduction 4 with 9 rules applied. Total rules applied 295 place count 1171 transition count 1094
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 297 place count 1169 transition count 1094
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 297 place count 1169 transition count 1093
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 299 place count 1168 transition count 1093
Applied a total of 299 rules in 234 ms. Remains 1168 /1320 variables (removed 152) and now considering 1093/1211 (removed 118) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 234 ms. Remains : 1168/1320 places, 1093/1211 transitions.
RANDOM walk for 40000 steps (8 resets) in 645 ms. (61 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 293 ms. (136 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 217 ms. (183 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 219 ms. (181 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 324 ms. (123 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 219 ms. (181 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 212 ms. (187 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 272 ms. (146 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 94485 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :0 out of 8
Probabilistic random walk after 94485 steps, saw 58342 distinct states, run finished after 3009 ms. (steps per millisecond=31 ) properties seen :0
// Phase 1: matrix 1093 rows 1168 cols
[2024-06-01 11:07:39] [INFO ] Computed 449 invariants in 4 ms
[2024-06-01 11:07:39] [INFO ] State equation strengthened by 196 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, 8 unsolved
At refinement iteration 1 (OVERLAPS) 456/616 variables, 186/186 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/616 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 363/979 variables, 173/359 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/979 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 957/1936 variables, 979/1338 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1936 variables, 196/1534 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1936 variables, 0/1534 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 213/2149 variables, 116/1650 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2149 variables, 52/1702 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2149 variables, 0/1702 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 4/2153 variables, 4/1706 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2153 variables, 4/1710 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2153 variables, 0/1710 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 8/2161 variables, 4/1714 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2161 variables, 0/1714 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 93/2254 variables, 64/1778 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2254 variables, 26/1804 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2254 variables, 0/1804 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 1/2255 variables, 2/1806 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2255 variables, 1/1807 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2255 variables, 0/1807 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (OVERLAPS) 6/2261 variables, 4/1811 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2261 variables, 2/1813 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2261 variables, 0/1813 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (OVERLAPS) 0/2261 variables, 0/1813 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2261/2261 variables, and 1813 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3812 ms.
Refiners :[Positive P Invariants (semi-flows): 449/449 constraints, State Equation: 1168/1168 constraints, ReadFeed: 196/196 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 456/616 variables, 186/186 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 11:07:43] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 1 ms to minimize.
[2024-06-01 11:07:43] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
[2024-06-01 11:07:43] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 1 ms to minimize.
[2024-06-01 11:07:43] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 2 ms to minimize.
[2024-06-01 11:07:43] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
[2024-06-01 11:07:43] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 1 ms to minimize.
[2024-06-01 11:07:43] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 2 ms to minimize.
[2024-06-01 11:07:44] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 1 ms to minimize.
[2024-06-01 11:07:44] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-06-01 11:07:44] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 1 ms to minimize.
[2024-06-01 11:07:44] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2024-06-01 11:07:44] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2024-06-01 11:07:44] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-06-01 11:07:44] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 2 ms to minimize.
[2024-06-01 11:07:44] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 2 ms to minimize.
[2024-06-01 11:07:44] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/616 variables, 16/202 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 11:07:44] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
[2024-06-01 11:07:45] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 1 ms to minimize.
[2024-06-01 11:07:45] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/616 variables, 3/205 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/616 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 363/979 variables, 173/378 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 11:07:45] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 2 ms to minimize.
[2024-06-01 11:07:45] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 1 ms to minimize.
[2024-06-01 11:07:45] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 1 ms to minimize.
[2024-06-01 11:07:45] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 2 ms to minimize.
[2024-06-01 11:07:45] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 1 ms to minimize.
[2024-06-01 11:07:45] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 4 ms to minimize.
[2024-06-01 11:07:46] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 2 ms to minimize.
[2024-06-01 11:07:46] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 1 ms to minimize.
[2024-06-01 11:07:46] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/979 variables, 9/387 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 11:07:46] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 2 ms to minimize.
[2024-06-01 11:07:46] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/979 variables, 2/389 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 11:07:46] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 1 ms to minimize.
[2024-06-01 11:07:46] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-06-01 11:07:46] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 2 ms to minimize.
[2024-06-01 11:07:47] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/979 variables, 4/393 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 11:07:47] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/979 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 11:07:47] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 2 ms to minimize.
[2024-06-01 11:07:47] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/979 variables, 2/396 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 11:07:47] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/979 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 11:07:48] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2024-06-01 11:07:48] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/979 variables, 2/399 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 11:07:48] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/979 variables, 1/400 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 11:07:48] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/979 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 11:07:49] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 2 ms to minimize.
[2024-06-01 11:07:49] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 5 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/979 variables, 2/403 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/979 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 957/1936 variables, 979/1382 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1936 variables, 196/1578 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1936 variables, 5/1583 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 11:07:50] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 2 ms to minimize.
[2024-06-01 11:07:50] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 2 ms to minimize.
[2024-06-01 11:07:50] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 2 ms to minimize.
[2024-06-01 11:07:50] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 2 ms to minimize.
[2024-06-01 11:07:50] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 2 ms to minimize.
[2024-06-01 11:07:51] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1936 variables, 6/1589 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 11:07:52] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1936 variables, 1/1590 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1936 variables, 0/1590 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (OVERLAPS) 213/2149 variables, 116/1706 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2149 variables, 52/1758 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2149 variables, 3/1761 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 11:07:55] [INFO ] Deduced a trap composed of 5 places in 117 ms of which 2 ms to minimize.
[2024-06-01 11:07:55] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 2 ms to minimize.
[2024-06-01 11:07:56] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 2 ms to minimize.
[2024-06-01 11:07:56] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 2 ms to minimize.
[2024-06-01 11:07:56] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 2 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/2149 variables, 5/1766 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2149 variables, 0/1766 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 28 (OVERLAPS) 4/2153 variables, 4/1770 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2153 variables, 4/1774 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2153 variables, 0/1774 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 31 (OVERLAPS) 8/2161 variables, 4/1778 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2161 variables, 0/1778 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 33 (OVERLAPS) 93/2254 variables, 64/1842 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2254 variables, 26/1868 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2254 variables, 0/1868 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 36 (OVERLAPS) 1/2255 variables, 2/1870 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2255 variables, 1/1871 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 11:08:02] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 3 ms to minimize.
At refinement iteration 38 (INCLUDED_ONLY) 0/2255 variables, 1/1872 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/2255 variables, 0/1872 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 40 (OVERLAPS) 6/2261 variables, 4/1876 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/2261 variables, 2/1878 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/2261 variables, 0/1878 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 43 (OVERLAPS) 0/2261 variables, 0/1878 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2261/2261 variables, and 1878 constraints, problems are : Problem set: 0 solved, 8 unsolved in 22251 ms.
Refiners :[Positive P Invariants (semi-flows): 449/449 constraints, State Equation: 1168/1168 constraints, ReadFeed: 196/196 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 57/57 constraints]
After SMT, in 26109ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 8302 ms.
Support contains 160 out of 1168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1168/1168 places, 1093/1093 transitions.
Applied a total of 0 rules in 29 ms. Remains 1168 /1168 variables (removed 0) and now considering 1093/1093 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 1168/1168 places, 1093/1093 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1168/1168 places, 1093/1093 transitions.
Applied a total of 0 rules in 27 ms. Remains 1168 /1168 variables (removed 0) and now considering 1093/1093 (removed 0) transitions.
[2024-06-01 11:08:13] [INFO ] Invariant cache hit.
[2024-06-01 11:08:14] [INFO ] Implicit Places using invariants in 674 ms returned [1156]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 686 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1167/1168 places, 1093/1093 transitions.
Applied a total of 0 rules in 32 ms. Remains 1167 /1167 variables (removed 0) and now considering 1093/1093 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 747 ms. Remains : 1167/1168 places, 1093/1093 transitions.
RANDOM walk for 40000 steps (8 resets) in 762 ms. (52 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 283 ms. (140 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 335 ms. (119 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 285 ms. (139 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 300 ms. (132 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 375 ms. (106 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 287 ms. (138 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 248 ms. (160 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 342 ms. (116 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 85324 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :0 out of 8
Probabilistic random walk after 85324 steps, saw 52228 distinct states, run finished after 3002 ms. (steps per millisecond=28 ) properties seen :0
// Phase 1: matrix 1093 rows 1167 cols
[2024-06-01 11:08:18] [INFO ] Computed 448 invariants in 4 ms
[2024-06-01 11:08:18] [INFO ] State equation strengthened by 196 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, 8 unsolved
At refinement iteration 1 (OVERLAPS) 455/615 variables, 185/185 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/615 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 363/978 variables, 173/358 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/978 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 957/1935 variables, 978/1336 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1935 variables, 196/1532 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1935 variables, 0/1532 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 213/2148 variables, 116/1648 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2148 variables, 52/1700 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2148 variables, 0/1700 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 4/2152 variables, 4/1704 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2152 variables, 4/1708 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2152 variables, 0/1708 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 8/2160 variables, 4/1712 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2160 variables, 0/1712 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 93/2253 variables, 64/1776 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2253 variables, 26/1802 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2253 variables, 0/1802 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 1/2254 variables, 2/1804 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2254 variables, 1/1805 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2254 variables, 0/1805 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (OVERLAPS) 6/2260 variables, 4/1809 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2260 variables, 2/1811 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2260 variables, 0/1811 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (OVERLAPS) 0/2260 variables, 0/1811 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2260/2260 variables, and 1811 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3810 ms.
Refiners :[Positive P Invariants (semi-flows): 448/448 constraints, State Equation: 1167/1167 constraints, ReadFeed: 196/196 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 455/615 variables, 185/185 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 11:08:22] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 1 ms to minimize.
[2024-06-01 11:08:22] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 2 ms to minimize.
[2024-06-01 11:08:22] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 1 ms to minimize.
[2024-06-01 11:08:22] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 2 ms to minimize.
[2024-06-01 11:08:23] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 2 ms to minimize.
[2024-06-01 11:08:23] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2024-06-01 11:08:23] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2024-06-01 11:08:23] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 1 ms to minimize.
[2024-06-01 11:08:23] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 1 ms to minimize.
[2024-06-01 11:08:23] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:08:23] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:08:23] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:08:23] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2024-06-01 11:08:23] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 1 ms to minimize.
[2024-06-01 11:08:23] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-06-01 11:08:23] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-01 11:08:23] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-06-01 11:08:23] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/615 variables, 18/203 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 11:08:24] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-06-01 11:08:24] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/615 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 11:08:24] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/615 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 11:08:24] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/615 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 11:08:24] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/615 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/615 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 363/978 variables, 173/381 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 11:08:24] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-06-01 11:08:25] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 2 ms to minimize.
[2024-06-01 11:08:25] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2024-06-01 11:08:25] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
[2024-06-01 11:08:25] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
[2024-06-01 11:08:25] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2024-06-01 11:08:25] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-06-01 11:08:25] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-06-01 11:08:25] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/978 variables, 9/390 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 11:08:25] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 2 ms to minimize.
[2024-06-01 11:08:25] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/978 variables, 2/392 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 11:08:26] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-06-01 11:08:26] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/978 variables, 2/394 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 11:08:26] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 2 ms to minimize.
[2024-06-01 11:08:26] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/978 variables, 2/396 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 11:08:26] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/978 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/978 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 957/1935 variables, 978/1375 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1935 variables, 196/1571 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1935 variables, 5/1576 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 11:08:28] [INFO ] Deduced a trap composed of 6 places in 102 ms of which 2 ms to minimize.
[2024-06-01 11:08:28] [INFO ] Deduced a trap composed of 6 places in 116 ms of which 2 ms to minimize.
[2024-06-01 11:08:28] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 2 ms to minimize.
[2024-06-01 11:08:28] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 2 ms to minimize.
[2024-06-01 11:08:28] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1935 variables, 5/1581 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 11:08:29] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 2 ms to minimize.
[2024-06-01 11:08:29] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 1 ms to minimize.
[2024-06-01 11:08:29] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1935 variables, 3/1584 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1935 variables, 0/1584 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 213/2148 variables, 116/1700 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2148 variables, 52/1752 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2148 variables, 3/1755 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 11:08:32] [INFO ] Deduced a trap composed of 6 places in 115 ms of which 3 ms to minimize.
[2024-06-01 11:08:32] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 2 ms to minimize.
[2024-06-01 11:08:32] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 3 ms to minimize.
[2024-06-01 11:08:32] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 2 ms to minimize.
[2024-06-01 11:08:32] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 2 ms to minimize.
[2024-06-01 11:08:33] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 2 ms to minimize.
[2024-06-01 11:08:33] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 2 ms to minimize.
[2024-06-01 11:08:33] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/2148 variables, 8/1763 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2148 variables, 0/1763 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (OVERLAPS) 4/2152 variables, 4/1767 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2152 variables, 4/1771 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2152 variables, 0/1771 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 29 (OVERLAPS) 8/2160 variables, 4/1775 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2160 variables, 0/1775 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 31 (OVERLAPS) 93/2253 variables, 64/1839 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2253 variables, 26/1865 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2253 variables, 0/1865 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 34 (OVERLAPS) 1/2254 variables, 2/1867 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2254 variables, 1/1868 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2254 variables, 0/1868 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 37 (OVERLAPS) 6/2260 variables, 4/1872 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2260 variables, 2/1874 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/2260 variables, 0/1874 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 40 (OVERLAPS) 0/2260 variables, 0/1874 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2260/2260 variables, and 1874 constraints, problems are : Problem set: 0 solved, 8 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 448/448 constraints, State Equation: 1167/1167 constraints, ReadFeed: 196/196 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 55/55 constraints]
After SMT, in 23884ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 12223 ms.
Support contains 160 out of 1167 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1167/1167 places, 1093/1093 transitions.
Applied a total of 0 rules in 27 ms. Remains 1167 /1167 variables (removed 0) and now considering 1093/1093 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 1167/1167 places, 1093/1093 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1167/1167 places, 1093/1093 transitions.
Applied a total of 0 rules in 25 ms. Remains 1167 /1167 variables (removed 0) and now considering 1093/1093 (removed 0) transitions.
[2024-06-01 11:08:54] [INFO ] Invariant cache hit.
[2024-06-01 11:08:55] [INFO ] Implicit Places using invariants in 523 ms returned []
[2024-06-01 11:08:55] [INFO ] Invariant cache hit.
[2024-06-01 11:08:55] [INFO ] State equation strengthened by 196 read => feed constraints.
[2024-06-01 11:08:58] [INFO ] Implicit Places using invariants and state equation in 2867 ms returned []
Implicit Place search using SMT with State Equation took 3398 ms to find 0 implicit places.
[2024-06-01 11:08:58] [INFO ] Redundant transitions in 64 ms returned []
Running 1079 sub problems to find dead transitions.
[2024-06-01 11:08:58] [INFO ] Invariant cache hit.
[2024-06-01 11:08:58] [INFO ] State equation strengthened by 196 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1155 variables, 108/108 constraints. Problems are: Problem set: 0 solved, 1079 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1155/2260 variables, and 108 constraints, problems are : Problem set: 0 solved, 1079 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 108/448 constraints, State Equation: 0/1167 constraints, ReadFeed: 0/196 constraints, PredecessorRefiner: 1079/1079 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1079 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1155 variables, 108/108 constraints. Problems are: Problem set: 0 solved, 1079 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1155 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1079 unsolved
At refinement iteration 2 (OVERLAPS) 12/1167 variables, 340/448 constraints. Problems are: Problem set: 0 solved, 1079 unsolved
[2024-06-01 11:09:48] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-06-01 11:09:48] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:09:48] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-06-01 11:09:48] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:09:49] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:09:49] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:09:49] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-06-01 11:09:49] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2024-06-01 11:09:49] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
[2024-06-01 11:09:49] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
[2024-06-01 11:09:49] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:09:50] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
[2024-06-01 11:09:50] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:09:50] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2024-06-01 11:09:50] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:09:50] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-06-01 11:09:50] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:09:50] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:09:51] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:09:51] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1167 variables, 20/468 constraints. Problems are: Problem set: 0 solved, 1079 unsolved
[2024-06-01 11:09:52] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:09:53] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
[2024-06-01 11:09:53] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:09:53] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-06-01 11:09:53] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:09:53] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:09:53] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:09:53] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
[2024-06-01 11:09:53] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:09:54] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:09:54] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-06-01 11:09:54] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 0 ms to minimize.
[2024-06-01 11:09:54] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 0 ms to minimize.
[2024-06-01 11:09:54] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 0 ms to minimize.
[2024-06-01 11:09:55] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:09:55] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:09:55] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
[2024-06-01 11:09:56] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-06-01 11:09:56] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
[2024-06-01 11:09:56] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1167 variables, 20/488 constraints. Problems are: Problem set: 0 solved, 1079 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1167/2260 variables, and 488 constraints, problems are : Problem set: 0 solved, 1079 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 448/448 constraints, State Equation: 0/1167 constraints, ReadFeed: 0/196 constraints, PredecessorRefiner: 0/1079 constraints, Known Traps: 40/40 constraints]
After SMT, in 60387ms problems are : Problem set: 0 solved, 1079 unsolved
Search for dead transitions found 0 dead transitions in 60401ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63903 ms. Remains : 1167/1167 places, 1093/1093 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 124 times.
Drop transitions (Partial Free agglomeration) removed 124 transitions
Iterating global reduction 0 with 124 rules applied. Total rules applied 124 place count 1167 transition count 1093
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 129 place count 1167 transition count 1088
Applied a total of 129 rules in 73 ms. Remains 1167 /1167 variables (removed 0) and now considering 1088/1093 (removed 5) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 1088 rows 1167 cols
[2024-06-01 11:09:58] [INFO ] Computed 448 invariants in 6 ms
[2024-06-01 11:09:59] [INFO ] [Real]Absence check using 448 positive place invariants in 64 ms returned sat
[2024-06-01 11:09:59] [INFO ] After 392ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-06-01 11:09:59] [INFO ] [Nat]Absence check using 448 positive place invariants in 67 ms returned sat
[2024-06-01 11:10:00] [INFO ] After 943ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-06-01 11:10:00] [INFO ] State equation strengthened by 105 read => feed constraints.
[2024-06-01 11:10:01] [INFO ] After 975ms SMT Verify possible using 105 Read/Feed constraints in natural domain returned unsat :0 sat :8
TRAPS : Iteration 0
[2024-06-01 11:10:01] [INFO ] Deduced a trap composed of 6 places in 143 ms of which 3 ms to minimize.
[2024-06-01 11:10:01] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 3 ms to minimize.
[2024-06-01 11:10:02] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 3 ms to minimize.
[2024-06-01 11:10:02] [INFO ] Deduced a trap composed of 8 places in 275 ms of which 6 ms to minimize.
[2024-06-01 11:10:02] [INFO ] Deduced a trap composed of 6 places in 243 ms of which 7 ms to minimize.
[2024-06-01 11:10:03] [INFO ] Deduced a trap composed of 7 places in 217 ms of which 6 ms to minimize.
[2024-06-01 11:10:03] [INFO ] Deduced a trap composed of 4 places in 231 ms of which 3 ms to minimize.
[2024-06-01 11:10:03] [INFO ] Deduced a trap composed of 5 places in 261 ms of which 6 ms to minimize.
[2024-06-01 11:10:03] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 3 ms to minimize.
[2024-06-01 11:10:04] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 3 ms to minimize.
[2024-06-01 11:10:04] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 2 ms to minimize.
[2024-06-01 11:10:04] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 3 ms to minimize.
[2024-06-01 11:10:04] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 2 ms to minimize.
[2024-06-01 11:10:04] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 2 ms to minimize.
[2024-06-01 11:10:05] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 2 ms to minimize.
[2024-06-01 11:10:05] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 2 ms to minimize.
[2024-06-01 11:10:05] [INFO ] Deduced a trap composed of 6 places in 167 ms of which 2 ms to minimize.
[2024-06-01 11:10:05] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 2 ms to minimize.
[2024-06-01 11:10:05] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 4180 ms
[2024-06-01 11:10:06] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 2 ms to minimize.
[2024-06-01 11:10:06] [INFO ] Deduced a trap composed of 6 places in 140 ms of which 2 ms to minimize.
[2024-06-01 11:10:06] [INFO ] Deduced a trap composed of 6 places in 165 ms of which 2 ms to minimize.
[2024-06-01 11:10:06] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 3 ms to minimize.
[2024-06-01 11:10:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 764 ms
[2024-06-01 11:10:07] [INFO ] Deduced a trap composed of 3 places in 124 ms of which 3 ms to minimize.
[2024-06-01 11:10:07] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 2 ms to minimize.
[2024-06-01 11:10:07] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 2 ms to minimize.
[2024-06-01 11:10:07] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 2 ms to minimize.
[2024-06-01 11:10:08] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 2 ms to minimize.
[2024-06-01 11:10:08] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 3 ms to minimize.
[2024-06-01 11:10:08] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 2 ms to minimize.
[2024-06-01 11:10:08] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 2 ms to minimize.
[2024-06-01 11:10:08] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 2 ms to minimize.
[2024-06-01 11:10:08] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 2 ms to minimize.
[2024-06-01 11:10:08] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1652 ms
[2024-06-01 11:10:09] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 2 ms to minimize.
[2024-06-01 11:10:09] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 2 ms to minimize.
[2024-06-01 11:10:09] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 2 ms to minimize.
[2024-06-01 11:10:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 496 ms
TRAPS : Iteration 1
[2024-06-01 11:10:09] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 3 ms to minimize.
[2024-06-01 11:10:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2024-06-01 11:10:10] [INFO ] Deduced a trap composed of 6 places in 196 ms of which 3 ms to minimize.
[2024-06-01 11:10:10] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 3 ms to minimize.
[2024-06-01 11:10:10] [INFO ] Deduced a trap composed of 5 places in 171 ms of which 3 ms to minimize.
[2024-06-01 11:10:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 761 ms
[2024-06-01 11:10:11] [INFO ] Deduced a trap composed of 8 places in 165 ms of which 3 ms to minimize.
[2024-06-01 11:10:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 254 ms
[2024-06-01 11:10:11] [INFO ] Deduced a trap composed of 6 places in 120 ms of which 2 ms to minimize.
[2024-06-01 11:10:11] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 2 ms to minimize.
[2024-06-01 11:10:12] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 2 ms to minimize.
[2024-06-01 11:10:12] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 2 ms to minimize.
[2024-06-01 11:10:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 766 ms
[2024-06-01 11:10:12] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 2 ms to minimize.
[2024-06-01 11:10:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
TRAPS : Iteration 2
[2024-06-01 11:10:13] [INFO ] Deduced a trap composed of 6 places in 137 ms of which 3 ms to minimize.
[2024-06-01 11:10:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 224 ms
[2024-06-01 11:10:14] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 2 ms to minimize.
[2024-06-01 11:10:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
TRAPS : Iteration 3
[2024-06-01 11:10:14] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 2 ms to minimize.
[2024-06-01 11:10:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 224 ms
[2024-06-01 11:10:16] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 3 ms to minimize.
[2024-06-01 11:10:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 242 ms
TRAPS : Iteration 4
[2024-06-01 11:10:16] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 2 ms to minimize.
[2024-06-01 11:10:16] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 3 ms to minimize.
[2024-06-01 11:10:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 407 ms
[2024-06-01 11:10:17] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 3 ms to minimize.
[2024-06-01 11:10:17] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 3 ms to minimize.
[2024-06-01 11:10:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 407 ms
[2024-06-01 11:10:17] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 2 ms to minimize.
[2024-06-01 11:10:17] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 3 ms to minimize.
[2024-06-01 11:10:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 379 ms
[2024-06-01 11:10:18] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 2 ms to minimize.
[2024-06-01 11:10:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 205 ms
TRAPS : Iteration 5
[2024-06-01 11:10:19] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 2 ms to minimize.
[2024-06-01 11:10:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 230 ms
[2024-06-01 11:10:20] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 3 ms to minimize.
[2024-06-01 11:10:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 269 ms
TRAPS : Iteration 6
[2024-06-01 11:10:21] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 3 ms to minimize.
[2024-06-01 11:10:21] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 3 ms to minimize.
[2024-06-01 11:10:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 417 ms
[2024-06-01 11:10:22] [INFO ] Deduced a trap composed of 6 places in 196 ms of which 3 ms to minimize.
[2024-06-01 11:10:22] [INFO ] Deduced a trap composed of 8 places in 192 ms of which 4 ms to minimize.
[2024-06-01 11:10:22] [INFO ] Deduced a trap composed of 11 places in 192 ms of which 3 ms to minimize.
[2024-06-01 11:10:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 767 ms
TRAPS : Iteration 7
[2024-06-01 11:10:23] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 3 ms to minimize.
[2024-06-01 11:10:23] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 4 ms to minimize.
[2024-06-01 11:10:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 471 ms
[2024-06-01 11:10:24] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 3 ms to minimize.
[2024-06-01 11:10:24] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 3 ms to minimize.
[2024-06-01 11:10:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 365 ms
TRAPS : Iteration 8
[2024-06-01 11:10:25] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 3 ms to minimize.
[2024-06-01 11:10:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 247 ms
[2024-06-01 11:10:26] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 3 ms to minimize.
[2024-06-01 11:10:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 226 ms
TRAPS : Iteration 9
[2024-06-01 11:10:26] [INFO ] Deduced a trap composed of 6 places in 176 ms of which 3 ms to minimize.
[2024-06-01 11:10:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 268 ms
[2024-06-01 11:10:27] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 2 ms to minimize.
[2024-06-01 11:10:27] [INFO ] Deduced a trap composed of 9 places in 185 ms of which 3 ms to minimize.
[2024-06-01 11:10:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 475 ms
[2024-06-01 11:10:28] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 2 ms to minimize.
[2024-06-01 11:10:28] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 3 ms to minimize.
[2024-06-01 11:10:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 433 ms
TRAPS : Iteration 10
[2024-06-01 11:10:29] [INFO ] Deduced a trap composed of 6 places in 171 ms of which 2 ms to minimize.
[2024-06-01 11:10:29] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 3 ms to minimize.
[2024-06-01 11:10:29] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 2 ms to minimize.
[2024-06-01 11:10:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 655 ms
[2024-06-01 11:10:30] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 2 ms to minimize.
[2024-06-01 11:10:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
TRAPS : Iteration 11
[2024-06-01 11:10:32] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 3 ms to minimize.
[2024-06-01 11:10:32] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 3 ms to minimize.
[2024-06-01 11:10:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 417 ms
TRAPS : Iteration 12
[2024-06-01 11:10:33] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 2 ms to minimize.
[2024-06-01 11:10:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 237 ms
TRAPS : Iteration 13
[2024-06-01 11:10:34] [INFO ] Deduced a trap composed of 7 places in 194 ms of which 3 ms to minimize.
[2024-06-01 11:10:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 288 ms
TRAPS : Iteration 14
[2024-06-01 11:10:37] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 2 ms to minimize.
[2024-06-01 11:10:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
TRAPS : Iteration 15
[2024-06-01 11:10:38] [INFO ] After 38317ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
[2024-06-01 11:10:39] [INFO ] After 40774ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Over-approximation ignoring read arcs solved 0 properties in 41284 ms.
[2024-06-01 11:10:39] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 10 ms.
[2024-06-01 11:10:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1167 places, 1093 transitions and 4852 arcs took 16 ms.
[2024-06-01 11:10:40] [INFO ] Flatten gal took : 131 ms
Total runtime 245996 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : ShieldIIPt-PT-050B-ReachabilityFireability-2024-00
Could not compute solution for formula : ShieldIIPt-PT-050B-ReachabilityFireability-2024-01
Could not compute solution for formula : ShieldIIPt-PT-050B-ReachabilityFireability-2024-03
Could not compute solution for formula : ShieldIIPt-PT-050B-ReachabilityFireability-2024-05
Could not compute solution for formula : ShieldIIPt-PT-050B-ReachabilityFireability-2024-08
Could not compute solution for formula : ShieldIIPt-PT-050B-ReachabilityFireability-2024-11
Could not compute solution for formula : ShieldIIPt-PT-050B-ReachabilityFireability-2024-12
Could not compute solution for formula : ShieldIIPt-PT-050B-ReachabilityFireability-2024-14

BK_STOP 1717240240638

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name ShieldIIPt-PT-050B-ReachabilityFireability-2024-00
rfs formula type EF
rfs formula formula --invariant=/tmp/1563/inv_0_
rfs formula name ShieldIIPt-PT-050B-ReachabilityFireability-2024-01
rfs formula type EF
rfs formula formula --invariant=/tmp/1563/inv_1_
rfs formula name ShieldIIPt-PT-050B-ReachabilityFireability-2024-03
rfs formula type EF
rfs formula formula --invariant=/tmp/1563/inv_2_
rfs formula name ShieldIIPt-PT-050B-ReachabilityFireability-2024-05
rfs formula type AG
rfs formula formula --invariant=/tmp/1563/inv_3_
rfs formula name ShieldIIPt-PT-050B-ReachabilityFireability-2024-08
rfs formula type EF
rfs formula formula --invariant=/tmp/1563/inv_4_
rfs formula name ShieldIIPt-PT-050B-ReachabilityFireability-2024-11
rfs formula type EF
rfs formula formula --invariant=/tmp/1563/inv_5_
rfs formula name ShieldIIPt-PT-050B-ReachabilityFireability-2024-12
rfs formula type AG
rfs formula formula --invariant=/tmp/1563/inv_6_
rfs formula name ShieldIIPt-PT-050B-ReachabilityFireability-2024-14
rfs formula type AG
rfs formula formula --invariant=/tmp/1563/inv_7_
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="ShieldIIPt-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 ShieldIIPt-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-171683760900335"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-050B.tgz
mv ShieldIIPt-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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;