fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r528-tall-171683762000838
Last Updated
July 7, 2024

About the Execution of LTSMin+red for ShieldRVs-PT-040A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
767.844 145701.00 192330.00 384.80 TFTFF?FTFTFFTTFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r528-tall-171683762000838.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 ShieldRVs-PT-040A, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683762000838
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K 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 51K 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.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 16:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 18:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 12 18:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 17:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 12 17:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 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 256K 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 ShieldRVs-PT-040A-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717268963104

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-040A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 19:09:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 19:09:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:09:24] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2024-06-01 19:09:24] [INFO ] Transformed 563 places.
[2024-06-01 19:09:24] [INFO ] Transformed 763 transitions.
[2024-06-01 19:09:24] [INFO ] Found NUPN structural information;
[2024-06-01 19:09:24] [INFO ] Parsed PT model containing 563 places and 763 transitions and 3680 arcs in 218 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVs-PT-040A-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-040A-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-040A-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-040A-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (72 resets) in 1566 ms. (25 steps per ms) remains 2/12 properties
FORMULA ShieldRVs-PT-040A-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 536 ms. (74 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 241 ms. (165 steps per ms) remains 1/2 properties
FORMULA ShieldRVs-PT-040A-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 763 rows 563 cols
[2024-06-01 19:09:25] [INFO ] Computed 161 invariants in 15 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 535/563 variables, 161/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/563 variables, 535/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 763/1326 variables, 563/1287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1326 variables, 0/1287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/1326 variables, 0/1287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1326/1326 variables, and 1287 constraints, problems are : Problem set: 0 solved, 1 unsolved in 579 ms.
Refiners :[Domain max(s): 563/563 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 563/563 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 535/563 variables, 161/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/563 variables, 535/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:09:26] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 9 ms to minimize.
[2024-06-01 19:09:26] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 2 ms to minimize.
[2024-06-01 19:09:26] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
[2024-06-01 19:09:26] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 1 ms to minimize.
[2024-06-01 19:09:26] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 2 ms to minimize.
[2024-06-01 19:09:26] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 2 ms to minimize.
[2024-06-01 19:09:27] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 7 ms to minimize.
[2024-06-01 19:09:27] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2024-06-01 19:09:27] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2024-06-01 19:09:27] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:09:27] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-06-01 19:09:27] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-06-01 19:09:27] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-06-01 19:09:27] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 14/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 763/1326 variables, 563/1301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1326 variables, 1/1302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:09:27] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:09:28] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:09:28] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:09:28] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-06-01 19:09:28] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-06-01 19:09:28] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-06-01 19:09:28] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-01 19:09:28] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:09:28] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2024-06-01 19:09:28] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1326 variables, 10/1312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1326 variables, 0/1312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1326 variables, 0/1312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1326/1326 variables, and 1312 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2910 ms.
Refiners :[Domain max(s): 563/563 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 563/563 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 24/24 constraints]
After SMT, in 3578ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 397 ms.
Support contains 28 out of 563 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 563/563 places, 763/763 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 562 transition count 762
Partial Free-agglomeration rule applied 77 times.
Drop transitions (Partial Free agglomeration) removed 77 transitions
Iterating global reduction 0 with 77 rules applied. Total rules applied 79 place count 562 transition count 762
Applied a total of 79 rules in 145 ms. Remains 562 /563 variables (removed 1) and now considering 762/763 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 562/563 places, 762/763 transitions.
RANDOM walk for 40000 steps (82 resets) in 530 ms. (75 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 301396 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :0 out of 1
Probabilistic random walk after 301396 steps, saw 75374 distinct states, run finished after 3004 ms. (steps per millisecond=100 ) properties seen :0
// Phase 1: matrix 762 rows 562 cols
[2024-06-01 19:09:32] [INFO ] Computed 161 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 534/562 variables, 161/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/562 variables, 534/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 762/1324 variables, 562/1285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1324 variables, 0/1285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/1324 variables, 0/1285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1324/1324 variables, and 1285 constraints, problems are : Problem set: 0 solved, 1 unsolved in 365 ms.
Refiners :[Domain max(s): 562/562 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 534/562 variables, 161/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/562 variables, 534/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:09:33] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 2 ms to minimize.
[2024-06-01 19:09:33] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 1 ms to minimize.
[2024-06-01 19:09:33] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 2 ms to minimize.
[2024-06-01 19:09:33] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 2 ms to minimize.
[2024-06-01 19:09:33] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 1 ms to minimize.
[2024-06-01 19:09:33] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 1 ms to minimize.
[2024-06-01 19:09:33] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 2 ms to minimize.
[2024-06-01 19:09:34] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 1 ms to minimize.
[2024-06-01 19:09:34] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 2 ms to minimize.
[2024-06-01 19:09:34] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 3 ms to minimize.
[2024-06-01 19:09:34] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 2 ms to minimize.
[2024-06-01 19:09:34] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:09:34] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2024-06-01 19:09:34] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 0 ms to minimize.
[2024-06-01 19:09:34] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-06-01 19:09:34] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 2 ms to minimize.
[2024-06-01 19:09:34] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-06-01 19:09:34] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-06-01 19:09:34] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 19/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 762/1324 variables, 562/1304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1324 variables, 1/1305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:09:35] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 2 ms to minimize.
[2024-06-01 19:09:35] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 2 ms to minimize.
[2024-06-01 19:09:35] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 2 ms to minimize.
[2024-06-01 19:09:35] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 2 ms to minimize.
[2024-06-01 19:09:35] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 2 ms to minimize.
[2024-06-01 19:09:35] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 1 ms to minimize.
[2024-06-01 19:09:36] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 2 ms to minimize.
[2024-06-01 19:09:36] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 2 ms to minimize.
[2024-06-01 19:09:36] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
[2024-06-01 19:09:36] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2024-06-01 19:09:36] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:09:36] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-06-01 19:09:36] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2024-06-01 19:09:36] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 2 ms to minimize.
[2024-06-01 19:09:36] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:09:37] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-06-01 19:09:37] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-06-01 19:09:37] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-06-01 19:09:37] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1324 variables, 19/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1324 variables, 0/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:09:37] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/1324 variables, 1/1325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1324 variables, 0/1325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1324 variables, 0/1325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1324/1324 variables, and 1325 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4592 ms.
Refiners :[Domain max(s): 562/562 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 39/39 constraints]
After SMT, in 4987ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 277 ms.
Support contains 28 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 762/762 transitions.
Applied a total of 0 rules in 47 ms. Remains 562 /562 variables (removed 0) and now considering 762/762 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 562/562 places, 762/762 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 762/762 transitions.
Applied a total of 0 rules in 23 ms. Remains 562 /562 variables (removed 0) and now considering 762/762 (removed 0) transitions.
[2024-06-01 19:09:38] [INFO ] Invariant cache hit.
[2024-06-01 19:09:38] [INFO ] Implicit Places using invariants in 323 ms returned []
[2024-06-01 19:09:38] [INFO ] Invariant cache hit.
[2024-06-01 19:09:39] [INFO ] Implicit Places using invariants and state equation in 660 ms returned []
Implicit Place search using SMT with State Equation took 994 ms to find 0 implicit places.
[2024-06-01 19:09:39] [INFO ] Redundant transitions in 133 ms returned [163]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 760 sub problems to find dead transitions.
// Phase 1: matrix 761 rows 562 cols
[2024-06-01 19:09:39] [INFO ] Computed 161 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 561/561 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 2 (OVERLAPS) 1/562 variables, 161/722 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/562 variables, 1/723 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:09:58] [INFO ] Deduced a trap composed of 7 places in 183 ms of which 3 ms to minimize.
[2024-06-01 19:09:58] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 2 ms to minimize.
[2024-06-01 19:09:58] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 3 ms to minimize.
[2024-06-01 19:09:59] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 2 ms to minimize.
[2024-06-01 19:09:59] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 3 ms to minimize.
[2024-06-01 19:09:59] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 2 ms to minimize.
[2024-06-01 19:09:59] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 3 ms to minimize.
[2024-06-01 19:09:59] [INFO ] Deduced a trap composed of 7 places in 295 ms of which 5 ms to minimize.
[2024-06-01 19:10:00] [INFO ] Deduced a trap composed of 6 places in 323 ms of which 6 ms to minimize.
[2024-06-01 19:10:00] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 3 ms to minimize.
[2024-06-01 19:10:00] [INFO ] Deduced a trap composed of 7 places in 174 ms of which 3 ms to minimize.
[2024-06-01 19:10:00] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 3 ms to minimize.
[2024-06-01 19:10:01] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 3 ms to minimize.
[2024-06-01 19:10:01] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 2 ms to minimize.
[2024-06-01 19:10:01] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 3 ms to minimize.
[2024-06-01 19:10:01] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 2 ms to minimize.
[2024-06-01 19:10:01] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 3 ms to minimize.
[2024-06-01 19:10:01] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 2 ms to minimize.
[2024-06-01 19:10:02] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 3 ms to minimize.
[2024-06-01 19:10:02] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 20/743 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:10:02] [INFO ] Deduced a trap composed of 7 places in 169 ms of which 2 ms to minimize.
[2024-06-01 19:10:02] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 3 ms to minimize.
[2024-06-01 19:10:02] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 3 ms to minimize.
[2024-06-01 19:10:03] [INFO ] Deduced a trap composed of 7 places in 169 ms of which 2 ms to minimize.
[2024-06-01 19:10:03] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 3 ms to minimize.
[2024-06-01 19:10:03] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 3 ms to minimize.
[2024-06-01 19:10:03] [INFO ] Deduced a trap composed of 7 places in 196 ms of which 2 ms to minimize.
[2024-06-01 19:10:03] [INFO ] Deduced a trap composed of 11 places in 161 ms of which 2 ms to minimize.
[2024-06-01 19:10:04] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 3 ms to minimize.
[2024-06-01 19:10:04] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 3 ms to minimize.
[2024-06-01 19:10:04] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 2 ms to minimize.
[2024-06-01 19:10:04] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 3 ms to minimize.
[2024-06-01 19:10:04] [INFO ] Deduced a trap composed of 7 places in 169 ms of which 3 ms to minimize.
[2024-06-01 19:10:04] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 2 ms to minimize.
[2024-06-01 19:10:05] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 3 ms to minimize.
[2024-06-01 19:10:05] [INFO ] Deduced a trap composed of 7 places in 169 ms of which 2 ms to minimize.
[2024-06-01 19:10:05] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 3 ms to minimize.
[2024-06-01 19:10:05] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 3 ms to minimize.
[2024-06-01 19:10:05] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 2 ms to minimize.
[2024-06-01 19:10:06] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 20/763 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:10:06] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 3 ms to minimize.
[2024-06-01 19:10:06] [INFO ] Deduced a trap composed of 16 places in 167 ms of which 2 ms to minimize.
[2024-06-01 19:10:06] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 2 ms to minimize.
[2024-06-01 19:10:06] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:10:06] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 2 ms to minimize.
[2024-06-01 19:10:06] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-06-01 19:10:07] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 2 ms to minimize.
[2024-06-01 19:10:07] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
[2024-06-01 19:10:07] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 2 ms to minimize.
[2024-06-01 19:10:07] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-06-01 19:10:07] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
[2024-06-01 19:10:07] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 1 ms to minimize.
[2024-06-01 19:10:07] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 2 ms to minimize.
[2024-06-01 19:10:07] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 0 ms to minimize.
[2024-06-01 19:10:08] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-06-01 19:10:08] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2024-06-01 19:10:08] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:10:08] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-06-01 19:10:08] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 0 ms to minimize.
[2024-06-01 19:10:08] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 1.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 0.0)timeout

(s162 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 20/783 constraints. Problems are: Problem set: 0 solved, 760 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 562/1323 variables, and 783 constraints, problems are : Problem set: 0 solved, 760 unsolved in 30026 ms.
Refiners :[Domain max(s): 562/562 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 0/562 constraints, PredecessorRefiner: 760/760 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 760 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 561/561 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 2 (OVERLAPS) 1/562 variables, 161/722 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/562 variables, 1/723 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 60/783 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:10:16] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-06-01 19:10:16] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 3 ms to minimize.
[2024-06-01 19:10:16] [INFO ] Deduced a trap composed of 12 places in 155 ms of which 2 ms to minimize.
[2024-06-01 19:10:17] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 3 ms to minimize.
[2024-06-01 19:10:17] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-06-01 19:10:17] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-01 19:10:17] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-06-01 19:10:17] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-06-01 19:10:17] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-06-01 19:10:17] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-06-01 19:10:17] [INFO ] Deduced a trap composed of 17 places in 180 ms of which 3 ms to minimize.
[2024-06-01 19:10:17] [INFO ] Deduced a trap composed of 14 places in 172 ms of which 2 ms to minimize.
[2024-06-01 19:10:18] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 3 ms to minimize.
[2024-06-01 19:10:18] [INFO ] Deduced a trap composed of 17 places in 176 ms of which 2 ms to minimize.
[2024-06-01 19:10:18] [INFO ] Deduced a trap composed of 18 places in 171 ms of which 2 ms to minimize.
[2024-06-01 19:10:18] [INFO ] Deduced a trap composed of 16 places in 170 ms of which 3 ms to minimize.
[2024-06-01 19:10:18] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 3 ms to minimize.
[2024-06-01 19:10:18] [INFO ] Deduced a trap composed of 16 places in 151 ms of which 3 ms to minimize.
[2024-06-01 19:10:19] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:10:19] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 20/803 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:10:19] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-06-01 19:10:19] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 0 ms to minimize.
[2024-06-01 19:10:19] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 0 ms to minimize.
[2024-06-01 19:10:20] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 3 ms to minimize.
[2024-06-01 19:10:20] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 3 ms to minimize.
[2024-06-01 19:10:20] [INFO ] Deduced a trap composed of 21 places in 158 ms of which 3 ms to minimize.
[2024-06-01 19:10:20] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 3 ms to minimize.
[2024-06-01 19:10:20] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 0 ms to minimize.
[2024-06-01 19:10:20] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 0 ms to minimize.
[2024-06-01 19:10:20] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 3 ms to minimize.
[2024-06-01 19:10:21] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 2 ms to minimize.
[2024-06-01 19:10:21] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 3 ms to minimize.
[2024-06-01 19:10:21] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 2 ms to minimize.
[2024-06-01 19:10:21] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 2 ms to minimize.
[2024-06-01 19:10:21] [INFO ] Deduced a trap composed of 7 places in 169 ms of which 3 ms to minimize.
[2024-06-01 19:10:22] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 2 ms to minimize.
[2024-06-01 19:10:22] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 2 ms to minimize.
[2024-06-01 19:10:22] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2024-06-01 19:10:22] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 3 ms to minimize.
[2024-06-01 19:10:22] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 20/823 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:10:23] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-06-01 19:10:23] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-06-01 19:10:23] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 2 ms to minimize.
[2024-06-01 19:10:23] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:10:23] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:10:23] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:10:23] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:10:24] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 2 ms to minimize.
[2024-06-01 19:10:24] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-06-01 19:10:24] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-06-01 19:10:24] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 2 ms to minimize.
[2024-06-01 19:10:24] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:10:24] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:10:24] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 2 ms to minimize.
[2024-06-01 19:10:24] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:10:25] [INFO ] Deduced a trap composed of 28 places in 170 ms of which 3 ms to minimize.
[2024-06-01 19:10:25] [INFO ] Deduced a trap composed of 26 places in 172 ms of which 2 ms to minimize.
[2024-06-01 19:10:25] [INFO ] Deduced a trap composed of 30 places in 174 ms of which 3 ms to minimize.
[2024-06-01 19:10:25] [INFO ] Deduced a trap composed of 18 places in 171 ms of which 2 ms to minimize.
[2024-06-01 19:10:25] [INFO ] Deduced a trap composed of 7 places in 170 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/562 variables, 20/843 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:10:26] [INFO ] Deduced a trap composed of 11 places in 161 ms of which 2 ms to minimize.
[2024-06-01 19:10:26] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 3 ms to minimize.
[2024-06-01 19:10:26] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 2 ms to minimize.
[2024-06-01 19:10:27] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 2 ms to minimize.
[2024-06-01 19:10:27] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 0 ms to minimize.
[2024-06-01 19:10:27] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-06-01 19:10:27] [INFO ] Deduced a trap composed of 30 places in 176 ms of which 3 ms to minimize.
[2024-06-01 19:10:27] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 0 ms to minimize.
[2024-06-01 19:10:27] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:10:27] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 0 ms to minimize.
[2024-06-01 19:10:27] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:10:28] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:10:28] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:10:28] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 2 ms to minimize.
[2024-06-01 19:10:28] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:10:28] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:10:28] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 0 ms to minimize.
[2024-06-01 19:10:28] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:10:28] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 0 ms to minimize.
[2024-06-01 19:10:28] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/562 variables, 20/863 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:10:29] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 3 ms to minimize.
[2024-06-01 19:10:29] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-06-01 19:10:29] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-06-01 19:10:29] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 0 ms to minimize.
[2024-06-01 19:10:30] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-01 19:10:30] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-06-01 19:10:30] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2024-06-01 19:10:30] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2024-06-01 19:10:30] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 3 ms to minimize.
[2024-06-01 19:10:30] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 2 ms to minimize.
[2024-06-01 19:10:30] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-06-01 19:10:30] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 2 ms to minimize.
[2024-06-01 19:10:30] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 2 ms to minimize.
[2024-06-01 19:10:31] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 2 ms to minimize.
[2024-06-01 19:10:31] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 2 ms to minimize.
[2024-06-01 19:10:31] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 0 ms to minimize.
[2024-06-01 19:10:31] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-06-01 19:10:31] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 0 ms to minimize.
[2024-06-01 19:10:31] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 2 ms to minimize.
[2024-06-01 19:10:31] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/562 variables, 20/883 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:10:32] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 2 ms to minimize.
[2024-06-01 19:10:32] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-06-01 19:10:33] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-06-01 19:10:33] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
[2024-06-01 19:10:33] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-06-01 19:10:33] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 2 ms to minimize.
[2024-06-01 19:10:33] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-06-01 19:10:33] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:10:33] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 3 ms to minimize.
[2024-06-01 19:10:33] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 0 ms to minimize.
[2024-06-01 19:10:33] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:10:34] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 2 ms to minimize.
[2024-06-01 19:10:34] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:10:34] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-06-01 19:10:34] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 0 ms to minimize.
[2024-06-01 19:10:34] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:10:34] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 2 ms to minimize.
[2024-06-01 19:10:34] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 2 ms to minimize.
[2024-06-01 19:10:34] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 2 ms to minimize.
[2024-06-01 19:10:34] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/562 variables, 20/903 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:10:35] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 2 ms to minimize.
[2024-06-01 19:10:36] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 3 ms to minimize.
[2024-06-01 19:10:36] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-06-01 19:10:36] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 3 ms to minimize.
[2024-06-01 19:10:36] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 0 ms to minimize.
[2024-06-01 19:10:36] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 2 ms to minimize.
[2024-06-01 19:10:36] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 2 ms to minimize.
[2024-06-01 19:10:37] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 1 ms to minimize.
[2024-06-01 19:10:37] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2024-06-01 19:10:37] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 1 ms to minimize.
[2024-06-01 19:10:37] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-06-01 19:10:37] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 2 ms to minimize.
[2024-06-01 19:10:37] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 2 ms to minimize.
[2024-06-01 19:10:37] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 2 ms to minimize.
[2024-06-01 19:10:37] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 2 ms to minimize.
[2024-06-01 19:10:37] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 2 ms to minimize.
[2024-06-01 19:10:37] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-06-01 19:10:38] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2024-06-01 19:10:38] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 2 ms to minimize.
[2024-06-01 19:10:38] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/562 variables, 20/923 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:10:38] [INFO ] Deduced a trap composed of 17 places in 176 ms of which 3 ms to minimize.
[2024-06-01 19:10:39] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 562/1323 variables, and 925 constraints, problems are : Problem set: 0 solved, 760 unsolved in 30015 ms.
Refiners :[Domain max(s): 562/562 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 0/562 constraints, PredecessorRefiner: 0/760 constraints, Known Traps: 202/202 constraints]
After SMT, in 60440ms problems are : Problem set: 0 solved, 760 unsolved
Search for dead transitions found 0 dead transitions in 60451ms
Starting structural reductions in REACHABILITY mode, iteration 1 : 562/562 places, 761/762 transitions.
Applied a total of 0 rules in 24 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61643 ms. Remains : 562/562 places, 761/762 transitions.
RANDOM walk for 40000 steps (82 resets) in 234 ms. (170 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 164 ms. (242 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 303850 steps, run timeout after 3001 ms. (steps per millisecond=101 ) properties seen :0 out of 1
Probabilistic random walk after 303850 steps, saw 75877 distinct states, run finished after 3001 ms. (steps per millisecond=101 ) properties seen :0
[2024-06-01 19:10:42] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 534/562 variables, 161/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/562 variables, 534/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 761/1323 variables, 562/1285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1323 variables, 0/1285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/1323 variables, 0/1285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1323/1323 variables, and 1285 constraints, problems are : Problem set: 0 solved, 1 unsolved in 344 ms.
Refiners :[Domain max(s): 562/562 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 534/562 variables, 161/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/562 variables, 534/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:10:43] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 1 ms to minimize.
[2024-06-01 19:10:43] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
[2024-06-01 19:10:43] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2024-06-01 19:10:43] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2024-06-01 19:10:43] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2024-06-01 19:10:43] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:10:43] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2024-06-01 19:10:43] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:10:44] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-06-01 19:10:44] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
[2024-06-01 19:10:44] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
[2024-06-01 19:10:44] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 12/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 761/1323 variables, 562/1297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1323 variables, 1/1298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:10:44] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:10:44] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:10:44] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
[2024-06-01 19:10:44] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:10:44] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:10:45] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-06-01 19:10:45] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-06-01 19:10:45] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:10:45] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-06-01 19:10:45] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 0 ms to minimize.
[2024-06-01 19:10:45] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 0 ms to minimize.
[2024-06-01 19:10:45] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:10:45] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:10:45] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-06-01 19:10:45] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:10:45] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:10:46] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:10:46] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2024-06-01 19:10:46] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-06-01 19:10:46] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1323 variables, 20/1318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1323 variables, 0/1318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1323 variables, 0/1318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1323/1323 variables, and 1318 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3262 ms.
Refiners :[Domain max(s): 562/562 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 32/32 constraints]
After SMT, in 3620ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 293 ms.
Support contains 28 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 761/761 transitions.
Applied a total of 0 rules in 22 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 562/562 places, 761/761 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 761/761 transitions.
Applied a total of 0 rules in 18 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
[2024-06-01 19:10:46] [INFO ] Invariant cache hit.
[2024-06-01 19:10:47] [INFO ] Implicit Places using invariants in 291 ms returned []
[2024-06-01 19:10:47] [INFO ] Invariant cache hit.
[2024-06-01 19:10:47] [INFO ] Implicit Places using invariants and state equation in 695 ms returned []
Implicit Place search using SMT with State Equation took 988 ms to find 0 implicit places.
[2024-06-01 19:10:47] [INFO ] Redundant transitions in 63 ms returned []
Running 760 sub problems to find dead transitions.
[2024-06-01 19:10:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 561/561 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 2 (OVERLAPS) 1/562 variables, 161/722 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/562 variables, 1/723 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:11:06] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 2 ms to minimize.
[2024-06-01 19:11:07] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 3 ms to minimize.
[2024-06-01 19:11:07] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 2 ms to minimize.
[2024-06-01 19:11:07] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 3 ms to minimize.
[2024-06-01 19:11:07] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 3 ms to minimize.
[2024-06-01 19:11:07] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 3 ms to minimize.
[2024-06-01 19:11:08] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 3 ms to minimize.
[2024-06-01 19:11:08] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 3 ms to minimize.
[2024-06-01 19:11:08] [INFO ] Deduced a trap composed of 6 places in 174 ms of which 3 ms to minimize.
[2024-06-01 19:11:08] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 2 ms to minimize.
[2024-06-01 19:11:08] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 2 ms to minimize.
[2024-06-01 19:11:09] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 3 ms to minimize.
[2024-06-01 19:11:09] [INFO ] Deduced a trap composed of 7 places in 169 ms of which 3 ms to minimize.
[2024-06-01 19:11:09] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 3 ms to minimize.
[2024-06-01 19:11:09] [INFO ] Deduced a trap composed of 7 places in 169 ms of which 3 ms to minimize.
[2024-06-01 19:11:09] [INFO ] Deduced a trap composed of 7 places in 183 ms of which 4 ms to minimize.
[2024-06-01 19:11:09] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 2 ms to minimize.
[2024-06-01 19:11:10] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 3 ms to minimize.
[2024-06-01 19:11:10] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 2 ms to minimize.
[2024-06-01 19:11:10] [INFO ] Deduced a trap composed of 7 places in 169 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 20/743 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:11:10] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 3 ms to minimize.
[2024-06-01 19:11:10] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 3 ms to minimize.
[2024-06-01 19:11:11] [INFO ] Deduced a trap composed of 7 places in 174 ms of which 2 ms to minimize.
[2024-06-01 19:11:11] [INFO ] Deduced a trap composed of 7 places in 169 ms of which 2 ms to minimize.
[2024-06-01 19:11:11] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 3 ms to minimize.
[2024-06-01 19:11:11] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 3 ms to minimize.
[2024-06-01 19:11:11] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 3 ms to minimize.
[2024-06-01 19:11:12] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 3 ms to minimize.
[2024-06-01 19:11:12] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 2 ms to minimize.
[2024-06-01 19:11:12] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 2 ms to minimize.
[2024-06-01 19:11:12] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 3 ms to minimize.
[2024-06-01 19:11:12] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 3 ms to minimize.
[2024-06-01 19:11:12] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 3 ms to minimize.
[2024-06-01 19:11:13] [INFO ] Deduced a trap composed of 7 places in 187 ms of which 3 ms to minimize.
[2024-06-01 19:11:13] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 3 ms to minimize.
[2024-06-01 19:11:13] [INFO ] Deduced a trap composed of 7 places in 170 ms of which 2 ms to minimize.
[2024-06-01 19:11:13] [INFO ] Deduced a trap composed of 7 places in 170 ms of which 3 ms to minimize.
[2024-06-01 19:11:13] [INFO ] Deduced a trap composed of 11 places in 173 ms of which 2 ms to minimize.
[2024-06-01 19:11:14] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 3 ms to minimize.
[2024-06-01 19:11:14] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 20/763 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:11:14] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 3 ms to minimize.
[2024-06-01 19:11:14] [INFO ] Deduced a trap composed of 16 places in 172 ms of which 2 ms to minimize.
[2024-06-01 19:11:14] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 3 ms to minimize.
[2024-06-01 19:11:14] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 1 ms to minimize.
[2024-06-01 19:11:15] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 2 ms to minimize.
[2024-06-01 19:11:15] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-06-01 19:11:15] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 2 ms to minimize.
[2024-06-01 19:11:15] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-06-01 19:11:15] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 2 ms to minimize.
[2024-06-01 19:11:15] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
[2024-06-01 19:11:15] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-06-01 19:11:15] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 2 ms to minimize.
[2024-06-01 19:11:16] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 2 ms to minimize.
[2024-06-01 19:11:16] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:11:16] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2024-06-01 19:11:16] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:11:16] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 0 ms to minimize.
[2024-06-01 19:11:16] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:11:16] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 0 ms to minimize.
[2024-06-01 19:11:16] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 20/783 constraints. Problems are: Problem set: 0 solved, 760 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 562/1323 variables, and 783 constraints, problems are : Problem set: 0 solved, 760 unsolved in 30019 ms.
Refiners :[Domain max(s): 562/562 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 0/562 constraints, PredecessorRefiner: 760/760 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 760 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 561/561 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 2 (OVERLAPS) 1/562 variables, 161/722 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/562 variables, 1/723 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 60/783 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:11:24] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-06-01 19:11:25] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 3 ms to minimize.
[2024-06-01 19:11:25] [INFO ] Deduced a trap composed of 12 places in 174 ms of which 2 ms to minimize.
[2024-06-01 19:11:25] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 3 ms to minimize.
[2024-06-01 19:11:25] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:11:25] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:11:25] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 0 ms to minimize.
[2024-06-01 19:11:26] [INFO ] Deduced a trap composed of 147 places in 172 ms of which 3 ms to minimize.
[2024-06-01 19:11:26] [INFO ] Deduced a trap composed of 145 places in 167 ms of which 2 ms to minimize.
[2024-06-01 19:11:26] [INFO ] Deduced a trap composed of 149 places in 156 ms of which 2 ms to minimize.
[2024-06-01 19:11:26] [INFO ] Deduced a trap composed of 141 places in 162 ms of which 3 ms to minimize.
[2024-06-01 19:11:26] [INFO ] Deduced a trap composed of 146 places in 157 ms of which 3 ms to minimize.
[2024-06-01 19:11:27] [INFO ] Deduced a trap composed of 118 places in 167 ms of which 2 ms to minimize.
[2024-06-01 19:11:27] [INFO ] Deduced a trap composed of 11 places in 175 ms of which 3 ms to minimize.
[2024-06-01 19:11:27] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-06-01 19:11:27] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 3 ms to minimize.
[2024-06-01 19:11:27] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 2 ms to minimize.
[2024-06-01 19:11:27] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 2 ms to minimize.
[2024-06-01 19:11:27] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:11:28] [INFO ] Deduced a trap composed of 11 places in 173 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 20/803 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:11:28] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 3 ms to minimize.
[2024-06-01 19:11:28] [INFO ] Deduced a trap composed of 14 places in 171 ms of which 2 ms to minimize.
[2024-06-01 19:11:29] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:11:29] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 0 ms to minimize.
[2024-06-01 19:11:29] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 0 ms to minimize.
[2024-06-01 19:11:29] [INFO ] Deduced a trap composed of 7 places in 174 ms of which 3 ms to minimize.
[2024-06-01 19:11:29] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 2 ms to minimize.
[2024-06-01 19:11:30] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 3 ms to minimize.
[2024-06-01 19:11:30] [INFO ] Deduced a trap composed of 19 places in 156 ms of which 2 ms to minimize.
[2024-06-01 19:11:30] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-01 19:11:30] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 2 ms to minimize.
[2024-06-01 19:11:30] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 3 ms to minimize.
[2024-06-01 19:11:30] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 0 ms to minimize.
[2024-06-01 19:11:31] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 3 ms to minimize.
[2024-06-01 19:11:31] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 2 ms to minimize.
[2024-06-01 19:11:31] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 2 ms to minimize.
[2024-06-01 19:11:31] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 2 ms to minimize.
[2024-06-01 19:11:31] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 2 ms to minimize.
[2024-06-01 19:11:31] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 2 ms to minimize.
[2024-06-01 19:11:31] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 20/823 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:11:32] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-06-01 19:11:32] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
[2024-06-01 19:11:32] [INFO ] Deduced a trap composed of 17 places in 176 ms of which 2 ms to minimize.
[2024-06-01 19:11:32] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-06-01 19:11:32] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-06-01 19:11:32] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:11:32] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 0 ms to minimize.
[2024-06-01 19:11:33] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 0 ms to minimize.
[2024-06-01 19:11:33] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 2 ms to minimize.
[2024-06-01 19:11:33] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-06-01 19:11:33] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 0 ms to minimize.
[2024-06-01 19:11:33] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 0 ms to minimize.
[2024-06-01 19:11:33] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:11:33] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:11:33] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:11:33] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 2 ms to minimize.
[2024-06-01 19:11:34] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 4 ms to minimize.
[2024-06-01 19:11:34] [INFO ] Deduced a trap composed of 20 places in 170 ms of which 3 ms to minimize.
[2024-06-01 19:11:34] [INFO ] Deduced a trap composed of 15 places in 177 ms of which 3 ms to minimize.
[2024-06-01 19:11:34] [INFO ] Deduced a trap composed of 19 places in 178 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/562 variables, 20/843 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:11:35] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-06-01 19:11:35] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 0 ms to minimize.
[2024-06-01 19:11:35] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 2 ms to minimize.
[2024-06-01 19:11:35] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 2 ms to minimize.
[2024-06-01 19:11:36] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 2 ms to minimize.
[2024-06-01 19:11:36] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 2 ms to minimize.
[2024-06-01 19:11:36] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 3 ms to minimize.
[2024-06-01 19:11:36] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 3 ms to minimize.
[2024-06-01 19:11:36] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 3 ms to minimize.
[2024-06-01 19:11:36] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 2 ms to minimize.
[2024-06-01 19:11:36] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 2 ms to minimize.
[2024-06-01 19:11:37] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 3 ms to minimize.
[2024-06-01 19:11:37] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 2 ms to minimize.
[2024-06-01 19:11:37] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 2 ms to minimize.
[2024-06-01 19:11:37] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 3 ms to minimize.
[2024-06-01 19:11:37] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 2 ms to minimize.
[2024-06-01 19:11:37] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 2 ms to minimize.
[2024-06-01 19:11:37] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 2 ms to minimize.
[2024-06-01 19:11:38] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 2 ms to minimize.
[2024-06-01 19:11:38] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/562 variables, 20/863 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:11:38] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 2 ms to minimize.
[2024-06-01 19:11:39] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 3 ms to minimize.
[2024-06-01 19:11:39] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 2 ms to minimize.
[2024-06-01 19:11:39] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 2 ms to minimize.
[2024-06-01 19:11:39] [INFO ] Deduced a trap composed of 27 places in 139 ms of which 2 ms to minimize.
[2024-06-01 19:11:39] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 3 ms to minimize.
[2024-06-01 19:11:40] [INFO ] Deduced a trap composed of 27 places in 139 ms of which 2 ms to minimize.
[2024-06-01 19:11:40] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 2 ms to minimize.
[2024-06-01 19:11:40] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 2 ms to minimize.
[2024-06-01 19:11:40] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 2 ms to minimize.
[2024-06-01 19:11:40] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 2 ms to minimize.
[2024-06-01 19:11:40] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 2 ms to minimize.
[2024-06-01 19:11:41] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 2 ms to minimize.
[2024-06-01 19:11:41] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 2 ms to minimize.
[2024-06-01 19:11:41] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 2 ms to minimize.
[2024-06-01 19:11:41] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 2 ms to minimize.
[2024-06-01 19:11:41] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 2 ms to minimize.
[2024-06-01 19:11:41] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 2 ms to minimize.
[2024-06-01 19:11:41] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 3 ms to minimize.
[2024-06-01 19:11:42] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/562 variables, 20/883 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:11:42] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 0 ms to minimize.
[2024-06-01 19:11:43] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
[2024-06-01 19:11:43] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-06-01 19:11:43] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 2 ms to minimize.
[2024-06-01 19:11:43] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 2 ms to minimize.
[2024-06-01 19:11:43] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 2 ms to minimize.
[2024-06-01 19:11:43] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-06-01 19:11:44] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 2 ms to minimize.
[2024-06-01 19:11:44] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 2 ms to minimize.
[2024-06-01 19:11:44] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 19:11:44] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-06-01 19:11:44] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-06-01 19:11:44] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 2 ms to minimize.
[2024-06-01 19:11:44] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 2 ms to minimize.
[2024-06-01 19:11:44] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2024-06-01 19:11:44] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 1 ms to minimize.
[2024-06-01 19:11:45] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 2 ms to minimize.
[2024-06-01 19:11:45] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-06-01 19:11:45] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 2 ms to minimize.
[2024-06-01 19:11:45] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/562 variables, 20/903 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:11:45] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 3 ms to minimize.
[2024-06-01 19:11:46] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 0 ms to minimize.
[2024-06-01 19:11:46] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:11:46] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2024-06-01 19:11:46] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-06-01 19:11:46] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-06-01 19:11:46] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:11:46] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 0 ms to minimize.
[2024-06-01 19:11:46] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:11:47] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 1 ms to minimize.
[2024-06-01 19:11:47] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 2 ms to minimize.
[2024-06-01 19:11:47] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 1 ms to minimize.
[2024-06-01 19:11:47] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-06-01 19:11:48] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 2 ms to minimize.
[2024-06-01 19:11:48] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 2 ms to minimize.
SMT process timed out in 60409ms, After SMT, problems are : Problem set: 0 solved, 760 unsolved
Search for dead transitions found 0 dead transitions in 60418ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61495 ms. Remains : 562/562 places, 761/761 transitions.
[2024-06-01 19:11:48] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-06-01 19:11:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 562 places, 761 transitions and 3828 arcs took 9 ms.
[2024-06-01 19:11:48] [INFO ] Flatten gal took : 123 ms
Total runtime 144335 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 : ShieldRVs-PT-040A-ReachabilityCardinality-2024-05

BK_STOP 1717269108805

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2024
rfs formula name ShieldRVs-PT-040A-ReachabilityCardinality-2024-05
rfs formula type AG
rfs formula formula --invariant=/tmp/2043/inv_0_
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="ShieldRVs-PT-040A"
export BK_EXAMINATION="ReachabilityCardinality"
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 ShieldRVs-PT-040A, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r528-tall-171683762000838"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-040A.tgz
mv ShieldRVs-PT-040A execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;