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.r530-tall-171683779800658.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 ShieldRVt-PT-100B, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r530-tall-171683779800658
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K 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 3.9K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 16:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 21:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 11 21:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 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 1.3M 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

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1717228614185

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldRVt-PT-100B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:56:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-01 07:56:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:56:55] [INFO ] Load time of PNML (sax parser for PT used): 234 ms
[2024-06-01 07:56:55] [INFO ] Transformed 5003 places.
[2024-06-01 07:56:55] [INFO ] Transformed 5003 transitions.
[2024-06-01 07:56:55] [INFO ] Found NUPN structural information;
[2024-06-01 07:56:55] [INFO ] Parsed PT model containing 5003 places and 5003 transitions and 11806 arcs in 477 ms.
Structural test allowed to assert that 2001 places are NOT stable. Took 32 ms.
RANDOM walk for 40000 steps (8 resets) in 7693 ms. (5 steps per ms) remains 2623/3002 properties
BEST_FIRST walk for 124 steps (8 resets) in 29 ms. (4 steps per ms) remains 2623/2623 properties
BEST_FIRST walk for 124 steps (8 resets) in 106 ms. (1 steps per ms) remains 2623/2623 properties
BEST_FIRST walk for 123 steps (8 resets) in 97 ms. (1 steps per ms) remains 2623/2623 properties
BEST_FIRST walk for 123 steps (8 resets) in 26 ms. (4 steps per ms) remains 2623/2623 properties
BEST_FIRST walk for 123 steps (8 resets) in 40 ms. (3 steps per ms) remains 2623/2623 properties
BEST_FIRST walk for 122 steps (8 resets) in 19 ms. (6 steps per ms) remains 2623/2623 properties
BEST_FIRST walk for 124 steps (8 resets) in 15 ms. (7 steps per ms) remains 2623/2623 properties
BEST_FIRST walk for 124 steps (8 resets) in 30 ms. (4 steps per ms) remains 2623/2623 properties
BEST_FIRST walk for 121 steps (8 resets) in 31 ms. (3 steps per ms) remains 2623/2623 properties
BEST_FIRST walk for 123 steps (8 resets) in 14 ms. (8 steps per ms) remains 2623/2623 properties
BEST_FIRST walk for 123 steps (8 resets) in 16 ms. (7 steps per ms) remains 2623/2623 properties
BEST_FIRST walk for 123 steps (8 resets) in 14 ms. (8 steps per ms) remains 2623/2623 properties
BEST_FIRST walk for 122 steps (8 resets) in 11 ms. (10 steps per ms) remains 2623/2623 properties
BEST_FIRST walk for 123 steps (8 resets) in 15 ms. (7 steps per ms) remains 2623/2623 properties
BEST_FIRST walk for 123 steps (8 resets) in 12 ms. (9 steps per ms) remains 2623/2623 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 2623/2623 properties
BEST_FIRST walk for 122 steps (8 resets) in 17 ms. (6 steps per ms) remains 2623/2623 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 2623/2623 properties
BEST_FIRST walk for 123 steps (8 resets) in 19 ms. (6 steps per ms) remains 2623/2623 properties
BEST_FIRST walk for 123 steps (8 resets) in 12 ms. (9 steps per ms) remains 2623/2623 properties
BEST_FIRST walk for 123 steps (8 resets) in 9 ms. (12 steps per ms) remains 2623/2623 properties
BEST_FIRST walk for 123 steps (8 resets) in 15 ms. (7 steps per ms) remains 2623/2623 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 2623/2623 properties
BEST_FIRST walk for 123 steps (8 resets) in 11 ms. (10 steps per ms) remains 2623/2623 properties
BEST_FIRST walk for 123 steps (8 resets) in 12 ms. (9 steps per ms) remains 2623/2623 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 2623/2623 properties
BEST_FIRST walk for 123 steps (8 resets) in 10 ms. (11 steps per ms) remains 2623/2623 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 2623/2623 properties
BEST_FIRST walk for 122 steps (8 resets) in 30 ms. (3 steps per ms) remains 2623/2623 properties
BEST_FIRST walk for 123 steps (8 resets) in 12 ms. (9 steps per ms) remains 2623/2623 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 2623/2623 properties
BEST_FIRST walk for 123 steps (8 resets) in 11 ms. (10 steps per ms) remains 2623/2623 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 2623/2623 properties
BEST_FIRST walk for 123 steps (8 resets) in 16 ms. (7 steps per ms) remains 2623/2623 properties
BEST_FIRST walk for 123 steps (8 resets) in 11 ms. (10 steps per ms) remains 2623/2623 properties
BEST_FIRST walk for 123 steps (8 resets) in 13 ms. (8 steps per ms) remains 2623/2623 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 2623/2623 properties
BEST_FIRST walk for 122 steps (8 resets) in 10 ms. (11 steps per ms) remains 2623/2623 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 2623/2623 properties
BEST_FIRST walk for 122 steps (8 resets) in 10 ms. (11 steps per ms) remains 2623/2623 properties
BEST_FIRST walk for 123 steps (8 resets) in 13 ms. (8 steps per ms) remains 2623/2623 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 2623/2623 properties
BEST_FIRST walk for 123 steps (8 resets) in 11 ms. (10 steps per ms) remains 2623/2623 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 2623/2623 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 2623/2623 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 2623/2623 properties
BEST_FIRST walk for 123 steps (8 resets) in 10 ms. (11 steps per ms) remains 2623/2623 properties
BEST_FIRST walk for 122 steps (8 resets) in 9 ms. (12 steps per ms) remains 2623/2623 properties
BEST_FIRST walk for 122 steps (8 resets) in 8 ms. (13 steps per ms) remains 2623/2623 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 2623/2623 properties
// Phase 1: matrix 5003 rows 5003 cols
[2024-06-01 07:56:58] [INFO ] Computed 401 invariants in 93 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/2623 variables, 2623/2623 constraints. Problems are: Problem set: 0 solved, 2623 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2623/10006 variables, and 2623 constraints, problems are : Problem set: 0 solved, 2623 unsolved in 5147 ms.
Refiners :[Domain max(s): 2623/5003 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/5003 constraints, PredecessorRefiner: 2623/2623 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2623 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2623 variables, 2623/2623 constraints. Problems are: Problem set: 0 solved, 2623 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2623/10006 variables, and 2623 constraints, problems are : Problem set: 0 solved, 2623 unsolved in 5040 ms.
Refiners :[Domain max(s): 2623/5003 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/5003 constraints, PredecessorRefiner: 0/2623 constraints, Known Traps: 0/0 constraints]
After SMT, in 11681ms problems are : Problem set: 0 solved, 2623 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2623 out of 5003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5003/5003 places, 5003/5003 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 903 transitions
Trivial Post-agglo rules discarded 903 transitions
Performed 903 trivial Post agglomeration. Transition count delta: 903
Iterating post reduction 0 with 903 rules applied. Total rules applied 903 place count 5003 transition count 4100
Reduce places removed 903 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 905 rules applied. Total rules applied 1808 place count 4100 transition count 4098
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1809 place count 4099 transition count 4098
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 52 Pre rules applied. Total rules applied 1809 place count 4099 transition count 4046
Deduced a syphon composed of 52 places in 29 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 1913 place count 4047 transition count 4046
Discarding 85 places :
Symmetric choice reduction at 3 with 85 rule applications. Total rules 1998 place count 3962 transition count 3961
Iterating global reduction 3 with 85 rules applied. Total rules applied 2083 place count 3962 transition count 3961
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 2083 place count 3962 transition count 3926
Deduced a syphon composed of 35 places in 28 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 2153 place count 3927 transition count 3926
Performed 815 Post agglomeration using F-continuation condition.Transition count delta: 815
Deduced a syphon composed of 815 places in 24 ms
Reduce places removed 815 places and 0 transitions.
Iterating global reduction 3 with 1630 rules applied. Total rules applied 3783 place count 3112 transition count 3111
Renaming transitions due to excessive name length > 1024 char.
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 35 places in 22 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 3853 place count 3077 transition count 3142
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3854 place count 3077 transition count 3141
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3855 place count 3077 transition count 3140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3856 place count 3076 transition count 3140
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 3857 place count 3076 transition count 3139
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3858 place count 3075 transition count 3138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3859 place count 3074 transition count 3138
Applied a total of 3859 rules in 1205 ms. Remains 3074 /5003 variables (removed 1929) and now considering 3138/5003 (removed 1865) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1217 ms. Remains : 3074/5003 places, 3138/5003 transitions.
RANDOM walk for 653245 steps (170 resets) in 120004 ms. (5 steps per ms) remains 2311/2623 properties
BEST_FIRST walk for 4003 steps (8 resets) in 107 ms. (37 steps per ms) remains 2311/2311 properties
BEST_FIRST walk for 4004 steps (8 resets) in 124 ms. (32 steps per ms) remains 2311/2311 properties
BEST_FIRST walk for 4004 steps (8 resets) in 102 ms. (38 steps per ms) remains 2311/2311 properties
BEST_FIRST walk for 4003 steps (8 resets) in 114 ms. (34 steps per ms) remains 2311/2311 properties
BEST_FIRST walk for 4004 steps (8 resets) in 119 ms. (33 steps per ms) remains 2311/2311 properties
BEST_FIRST walk for 4004 steps (8 resets) in 120 ms. (33 steps per ms) remains 2311/2311 properties
BEST_FIRST walk for 4003 steps (8 resets) in 114 ms. (34 steps per ms) remains 2311/2311 properties
BEST_FIRST walk for 4003 steps (8 resets) in 115 ms. (34 steps per ms) remains 2311/2311 properties
BEST_FIRST walk for 4004 steps (8 resets) in 127 ms. (31 steps per ms) remains 2311/2311 properties
BEST_FIRST walk for 4004 steps (8 resets) in 117 ms. (33 steps per ms) remains 2311/2311 properties
BEST_FIRST walk for 4004 steps (8 resets) in 108 ms. (36 steps per ms) remains 2311/2311 properties
BEST_FIRST walk for 4004 steps (8 resets) in 115 ms. (34 steps per ms) remains 2311/2311 properties
BEST_FIRST walk for 4003 steps (8 resets) in 124 ms. (32 steps per ms) remains 2311/2311 properties
BEST_FIRST walk for 4004 steps (8 resets) in 102 ms. (38 steps per ms) remains 2311/2311 properties
BEST_FIRST walk for 4002 steps (8 resets) in 123 ms. (32 steps per ms) remains 2311/2311 properties
BEST_FIRST walk for 4003 steps (8 resets) in 127 ms. (31 steps per ms) remains 2311/2311 properties
BEST_FIRST walk for 4004 steps (8 resets) in 128 ms. (31 steps per ms) remains 2311/2311 properties
BEST_FIRST walk for 4003 steps (8 resets) in 121 ms. (32 steps per ms) remains 2311/2311 properties
BEST_FIRST walk for 4002 steps (8 resets) in 97 ms. (40 steps per ms) remains 2311/2311 properties
BEST_FIRST walk for 4003 steps (8 resets) in 125 ms. (31 steps per ms) remains 2311/2311 properties
BEST_FIRST walk for 4003 steps (8 resets) in 122 ms. (32 steps per ms) remains 2311/2311 properties
BEST_FIRST walk for 4003 steps (8 resets) in 112 ms. (35 steps per ms) remains 2311/2311 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 2311/2311 properties
BEST_FIRST walk for 4002 steps (8 resets) in 114 ms. (34 steps per ms) remains 2311/2311 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 2311/2311 properties
BEST_FIRST walk for 4004 steps (8 resets) in 105 ms. (37 steps per ms) remains 2311/2311 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 2311/2311 properties
BEST_FIRST walk for 4004 steps (8 resets) in 115 ms. (34 steps per ms) remains 2311/2311 properties
BEST_FIRST walk for 4004 steps (8 resets) in 101 ms. (39 steps per ms) remains 2311/2311 properties
BEST_FIRST walk for 4004 steps (8 resets) in 116 ms. (34 steps per ms) remains 2311/2311 properties
BEST_FIRST walk for 4004 steps (8 resets) in 115 ms. (34 steps per ms) remains 2311/2311 properties
BEST_FIRST walk for 4004 steps (8 resets) in 104 ms. (38 steps per ms) remains 2311/2311 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 2311/2311 properties
BEST_FIRST walk for 4004 steps (8 resets) in 127 ms. (31 steps per ms) remains 2311/2311 properties
BEST_FIRST walk for 4004 steps (8 resets) in 119 ms. (33 steps per ms) remains 2311/2311 properties
BEST_FIRST walk for 4004 steps (8 resets) in 131 ms. (30 steps per ms) remains 2311/2311 properties
BEST_FIRST walk for 4004 steps (8 resets) in 106 ms. (37 steps per ms) remains 2311/2311 properties
BEST_FIRST walk for 4004 steps (8 resets) in 101 ms. (39 steps per ms) remains 2311/2311 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 2311/2311 properties
BEST_FIRST walk for 4003 steps (8 resets) in 108 ms. (36 steps per ms) remains 2311/2311 properties
BEST_FIRST walk for 4004 steps (8 resets) in 115 ms. (34 steps per ms) remains 2311/2311 properties
BEST_FIRST walk for 4003 steps (8 resets) in 112 ms. (35 steps per ms) remains 2311/2311 properties
BEST_FIRST walk for 4004 steps (8 resets) in 126 ms. (31 steps per ms) remains 2311/2311 properties
BEST_FIRST walk for 4003 steps (8 resets) in 109 ms. (36 steps per ms) remains 2311/2311 properties
BEST_FIRST walk for 4003 steps (8 resets) in 119 ms. (33 steps per ms) remains 2311/2311 properties
BEST_FIRST walk for 4003 steps (8 resets) in 121 ms. (32 steps per ms) remains 2311/2311 properties
BEST_FIRST walk for 4003 steps (8 resets) in 120 ms. (33 steps per ms) remains 2311/2311 properties
BEST_FIRST walk for 4003 steps (8 resets) in 126 ms. (31 steps per ms) remains 2311/2311 properties
BEST_FIRST walk for 4004 steps (8 resets) in 116 ms. (34 steps per ms) remains 2311/2311 properties
BEST_FIRST walk for 4003 steps (8 resets) in 103 ms. (38 steps per ms) remains 2311/2311 properties
// Phase 1: matrix 3138 rows 3074 cols
[2024-06-01 07:57:43] [INFO ] Computed 400 invariants in 16 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2311/6212 variables, and 0 constraints, problems are : Problem set: 0 solved, 2311 unsolved in 45036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/400 constraints, State Equation: 0/3074 constraints, PredecessorRefiner: 2311/2311 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2311 unsolved
(s448 1timeout
^^^^^^^^
(error "Invalid token: 1timeout")
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2311/6212 variables, and 0 constraints, problems are : Problem set: 0 solved, 2311 unsolved in 45039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/400 constraints, State Equation: 0/3074 constraints, PredecessorRefiner: 0/2311 constraints, Known Traps: 0/0 constraints]
After SMT, in 90966ms problems are : Problem set: 0 solved, 2311 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2311 out of 3074 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3074/3074 places, 3138/3138 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 84 place count 3074 transition count 3054
Reduce places removed 84 places and 0 transitions.
Iterating post reduction 1 with 84 rules applied. Total rules applied 168 place count 2990 transition count 3054
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 168 place count 2990 transition count 3011
Deduced a syphon composed of 43 places in 16 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 254 place count 2947 transition count 3011
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 278 place count 2923 transition count 2987
Iterating global reduction 2 with 24 rules applied. Total rules applied 302 place count 2923 transition count 2987
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 302 place count 2923 transition count 2963
Deduced a syphon composed of 24 places in 24 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 350 place count 2899 transition count 2963
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 15 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 2 with 122 rules applied. Total rules applied 472 place count 2838 transition count 2902
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 32 places in 15 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 536 place count 2806 transition count 2930
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 537 place count 2806 transition count 2929
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 538 place count 2805 transition count 2929
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 539 place count 2805 transition count 2929
Applied a total of 539 rules in 354 ms. Remains 2805 /3074 variables (removed 269) and now considering 2929/3138 (removed 209) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 354 ms. Remains : 2805/3074 places, 2929/3138 transitions.
RANDOM walk for 888481 steps (209 resets) in 120004 ms. (7 steps per ms) remains 1981/2311 properties
BEST_FIRST walk for 4004 steps (8 resets) in 122 ms. (32 steps per ms) remains 1981/1981 properties
BEST_FIRST walk for 4004 steps (8 resets) in 87 ms. (45 steps per ms) remains 1981/1981 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 1981/1981 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 1981/1981 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 1981/1981 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 1981/1981 properties
BEST_FIRST walk for 4003 steps (8 resets) in 81 ms. (48 steps per ms) remains 1981/1981 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 1981/1981 properties
BEST_FIRST walk for 4003 steps (8 resets) in 80 ms. (49 steps per ms) remains 1981/1981 properties
BEST_FIRST walk for 4003 steps (8 resets) in 85 ms. (46 steps per ms) remains 1981/1981 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 1981/1981 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 1981/1981 properties
BEST_FIRST walk for 4003 steps (8 resets) in 119 ms. (33 steps per ms) remains 1981/1981 properties
BEST_FIRST walk for 4002 steps (8 resets) in 117 ms. (33 steps per ms) remains 1981/1981 properties
BEST_FIRST walk for 4004 steps (8 resets) in 126 ms. (31 steps per ms) remains 1981/1981 properties
BEST_FIRST walk for 4004 steps (8 resets) in 107 ms. (37 steps per ms) remains 1981/1981 properties
BEST_FIRST walk for 4004 steps (8 resets) in 133 ms. (29 steps per ms) remains 1981/1981 properties
BEST_FIRST walk for 4002 steps (8 resets) in 118 ms. (33 steps per ms) remains 1981/1981 properties
BEST_FIRST walk for 4004 steps (8 resets) in 133 ms. (29 steps per ms) remains 1981/1981 properties
BEST_FIRST walk for 4004 steps (8 resets) in 139 ms. (28 steps per ms) remains 1981/1981 properties
BEST_FIRST walk for 4004 steps (8 resets) in 128 ms. (31 steps per ms) remains 1981/1981 properties
BEST_FIRST walk for 4004 steps (8 resets) in 126 ms. (31 steps per ms) remains 1981/1981 properties
BEST_FIRST walk for 4003 steps (8 resets) in 100 ms. (39 steps per ms) remains 1981/1981 properties
BEST_FIRST walk for 4003 steps (8 resets) in 83 ms. (47 steps per ms) remains 1981/1981 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 1981/1981 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 1981/1981 properties
BEST_FIRST walk for 4003 steps (8 resets) in 85 ms. (46 steps per ms) remains 1981/1981 properties
BEST_FIRST walk for 4003 steps (8 resets) in 88 ms. (44 steps per ms) remains 1981/1981 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 1981/1981 properties
BEST_FIRST walk for 4003 steps (8 resets) in 89 ms. (44 steps per ms) remains 1981/1981 properties
BEST_FIRST walk for 4004 steps (8 resets) in 87 ms. (45 steps per ms) remains 1981/1981 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 1981/1981 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 1981/1981 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 1981/1981 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 1981/1981 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 1981/1981 properties
BEST_FIRST walk for 4003 steps (8 resets) in 89 ms. (44 steps per ms) remains 1981/1981 properties
BEST_FIRST walk for 4003 steps (8 resets) in 89 ms. (44 steps per ms) remains 1981/1981 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 1981/1981 properties
BEST_FIRST walk for 4004 steps (8 resets) in 87 ms. (45 steps per ms) remains 1981/1981 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 1981/1981 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 1981/1981 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 1981/1981 properties
BEST_FIRST walk for 4002 steps (8 resets) in 86 ms. (46 steps per ms) remains 1981/1981 properties
BEST_FIRST walk for 4003 steps (8 resets) in 87 ms. (45 steps per ms) remains 1981/1981 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 1981/1981 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 1981/1981 properties
BEST_FIRST walk for 4003 steps (8 resets) in 83 ms. (47 steps per ms) remains 1981/1981 properties
BEST_FIRST walk for 4003 steps (8 resets) in 90 ms. (43 steps per ms) remains 1981/1981 properties
BEST_FIRST walk for 4003 steps (8 resets) in 88 ms. (44 steps per ms) remains 1981/1981 properties
// Phase 1: matrix 2929 rows 2805 cols
[2024-06-01 07:59:46] [INFO ] Computed 400 invariants in 9 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1981/5734 variables, and 0 constraints, problems are : Problem set: 0 solved, 1981 unsolved in 75031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/400 constraints, State Equation: 0/2805 constraints, PredecessorRefiner: 1981/1981 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1981 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1981 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1981 unsolved
At refinement iteration 1 (OVERLAPS) 418/2399 variables, 283/283 constraints. Problems are: Problem set: 0 solved, 1981 unsolved
[2024-06-01 08:01:59] [INFO ] Deduced a trap composed of 52 places in 996 ms of which 100 ms to minimize.
[2024-06-01 08:02:01] [INFO ] Deduced a trap composed of 18 places in 258 ms of which 5 ms to minimize.
[2024-06-01 08:02:01] [INFO ] Deduced a trap composed of 18 places in 257 ms of which 4 ms to minimize.
[2024-06-01 08:02:02] [INFO ] Deduced a trap composed of 18 places in 237 ms of which 4 ms to minimize.
[2024-06-01 08:02:03] [INFO ] Deduced a trap composed of 20 places in 238 ms of which 4 ms to minimize.
[2024-06-01 08:02:05] [INFO ] Deduced a trap composed of 24 places in 248 ms of which 4 ms to minimize.
[2024-06-01 08:02:05] [INFO ] Deduced a trap composed of 18 places in 234 ms of which 5 ms to minimize.
[2024-06-01 08:02:06] [INFO ] Deduced a trap composed of 28 places in 241 ms of which 4 ms to minimize.
[2024-06-01 08:02:06] [INFO ] Deduced a trap composed of 28 places in 248 ms of which 4 ms to minimize.
[2024-06-01 08:02:08] [INFO ] Deduced a trap composed of 18 places in 252 ms of which 5 ms to minimize.
[2024-06-01 08:02:09] [INFO ] Deduced a trap composed of 28 places in 251 ms of which 4 ms to minimize.
[2024-06-01 08:02:09] [INFO ] Deduced a trap composed of 28 places in 246 ms of which 4 ms to minimize.
[2024-06-01 08:02:10] [INFO ] Deduced a trap composed of 32 places in 251 ms of which 5 ms to minimize.
[2024-06-01 08:02:10] [INFO ] Deduced a trap composed of 30 places in 254 ms of which 4 ms to minimize.
[2024-06-01 08:02:13] [INFO ] Deduced a trap composed of 38 places in 242 ms of which 4 ms to minimize.
[2024-06-01 08:02:13] [INFO ] Deduced a trap composed of 28 places in 238 ms of which 4 ms to minimize.
[2024-06-01 08:02:14] [INFO ] Deduced a trap composed of 42 places in 243 ms of which 4 ms to minimize.
[2024-06-01 08:02:14] [INFO ] Deduced a trap composed of 38 places in 241 ms of which 4 ms to minimize.
[2024-06-01 08:02:16] [INFO ] Deduced a trap composed of 18 places in 246 ms of which 5 ms to minimize.
[2024-06-01 08:02:16] [INFO ] Deduced a trap composed of 24 places in 245 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2399 variables, 20/303 constraints. Problems are: Problem set: 0 solved, 1981 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2399/5734 variables, and 303 constraints, problems are : Problem set: 0 solved, 1981 unsolved in 75040 ms.
Refiners :[Positive P Invariants (semi-flows): 283/400 constraints, State Equation: 0/2805 constraints, PredecessorRefiner: 0/1981 constraints, Known Traps: 20/20 constraints]
After SMT, in 150578ms problems are : Problem set: 0 solved, 1981 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1981 out of 2805 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2805/2805 places, 2929/2929 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 82 place count 2805 transition count 2847
Reduce places removed 82 places and 0 transitions.
Iterating post reduction 1 with 82 rules applied. Total rules applied 164 place count 2723 transition count 2847
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 164 place count 2723 transition count 2799
Deduced a syphon composed of 48 places in 12 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 260 place count 2675 transition count 2799
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 282 place count 2653 transition count 2777
Iterating global reduction 2 with 22 rules applied. Total rules applied 304 place count 2653 transition count 2777
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 304 place count 2653 transition count 2755
Deduced a syphon composed of 22 places in 13 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 348 place count 2631 transition count 2755
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 11 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 488 place count 2561 transition count 2685
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 29 places in 12 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 546 place count 2532 transition count 2709
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 547 place count 2532 transition count 2708
Free-agglomeration rule applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 557 place count 2532 transition count 2698
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 567 place count 2522 transition count 2698
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 570 place count 2522 transition count 2695
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 572 place count 2522 transition count 2695
Applied a total of 572 rules in 316 ms. Remains 2522 /2805 variables (removed 283) and now considering 2695/2929 (removed 234) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 316 ms. Remains : 2522/2805 places, 2695/2929 transitions.
RANDOM walk for 990003 steps (249 resets) in 120004 ms. (8 steps per ms) remains 1980/1981 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4003 steps (8 resets) in 100 ms. (39 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4002 steps (8 resets) in 132 ms. (30 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4003 steps (8 resets) in 138 ms. (28 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4004 steps (8 resets) in 135 ms. (29 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4004 steps (8 resets) in 129 ms. (30 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4004 steps (8 resets) in 123 ms. (32 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4004 steps (8 resets) in 120 ms. (33 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4003 steps (8 resets) in 162 ms. (24 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4003 steps (8 resets) in 120 ms. (33 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4003 steps (8 resets) in 148 ms. (26 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4004 steps (8 resets) in 117 ms. (33 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4004 steps (8 resets) in 161 ms. (24 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4003 steps (8 resets) in 124 ms. (32 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4003 steps (8 resets) in 138 ms. (28 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4004 steps (8 resets) in 153 ms. (26 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4004 steps (8 resets) in 147 ms. (27 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4004 steps (8 resets) in 150 ms. (26 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4004 steps (8 resets) in 120 ms. (33 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4004 steps (8 resets) in 162 ms. (24 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4003 steps (8 resets) in 151 ms. (26 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4004 steps (8 resets) in 143 ms. (27 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4003 steps (8 resets) in 156 ms. (25 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4003 steps (8 resets) in 119 ms. (33 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4004 steps (8 resets) in 116 ms. (34 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4002 steps (8 resets) in 151 ms. (26 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4003 steps (8 resets) in 116 ms. (34 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4003 steps (8 resets) in 149 ms. (26 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4003 steps (8 resets) in 143 ms. (27 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4004 steps (8 resets) in 134 ms. (29 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4003 steps (8 resets) in 190 ms. (20 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4004 steps (8 resets) in 140 ms. (28 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4003 steps (8 resets) in 143 ms. (27 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4004 steps (8 resets) in 120 ms. (33 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4004 steps (8 resets) in 147 ms. (27 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4003 steps (8 resets) in 103 ms. (38 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4004 steps (8 resets) in 153 ms. (26 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4002 steps (8 resets) in 160 ms. (24 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4004 steps (8 resets) in 119 ms. (33 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4004 steps (8 resets) in 150 ms. (26 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4004 steps (8 resets) in 121 ms. (32 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4004 steps (8 resets) in 128 ms. (31 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4003 steps (8 resets) in 144 ms. (27 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4004 steps (8 resets) in 198 ms. (20 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4004 steps (8 resets) in 169 ms. (23 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4003 steps (8 resets) in 154 ms. (25 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4002 steps (8 resets) in 144 ms. (27 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4003 steps (8 resets) in 122 ms. (32 steps per ms) remains 1980/1980 properties
Interrupted probabilistic random walk after 748311 steps, run timeout after 96001 ms. (steps per millisecond=7 ) properties seen :0 out of 1980
Probabilistic random walk after 748311 steps, saw 527266 distinct states, run finished after 96006 ms. (steps per millisecond=7 ) properties seen :0
// Phase 1: matrix 2695 rows 2522 cols
[2024-06-01 08:04:25] [INFO ] Computed 400 invariants in 14 ms
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 1980/5217 variables, and 0 constraints, problems are : Problem set: 0 solved, 1980 unsolved in 90036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/400 constraints, State Equation: 0/2522 constraints, PredecessorRefiner: 1980/1980 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1980 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1980 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1980 unsolved
At refinement iteration 1 (OVERLAPS) 305/2285 variables, 282/282 constraints. Problems are: Problem set: 0 solved, 1980 unsolved
[2024-06-01 08:06:53] [INFO ] Deduced a trap composed of 29 places in 842 ms of which 13 ms to minimize.
[2024-06-01 08:06:54] [INFO ] Deduced a trap composed of 29 places in 857 ms of which 13 ms to minimize.
[2024-06-01 08:06:55] [INFO ] Deduced a trap composed of 24 places in 231 ms of which 4 ms to minimize.
[2024-06-01 08:06:56] [INFO ] Deduced a trap composed of 18 places in 233 ms of which 4 ms to minimize.
[2024-06-01 08:06:57] [INFO ] Deduced a trap composed of 18 places in 228 ms of which 4 ms to minimize.
[2024-06-01 08:06:57] [INFO ] Deduced a trap composed of 14 places in 234 ms of which 4 ms to minimize.
[2024-06-01 08:06:57] [INFO ] Deduced a trap composed of 20 places in 220 ms of which 4 ms to minimize.
[2024-06-01 08:06:59] [INFO ] Deduced a trap composed of 18 places in 232 ms of which 4 ms to minimize.
[2024-06-01 08:06:59] [INFO ] Deduced a trap composed of 32 places in 232 ms of which 5 ms to minimize.
[2024-06-01 08:07:00] [INFO ] Deduced a trap composed of 24 places in 243 ms of which 4 ms to minimize.
[2024-06-01 08:07:02] [INFO ] Deduced a trap composed of 18 places in 226 ms of which 4 ms to minimize.
[2024-06-01 08:07:03] [INFO ] Deduced a trap composed of 24 places in 248 ms of which 4 ms to minimize.
[2024-06-01 08:07:04] [INFO ] Deduced a trap composed of 28 places in 232 ms of which 4 ms to minimize.
[2024-06-01 08:07:06] [INFO ] Deduced a trap composed of 38 places in 261 ms of which 5 ms to minimize.
[2024-06-01 08:07:06] [INFO ] Deduced a trap composed of 28 places in 247 ms of which 4 ms to minimize.
[2024-06-01 08:07:07] [INFO ] Deduced a trap composed of 42 places in 260 ms of which 4 ms to minimize.
[2024-06-01 08:07:07] [INFO ] Deduced a trap composed of 42 places in 236 ms of which 5 ms to minimize.
[2024-06-01 08:07:08] [INFO ] Deduced a trap composed of 24 places in 238 ms of which 4 ms to minimize.
[2024-06-01 08:07:10] [INFO ] Deduced a trap composed of 58 places in 255 ms of which 5 ms to minimize.
[2024-06-01 08:07:10] [INFO ] Deduced a trap composed of 28 places in 253 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2285 variables, 20/302 constraints. Problems are: Problem set: 0 solved, 1980 unsolved
[2024-06-01 08:07:15] [INFO ] Deduced a trap composed of 28 places in 233 ms of which 4 ms to minimize.
[2024-06-01 08:07:15] [INFO ] Deduced a trap composed of 24 places in 223 ms of which 4 ms to minimize.
[2024-06-01 08:07:15] [INFO ] Deduced a trap composed of 28 places in 222 ms of which 4 ms to minimize.
[2024-06-01 08:07:16] [INFO ] Deduced a trap composed of 30 places in 242 ms of which 5 ms to minimize.
[2024-06-01 08:07:17] [INFO ] Deduced a trap composed of 30 places in 240 ms of which 4 ms to minimize.
[2024-06-01 08:07:17] [INFO ] Deduced a trap composed of 30 places in 234 ms of which 4 ms to minimize.
[2024-06-01 08:07:17] [INFO ] Deduced a trap composed of 32 places in 234 ms of which 4 ms to minimize.
[2024-06-01 08:07:17] [INFO ] Deduced a trap composed of 28 places in 233 ms of which 4 ms to minimize.
[2024-06-01 08:07:18] [INFO ] Deduced a trap composed of 39 places in 238 ms of which 4 ms to minimize.
[2024-06-01 08:07:18] [INFO ] Deduced a trap composed of 34 places in 227 ms of which 4 ms to minimize.
[2024-06-01 08:07:20] [INFO ] Deduced a trap composed of 38 places in 252 ms of which 5 ms to minimize.
[2024-06-01 08:07:20] [INFO ] Deduced a trap composed of 38 places in 248 ms of which 4 ms to minimize.
[2024-06-01 08:07:20] [INFO ] Deduced a trap composed of 32 places in 221 ms of which 4 ms to minimize.
[2024-06-01 08:07:20] [INFO ] Deduced a trap composed of 28 places in 220 ms of which 4 ms to minimize.
[2024-06-01 08:07:21] [INFO ] Deduced a trap composed of 38 places in 237 ms of which 5 ms to minimize.
[2024-06-01 08:07:21] [INFO ] Deduced a trap composed of 52 places in 251 ms of which 4 ms to minimize.
[2024-06-01 08:07:22] [INFO ] Deduced a trap composed of 38 places in 251 ms of which 4 ms to minimize.
[2024-06-01 08:07:22] [INFO ] Deduced a trap composed of 36 places in 252 ms of which 4 ms to minimize.
[2024-06-01 08:07:22] [INFO ] Deduced a trap composed of 46 places in 251 ms of which 4 ms to minimize.
[2024-06-01 08:07:23] [INFO ] Deduced a trap composed of 38 places in 235 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2285 variables, 20/322 constraints. Problems are: Problem set: 0 solved, 1980 unsolved
[2024-06-01 08:07:25] [INFO ] Deduced a trap composed of 18 places in 222 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2285/5217 variables, and 323 constraints, problems are : Problem set: 0 solved, 1980 unsolved in 90085 ms.
Refiners :[Positive P Invariants (semi-flows): 282/400 constraints, State Equation: 0/2522 constraints, PredecessorRefiner: 0/1980 constraints, Known Traps: 41/41 constraints]
After SMT, in 180681ms problems are : Problem set: 0 solved, 1980 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1980 out of 2522 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2522/2522 places, 2695/2695 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 0 with 1 rules applied. Total rules applied 1 place count 2522 transition count 2694
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2521 transition count 2694
Applied a total of 2 rules in 41 ms. Remains 2521 /2522 variables (removed 1) and now considering 2694/2695 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 2521/2522 places, 2694/2695 transitions.
RANDOM walk for 1017933 steps (279 resets) in 120004 ms. (8 steps per ms) remains 1963/1980 properties
BEST_FIRST walk for 4003 steps (8 resets) in 96 ms. (41 steps per ms) remains 1963/1963 properties
BEST_FIRST walk for 4004 steps (8 resets) in 145 ms. (27 steps per ms) remains 1963/1963 properties
BEST_FIRST walk for 4004 steps (8 resets) in 167 ms. (23 steps per ms) remains 1963/1963 properties
BEST_FIRST walk for 4004 steps (8 resets) in 155 ms. (25 steps per ms) remains 1963/1963 properties
BEST_FIRST walk for 4003 steps (8 resets) in 123 ms. (32 steps per ms) remains 1963/1963 properties
BEST_FIRST walk for 4004 steps (8 resets) in 167 ms. (23 steps per ms) remains 1963/1963 properties
BEST_FIRST walk for 4004 steps (9 resets) in 135 ms. (29 steps per ms) remains 1963/1963 properties
BEST_FIRST walk for 4004 steps (8 resets) in 121 ms. (32 steps per ms) remains 1963/1963 properties
BEST_FIRST walk for 4003 steps (8 resets) in 150 ms. (26 steps per ms) remains 1963/1963 properties
BEST_FIRST walk for 4002 steps (8 resets) in 126 ms. (31 steps per ms) remains 1963/1963 properties
BEST_FIRST walk for 4003 steps (8 resets) in 164 ms. (24 steps per ms) remains 1963/1963 properties
BEST_FIRST walk for 4004 steps (8 resets) in 151 ms. (26 steps per ms) remains 1963/1963 properties
BEST_FIRST walk for 4004 steps (8 resets) in 155 ms. (25 steps per ms) remains 1963/1963 properties
BEST_FIRST walk for 4004 steps (8 resets) in 143 ms. (27 steps per ms) remains 1963/1963 properties
BEST_FIRST walk for 4004 steps (8 resets) in 161 ms. (24 steps per ms) remains 1963/1963 properties
BEST_FIRST walk for 4004 steps (8 resets) in 119 ms. (33 steps per ms) remains 1963/1963 properties
BEST_FIRST walk for 4004 steps (8 resets) in 158 ms. (25 steps per ms) remains 1963/1963 properties
BEST_FIRST walk for 4003 steps (8 resets) in 173 ms. (23 steps per ms) remains 1963/1963 properties
BEST_FIRST walk for 4003 steps (8 resets) in 137 ms. (29 steps per ms) remains 1963/1963 properties
BEST_FIRST walk for 4004 steps (8 resets) in 148 ms. (26 steps per ms) remains 1963/1963 properties
BEST_FIRST walk for 4004 steps (8 resets) in 139 ms. (28 steps per ms) remains 1963/1963 properties
BEST_FIRST walk for 4002 steps (8 resets) in 168 ms. (23 steps per ms) remains 1963/1963 properties
BEST_FIRST walk for 4004 steps (8 resets) in 134 ms. (29 steps per ms) remains 1963/1963 properties
BEST_FIRST walk for 4004 steps (8 resets) in 168 ms. (23 steps per ms) remains 1963/1963 properties
BEST_FIRST walk for 4004 steps (8 resets) in 163 ms. (24 steps per ms) remains 1963/1963 properties
BEST_FIRST walk for 4003 steps (8 resets) in 102 ms. (38 steps per ms) remains 1963/1963 properties
BEST_FIRST walk for 4003 steps (8 resets) in 162 ms. (24 steps per ms) remains 1963/1963 properties
BEST_FIRST walk for 4003 steps (8 resets) in 166 ms. (23 steps per ms) remains 1963/1963 properties
BEST_FIRST walk for 4003 steps (8 resets) in 149 ms. (26 steps per ms) remains 1963/1963 properties
BEST_FIRST walk for 4003 steps (8 resets) in 156 ms. (25 steps per ms) remains 1963/1963 properties
BEST_FIRST walk for 4003 steps (8 resets) in 130 ms. (30 steps per ms) remains 1963/1963 properties
BEST_FIRST walk for 4003 steps (8 resets) in 163 ms. (24 steps per ms) remains 1963/1963 properties
BEST_FIRST walk for 4004 steps (8 resets) in 152 ms. (26 steps per ms) remains 1963/1963 properties
BEST_FIRST walk for 4003 steps (8 resets) in 103 ms. (38 steps per ms) remains 1963/1963 properties
BEST_FIRST walk for 4003 steps (8 resets) in 163 ms. (24 steps per ms) remains 1963/1963 properties
BEST_FIRST walk for 4004 steps (8 resets) in 140 ms. (28 steps per ms) remains 1963/1963 properties
BEST_FIRST walk for 4004 steps (8 resets) in 154 ms. (25 steps per ms) remains 1963/1963 properties
BEST_FIRST walk for 4004 steps (8 resets) in 140 ms. (28 steps per ms) remains 1963/1963 properties
BEST_FIRST walk for 4003 steps (8 resets) in 126 ms. (31 steps per ms) remains 1963/1963 properties
BEST_FIRST walk for 4004 steps (8 resets) in 162 ms. (24 steps per ms) remains 1963/1963 properties
BEST_FIRST walk for 4004 steps (8 resets) in 159 ms. (25 steps per ms) remains 1963/1963 properties
BEST_FIRST walk for 4003 steps (8 resets) in 153 ms. (25 steps per ms) remains 1963/1963 properties
BEST_FIRST walk for 4004 steps (8 resets) in 120 ms. (33 steps per ms) remains 1963/1963 properties
BEST_FIRST walk for 4004 steps (8 resets) in 151 ms. (26 steps per ms) remains 1963/1963 properties
BEST_FIRST walk for 4004 steps (8 resets) in 172 ms. (23 steps per ms) remains 1963/1963 properties
BEST_FIRST walk for 4004 steps (8 resets) in 166 ms. (23 steps per ms) remains 1963/1963 properties
BEST_FIRST walk for 4002 steps (8 resets) in 140 ms. (28 steps per ms) remains 1963/1963 properties
BEST_FIRST walk for 4003 steps (8 resets) in 138 ms. (28 steps per ms) remains 1963/1963 properties
BEST_FIRST walk for 4003 steps (8 resets) in 159 ms. (25 steps per ms) remains 1963/1963 properties
BEST_FIRST walk for 4004 steps (8 resets) in 156 ms. (25 steps per ms) remains 1963/1963 properties
Probabilistic random walk after 1000001 steps, saw 361313 distinct states, run finished after 74887 ms. (steps per millisecond=13 ) properties seen :200
// Phase 1: matrix 2694 rows 2521 cols
[2024-06-01 08:09:13] [INFO ] Computed 400 invariants in 12 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1763 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1763 unsolved
SMT process timed out in 105484ms, After SMT, problems are : Problem set: 0 solved, 1763 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1763 out of 2521 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2521/2521 places, 2694/2694 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 2521 transition count 2632
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 124 place count 2459 transition count 2632
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 124 place count 2459 transition count 2602
Deduced a syphon composed of 30 places in 10 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 184 place count 2429 transition count 2602
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 191 place count 2422 transition count 2595
Iterating global reduction 2 with 7 rules applied. Total rules applied 198 place count 2422 transition count 2595
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 198 place count 2422 transition count 2588
Deduced a syphon composed of 7 places in 9 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 212 place count 2415 transition count 2588
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 9 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 324 place count 2359 transition count 2532
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 27 places in 9 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 378 place count 2332 transition count 2552
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 379 place count 2332 transition count 2551
Applied a total of 379 rules in 166 ms. Remains 2332 /2521 variables (removed 189) and now considering 2551/2694 (removed 143) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 2332/2521 places, 2551/2694 transitions.
RANDOM walk for 538817 steps (159 resets) in 120004 ms. (4 steps per ms) remains 1763/1763 properties
BEST_FIRST walk for 4004 steps (8 resets) in 141 ms. (28 steps per ms) remains 1763/1763 properties
BEST_FIRST walk for 4004 steps (8 resets) in 121 ms. (32 steps per ms) remains 1763/1763 properties
BEST_FIRST walk for 4004 steps (8 resets) in 138 ms. (28 steps per ms) remains 1763/1763 properties
BEST_FIRST walk for 4004 steps (8 resets) in 130 ms. (30 steps per ms) remains 1763/1763 properties
BEST_FIRST walk for 4004 steps (8 resets) in 159 ms. (25 steps per ms) remains 1763/1763 properties
BEST_FIRST walk for 4004 steps (8 resets) in 143 ms. (27 steps per ms) remains 1763/1763 properties
BEST_FIRST walk for 4003 steps (8 resets) in 99 ms. (40 steps per ms) remains 1763/1763 properties
BEST_FIRST walk for 4004 steps (8 resets) in 156 ms. (25 steps per ms) remains 1763/1763 properties
BEST_FIRST walk for 4004 steps (8 resets) in 151 ms. (26 steps per ms) remains 1763/1763 properties
BEST_FIRST walk for 4004 steps (8 resets) in 151 ms. (26 steps per ms) remains 1763/1763 properties
BEST_FIRST walk for 4002 steps (9 resets) in 122 ms. (32 steps per ms) remains 1763/1763 properties
BEST_FIRST walk for 4004 steps (8 resets) in 134 ms. (29 steps per ms) remains 1763/1763 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 1763/1763 properties
BEST_FIRST walk for 4003 steps (8 resets) in 147 ms. (27 steps per ms) remains 1763/1763 properties
BEST_FIRST walk for 4003 steps (8 resets) in 146 ms. (27 steps per ms) remains 1763/1763 properties
BEST_FIRST walk for 4004 steps (8 resets) in 101 ms. (39 steps per ms) remains 1763/1763 properties
BEST_FIRST walk for 4003 steps (8 resets) in 153 ms. (25 steps per ms) remains 1763/1763 properties
BEST_FIRST walk for 4003 steps (8 resets) in 151 ms. (26 steps per ms) remains 1763/1763 properties
BEST_FIRST walk for 4004 steps (8 resets) in 134 ms. (29 steps per ms) remains 1763/1763 properties
BEST_FIRST walk for 4004 steps (8 resets) in 131 ms. (30 steps per ms) remains 1763/1763 properties
BEST_FIRST walk for 4004 steps (8 resets) in 124 ms. (32 steps per ms) remains 1763/1763 properties
BEST_FIRST walk for 4002 steps (8 resets) in 106 ms. (37 steps per ms) remains 1763/1763 properties
BEST_FIRST walk for 4003 steps (8 resets) in 131 ms. (30 steps per ms) remains 1763/1763 properties
BEST_FIRST walk for 4004 steps (8 resets) in 136 ms. (29 steps per ms) remains 1763/1763 properties
BEST_FIRST walk for 4004 steps (8 resets) in 122 ms. (32 steps per ms) remains 1763/1763 properties
BEST_FIRST walk for 4003 steps (8 resets) in 161 ms. (24 steps per ms) remains 1763/1763 properties
BEST_FIRST walk for 4003 steps (8 resets) in 115 ms. (34 steps per ms) remains 1763/1763 properties
BEST_FIRST walk for 4003 steps (8 resets) in 131 ms. (30 steps per ms) remains 1763/1763 properties
BEST_FIRST walk for 4004 steps (8 resets) in 162 ms. (24 steps per ms) remains 1763/1763 properties
BEST_FIRST walk for 4004 steps (8 resets) in 115 ms. (34 steps per ms) remains 1763/1763 properties
BEST_FIRST walk for 4003 steps (8 resets) in 157 ms. (25 steps per ms) remains 1763/1763 properties
BEST_FIRST walk for 4003 steps (8 resets) in 142 ms. (27 steps per ms) remains 1763/1763 properties
BEST_FIRST walk for 4004 steps (8 resets) in 162 ms. (24 steps per ms) remains 1763/1763 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 1763/1763 properties
BEST_FIRST walk for 4004 steps (8 resets) in 140 ms. (28 steps per ms) remains 1763/1763 properties
BEST_FIRST walk for 4003 steps (8 resets) in 109 ms. (36 steps per ms) remains 1763/1763 properties
BEST_FIRST walk for 4004 steps (8 resets) in 148 ms. (26 steps per ms) remains 1763/1763 properties
BEST_FIRST walk for 4004 steps (8 resets) in 101 ms. (39 steps per ms) remains 1763/1763 properties
BEST_FIRST walk for 4004 steps (8 resets) in 164 ms. (24 steps per ms) remains 1763/1763 properties
BEST_FIRST walk for 4003 steps (8 resets) in 141 ms. (28 steps per ms) remains 1763/1763 properties
BEST_FIRST walk for 4004 steps (8 resets) in 150 ms. (26 steps per ms) remains 1763/1763 properties
BEST_FIRST walk for 4004 steps (8 resets) in 147 ms. (27 steps per ms) remains 1763/1763 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 1763/1763 properties
BEST_FIRST walk for 4004 steps (8 resets) in 115 ms. (34 steps per ms) remains 1763/1763 properties
BEST_FIRST walk for 4004 steps (8 resets) in 123 ms. (32 steps per ms) remains 1763/1763 properties
BEST_FIRST walk for 4004 steps (8 resets) in 121 ms. (32 steps per ms) remains 1763/1763 properties
BEST_FIRST walk for 4003 steps (8 resets) in 165 ms. (24 steps per ms) remains 1763/1763 properties
BEST_FIRST walk for 4004 steps (8 resets) in 105 ms. (37 steps per ms) remains 1763/1763 properties
BEST_FIRST walk for 4003 steps (8 resets) in 160 ms. (24 steps per ms) remains 1763/1763 properties
BEST_FIRST walk for 4003 steps (8 resets) in 130 ms. (30 steps per ms) remains 1763/1763 properties
Probabilistic random walk after 1000001 steps, saw 380879 distinct states, run finished after 71537 ms. (steps per millisecond=13 ) properties seen :216
// Phase 1: matrix 2551 rows 2332 cols
[2024-06-01 08:12:42] [INFO ] Computed 400 invariants in 9 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1547 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1547 unsolved
SMT process timed out in 120396ms, After SMT, problems are : Problem set: 0 solved, 1547 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1547 out of 2332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2332/2332 places, 2551/2551 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 2332 transition count 2501
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 100 place count 2282 transition count 2501
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 100 place count 2282 transition count 2464
Deduced a syphon composed of 37 places in 7 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 174 place count 2245 transition count 2464
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 181 place count 2238 transition count 2457
Iterating global reduction 2 with 7 rules applied. Total rules applied 188 place count 2238 transition count 2457
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 188 place count 2238 transition count 2450
Deduced a syphon composed of 7 places in 7 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 202 place count 2231 transition count 2450
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 7 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 322 place count 2171 transition count 2390
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 26 places in 7 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 374 place count 2145 transition count 2404
Applied a total of 374 rules in 119 ms. Remains 2145 /2332 variables (removed 187) and now considering 2404/2551 (removed 147) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 2145/2332 places, 2404/2551 transitions.
RANDOM walk for 595034 steps (198 resets) in 120004 ms. (4 steps per ms) remains 1547/1547 properties
BEST_FIRST walk for 4004 steps (8 resets) in 135 ms. (29 steps per ms) remains 1547/1547 properties
BEST_FIRST walk for 4003 steps (8 resets) in 87 ms. (45 steps per ms) remains 1547/1547 properties
BEST_FIRST walk for 4004 steps (8 resets) in 125 ms. (31 steps per ms) remains 1547/1547 properties
BEST_FIRST walk for 4004 steps (8 resets) in 132 ms. (30 steps per ms) remains 1547/1547 properties
BEST_FIRST walk for 4004 steps (8 resets) in 130 ms. (30 steps per ms) remains 1547/1547 properties
BEST_FIRST walk for 4004 steps (8 resets) in 140 ms. (28 steps per ms) remains 1547/1547 properties
BEST_FIRST walk for 4003 steps (8 resets) in 109 ms. (36 steps per ms) remains 1547/1547 properties
BEST_FIRST walk for 4004 steps (8 resets) in 135 ms. (29 steps per ms) remains 1547/1547 properties
BEST_FIRST walk for 4004 steps (8 resets) in 142 ms. (28 steps per ms) remains 1547/1547 properties
BEST_FIRST walk for 4004 steps (8 resets) in 115 ms. (34 steps per ms) remains 1547/1547 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 1547/1547 properties
BEST_FIRST walk for 4003 steps (8 resets) in 132 ms. (30 steps per ms) remains 1547/1547 properties
BEST_FIRST walk for 4002 steps (8 resets) in 107 ms. (37 steps per ms) remains 1547/1547 properties
BEST_FIRST walk for 4004 steps (8 resets) in 153 ms. (26 steps per ms) remains 1547/1547 properties
BEST_FIRST walk for 4004 steps (8 resets) in 138 ms. (28 steps per ms) remains 1547/1547 properties
BEST_FIRST walk for 4003 steps (8 resets) in 109 ms. (36 steps per ms) remains 1547/1547 properties
BEST_FIRST walk for 4004 steps (8 resets) in 147 ms. (27 steps per ms) remains 1547/1547 properties
BEST_FIRST walk for 4004 steps (8 resets) in 135 ms. (29 steps per ms) remains 1547/1547 properties
BEST_FIRST walk for 4004 steps (8 resets) in 127 ms. (31 steps per ms) remains 1547/1547 properties
BEST_FIRST walk for 4002 steps (8 resets) in 102 ms. (38 steps per ms) remains 1547/1547 properties
BEST_FIRST walk for 4003 steps (8 resets) in 128 ms. (31 steps per ms) remains 1547/1547 properties
BEST_FIRST walk for 4003 steps (8 resets) in 135 ms. (29 steps per ms) remains 1547/1547 properties
BEST_FIRST walk for 4004 steps (8 resets) in 97 ms. (40 steps per ms) remains 1547/1547 properties
BEST_FIRST walk for 4004 steps (8 resets) in 144 ms. (27 steps per ms) remains 1547/1547 properties
BEST_FIRST walk for 4003 steps (8 resets) in 103 ms. (38 steps per ms) remains 1547/1547 properties
BEST_FIRST walk for 4004 steps (8 resets) in 142 ms. (28 steps per ms) remains 1547/1547 properties
BEST_FIRST walk for 4004 steps (8 resets) in 126 ms. (31 steps per ms) remains 1547/1547 properties
BEST_FIRST walk for 4004 steps (8 resets) in 137 ms. (29 steps per ms) remains 1547/1547 properties
BEST_FIRST walk for 4004 steps (8 resets) in 143 ms. (27 steps per ms) remains 1547/1547 properties
BEST_FIRST walk for 4004 steps (8 resets) in 130 ms. (30 steps per ms) remains 1547/1547 properties
BEST_FIRST walk for 4002 steps (8 resets) in 117 ms. (33 steps per ms) remains 1547/1547 properties
BEST_FIRST walk for 4003 steps (8 resets) in 138 ms. (28 steps per ms) remains 1547/1547 properties
BEST_FIRST walk for 4004 steps (8 resets) in 127 ms. (31 steps per ms) remains 1547/1547 properties
BEST_FIRST walk for 4004 steps (8 resets) in 99 ms. (40 steps per ms) remains 1547/1547 properties
BEST_FIRST walk for 4003 steps (8 resets) in 137 ms. (29 steps per ms) remains 1547/1547 properties
BEST_FIRST walk for 4004 steps (8 resets) in 135 ms. (29 steps per ms) remains 1547/1547 properties
BEST_FIRST walk for 4004 steps (8 resets) in 101 ms. (39 steps per ms) remains 1547/1547 properties
BEST_FIRST walk for 4004 steps (8 resets) in 121 ms. (32 steps per ms) remains 1547/1547 properties
BEST_FIRST walk for 4002 steps (8 resets) in 142 ms. (27 steps per ms) remains 1547/1547 properties
BEST_FIRST walk for 4004 steps (8 resets) in 138 ms. (28 steps per ms) remains 1547/1547 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 1547/1547 properties
BEST_FIRST walk for 4004 steps (8 resets) in 129 ms. (30 steps per ms) remains 1547/1547 properties
BEST_FIRST walk for 4004 steps (8 resets) in 105 ms. (37 steps per ms) remains 1547/1547 properties
BEST_FIRST walk for 4002 steps (8 resets) in 143 ms. (27 steps per ms) remains 1547/1547 properties
BEST_FIRST walk for 4004 steps (8 resets) in 132 ms. (30 steps per ms) remains 1547/1547 properties
BEST_FIRST walk for 4004 steps (8 resets) in 127 ms. (31 steps per ms) remains 1547/1547 properties
BEST_FIRST walk for 4003 steps (8 resets) in 132 ms. (30 steps per ms) remains 1547/1547 properties
BEST_FIRST walk for 4004 steps (8 resets) in 130 ms. (30 steps per ms) remains 1547/1547 properties
BEST_FIRST walk for 4004 steps (8 resets) in 138 ms. (28 steps per ms) remains 1547/1547 properties
BEST_FIRST walk for 4004 steps (8 resets) in 104 ms. (38 steps per ms) remains 1547/1547 properties
Probabilistic random walk after 1000001 steps, saw 383114 distinct states, run finished after 65014 ms. (steps per millisecond=15 ) properties seen :222
// Phase 1: matrix 2404 rows 2145 cols
[2024-06-01 08:16:19] [INFO ] Computed 400 invariants in 12 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1325 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1325 unsolved
At refinement iteration 1 (OVERLAPS) 286/1611 variables, 191/191 constraints. Problems are: Problem set: 0 solved, 1325 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 (/ 15.0 16.0))
(s2 (/ 1.0 16.0))
(s3 (/ 1.0 16.0))
(s4 (/ 1.0 16.0))
(s5 (/ 1.0 16.0))
(s6 (/ 1.0 16.0))
(s7 (/ 1.0 16.0))
(s8 (/ 1.0 16.0))
(s9 (/ 9.0 16.0))
(s10 (/ 1.0 16.0))
(s11 0.0)
(s12 (/ 1.0 16.0))
(s13 (/ 1.0 16.0))
(s14 (/ 1.0 16.0))
(s15 (/ 1.0 16.0))
(s16 (/ 1.0 16.0))
(s17 (/ 11.0 16.0))
(s18 0.0)
(s19 (/ 1.0 16.0))
(s20 (/ 1.0 16.0))
(s21 (/ 1.0 16.0))
(s22 (/ 1.0 16.0))
(s23 (/ 1.0 16.0))
(s24 (/ 1.0 16.0))
(s25 (/ 1.0 16.0))
(s26 (/ 1.0 16.0))
(s27 (/ 1.0 2.0))
(s28 (/ 1.0 16.0))
(s29 (/ 1.0 16.0))
(s30 (/ 9.0 16.0))
(s31 (/ 1.0 16.0))
(s32 (/ 1.0 16.0))
(s33 (/ 1.0 16.0))
(s34 (/ 1.0 16.0))
(s35 (/ 1.0 16.0))
(s36 0.0)
(s37 (/ 1.0 16.0))
(s38 (/ 1.0 16.0))
(s39 (/ 1.0 16.0))
(s40 (/ 1.0 16.0))
(s41 (/ 1.0 16.0))
(s42 (/ 1.0 16.0))
(s43 (/ 1.0 16.0))
(s44 (/ 9.0 16.0))
(s45 0.0)
(s46 (/ 11.0 16.0))
(s47 (/ 1.0 16.0))
(s48 (/ 1.0 16.0))
(s49 (/ 1.0 16.0))
(s50 (/ 1.0 16.0))
(s51 (/ 1.0 16.0))
(s52 0.0)
(s53 (/ 9.0 16.0))
(s54 (/ 1.0 16.0))
(s55 (/ 1.0 16.0))
(s56 (/ 1.0 16.0))
(s57 (/ 1.0 16.0))
(s58 (/ 1.0 16.0))
(s59 (/ 1.0 16.0))
(s60 (/ 1.0 16.0))
(s61 0.0)
(s62 (/ 1.0 16.0))
(s63 (/ 1.0 16.0))
(s64 (/ 1.0 16.0))
(s65 (/ 9.0 16.0))
(s66 (/ 1.0 16.0))
(s67 (/ 1.0 16.0))
(s68 (/ 1.0 16.0))
(s69 (/ 1.0 16.0))
(s70 0.0)
(s71 (/ 9.0 16.0))
(s72 (/ 1.0 16.0))
(s73 (/ 1.0 16.0))
(s74 (/ 1.0 16.0))
(s75 (/ 1.0 16.0))
(s76 (/ 1.0 16.0))
(s77 (/ 1.0 16.0))
(s78 (/ 1.0 16.0))
(s79 0.0)
(s80 (/ 1.0 16.0))
(s81 (/ 1.0 16.0))
(s82 (/ 1.0 16.0))
(s83 (/ 1.0 16.0))
(s84 (/ 1.0 16.0))
(s85 (/ 1.0 16.0))
(s86 (/ 5.0 8.0))
(s87 (/ 1.0 16.0))
(s88 (/ 1.0 16.0))
(s89 (/ 1.0 16.0))
(s90 (/ 1.0 16.0))
(s91 (/ 9.0 16.0))
(s92 (/ 1.0 16.0))
(s93 (/ 1.0 16.0))
(s94 (/ 1.0 16.0))
(s95 0.0)
(s96 (/ 1.0 16.0))
(s97 (/ 1.0 16.0))
(s98 (/ 1.0 16.0))
(s99 (/ 1.0 16.0))
(s100 (/ 9.0 16.0))
(s101 (/ 1.0 16.0))
(s102 (/ 1.0 16.0))
(s103 (/ 1.0 16.0))
(s104 0.0)
(s105 (/ 1.0 16.0))
(s106 (/ 1.0 16.0))
(s107 (/ 9.0 16.0))
(s108 (/ 1.0 16.0))
(s109 (/ 1.0 16.0))
(s110 (/ 1.0 16.0))
(s111 (/ 1.0 16.0))
(s112 (/ 1.0 16.0))
(s113 0.0)
(s114 (/ 11.0 16.0))
(s115 (/ 1.0 16.0))
(s116 (/ 1.0 16.0))
(s117 (/ 1.0 16.0))
(s118 (/ 1.0 16.0))
(s119 (/ 1.0 16.0))
(s120 0.0)
(s121 (/ 1.0 16.0))
(s122 (/ 1.0 16.0))
(s123 (/ 1.0 16.0))
(s124 (/ 9.0 16.0))
(s125 (/ 1.0 16.0))
(s126 (/ 1.0 16.0))
(s127 (/ 1.0 16.0))
(s128 (/ 1.0 16.0))
(s129 0.0)
(s130 (/ 1.0 16.0))
(s131 (/ 1.0 16.0))
(s132 (/ 1.0 16.0))
(s133 (/ 1.0 16.0))
(s134 (/ 1.0 16.0))
(s135 (/ 1.0 16.0))
(s136 (/ 1.0 16.0))
(s137 (/ 1.0 16.0))
(s138 (/ 1.0 2.0))
(s139 (/ 1.0 16.0))
(s140 (/ 1.0 16.0))
(s141 (/ 1.0 16.0))
(s142 (/ 9.0 16.0))
(s143 (/ 1.0 16.0))
(s144 (/ 1.0 16.0))
(s145 (/ 1.0 16.0))
(s146 (/ 1.0 16.0))
(s147 0.0)
(s148 (/ 1.0 16.0))
(s149 (/ 11.0 16.0))
(s150 (/ 1.0 16.0))
(s151 (/ 1.0 16.0))
(s152 (/ 1.0 16.0))
(s153 (/ 1.0 16.0))
(s154 0.0)
(s155 (/ 9.0 16.0))
(s156 (/ 1.0 16.0))
(s157 (/ 1.0 16.0))
(s158 (/ 1.0 16.0))
(s159 (/ 1.0 16.0))
(s160 (/ 1.0 16.0))
(s161 (/ 1.0 16.0))
(s162 (/ 1.0 16.0))
(s163 0.0)
(s164 (/ 1.0 16.0))
(s165 (/ 1.0 16.0))
(s166 (/ 1.0 16.0))
(s167 (/ 1.0 16.0))
(s168 (/ 1.0 16.0))
(s169 (/ 1.0 16.0))
(s170 (/ 1.0 16.0))
(s171 (/ 1.0 16.0))
(s172 (/ 1.0 2.0))
(s173 (/ 1.0 16.0))
(s174 (/ 1.0 16.0))
(s175 (/ 1.0 16.0))
(s176 (/ 1.0 16.0))
(s177 (/ 1.0 16.0))
(s178 (/ 1.0 16.0))
(s179 (/ 1.0 16.0))
(s180 (/ 9.0 16.0))
(s181 0.0)
(s182 (/ 1.0 16.0))
(s183 (/ 1.0 16.0))
(s184 (/ 11.0 16.0))
(s185 (/ 1.0 16.0))
(s186 (/ 1.0 16.0))
(s187 (/ 1.0 16.0))
(s188 0.0)
(s189 (/ 1.0 16.0))
(s190 (/ 1.0 16.0))
(s191 (/ 1.0 16.0))
(s192 (/ 1.0 16.0))
(s193 (/ 1.0 16.0))
(s194 (/ 9.0 16.0))
(s195 (/ 1.0 16.0))
(s196 (/ 1.0 16.0))
(s197 0.0)
(s198 (/ 1.0 16.0))
(s199 (/ 1.0 16.0))
(s200 (/ 1.0 16.0))
(s201 (/ 1.0 16.0))
(s202 (/ 1.0 16.0))
(s203 (/ 1.0 16.0))
(s204 (/ 1.0 16.0))
(s205 (/ 1.0 16.0))
(s206 (/ 1.0 2.0))
(s207 (/ 1.0 16.0))
(s208 (/ 1.0 16.0))
(s209 (/ 1.0 16.0))
(s210 (/ 1.0 16.0))
(s211 (/ 1.0 16.0))
(s212 (/ 1.0 16.0))
(s213 (/ 9.0 16.0))
(s214 (/ 1.0 16.0))
(s215 0.0)
(s216 (/ 1.0 16.0))
(s217 (/ 1.0 16.0))
(s218 (/ 1.0 16.0))
(s219 (/ 1.0 16.0))
(s220 (/ 1.0 16.0))
(s221 (/ 11.0 16.0))
(s222 0.0)
(s223 (/ 1.0 16.0))
(s224 (/ 1.0 16.0))
(s225 (/ 1.0 16.0))
(s226 (/ 1.0 16.0))
(s227 (/ 1.0 16.0))
(s228 (/ 1.0 16.0))
(s229 (/ 1.0 16.0))
(s230 (/ 1.0 16.0))
(s231 (/ 1.0 2.0))
(s232 (/ 1.0 16.0))
(s233 (/ 1.0 16.0))
(s234 (/ 1.0 16.0))
(s235 (/ 1.0 16.0))
(s236 (/ 1.0 16.0))
(s237 (/ 1.0 16.0))
(s238 (/ 1.0 16.0))
(s239 (/ 9.0 16.0))
(s240 0.0)
(s241 (/ 1.0 16.0))
(s242 (/ 1.0 16.0))
(s243 (/ 1.0 16.0))
(s244 (/ 1.0 16.0))
(s245 (/ 1.0 16.0))
(s246 (/ 1.0 16.0))
(s247 (/ 9.0 16.0))
(s248 (/ 1.0 16.0))
(s249 0.0)
(s250 (/ 1.0 16.0))
(s251 (/ 11.0 16.0))
(s252 (/ 1.0 16.0))
(s253 (/ 1.0 16.0))
(s254 (/ 1.0 16.0))
(s255 (/ 1.0 16.0))
(s256 0.0)
(s257 (/ 1.0 16.0))
(s258 (/ 1.0 16.0))
(s259 (/ 1.0 16.0))
(s260 (/ 1.0 16.0))
(s261 (/ 1.0 16.0))
(s262 (/ 1.0 16.0))
(s263 (/ 9.0 16.0))
(s264 (/ 1.0 16.0))
(s265 0.0)
(s266 (/ 1.0 16.0))
(s267 (/ 1.0 16.0))
(s268 (/ 1.0 16.0))
(s269 (/ 1.0 16.0))
(s270 (/ 1.0 16.0))
(s271 (/ 1.0 16.0))
(s272 (/ 1.0 16.0))
(s273 (/ 1.0 16.0))
(s274 (/ 1.0 2.0))
(s275 (/ 9.0 16.0))
(s276 (/ 1.0 16.0))
(s277 (/ 1.0 16.0))
(s278 (/ 1.0 16.0))
(s279 (/ 1.0 16.0))
(s280 (/ 1.0 16.0))
(s281 (/ 1.0 16.0))
(s282 (/ 1.0 16.0))
(s283 0.0)
(s284 (/ 1.0 16.0))
(s285 (/ 1.0 16.0))
(s286 (/ 1.0 16.0))
(s287 (/ 1.0 16.0))
(s288 (/ 11.0 16.0))
(s289 (/ 1.0 16.0))
(s290 0.0)
(s291 (/ 1.0 16.0))
(s292 (/ 1.0 16.0))
(s293 (/ 1.0 16.0))
(s294 (/ 1.0 16.0))
(s295 (/ 1.0 16.0))
(s296 (/ 9.0 16.0))
(s297 (/ 1.0 16.0))
(s298 (/ 1.0 16.0))
(s299 0.0)
(s300 (/ 1.0 16.0))
(s301 (/ 1.0 16.0))
(s302 (/ 1.0 16.0))
(s303 (/ 1.0 16.0))
(s304 (/ 1.0 16.0))
(s305 (/ 1.0 16.0))
(s306 (/ 1.0 16.0))
(s307 (/ 9.0 16.0))
(s308 0.0)
(s309 (/ 1.0 16.0))
(s310 (/ 1.0 16.0))
(s311 (/ 1.0 16.0))
(s312 (/ 1.0 16.0))
(s313 (/ 9.0 16.0))
(s314 (/ 1.0 16.0))
(s315 (/ 1.0 16.0))
(s316 (/ 1.0 16.0))
(s317 0.0)
(s318 (/ 1.0 16.0))
(s319 (/ 1.0 16.0))
(s320 (/ 1.0 16.0))
(s321 (/ 1.0 16.0))
(s322 (/ 11.0 16.0))
(s323 (/ 1.0 16.0))
(s324 0.0)
(s325 (/ 1.0 16.0))
(s326 (/ 1.0 16.0))
(s327 (/ 1.0 16.0))
(s328 (/ 1.0 16.0))
(s329 (/ 1.0 16.0))
(s330 (/ 1.0 16.0))
(s331 (/ 9.0 16.0))
(s332 (/ 1.0 16.0))
(s333 0.0)
(s334 (/ 1.0 16.0))
(s335 (/ 1.0 16.0))
(s336 (/ 1.0 16.0))
(s337 (/ 1.0 16.0))
(s338 (/ 1.0 16.0))
(s339 (/ 1.0 16.0))
(s340 (/ 1.0 16.0))
(s341 (/ 9.0 16.0))
(s342 0.0)
(s343 (/ 1.0 16.0))
(s344 (/ 1.0 16.0))
(s345 (/ 1.0 16.0))
(s346 (/ 1.0 16.0))
(s347 (/ 1.0 16.0))
(s348 (/ 1.0 16.0))
(s349 (/ 1.0 16.0))
(s350 (/ 9.0 16.0))
(s351 0.0)
(s352 (/ 1.0 16.0))
(s353 (/ 11.0 16.0))
(s354 (/ 1.0 16.0))
(s355 (/ 1.0 16.0))
(s356 (/ 1.0 16.0))
(s357 (/ 1.0 16.0))
(s358 0.0)
(s359 (/ 9.0 16.0))
(s360 (/ 1.0 16.0))
(s361 (/ 1.0 16.0))
(s362 (/ 1.0 16.0))
(s363 (/ 1.0 16.0))
(s364 (/ 1.0 16.0))
(s365 (/ 1.0 16.0))
(s366 (/ 1.0 16.0))
(s367 0.0)
(s368 (/ 1.0 16.0))
(s369 (/ 1.0 16.0))
(s370 (/ 1.0 16.0))
(s371 (/ 1.0 16.0))
(s372 (/ 1.0 16.0))
(s373 (/ 1.0 16.0))
(s374 (/ 1.0 16.0))
(s375 (/ 9.0 16.0))
(s376 0.0)
(s377 (/ 1.0 16.0))
(s378 (/ 1.0 16.0))
(s379 (/ 1.0 16.0))
(s380 (/ 1.0 16.0))
(s381 (/ 1.0 16.0))
(s382 (/ 1.0 16.0))
(s383 (/ 1.0 16.0))
(s384 (/ 9.0 16.0))
(s385 0.0)
(s386 (/ 1.0 16.0))
(s387 (/ 1.0 16.0))
(s388 (/ 1.0 16.0))
(s389 (/ 1.0 16.0))
(s390 (/ 1.0 16.0))
(s391 (/ 1.0 16.0))
(s392 (/ 5.0 8.0))
(s393 (/ 1.0 16.0))
(s394 (/ 1.0 16.0))
(s395 (/ 1.0 16.0))
(s396 (/ 1.0 16.0))
(s397 (/ 1.0 16.0))
(s398 (/ 1.0 16.0))
(s399 (/ 9.0 16.0))
(s400 (/ 1.0 16.0))
(s401 0.0)
(s402 (/ 1.0 16.0))
(s403 (/ 1.0 16.0))
(s404 (/ 1.0 16.0))
(s405 (/ 1.0 16.0))
(s406 (/ 1.0 16.0))
(s407 (/ 1.0 16.0))
(s408 (/ 1.0 16.0))
(s409 (/ 9.0 16.0))
(s410 0.0)
(s411 (/ 9.0 16.0))
(s412 (/ 1.0 16.0))
(s413 (/ 1.0 16.0))
(s414 (/ 1.0 16.0))
(s415 (/ 1.0 16.0))
(s416 (/ 1.0 16.0))
(s417 (/ 1.0 16.0))
(s418 (/ 1.0 16.0))
(s419 0.0)
(s420 (/ 1.0 16.0))
(s421 (/ 1.0 16.0))
(s422 (/ 1.0 16.0))
(s423 (/ 1.0 16.0))
(s424 (/ 1.0 16.0))
(s425 (/ 1.0 16.0))
(s426 (/ 5.0 8.0))
(s427 (/ 1.0 16.0))
(s428 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1611/4549 variables, and 191 constraints, problems are : Problem set: 0 solved, 1325 unsolved in 135032 ms.
Refiners :[Positive P Invariants (semi-flows): 191/400 constraints, State Equation: 0/2145 constraints, PredecessorRefiner: 1325/1325 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1325 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1325 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1325 unsolved
At refinement iteration 1 (OVERLAPS) 286/1611 variables, 191/191 constraints. Problems are: Problem set: 0 solved, 1325 unsolved
[2024-06-01 08:18:59] [INFO ] Deduced a trap composed of 30 places in 477 ms of which 8 ms to minimize.
[2024-06-01 08:19:00] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 3 ms to minimize.
[2024-06-01 08:19:00] [INFO ] Deduced a trap composed of 14 places in 143 ms of which 3 ms to minimize.
[2024-06-01 08:19:01] [INFO ] Deduced a trap composed of 18 places in 137 ms of which 3 ms to minimize.
[2024-06-01 08:19:01] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 3 ms to minimize.
[2024-06-01 08:19:02] [INFO ] Deduced a trap composed of 24 places in 140 ms of which 3 ms to minimize.
[2024-06-01 08:19:03] [INFO ] Deduced a trap composed of 18 places in 149 ms of which 2 ms to minimize.
[2024-06-01 08:19:03] [INFO ] Deduced a trap composed of 28 places in 165 ms of which 3 ms to minimize.
[2024-06-01 08:19:03] [INFO ] Deduced a trap composed of 30 places in 144 ms of which 3 ms to minimize.
[2024-06-01 08:19:05] [INFO ] Deduced a trap composed of 28 places in 163 ms of which 3 ms to minimize.
[2024-06-01 08:19:05] [INFO ] Deduced a trap composed of 32 places in 155 ms of which 3 ms to minimize.
[2024-06-01 08:19:05] [INFO ] Deduced a trap composed of 38 places in 156 ms of which 3 ms to minimize.
[2024-06-01 08:19:06] [INFO ] Deduced a trap composed of 28 places in 163 ms of which 3 ms to minimize.
[2024-06-01 08:19:07] [INFO ] Deduced a trap composed of 18 places in 157 ms of which 3 ms to minimize.
[2024-06-01 08:19:07] [INFO ] Deduced a trap composed of 24 places in 156 ms of which 3 ms to minimize.
[2024-06-01 08:19:08] [INFO ] Deduced a trap composed of 42 places in 158 ms of which 3 ms to minimize.
[2024-06-01 08:19:08] [INFO ] Deduced a trap composed of 34 places in 153 ms of which 3 ms to minimize.
[2024-06-01 08:19:09] [INFO ] Deduced a trap composed of 18 places in 160 ms of which 3 ms to minimize.
[2024-06-01 08:19:09] [INFO ] Deduced a trap composed of 24 places in 159 ms of which 3 ms to minimize.
[2024-06-01 08:19:10] [INFO ] Deduced a trap composed of 34 places in 172 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1611 variables, 20/211 constraints. Problems are: Problem set: 0 solved, 1325 unsolved
[2024-06-01 08:19:11] [INFO ] Deduced a trap composed of 34 places in 433 ms of which 7 ms to minimize.
[2024-06-01 08:19:11] [INFO ] Deduced a trap composed of 50 places in 432 ms of which 7 ms to minimize.
[2024-06-01 08:19:12] [INFO ] Deduced a trap composed of 50 places in 441 ms of which 7 ms to minimize.
[2024-06-01 08:19:12] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 1 ms to minimize.
[2024-06-01 08:19:13] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 3 ms to minimize.
[2024-06-01 08:19:14] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 3 ms to minimize.
[2024-06-01 08:19:14] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 3 ms to minimize.
[2024-06-01 08:19:14] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 2 ms to minimize.
[2024-06-01 08:19:15] [INFO ] Deduced a trap composed of 28 places in 140 ms of which 3 ms to minimize.
[2024-06-01 08:19:19] [INFO ] Deduced a trap composed of 48 places in 152 ms of which 2 ms to minimize.
[2024-06-01 08:19:21] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 3 ms to minimize.
[2024-06-01 08:19:21] [INFO ] Deduced a trap composed of 18 places in 154 ms of which 4 ms to minimize.
[2024-06-01 08:19:21] [INFO ] Deduced a trap composed of 28 places in 156 ms of which 3 ms to minimize.
[2024-06-01 08:19:23] [INFO ] Deduced a trap composed of 36 places in 166 ms of which 3 ms to minimize.
[2024-06-01 08:19:23] [INFO ] Deduced a trap composed of 46 places in 169 ms of which 3 ms to minimize.
[2024-06-01 08:19:23] [INFO ] Deduced a trap composed of 28 places in 162 ms of which 3 ms to minimize.
[2024-06-01 08:19:24] [INFO ] Deduced a trap composed of 30 places in 167 ms of which 3 ms to minimize.
[2024-06-01 08:19:25] [INFO ] Deduced a trap composed of 24 places in 173 ms of which 3 ms to minimize.
[2024-06-01 08:19:25] [INFO ] Deduced a trap composed of 42 places in 173 ms of which 3 ms to minimize.
[2024-06-01 08:19:25] [INFO ] Deduced a trap composed of 34 places in 177 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1611 variables, 20/231 constraints. Problems are: Problem set: 0 solved, 1325 unsolved
[2024-06-01 08:19:30] [INFO ] Deduced a trap composed of 34 places in 139 ms of which 3 ms to minimize.
[2024-06-01 08:19:31] [INFO ] Deduced a trap composed of 28 places in 148 ms of which 3 ms to minimize.
[2024-06-01 08:19:31] [INFO ] Deduced a trap composed of 42 places in 145 ms of which 2 ms to minimize.
[2024-06-01 08:19:32] [INFO ] Deduced a trap composed of 50 places in 146 ms of which 3 ms to minimize.
[2024-06-01 08:19:35] [INFO ] Deduced a trap composed of 30 places in 165 ms of which 3 ms to minimize.
[2024-06-01 08:19:35] [INFO ] Deduced a trap composed of 24 places in 159 ms of which 3 ms to minimize.
[2024-06-01 08:19:35] [INFO ] Deduced a trap composed of 38 places in 156 ms of which 3 ms to minimize.
[2024-06-01 08:19:35] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 2 ms to minimize.
[2024-06-01 08:19:35] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 2 ms to minimize.
[2024-06-01 08:19:36] [INFO ] Deduced a trap composed of 18 places in 127 ms of which 3 ms to minimize.
[2024-06-01 08:19:36] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 3 ms to minimize.
[2024-06-01 08:19:37] [INFO ] Deduced a trap composed of 24 places in 159 ms of which 3 ms to minimize.
[2024-06-01 08:19:39] [INFO ] Deduced a trap composed of 32 places in 175 ms of which 3 ms to minimize.
[2024-06-01 08:19:39] [INFO ] Deduced a trap composed of 28 places in 175 ms of which 3 ms to minimize.
[2024-06-01 08:19:40] [INFO ] Deduced a trap composed of 32 places in 170 ms of which 3 ms to minimize.
[2024-06-01 08:19:40] [INFO ] Deduced a trap composed of 32 places in 170 ms of which 3 ms to minimize.
[2024-06-01 08:19:41] [INFO ] Deduced a trap composed of 42 places in 173 ms of which 4 ms to minimize.
[2024-06-01 08:19:41] [INFO ] Deduced a trap composed of 34 places in 170 ms of which 3 ms to minimize.
[2024-06-01 08:19:42] [INFO ] Deduced a trap composed of 42 places in 174 ms of which 4 ms to minimize.
[2024-06-01 08:19:42] [INFO ] Deduced a trap composed of 44 places in 181 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1611 variables, 20/251 constraints. Problems are: Problem set: 0 solved, 1325 unsolved
[2024-06-01 08:19:47] [INFO ] Deduced a trap composed of 28 places in 138 ms of which 2 ms to minimize.
[2024-06-01 08:19:52] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 3 ms to minimize.
[2024-06-01 08:19:53] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 2 ms to minimize.
[2024-06-01 08:19:54] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 2 ms to minimize.
[2024-06-01 08:19:55] [INFO ] Deduced a trap composed of 34 places in 164 ms of which 3 ms to minimize.
[2024-06-01 08:19:56] [INFO ] Deduced a trap composed of 42 places in 169 ms of which 4 ms to minimize.
[2024-06-01 08:19:56] [INFO ] Deduced a trap composed of 34 places in 171 ms of which 3 ms to minimize.
[2024-06-01 08:19:57] [INFO ] Deduced a trap composed of 64 places in 171 ms of which 4 ms to minimize.
[2024-06-01 08:19:57] [INFO ] Deduced a trap composed of 62 places in 177 ms of which 3 ms to minimize.
[2024-06-01 08:19:57] [INFO ] Deduced a trap composed of 44 places in 173 ms of which 3 ms to minimize.
[2024-06-01 08:19:59] [INFO ] Deduced a trap composed of 34 places in 183 ms of which 3 ms to minimize.
[2024-06-01 08:20:00] [INFO ] Deduced a trap composed of 28 places in 186 ms of which 3 ms to minimize.
[2024-06-01 08:20:00] [INFO ] Deduced a trap composed of 34 places in 186 ms of which 3 ms to minimize.
[2024-06-01 08:20:01] [INFO ] Deduced a trap composed of 32 places in 187 ms of which 4 ms to minimize.
[2024-06-01 08:20:01] [INFO ] Deduced a trap composed of 36 places in 185 ms of which 4 ms to minimize.
[2024-06-01 08:20:01] [INFO ] Deduced a trap composed of 24 places in 182 ms of which 4 ms to minimize.
[2024-06-01 08:20:02] [INFO ] Deduced a trap composed of 24 places in 200 ms of which 4 ms to minimize.
[2024-06-01 08:20:03] [INFO ] Deduced a trap composed of 32 places in 193 ms of which 4 ms to minimize.
[2024-06-01 08:20:03] [INFO ] Deduced a trap composed of 38 places in 200 ms of which 4 ms to minimize.
[2024-06-01 08:20:03] [INFO ] Deduced a trap composed of 38 places in 195 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1611 variables, 20/271 constraints. Problems are: Problem set: 0 solved, 1325 unsolved
[2024-06-01 08:20:05] [INFO ] Deduced a trap composed of 20 places in 171 ms of which 4 ms to minimize.
[2024-06-01 08:20:16] [INFO ] Deduced a trap composed of 38 places in 212 ms of which 4 ms to minimize.
[2024-06-01 08:20:16] [INFO ] Deduced a trap composed of 36 places in 210 ms of which 4 ms to minimize.
[2024-06-01 08:20:17] [INFO ] Deduced a trap composed of 46 places in 212 ms of which 3 ms to minimize.
[2024-06-01 08:20:17] [INFO ] Deduced a trap composed of 38 places in 168 ms of which 3 ms to minimize.
[2024-06-01 08:20:20] [INFO ] Deduced a trap composed of 24 places in 234 ms of which 5 ms to minimize.
[2024-06-01 08:20:20] [INFO ] Deduced a trap composed of 78 places in 233 ms of which 4 ms to minimize.
[2024-06-01 08:20:21] [INFO ] Deduced a trap composed of 70 places in 231 ms of which 4 ms to minimize.
[2024-06-01 08:20:21] [INFO ] Deduced a trap composed of 62 places in 238 ms of which 5 ms to minimize.
[2024-06-01 08:20:21] [INFO ] Deduced a trap composed of 62 places in 230 ms of which 4 ms to minimize.
[2024-06-01 08:20:21] [INFO ] Deduced a trap composed of 58 places in 234 ms of which 4 ms to minimize.
[2024-06-01 08:20:22] [INFO ] Deduced a trap composed of 52 places in 224 ms of which 5 ms to minimize.
[2024-06-01 08:20:22] [INFO ] Deduced a trap composed of 52 places in 218 ms of which 4 ms to minimize.
[2024-06-01 08:20:23] [INFO ] Deduced a trap composed of 44 places in 237 ms of which 4 ms to minimize.
[2024-06-01 08:20:23] [INFO ] Deduced a trap composed of 61 places in 250 ms of which 4 ms to minimize.
[2024-06-01 08:20:23] [INFO ] Deduced a trap composed of 58 places in 235 ms of which 5 ms to minimize.
[2024-06-01 08:20:23] [INFO ] Deduced a trap composed of 58 places in 228 ms of which 4 ms to minimize.
[2024-06-01 08:20:24] [INFO ] Deduced a trap composed of 40 places in 235 ms of which 4 ms to minimize.
[2024-06-01 08:20:24] [INFO ] Deduced a trap composed of 42 places in 237 ms of which 5 ms to minimize.
[2024-06-01 08:20:24] [INFO ] Deduced a trap composed of 38 places in 232 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1611 variables, 20/291 constraints. Problems are: Problem set: 0 solved, 1325 unsolved
[2024-06-01 08:20:30] [INFO ] Deduced a trap composed of 28 places in 141 ms of which 3 ms to minimize.
[2024-06-01 08:20:30] [INFO ] Deduced a trap composed of 36 places in 141 ms of which 3 ms to minimize.
[2024-06-01 08:20:31] [INFO ] Deduced a trap composed of 40 places in 140 ms of which 3 ms to minimize.
[2024-06-01 08:20:34] [INFO ] Deduced a trap composed of 40 places in 158 ms of which 3 ms to minimize.
[2024-06-01 08:20:34] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 2 ms to minimize.
[2024-06-01 08:20:36] [INFO ] Deduced a trap composed of 18 places in 126 ms of which 2 ms to minimize.
[2024-06-01 08:20:38] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 3 ms to minimize.
[2024-06-01 08:20:41] [INFO ] Deduced a trap composed of 34 places in 140 ms of which 3 ms to minimize.
[2024-06-01 08:20:44] [INFO ] Deduced a trap composed of 18 places in 161 ms of which 3 ms to minimize.
[2024-06-01 08:20:44] [INFO ] Deduced a trap composed of 24 places in 155 ms of which 4 ms to minimize.
[2024-06-01 08:20:44] [INFO ] Deduced a trap composed of 52 places in 151 ms of which 2 ms to minimize.
[2024-06-01 08:20:45] [INFO ] Deduced a trap composed of 28 places in 149 ms of which 3 ms to minimize.
[2024-06-01 08:20:45] [INFO ] Deduced a trap composed of 48 places in 153 ms of which 3 ms to minimize.
[2024-06-01 08:20:46] [INFO ] Deduced a trap composed of 24 places in 165 ms of which 3 ms to minimize.
[2024-06-01 08:20:46] [INFO ] Deduced a trap composed of 24 places in 169 ms of which 3 ms to minimize.
[2024-06-01 08:20:46] [INFO ] Deduced a trap composed of 32 places in 156 ms of which 3 ms to minimize.
[2024-06-01 08:20:47] [INFO ] Deduced a trap composed of 38 places in 164 ms of which 3 ms to minimize.
[2024-06-01 08:20:47] [INFO ] Deduced a trap composed of 28 places in 155 ms of which 3 ms to minimize.
[2024-06-01 08:20:47] [INFO ] Deduced a trap composed of 40 places in 158 ms of which 3 ms to minimize.
[2024-06-01 08:20:47] [INFO ] Deduced a trap composed of 38 places in 155 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1611 variables, 20/311 constraints. Problems are: Problem set: 0 solved, 1325 unsolved
[2024-06-01 08:20:49] [INFO ] Deduced a trap composed of 36 places in 139 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1611/4549 variables, and 312 constraints, problems are : Problem set: 0 solved, 1325 unsolved in 135045 ms.
Refiners :[Positive P Invariants (semi-flows): 191/400 constraints, State Equation: 0/2145 constraints, PredecessorRefiner: 0/1325 constraints, Known Traps: 121/121 constraints]
After SMT, in 270415ms problems are : Problem set: 0 solved, 1325 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1325 out of 2145 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2145/2145 places, 2404/2404 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 2145 transition count 2354
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 100 place count 2095 transition count 2354
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 100 place count 2095 transition count 2316
Deduced a syphon composed of 38 places in 6 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 176 place count 2057 transition count 2316
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 184 place count 2049 transition count 2308
Iterating global reduction 2 with 8 rules applied. Total rules applied 192 place count 2049 transition count 2308
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 192 place count 2049 transition count 2300
Deduced a syphon composed of 8 places in 6 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 208 place count 2041 transition count 2300
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 5 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 328 place count 1981 transition count 2240
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 29 places in 5 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 386 place count 1952 transition count 2256
Applied a total of 386 rules in 103 ms. Remains 1952 /2145 variables (removed 193) and now considering 2256/2404 (removed 148) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 1952/2145 places, 2256/2404 transitions.
RANDOM walk for 1471167 steps (385 resets) in 120004 ms. (12 steps per ms) remains 1324/1325 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 98 ms. (40 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 98 ms. (40 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4003 steps (8 resets) in 117 ms. (33 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 128 ms. (31 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 109 ms. (36 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4003 steps (8 resets) in 108 ms. (36 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 115 ms. (34 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 114 ms. (34 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 127 ms. (31 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 117 ms. (33 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 103 ms. (38 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4003 steps (8 resets) in 118 ms. (33 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4003 steps (8 resets) in 100 ms. (39 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4002 steps (8 resets) in 117 ms. (33 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4003 steps (8 resets) in 124 ms. (32 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 120 ms. (33 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 114 ms. (34 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 127 ms. (31 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4003 steps (8 resets) in 91 ms. (43 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 130 ms. (30 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4003 steps (8 resets) in 138 ms. (28 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4003 steps (8 resets) in 123 ms. (32 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 125 ms. (31 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 120 ms. (33 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4003 steps (8 resets) in 108 ms. (36 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 123 ms. (32 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4002 steps (8 resets) in 128 ms. (31 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 128 ms. (31 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 126 ms. (31 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4003 steps (8 resets) in 85 ms. (46 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 125 ms. (31 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 118 ms. (33 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4002 steps (8 resets) in 129 ms. (30 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 124 ms. (32 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4003 steps (8 resets) in 133 ms. (29 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 1324/1324 properties
Probabilistic random walk after 1000001 steps, saw 364956 distinct states, run finished after 59131 ms. (steps per millisecond=16 ) properties seen :172
// Phase 1: matrix 2256 rows 1952 cols
[2024-06-01 08:22:21] [INFO ] Computed 400 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1152 unsolved
At refinement iteration 1 (OVERLAPS) 249/1401 variables, 167/167 constraints. Problems are: Problem set: 0 solved, 1152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1401 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1152 unsolved
At refinement iteration 3 (OVERLAPS) 1421/2822 variables, 1401/1568 constraints. Problems are: Problem set: 0 solved, 1152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2822 variables, 0/1568 constraints. Problems are: Problem set: 0 solved, 1152 unsolved
SMT process timed out in 150283ms, After SMT, problems are : Problem set: 0 solved, 1152 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1152 out of 1952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1952/1952 places, 2256/2256 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 1952 transition count 2216
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 80 place count 1912 transition count 2216
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 80 place count 1912 transition count 2186
Deduced a syphon composed of 30 places in 9 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 140 place count 1882 transition count 2186
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 145 place count 1877 transition count 2181
Iterating global reduction 2 with 5 rules applied. Total rules applied 150 place count 1877 transition count 2181
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 150 place count 1877 transition count 2176
Deduced a syphon composed of 5 places in 5 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 160 place count 1872 transition count 2176
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 7 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 254 place count 1825 transition count 2129
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 23 places in 5 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 300 place count 1802 transition count 2140
Applied a total of 300 rules in 122 ms. Remains 1802 /1952 variables (removed 150) and now considering 2140/2256 (removed 116) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 1802/1952 places, 2140/2256 transitions.
RANDOM walk for 805453 steps (218 resets) in 120004 ms. (6 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 4004 steps (8 resets) in 117 ms. (33 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 4003 steps (8 resets) in 114 ms. (34 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 4002 steps (8 resets) in 116 ms. (34 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 4004 steps (8 resets) in 108 ms. (36 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 4004 steps (8 resets) in 106 ms. (37 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 4004 steps (8 resets) in 106 ms. (37 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 4003 steps (8 resets) in 85 ms. (46 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 4004 steps (8 resets) in 105 ms. (37 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 4002 steps (8 resets) in 108 ms. (36 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 4003 steps (8 resets) in 115 ms. (34 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 4004 steps (8 resets) in 121 ms. (32 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 4004 steps (8 resets) in 108 ms. (36 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 4003 steps (8 resets) in 112 ms. (35 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 4004 steps (8 resets) in 108 ms. (36 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 4004 steps (8 resets) in 116 ms. (34 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 4004 steps (8 resets) in 115 ms. (34 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 4004 steps (8 resets) in 115 ms. (34 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 4003 steps (8 resets) in 105 ms. (37 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 4003 steps (8 resets) in 112 ms. (35 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 4003 steps (8 resets) in 74 ms. (53 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 4003 steps (8 resets) in 113 ms. (35 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 4003 steps (8 resets) in 122 ms. (32 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 4004 steps (8 resets) in 117 ms. (33 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 4003 steps (8 resets) in 80 ms. (49 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 4004 steps (8 resets) in 106 ms. (37 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 4004 steps (8 resets) in 117 ms. (33 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 4003 steps (8 resets) in 113 ms. (35 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 4002 steps (8 resets) in 91 ms. (43 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 4003 steps (8 resets) in 121 ms. (32 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 4004 steps (8 resets) in 115 ms. (34 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 4003 steps (8 resets) in 91 ms. (43 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 4004 steps (8 resets) in 125 ms. (31 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 4003 steps (8 resets) in 114 ms. (34 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 4002 steps (8 resets) in 114 ms. (34 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 4003 steps (8 resets) in 115 ms. (34 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 1152/1152 properties
Probabilistic random walk after 1000001 steps, saw 368779 distinct states, run finished after 55050 ms. (steps per millisecond=18 ) properties seen :210
// Phase 1: matrix 2140 rows 1802 cols
[2024-06-01 08:26:18] [INFO ] Computed 400 invariants in 12 ms

BK_TIME_CONFINEMENT_REACHED

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -timeout 180 -rebuildPNML

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="ShieldRVt-PT-100B"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 ShieldRVt-PT-100B, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r530-tall-171683779800658"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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