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.r070-tall-171620505000022.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 itstools
Input is CANConstruction-PT-020, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-tall-171620505000022
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 9.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 19:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 12 19:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Apr 12 19:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 12 19:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 641K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CANConstruction-PT-020-ReachabilityCardinality-2024-00
FORMULA_NAME CANConstruction-PT-020-ReachabilityCardinality-2024-01
FORMULA_NAME CANConstruction-PT-020-ReachabilityCardinality-2024-02
FORMULA_NAME CANConstruction-PT-020-ReachabilityCardinality-2024-03
FORMULA_NAME CANConstruction-PT-020-ReachabilityCardinality-2024-04
FORMULA_NAME CANConstruction-PT-020-ReachabilityCardinality-2024-05
FORMULA_NAME CANConstruction-PT-020-ReachabilityCardinality-2024-06
FORMULA_NAME CANConstruction-PT-020-ReachabilityCardinality-2024-07
FORMULA_NAME CANConstruction-PT-020-ReachabilityCardinality-2024-08
FORMULA_NAME CANConstruction-PT-020-ReachabilityCardinality-2024-09
FORMULA_NAME CANConstruction-PT-020-ReachabilityCardinality-2024-10
FORMULA_NAME CANConstruction-PT-020-ReachabilityCardinality-2024-11
FORMULA_NAME CANConstruction-PT-020-ReachabilityCardinality-2024-12
FORMULA_NAME CANConstruction-PT-020-ReachabilityCardinality-2024-13
FORMULA_NAME CANConstruction-PT-020-ReachabilityCardinality-2024-14
FORMULA_NAME CANConstruction-PT-020-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716213502195

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-020
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-20 13:58:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-20 13:58:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 13:58:23] [INFO ] Load time of PNML (sax parser for PT used): 122 ms
[2024-05-20 13:58:23] [INFO ] Transformed 1042 places.
[2024-05-20 13:58:23] [INFO ] Transformed 1760 transitions.
[2024-05-20 13:58:23] [INFO ] Parsed PT model containing 1042 places and 1760 transitions and 5200 arcs in 262 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (113 resets) in 1727 ms. (23 steps per ms) remains 5/16 properties
FORMULA CANConstruction-PT-020-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-020-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-020-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-020-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-020-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-020-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-020-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-020-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-020-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-020-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-020-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 5/5 properties
[2024-05-20 13:58:24] [INFO ] Flatten gal took : 202 ms
BEST_FIRST walk for 40004 steps (8 resets) in 306 ms. (130 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 520 ms. (76 steps per ms) remains 5/5 properties
[2024-05-20 13:58:24] [INFO ] Flatten gal took : 182 ms
BEST_FIRST walk for 40003 steps (8 resets) in 898 ms. (44 steps per ms) remains 5/5 properties
[2024-05-20 13:58:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14478470313676148928.gal : 120 ms
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 5/5 properties
[2024-05-20 13:58:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11062620756483755625.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14478470313676148928.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11062620756483755625.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
// Phase 1: matrix 1760 rows 1042 cols
[2024-05-20 13:58:25] [INFO ] Computed 41 invariants in 41 ms
[2024-05-20 13:58:25] [INFO ] State equation strengthened by 780 read => feed constraints.
Loading property file /tmp/ReachabilityCardinality11062620756483755625.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 882/1023 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 18/1041 variables, 18/41 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1041 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 11
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :11 after 13
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :13 after 15
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :15 after 17
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :17 after 24
At refinement iteration 6 (OVERLAPS) 1760/2801 variables, 1041/1082 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem CANConstruction-PT-020-ReachabilityCardinality-2024-04 is UNSAT
FORMULA CANConstruction-PT-020-ReachabilityCardinality-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (INCLUDED_ONLY) 0/2801 variables, 780/1862 constraints. Problems are: Problem set: 1 solved, 4 unsolved
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :24 after 116
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :116 after 119
At refinement iteration 8 (INCLUDED_ONLY) 0/2801 variables, 0/1862 constraints. Problems are: Problem set: 1 solved, 4 unsolved
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :119 after 138
At refinement iteration 9 (OVERLAPS) 1/2802 variables, 1/1863 constraints. Problems are: Problem set: 1 solved, 4 unsolved
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :138 after 164
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :164 after 271
At refinement iteration 10 (INCLUDED_ONLY) 0/2802 variables, 0/1863 constraints. Problems are: Problem set: 1 solved, 4 unsolved
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :271 after 403
At refinement iteration 11 (OVERLAPS) 0/2802 variables, 0/1863 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2802/2802 variables, and 1863 constraints, problems are : Problem set: 1 solved, 4 unsolved in 1699 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 1042/1042 constraints, ReadFeed: 780/780 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 887/1023 variables, 21/21 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 2/23 constraints. Problems are: Problem set: 1 solved, 4 unsolved
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :403 after 582
[2024-05-20 13:58:27] [INFO ] Deduced a trap composed of 46 places in 444 ms of which 49 ms to minimize.
[2024-05-20 13:58:27] [INFO ] Deduced a trap composed of 44 places in 371 ms of which 8 ms to minimize.
[2024-05-20 13:58:28] [INFO ] Deduced a trap composed of 42 places in 287 ms of which 5 ms to minimize.
[2024-05-20 13:58:28] [INFO ] Deduced a trap composed of 52 places in 256 ms of which 4 ms to minimize.
[2024-05-20 13:58:28] [INFO ] Deduced a trap composed of 43 places in 263 ms of which 4 ms to minimize.
[2024-05-20 13:58:29] [INFO ] Deduced a trap composed of 43 places in 227 ms of which 4 ms to minimize.
[2024-05-20 13:58:29] [INFO ] Deduced a trap composed of 49 places in 208 ms of which 4 ms to minimize.
[2024-05-20 13:58:29] [INFO ] Deduced a trap composed of 44 places in 209 ms of which 3 ms to minimize.
[2024-05-20 13:58:29] [INFO ] Deduced a trap composed of 45 places in 234 ms of which 4 ms to minimize.
[2024-05-20 13:58:30] [INFO ] Deduced a trap composed of 44 places in 213 ms of which 4 ms to minimize.
[2024-05-20 13:58:30] [INFO ] Deduced a trap composed of 47 places in 199 ms of which 5 ms to minimize.
[2024-05-20 13:58:30] [INFO ] Deduced a trap composed of 46 places in 183 ms of which 3 ms to minimize.
[2024-05-20 13:58:30] [INFO ] Deduced a trap composed of 47 places in 200 ms of which 4 ms to minimize.
[2024-05-20 13:58:30] [INFO ] Deduced a trap composed of 45 places in 176 ms of which 3 ms to minimize.
[2024-05-20 13:58:31] [INFO ] Deduced a trap composed of 43 places in 153 ms of which 3 ms to minimize.
[2024-05-20 13:58:31] [INFO ] Deduced a trap composed of 50 places in 126 ms of which 3 ms to minimize.
[2024-05-20 13:58:31] [INFO ] Deduced a trap composed of 45 places in 190 ms of which 4 ms to minimize.
[2024-05-20 13:58:31] [INFO ] Deduced a trap composed of 49 places in 171 ms of which 3 ms to minimize.
SDD proceeding with computation,5 properties remain. new max is 16384
SDD size :582 after 14703
[2024-05-20 13:58:31] [INFO ] Deduced a trap composed of 49 places in 171 ms of which 3 ms to minimize.
[2024-05-20 13:58:32] [INFO ] Deduced a trap composed of 51 places in 144 ms of which 3 ms to minimize.
SMT process timed out in 7035ms, After SMT, problems are : Problem set: 1 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 136 out of 1042 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1042/1042 places, 1760/1760 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 75 place count 1042 transition count 1685
Reduce places removed 75 places and 0 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Iterating post reduction 1 with 98 rules applied. Total rules applied 173 place count 967 transition count 1662
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 196 place count 944 transition count 1662
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 196 place count 944 transition count 1655
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 210 place count 937 transition count 1655
Discarding 312 places :
Symmetric choice reduction at 3 with 312 rule applications. Total rules 522 place count 625 transition count 1031
Iterating global reduction 3 with 312 rules applied. Total rules applied 834 place count 625 transition count 1031
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 844 place count 620 transition count 1026
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -51
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 852 place count 616 transition count 1077
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 854 place count 616 transition count 1075
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 856 place count 614 transition count 1075
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 4 with 10 rules applied. Total rules applied 866 place count 614 transition count 1065
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 876 place count 604 transition count 1065
Partial Free-agglomeration rule applied 30 times.
Drop transitions (Partial Free agglomeration) removed 30 transitions
Iterating global reduction 5 with 30 rules applied. Total rules applied 906 place count 604 transition count 1065
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 909 place count 604 transition count 1065
Applied a total of 909 rules in 370 ms. Remains 604 /1042 variables (removed 438) and now considering 1065/1760 (removed 695) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 380 ms. Remains : 604/1042 places, 1065/1760 transitions.
RANDOM walk for 40000 steps (207 resets) in 413 ms. (96 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (9 resets) in 147 ms. (270 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (11 resets) in 172 ms. (231 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (11 resets) in 232 ms. (171 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (9 resets) in 194 ms. (205 steps per ms) remains 4/4 properties
SDD proceeding with computation,5 properties remain. new max is 32768
SDD size :14703 after 17188
Interrupted probabilistic random walk after 290498 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :0 out of 4
Probabilistic random walk after 290498 steps, saw 52191 distinct states, run finished after 3009 ms. (steps per millisecond=96 ) properties seen :0
// Phase 1: matrix 1065 rows 604 cols
[2024-05-20 13:58:35] [INFO ] Computed 41 invariants in 6 ms
[2024-05-20 13:58:35] [INFO ] State equation strengthened by 852 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 449/585 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/585 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/585 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 18/603 variables, 18/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/603 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1065/1668 variables, 603/644 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1668 variables, 852/1496 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1668 variables, 0/1496 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/1669 variables, 1/1497 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1669 variables, 0/1497 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/1669 variables, 0/1497 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1669/1669 variables, and 1497 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1005 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 604/604 constraints, ReadFeed: 852/852 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 449/585 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/585 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-20 13:58:37] [INFO ] Deduced a trap composed of 27 places in 243 ms of which 3 ms to minimize.
[2024-05-20 13:58:37] [INFO ] Deduced a trap composed of 34 places in 222 ms of which 3 ms to minimize.
[2024-05-20 13:58:37] [INFO ] Deduced a trap composed of 28 places in 253 ms of which 4 ms to minimize.
[2024-05-20 13:58:38] [INFO ] Deduced a trap composed of 29 places in 260 ms of which 7 ms to minimize.
[2024-05-20 13:58:38] [INFO ] Deduced a trap composed of 25 places in 220 ms of which 5 ms to minimize.
SDD proceeding with computation,5 properties remain. new max is 65536
SDD size :17188 after 22966
[2024-05-20 13:58:40] [INFO ] Deduced a trap composed of 26 places in 1874 ms of which 4 ms to minimize.
[2024-05-20 13:58:40] [INFO ] Deduced a trap composed of 27 places in 273 ms of which 5 ms to minimize.
[2024-05-20 13:58:40] [INFO ] Deduced a trap composed of 34 places in 190 ms of which 3 ms to minimize.
[2024-05-20 13:58:41] [INFO ] Deduced a trap composed of 28 places in 220 ms of which 8 ms to minimize.
[2024-05-20 13:58:41] [INFO ] Deduced a trap composed of 28 places in 240 ms of which 6 ms to minimize.
[2024-05-20 13:58:41] [INFO ] Deduced a trap composed of 27 places in 151 ms of which 2 ms to minimize.
[2024-05-20 13:58:41] [INFO ] Deduced a trap composed of 25 places in 153 ms of which 2 ms to minimize.
[2024-05-20 13:58:41] [INFO ] Deduced a trap composed of 28 places in 156 ms of which 2 ms to minimize.
[2024-05-20 13:58:41] [INFO ] Deduced a trap composed of 28 places in 141 ms of which 2 ms to minimize.
[2024-05-20 13:58:42] [INFO ] Deduced a trap composed of 27 places in 211 ms of which 21 ms to minimize.
[2024-05-20 13:58:42] [INFO ] Deduced a trap composed of 29 places in 148 ms of which 2 ms to minimize.
[2024-05-20 13:58:42] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 2 ms to minimize.
[2024-05-20 13:58:42] [INFO ] Deduced a trap composed of 28 places in 160 ms of which 5 ms to minimize.
[2024-05-20 13:58:42] [INFO ] Deduced a trap composed of 27 places in 157 ms of which 4 ms to minimize.
[2024-05-20 13:58:42] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/585 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-20 13:58:43] [INFO ] Deduced a trap composed of 28 places in 251 ms of which 5 ms to minimize.
[2024-05-20 13:58:43] [INFO ] Deduced a trap composed of 31 places in 252 ms of which 5 ms to minimize.
[2024-05-20 13:58:43] [INFO ] Deduced a trap composed of 29 places in 190 ms of which 5 ms to minimize.
[2024-05-20 13:58:43] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 3 ms to minimize.
[2024-05-20 13:58:44] [INFO ] Deduced a trap composed of 31 places in 211 ms of which 5 ms to minimize.
[2024-05-20 13:58:45] [INFO ] Deduced a trap composed of 29 places in 1204 ms of which 2 ms to minimize.
[2024-05-20 13:58:45] [INFO ] Deduced a trap composed of 28 places in 199 ms of which 5 ms to minimize.
[2024-05-20 13:58:45] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 3 ms to minimize.
[2024-05-20 13:58:45] [INFO ] Deduced a trap composed of 27 places in 190 ms of which 5 ms to minimize.
[2024-05-20 13:58:46] [INFO ] Deduced a trap composed of 30 places in 141 ms of which 3 ms to minimize.
[2024-05-20 13:58:46] [INFO ] Deduced a trap composed of 30 places in 144 ms of which 3 ms to minimize.
[2024-05-20 13:58:46] [INFO ] Deduced a trap composed of 31 places in 146 ms of which 2 ms to minimize.
[2024-05-20 13:58:46] [INFO ] Deduced a trap composed of 29 places in 139 ms of which 3 ms to minimize.
[2024-05-20 13:58:46] [INFO ] Deduced a trap composed of 29 places in 148 ms of which 2 ms to minimize.
[2024-05-20 13:58:46] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 2 ms to minimize.
[2024-05-20 13:58:46] [INFO ] Deduced a trap composed of 27 places in 190 ms of which 4 ms to minimize.
[2024-05-20 13:58:47] [INFO ] Deduced a trap composed of 29 places in 188 ms of which 12 ms to minimize.
[2024-05-20 13:58:47] [INFO ] Deduced a trap composed of 29 places in 113 ms of which 2 ms to minimize.
[2024-05-20 13:58:47] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 2 ms to minimize.
[2024-05-20 13:58:47] [INFO ] Deduced a trap composed of 27 places in 161 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/585 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-20 13:58:47] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 1 ms to minimize.
[2024-05-20 13:58:47] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 2 ms to minimize.
[2024-05-20 13:58:47] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 2 ms to minimize.
[2024-05-20 13:58:48] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 2 ms to minimize.
SDD proceeding with computation,5 properties remain. new max is 131072
[2024-05-20 13:58:48] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 2 ms to minimize.
SDD size :22966 after 30185
[2024-05-20 13:58:48] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 3 ms to minimize.
[2024-05-20 13:58:48] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 3 ms to minimize.
[2024-05-20 13:58:48] [INFO ] Deduced a trap composed of 28 places in 150 ms of which 5 ms to minimize.
[2024-05-20 13:58:48] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 2 ms to minimize.
[2024-05-20 13:58:48] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 1 ms to minimize.
[2024-05-20 13:58:49] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 3 ms to minimize.
[2024-05-20 13:58:49] [INFO ] Deduced a trap composed of 28 places in 935 ms of which 2 ms to minimize.
[2024-05-20 13:58:50] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-05-20 13:58:50] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-05-20 13:58:50] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-05-20 13:58:50] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 2 ms to minimize.
[2024-05-20 13:58:50] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 2 ms to minimize.
[2024-05-20 13:58:50] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 1 ms to minimize.
[2024-05-20 13:58:50] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 1 ms to minimize.
[2024-05-20 13:58:50] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/585 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-20 13:58:50] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 2 ms to minimize.
[2024-05-20 13:58:50] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 2 ms to minimize.
[2024-05-20 13:58:50] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 2 ms to minimize.
[2024-05-20 13:58:51] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2024-05-20 13:58:51] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 2 ms to minimize.
[2024-05-20 13:58:51] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2024-05-20 13:58:51] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 2 ms to minimize.
[2024-05-20 13:58:51] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-05-20 13:58:51] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 2 ms to minimize.
[2024-05-20 13:58:51] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2024-05-20 13:58:51] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-05-20 13:58:51] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-20 13:58:51] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-20 13:58:51] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-05-20 13:58:51] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 1 ms to minimize.
[2024-05-20 13:58:52] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 2 ms to minimize.
[2024-05-20 13:58:52] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 2 ms to minimize.
[2024-05-20 13:58:52] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 2 ms to minimize.
[2024-05-20 13:58:52] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 2 ms to minimize.
[2024-05-20 13:58:52] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/585 variables, 20/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-20 13:58:52] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 2 ms to minimize.
[2024-05-20 13:58:52] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2024-05-20 13:58:52] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2024-05-20 13:58:52] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2024-05-20 13:58:52] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-05-20 13:58:52] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 2 ms to minimize.
[2024-05-20 13:58:52] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 2 ms to minimize.
[2024-05-20 13:58:53] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-05-20 13:58:53] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-20 13:58:53] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 2 ms to minimize.
[2024-05-20 13:58:53] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/585 variables, 11/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-20 13:58:53] [INFO ] Deduced a trap composed of 28 places in 119 ms of which 3 ms to minimize.
[2024-05-20 13:58:53] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 2 ms to minimize.
[2024-05-20 13:58:53] [INFO ] Deduced a trap composed of 28 places in 116 ms of which 3 ms to minimize.
[2024-05-20 13:58:53] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 2 ms to minimize.
[2024-05-20 13:58:54] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 2 ms to minimize.
[2024-05-20 13:58:54] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 2 ms to minimize.
[2024-05-20 13:58:54] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/585 variables, 7/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-20 13:58:54] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2024-05-20 13:58:54] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 2 ms to minimize.
[2024-05-20 13:58:54] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2024-05-20 13:58:54] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-05-20 13:58:54] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/585 variables, 5/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-20 13:58:54] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/585 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/585 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 18/603 variables, 18/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-20 13:58:55] [INFO ] Deduced a trap composed of 28 places in 126 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/603 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-20 13:58:55] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/603 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/603 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 1065/1668 variables, 603/750 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem CANConstruction-PT-020-ReachabilityCardinality-2024-10 is UNSAT
FORMULA CANConstruction-PT-020-ReachabilityCardinality-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 17 (INCLUDED_ONLY) 0/1668 variables, 852/1602 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1668 variables, 3/1605 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1668 variables, 0/1605 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 1/1669 variables, 1/1606 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1669 variables, 0/1606 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 0/1669 variables, 0/1606 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1669/1669 variables, and 1606 constraints, problems are : Problem set: 1 solved, 3 unsolved in 19844 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 604/604 constraints, ReadFeed: 852/852 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 106/106 constraints]
After SMT, in 20935ms problems are : Problem set: 1 solved, 3 unsolved
FORMULA CANConstruction-PT-020-ReachabilityCardinality-2024-13 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 322 ms.
Support contains 61 out of 604 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 604/604 places, 1065/1065 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 604 transition count 1056
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 19 place count 595 transition count 1055
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 594 transition count 1055
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 20 place count 594 transition count 1054
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 22 place count 593 transition count 1054
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 34 place count 581 transition count 1030
Iterating global reduction 3 with 12 rules applied. Total rules applied 46 place count 581 transition count 1030
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 84 place count 562 transition count 1011
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 98 place count 555 transition count 1014
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 99 place count 555 transition count 1013
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 100 place count 554 transition count 1013
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 101 place count 553 transition count 1011
Iterating global reduction 4 with 1 rules applied. Total rules applied 102 place count 553 transition count 1011
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 103 place count 553 transition count 1010
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 104 place count 552 transition count 1010
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 110 place count 552 transition count 1010
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 111 place count 552 transition count 1010
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 112 place count 551 transition count 1008
Iterating global reduction 5 with 1 rules applied. Total rules applied 113 place count 551 transition count 1008
Applied a total of 113 rules in 277 ms. Remains 551 /604 variables (removed 53) and now considering 1008/1065 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 277 ms. Remains : 551/604 places, 1008/1065 transitions.
RANDOM walk for 40000 steps (264 resets) in 494 ms. (80 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (12 resets) in 119 ms. (333 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (12 resets) in 167 ms. (238 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 383996 steps, run timeout after 3001 ms. (steps per millisecond=127 ) properties seen :0 out of 2
Probabilistic random walk after 383996 steps, saw 63309 distinct states, run finished after 3001 ms. (steps per millisecond=127 ) properties seen :0
// Phase 1: matrix 1008 rows 551 cols
[2024-05-20 13:59:00] [INFO ] Computed 41 invariants in 12 ms
[2024-05-20 13:59:00] [INFO ] State equation strengthened by 890 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 468/529 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/529 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/530 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/530 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 20/550 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/550 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1008/1558 variables, 550/591 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1558 variables, 890/1481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1558 variables, 0/1481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/1559 variables, 1/1482 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1559 variables, 0/1482 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/1559 variables, 0/1482 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1559/1559 variables, and 1482 constraints, problems are : Problem set: 0 solved, 2 unsolved in 602 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 551/551 constraints, ReadFeed: 890/890 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 468/529 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 13:59:01] [INFO ] Deduced a trap composed of 2 places in 175 ms of which 3 ms to minimize.
[2024-05-20 13:59:01] [INFO ] Deduced a trap composed of 29 places in 145 ms of which 3 ms to minimize.
[2024-05-20 13:59:01] [INFO ] Deduced a trap composed of 26 places in 142 ms of which 3 ms to minimize.
[2024-05-20 13:59:01] [INFO ] Deduced a trap composed of 25 places in 137 ms of which 2 ms to minimize.
[2024-05-20 13:59:02] [INFO ] Deduced a trap composed of 26 places in 140 ms of which 2 ms to minimize.
[2024-05-20 13:59:02] [INFO ] Deduced a trap composed of 29 places in 139 ms of which 3 ms to minimize.
[2024-05-20 13:59:02] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 2 ms to minimize.
[2024-05-20 13:59:02] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 2 ms to minimize.
[2024-05-20 13:59:02] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 3 ms to minimize.
[2024-05-20 13:59:02] [INFO ] Deduced a trap composed of 28 places in 129 ms of which 2 ms to minimize.
[2024-05-20 13:59:02] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 2 ms to minimize.
[2024-05-20 13:59:03] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 3 ms to minimize.
[2024-05-20 13:59:03] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 3 ms to minimize.
[2024-05-20 13:59:03] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 2 ms to minimize.
[2024-05-20 13:59:03] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 2 ms to minimize.
[2024-05-20 13:59:03] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 2 ms to minimize.
[2024-05-20 13:59:03] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 3 ms to minimize.
[2024-05-20 13:59:03] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 2 ms to minimize.
[2024-05-20 13:59:03] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 2 ms to minimize.
[2024-05-20 13:59:04] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/529 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 13:59:04] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 2 ms to minimize.
[2024-05-20 13:59:04] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 2 ms to minimize.
[2024-05-20 13:59:04] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 2 ms to minimize.
[2024-05-20 13:59:04] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 2 ms to minimize.
[2024-05-20 13:59:04] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 3 ms to minimize.
[2024-05-20 13:59:04] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 2 ms to minimize.
[2024-05-20 13:59:04] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 2 ms to minimize.
[2024-05-20 13:59:05] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 2 ms to minimize.
[2024-05-20 13:59:05] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 2 ms to minimize.
[2024-05-20 13:59:05] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 3 ms to minimize.
[2024-05-20 13:59:05] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 2 ms to minimize.
[2024-05-20 13:59:05] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 2 ms to minimize.
[2024-05-20 13:59:05] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-05-20 13:59:05] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 2 ms to minimize.
[2024-05-20 13:59:05] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 2 ms to minimize.
[2024-05-20 13:59:05] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 3 ms to minimize.
[2024-05-20 13:59:06] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 2 ms to minimize.
[2024-05-20 13:59:06] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 3 ms to minimize.
[2024-05-20 13:59:06] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 2 ms to minimize.
[2024-05-20 13:59:06] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/529 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 13:59:06] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 2 ms to minimize.
[2024-05-20 13:59:06] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 2 ms to minimize.
[2024-05-20 13:59:06] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 2 ms to minimize.
[2024-05-20 13:59:06] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 2 ms to minimize.
[2024-05-20 13:59:06] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 3 ms to minimize.
[2024-05-20 13:59:07] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 1 ms to minimize.
[2024-05-20 13:59:07] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 2 ms to minimize.
[2024-05-20 13:59:07] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 2 ms to minimize.
[2024-05-20 13:59:07] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 2 ms to minimize.
[2024-05-20 13:59:07] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 2 ms to minimize.
[2024-05-20 13:59:07] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 2 ms to minimize.
[2024-05-20 13:59:07] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2024-05-20 13:59:07] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 2 ms to minimize.
[2024-05-20 13:59:07] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-05-20 13:59:07] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 2 ms to minimize.
[2024-05-20 13:59:07] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 2 ms to minimize.
[2024-05-20 13:59:08] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/529 variables, 17/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 13:59:08] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 1 ms to minimize.
[2024-05-20 13:59:08] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
[2024-05-20 13:59:08] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 2 ms to minimize.
[2024-05-20 13:59:08] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/529 variables, 4/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 13:59:08] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 2 ms to minimize.
[2024-05-20 13:59:08] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 2 ms to minimize.
[2024-05-20 13:59:08] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 2 ms to minimize.
[2024-05-20 13:59:08] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 2 ms to minimize.
[2024-05-20 13:59:08] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/529 variables, 5/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/529 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/530 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 13:59:09] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 2 ms to minimize.
[2024-05-20 13:59:09] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 3 ms to minimize.
[2024-05-20 13:59:09] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 2 ms to minimize.
[2024-05-20 13:59:09] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 3 ms to minimize.
[2024-05-20 13:59:09] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 3 ms to minimize.
[2024-05-20 13:59:09] [INFO ] Deduced a trap composed of 29 places in 113 ms of which 3 ms to minimize.
[2024-05-20 13:59:09] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 3 ms to minimize.
[2024-05-20 13:59:09] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 2 ms to minimize.
[2024-05-20 13:59:10] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 3 ms to minimize.
[2024-05-20 13:59:10] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 2 ms to minimize.
[2024-05-20 13:59:10] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
[2024-05-20 13:59:10] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-05-20 13:59:10] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 3 ms to minimize.
[2024-05-20 13:59:10] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 3 ms to minimize.
[2024-05-20 13:59:10] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 2 ms to minimize.
[2024-05-20 13:59:10] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 2 ms to minimize.
[2024-05-20 13:59:11] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 17/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/530 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 20/550 variables, 20/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 13:59:11] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 3 ms to minimize.
[2024-05-20 13:59:11] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 3 ms to minimize.
[2024-05-20 13:59:11] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 2 ms to minimize.
[2024-05-20 13:59:11] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 2 ms to minimize.
[2024-05-20 13:59:11] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 2 ms to minimize.
[2024-05-20 13:59:11] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 2 ms to minimize.
[2024-05-20 13:59:11] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 2 ms to minimize.
[2024-05-20 13:59:11] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 2 ms to minimize.
[2024-05-20 13:59:12] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 2 ms to minimize.
[2024-05-20 13:59:12] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 4 ms to minimize.
[2024-05-20 13:59:12] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/550 variables, 11/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/550 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1008/1558 variables, 550/685 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1558 variables, 890/1575 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1558 variables, 2/1577 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1558 variables, 0/1577 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/1559 variables, 1/1578 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1559 variables, 0/1578 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1559 variables, 0/1578 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1559/1559 variables, and 1578 constraints, problems are : Problem set: 0 solved, 2 unsolved in 11861 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 551/551 constraints, ReadFeed: 890/890 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 94/94 constraints]
After SMT, in 12515ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 118 ms.
Support contains 61 out of 551 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 551/551 places, 1008/1008 transitions.
Applied a total of 0 rules in 25 ms. Remains 551 /551 variables (removed 0) and now considering 1008/1008 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 551/551 places, 1008/1008 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 551/551 places, 1008/1008 transitions.
Applied a total of 0 rules in 27 ms. Remains 551 /551 variables (removed 0) and now considering 1008/1008 (removed 0) transitions.
[2024-05-20 13:59:13] [INFO ] Invariant cache hit.
[2024-05-20 13:59:13] [INFO ] Implicit Places using invariants in 313 ms returned [5, 12, 19, 26, 32, 38, 47, 55, 60, 64, 70, 78, 86, 93, 99, 105, 111, 117, 124, 131]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 322 ms to find 20 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 531/551 places, 1008/1008 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 531 transition count 1005
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 528 transition count 1005
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 11 place count 523 transition count 1000
Iterating global reduction 2 with 5 rules applied. Total rules applied 16 place count 523 transition count 1000
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 62 place count 500 transition count 977
Applied a total of 62 rules in 210 ms. Remains 500 /531 variables (removed 31) and now considering 977/1008 (removed 31) transitions.
// Phase 1: matrix 977 rows 500 cols
[2024-05-20 13:59:13] [INFO ] Computed 21 invariants in 5 ms
[2024-05-20 13:59:14] [INFO ] Implicit Places using invariants in 234 ms returned []
[2024-05-20 13:59:14] [INFO ] Invariant cache hit.
[2024-05-20 13:59:14] [INFO ] State equation strengthened by 862 read => feed constraints.
[2024-05-20 13:59:15] [INFO ] Implicit Places using invariants and state equation in 1693 ms returned []
Implicit Place search using SMT with State Equation took 1932 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 500/551 places, 977/1008 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2491 ms. Remains : 500/551 places, 977/1008 transitions.
RANDOM walk for 40000 steps (274 resets) in 411 ms. (97 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (12 resets) in 86 ms. (459 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (13 resets) in 107 ms. (370 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 413375 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :0 out of 2
Probabilistic random walk after 413375 steps, saw 66769 distinct states, run finished after 3001 ms. (steps per millisecond=137 ) properties seen :0
[2024-05-20 13:59:19] [INFO ] Invariant cache hit.
[2024-05-20 13:59:19] [INFO ] State equation strengthened by 862 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 437/498 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/498 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/499 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/499 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 977/1476 variables, 499/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1476 variables, 862/1382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1476 variables, 0/1382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/1477 variables, 1/1383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1477 variables, 0/1383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1477 variables, 0/1383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1477/1477 variables, and 1383 constraints, problems are : Problem set: 0 solved, 2 unsolved in 519 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 500/500 constraints, ReadFeed: 862/862 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 437/498 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 13:59:19] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 3 ms to minimize.
[2024-05-20 13:59:19] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 3 ms to minimize.
[2024-05-20 13:59:20] [INFO ] Deduced a trap composed of 28 places in 141 ms of which 3 ms to minimize.
[2024-05-20 13:59:20] [INFO ] Deduced a trap composed of 25 places in 144 ms of which 2 ms to minimize.
[2024-05-20 13:59:20] [INFO ] Deduced a trap composed of 25 places in 157 ms of which 3 ms to minimize.
[2024-05-20 13:59:20] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 3 ms to minimize.
[2024-05-20 13:59:20] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 3 ms to minimize.
[2024-05-20 13:59:20] [INFO ] Deduced a trap composed of 27 places in 140 ms of which 3 ms to minimize.
[2024-05-20 13:59:20] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 3 ms to minimize.
[2024-05-20 13:59:21] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 2 ms to minimize.
[2024-05-20 13:59:21] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 3 ms to minimize.
[2024-05-20 13:59:21] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 3 ms to minimize.
[2024-05-20 13:59:21] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 2 ms to minimize.
[2024-05-20 13:59:21] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 2 ms to minimize.
[2024-05-20 13:59:21] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 3 ms to minimize.
[2024-05-20 13:59:21] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 2 ms to minimize.
[2024-05-20 13:59:21] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
[2024-05-20 13:59:22] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 3 ms to minimize.
[2024-05-20 13:59:22] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 2 ms to minimize.
[2024-05-20 13:59:22] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/498 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 13:59:22] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 3 ms to minimize.
[2024-05-20 13:59:22] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 2 ms to minimize.
[2024-05-20 13:59:22] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 2 ms to minimize.
[2024-05-20 13:59:22] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 2 ms to minimize.
[2024-05-20 13:59:22] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 2 ms to minimize.
[2024-05-20 13:59:23] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 2 ms to minimize.
[2024-05-20 13:59:23] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 2 ms to minimize.
[2024-05-20 13:59:23] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 2 ms to minimize.
[2024-05-20 13:59:23] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 3 ms to minimize.
[2024-05-20 13:59:23] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 2 ms to minimize.
[2024-05-20 13:59:23] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 2 ms to minimize.
[2024-05-20 13:59:23] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 2 ms to minimize.
[2024-05-20 13:59:23] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 2 ms to minimize.
[2024-05-20 13:59:23] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 2 ms to minimize.
[2024-05-20 13:59:23] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 3 ms to minimize.
[2024-05-20 13:59:24] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 3 ms to minimize.
[2024-05-20 13:59:24] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 2 ms to minimize.
[2024-05-20 13:59:24] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 2 ms to minimize.
[2024-05-20 13:59:24] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 2 ms to minimize.
[2024-05-20 13:59:24] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/498 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 13:59:24] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 3 ms to minimize.
[2024-05-20 13:59:24] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 2 ms to minimize.
[2024-05-20 13:59:24] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 2 ms to minimize.
[2024-05-20 13:59:24] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 1 ms to minimize.
[2024-05-20 13:59:24] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 2 ms to minimize.
[2024-05-20 13:59:25] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 2 ms to minimize.
[2024-05-20 13:59:25] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 2 ms to minimize.
[2024-05-20 13:59:25] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 2 ms to minimize.
[2024-05-20 13:59:25] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 2 ms to minimize.
[2024-05-20 13:59:25] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
[2024-05-20 13:59:25] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 2 ms to minimize.
[2024-05-20 13:59:25] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 2 ms to minimize.
[2024-05-20 13:59:25] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 1 ms to minimize.
[2024-05-20 13:59:25] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 3 ms to minimize.
[2024-05-20 13:59:26] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 2 ms to minimize.
[2024-05-20 13:59:26] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 2 ms to minimize.
[2024-05-20 13:59:26] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 2 ms to minimize.
[2024-05-20 13:59:26] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 2 ms to minimize.
[2024-05-20 13:59:26] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 2 ms to minimize.
[2024-05-20 13:59:26] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/498 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/498 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/499 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 977/1476 variables, 499/580 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1476 variables, 862/1442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1476 variables, 2/1444 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1476 variables, 0/1444 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/1477 variables, 1/1445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1477 variables, 0/1445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/1477 variables, 0/1445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1477/1477 variables, and 1445 constraints, problems are : Problem set: 0 solved, 2 unsolved in 7754 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 500/500 constraints, ReadFeed: 862/862 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 60/60 constraints]
After SMT, in 8320ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 158 ms.
Support contains 61 out of 500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 977/977 transitions.
Applied a total of 0 rules in 76 ms. Remains 500 /500 variables (removed 0) and now considering 977/977 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 500/500 places, 977/977 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 977/977 transitions.
Applied a total of 0 rules in 56 ms. Remains 500 /500 variables (removed 0) and now considering 977/977 (removed 0) transitions.
[2024-05-20 13:59:27] [INFO ] Invariant cache hit.
[2024-05-20 13:59:27] [INFO ] Implicit Places using invariants in 270 ms returned []
[2024-05-20 13:59:27] [INFO ] Invariant cache hit.
[2024-05-20 13:59:28] [INFO ] State equation strengthened by 862 read => feed constraints.
[2024-05-20 13:59:29] [INFO ] Implicit Places using invariants and state equation in 1681 ms returned []
Implicit Place search using SMT with State Equation took 1953 ms to find 0 implicit places.
[2024-05-20 13:59:29] [INFO ] Redundant transitions in 57 ms returned []
Running 957 sub problems to find dead transitions.
[2024-05-20 13:59:29] [INFO ] Invariant cache hit.
[2024-05-20 13:59:29] [INFO ] State equation strengthened by 862 read => feed constraints.
SDD proceeding with computation,5 properties remain. new max is 262144
SDD size :30185 after 588119
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 957 unsolved
[2024-05-20 13:59:37] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 2 ms to minimize.
[2024-05-20 13:59:37] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 2 ms to minimize.
[2024-05-20 13:59:37] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 2 ms to minimize.
[2024-05-20 13:59:37] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 2 ms to minimize.
[2024-05-20 13:59:37] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 2 ms to minimize.
[2024-05-20 13:59:37] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-05-20 13:59:37] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 2 ms to minimize.
[2024-05-20 13:59:37] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 2 ms to minimize.
[2024-05-20 13:59:38] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 2 ms to minimize.
[2024-05-20 13:59:38] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 2 ms to minimize.
[2024-05-20 13:59:38] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 2 ms to minimize.
[2024-05-20 13:59:38] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 2 ms to minimize.
[2024-05-20 13:59:38] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 2 ms to minimize.
[2024-05-20 13:59:38] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 2 ms to minimize.
[2024-05-20 13:59:38] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
[2024-05-20 13:59:38] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2024-05-20 13:59:38] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 2 ms to minimize.
[2024-05-20 13:59:38] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 2 ms to minimize.
[2024-05-20 13:59:39] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 2 ms to minimize.
[2024-05-20 13:59:39] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 957 unsolved
[2024-05-20 13:59:39] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-05-20 13:59:39] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 2 ms to minimize.
[2024-05-20 13:59:39] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 2 ms to minimize.
[2024-05-20 13:59:39] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 2 ms to minimize.
[2024-05-20 13:59:39] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 2 ms to minimize.
[2024-05-20 13:59:40] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 2 ms to minimize.
[2024-05-20 13:59:40] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 2 ms to minimize.
[2024-05-20 13:59:40] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 2 ms to minimize.
[2024-05-20 13:59:40] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 2 ms to minimize.
[2024-05-20 13:59:40] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 2 ms to minimize.
[2024-05-20 13:59:40] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 2 ms to minimize.
[2024-05-20 13:59:40] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 2 ms to minimize.
[2024-05-20 13:59:40] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 2 ms to minimize.
[2024-05-20 13:59:40] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 2 ms to minimize.
[2024-05-20 13:59:40] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2024-05-20 13:59:41] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 2 ms to minimize.
[2024-05-20 13:59:41] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 1 ms to minimize.
[2024-05-20 13:59:41] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 2 ms to minimize.
[2024-05-20 13:59:41] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 2 ms to minimize.
[2024-05-20 13:59:41] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 957 unsolved
[2024-05-20 13:59:41] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2024-05-20 13:59:42] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 2 ms to minimize.
[2024-05-20 13:59:42] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-05-20 13:59:42] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 2 ms to minimize.
[2024-05-20 13:59:42] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-05-20 13:59:42] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 2 ms to minimize.
[2024-05-20 13:59:42] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-05-20 13:59:42] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2024-05-20 13:59:42] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-05-20 13:59:42] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-05-20 13:59:42] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 2 ms to minimize.
[2024-05-20 13:59:42] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 2 ms to minimize.
[2024-05-20 13:59:42] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 2 ms to minimize.
[2024-05-20 13:59:43] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2024-05-20 13:59:43] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 2 ms to minimize.
[2024-05-20 13:59:43] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 1 ms to minimize.
[2024-05-20 13:59:43] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 1 ms to minimize.
[2024-05-20 13:59:43] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 2 ms to minimize.
[2024-05-20 13:59:43] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 2 ms to minimize.
[2024-05-20 13:59:43] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/499 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 957 unsolved
[2024-05-20 13:59:51] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 2 ms to minimize.
[2024-05-20 13:59:51] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 2 ms to minimize.
[2024-05-20 13:59:51] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 2 ms to minimize.
[2024-05-20 13:59:51] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
[2024-05-20 13:59:51] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 3 ms to minimize.
[2024-05-20 13:59:51] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 2 ms to minimize.
[2024-05-20 13:59:51] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 2 ms to minimize.
[2024-05-20 13:59:52] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 2 ms to minimize.
[2024-05-20 13:59:52] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 2 ms to minimize.
[2024-05-20 13:59:52] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 2 ms to minimize.
[2024-05-20 13:59:52] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 2 ms to minimize.
[2024-05-20 13:59:52] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 2 ms to minimize.
[2024-05-20 13:59:52] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 2 ms to minimize.
[2024-05-20 13:59:52] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 2 ms to minimize.
[2024-05-20 13:59:52] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 2 ms to minimize.
[2024-05-20 13:59:52] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 2 ms to minimize.
[2024-05-20 13:59:53] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 2 ms to minimize.
[2024-05-20 13:59:53] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 3 ms to minimize.
[2024-05-20 13:59:53] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 2 ms to minimize.
[2024-05-20 13:59:53] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/499 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 957 unsolved
[2024-05-20 13:59:53] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2024-05-20 13:59:54] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2024-05-20 13:59:54] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 1 ms to minimize.
[2024-05-20 13:59:54] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 2 ms to minimize.
[2024-05-20 13:59:54] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 2 ms to minimize.
[2024-05-20 13:59:54] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 2 ms to minimize.
[2024-05-20 13:59:54] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 2 ms to minimize.
[2024-05-20 13:59:54] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 2 ms to minimize.
[2024-05-20 13:59:54] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 2 ms to minimize.
[2024-05-20 13:59:55] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 2 ms to minimize.
[2024-05-20 13:59:55] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2024-05-20 13:59:55] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 3 ms to minimize.
[2024-05-20 13:59:55] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 2 ms to minimize.
[2024-05-20 13:59:55] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 2 ms to minimize.
[2024-05-20 13:59:55] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 2 ms to minimize.
[2024-05-20 13:59:55] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 2 ms to minimize.
[2024-05-20 13:59:55] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 2 ms to minimize.
[2024-05-20 13:59:55] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 2 ms to minimize.
[2024-05-20 13:59:56] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 2 ms to minimize.
[2024-05-20 13:59:56] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/499 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 957 unsolved
[2024-05-20 13:59:56] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 2 ms to minimize.
[2024-05-20 13:59:57] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 2 ms to minimize.
[2024-05-20 13:59:57] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 2 ms to minimize.
[2024-05-20 13:59:57] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 2 ms to minimize.
[2024-05-20 13:59:57] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 2 ms to minimize.
[2024-05-20 13:59:57] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 2 ms to minimize.
[2024-05-20 13:59:57] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 2 ms to minimize.
[2024-05-20 13:59:57] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 2 ms to minimize.
[2024-05-20 13:59:57] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
[2024-05-20 13:59:57] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 2 ms to minimize.
[2024-05-20 13:59:57] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 2 ms to minimize.
[2024-05-20 13:59:58] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 2 ms to minimize.
[2024-05-20 13:59:58] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2024-05-20 13:59:58] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-05-20 13:59:58] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 2 ms to minimize.
[2024-05-20 13:59:58] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 2 ms to minimize.
[2024-05-20 13:59:58] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
[2024-05-20 13:59:58] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 2 ms to minimize.
[2024-05-20 13:59:58] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 1 ms to minimize.
[2024-05-20 13:59:58] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 957 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 499/1477 variables, and 141 constraints, problems are : Problem set: 0 solved, 957 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 0/500 constraints, ReadFeed: 0/862 constraints, PredecessorRefiner: 957/957 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 0 solved, 957 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 957 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 120/141 constraints. Problems are: Problem set: 0 solved, 957 unsolved
[2024-05-20 14:00:01] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-05-20 14:00:01] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 2 ms to minimize.
[2024-05-20 14:00:01] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2024-05-20 14:00:01] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 2 ms to minimize.
[2024-05-20 14:00:01] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 2 ms to minimize.
[2024-05-20 14:00:01] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 2 ms to minimize.
[2024-05-20 14:00:02] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 2 ms to minimize.
[2024-05-20 14:00:02] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 2 ms to minimize.
[2024-05-20 14:00:02] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 2 ms to minimize.
[2024-05-20 14:00:02] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 3 ms to minimize.
[2024-05-20 14:00:02] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 2 ms to minimize.
[2024-05-20 14:00:02] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 2 ms to minimize.
[2024-05-20 14:00:02] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 3 ms to minimize.
[2024-05-20 14:00:02] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 2 ms to minimize.
[2024-05-20 14:00:02] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 2 ms to minimize.
[2024-05-20 14:00:03] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 2 ms to minimize.
[2024-05-20 14:00:03] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 1 ms to minimize.
[2024-05-20 14:00:03] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 2 ms to minimize.
[2024-05-20 14:00:03] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 2 ms to minimize.
[2024-05-20 14:00:03] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 957 unsolved
[2024-05-20 14:00:04] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 2 ms to minimize.
[2024-05-20 14:00:04] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 1 ms to minimize.
[2024-05-20 14:00:04] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 2 ms to minimize.
[2024-05-20 14:00:04] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 2 ms to minimize.
[2024-05-20 14:00:04] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 2 ms to minimize.
[2024-05-20 14:00:04] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 2 ms to minimize.
[2024-05-20 14:00:04] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 2 ms to minimize.
[2024-05-20 14:00:05] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2024-05-20 14:00:05] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-05-20 14:00:05] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 2 ms to minimize.
[2024-05-20 14:00:05] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 2 ms to minimize.
[2024-05-20 14:00:05] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-20 14:00:05] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 2 ms to minimize.
[2024-05-20 14:00:05] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 2 ms to minimize.
[2024-05-20 14:00:05] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 2 ms to minimize.
[2024-05-20 14:00:05] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 2 ms to minimize.
[2024-05-20 14:00:05] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 2 ms to minimize.
[2024-05-20 14:00:05] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 2 ms to minimize.
[2024-05-20 14:00:06] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 2 ms to minimize.
[2024-05-20 14:00:06] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/499 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 957 unsolved
[2024-05-20 14:00:07] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 2 ms to minimize.
[2024-05-20 14:00:07] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 2 ms to minimize.
[2024-05-20 14:00:07] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-05-20 14:00:07] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 1 ms to minimize.
[2024-05-20 14:00:07] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-05-20 14:00:07] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 2 ms to minimize.
[2024-05-20 14:00:07] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
[2024-05-20 14:00:07] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 2 ms to minimize.
[2024-05-20 14:00:07] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 2 ms to minimize.
[2024-05-20 14:00:07] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2024-05-20 14:00:08] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 2 ms to minimize.
[2024-05-20 14:00:08] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2024-05-20 14:00:08] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 2 ms to minimize.
[2024-05-20 14:00:08] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 2 ms to minimize.
[2024-05-20 14:00:08] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-20 14:00:08] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-05-20 14:00:08] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-20 14:00:08] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-20 14:00:08] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-20 14:00:08] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/499 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 957 unsolved
[2024-05-20 14:00:09] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
[2024-05-20 14:00:09] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 2 ms to minimize.
[2024-05-20 14:00:09] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 2 ms to minimize.
[2024-05-20 14:00:09] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 2 ms to minimize.
[2024-05-20 14:00:10] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 2 ms to minimize.
[2024-05-20 14:00:10] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 2 ms to minimize.
[2024-05-20 14:00:10] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 2 ms to minimize.
[2024-05-20 14:00:10] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 1 ms to minimize.
[2024-05-20 14:00:10] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 2 ms to minimize.
[2024-05-20 14:00:10] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 2 ms to minimize.
[2024-05-20 14:00:10] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 2 ms to minimize.
[2024-05-20 14:00:10] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 2 ms to minimize.
[2024-05-20 14:00:10] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 2 ms to minimize.
[2024-05-20 14:00:10] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 2 ms to minimize.
[2024-05-20 14:00:11] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 2 ms to minimize.
[2024-05-20 14:00:11] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-05-20 14:00:11] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 2 ms to minimize.
[2024-05-20 14:00:11] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 2 ms to minimize.
[2024-05-20 14:00:11] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2024-05-20 14:00:11] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/499 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 957 unsolved
[2024-05-20 14:00:12] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 2 ms to minimize.
[2024-05-20 14:00:12] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 2 ms to minimize.
[2024-05-20 14:00:12] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 3 ms to minimize.
[2024-05-20 14:00:12] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 2 ms to minimize.
[2024-05-20 14:00:12] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 2 ms to minimize.
[2024-05-20 14:00:12] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 2 ms to minimize.
[2024-05-20 14:00:13] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 2 ms to minimize.
[2024-05-20 14:00:13] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 2 ms to minimize.
[2024-05-20 14:00:13] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 2 ms to minimize.
[2024-05-20 14:00:13] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 2 ms to minimize.
[2024-05-20 14:00:13] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 1 ms to minimize.
[2024-05-20 14:00:13] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 2 ms to minimize.
[2024-05-20 14:00:13] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2024-05-20 14:00:13] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2024-05-20 14:00:13] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-05-20 14:00:13] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 ms to minimize.
[2024-05-20 14:00:14] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 2 ms to minimize.
[2024-05-20 14:00:14] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 2 ms to minimize.
[2024-05-20 14:00:14] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-05-20 14:00:14] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 20/241 constraints. Problems are: Problem set: 0 solved, 957 unsolved
[2024-05-20 14:00:15] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 2 ms to minimize.
[2024-05-20 14:00:15] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 2 ms to minimize.
[2024-05-20 14:00:15] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 2 ms to minimize.
[2024-05-20 14:00:15] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 2 ms to minimize.
[2024-05-20 14:00:15] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-05-20 14:00:15] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-05-20 14:00:15] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-05-20 14:00:16] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 2 ms to minimize.
[2024-05-20 14:00:16] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2024-05-20 14:00:16] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-05-20 14:00:16] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-20 14:00:16] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 17 ms to minimize.
[2024-05-20 14:00:16] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-20 14:00:16] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 2 ms to minimize.
[2024-05-20 14:00:16] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 2 ms to minimize.
[2024-05-20 14:00:16] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 2 ms to minimize.
[2024-05-20 14:00:16] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-20 14:00:16] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-05-20 14:00:16] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-20 14:00:16] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 20/261 constraints. Problems are: Problem set: 0 solved, 957 unsolved
[2024-05-20 14:00:18] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 1 ms to minimize.
[2024-05-20 14:00:18] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2024-05-20 14:00:18] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-20 14:00:18] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-05-20 14:00:18] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-20 14:00:18] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2024-05-20 14:00:18] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-05-20 14:00:18] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-20 14:00:18] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 2 ms to minimize.
[2024-05-20 14:00:18] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 2 ms to minimize.
[2024-05-20 14:00:18] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-20 14:00:18] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-20 14:00:19] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-20 14:00:19] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-20 14:00:19] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 2 ms to minimize.
[2024-05-20 14:00:19] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 2 ms to minimize.
[2024-05-20 14:00:19] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-20 14:00:19] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 2 ms to minimize.
[2024-05-20 14:00:19] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 2 ms to minimize.
[2024-05-20 14:00:19] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 20/281 constraints. Problems are: Problem set: 0 solved, 957 unsolved
SDD proceeding with computation,5 properties remain. new max is 524288
[2024-05-20 14:00:20] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-20 14:00:20] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-20 14:00:21] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 2 ms to minimize.
[2024-05-20 14:00:21] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-20 14:00:21] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
SDD size :588119 after 705331
[2024-05-20 14:00:21] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-05-20 14:00:21] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 2 ms to minimize.
[2024-05-20 14:00:21] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-05-20 14:00:21] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 2 ms to minimize.
[2024-05-20 14:00:21] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 2 ms to minimize.
[2024-05-20 14:00:21] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 2 ms to minimize.
[2024-05-20 14:00:21] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 2 ms to minimize.
[2024-05-20 14:00:21] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 2 ms to minimize.
[2024-05-20 14:00:22] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 2 ms to minimize.
[2024-05-20 14:00:22] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 2 ms to minimize.
[2024-05-20 14:00:22] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 1 ms to minimize.
[2024-05-20 14:00:22] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 2 ms to minimize.
[2024-05-20 14:00:22] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 2 ms to minimize.
[2024-05-20 14:00:22] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 2 ms to minimize.
[2024-05-20 14:00:22] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 20/301 constraints. Problems are: Problem set: 0 solved, 957 unsolved
[2024-05-20 14:00:23] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-05-20 14:00:23] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 2 ms to minimize.
[2024-05-20 14:00:24] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-20 14:00:24] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-20 14:00:24] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-05-20 14:00:24] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-20 14:00:24] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 2 ms to minimize.
[2024-05-20 14:00:24] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-20 14:00:24] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-05-20 14:00:24] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-20 14:00:24] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-20 14:00:24] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 2 ms to minimize.
[2024-05-20 14:00:24] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-20 14:00:24] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 2 ms to minimize.
[2024-05-20 14:00:24] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-20 14:00:25] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-20 14:00:25] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 2 ms to minimize.
[2024-05-20 14:00:25] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 2 ms to minimize.
[2024-05-20 14:00:25] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 2 ms to minimize.
[2024-05-20 14:00:25] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/499 variables, 20/321 constraints. Problems are: Problem set: 0 solved, 957 unsolved
[2024-05-20 14:00:26] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-05-20 14:00:26] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-20 14:00:26] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-20 14:00:26] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 2 ms to minimize.
[2024-05-20 14:00:27] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-20 14:00:27] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 2 ms to minimize.
[2024-05-20 14:00:27] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 2 ms to minimize.
[2024-05-20 14:00:27] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 3 ms to minimize.
[2024-05-20 14:00:27] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 2 ms to minimize.
[2024-05-20 14:00:27] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-20 14:00:27] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-20 14:00:27] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 2 ms to minimize.
[2024-05-20 14:00:27] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-20 14:00:27] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-20 14:00:27] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
[2024-05-20 14:00:27] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-20 14:00:28] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-20 14:00:28] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 2 ms to minimize.
[2024-05-20 14:00:28] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 2 ms to minimize.
[2024-05-20 14:00:28] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/499 variables, 20/341 constraints. Problems are: Problem set: 0 solved, 957 unsolved
[2024-05-20 14:00:29] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 2 ms to minimize.
[2024-05-20 14:00:29] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 2 ms to minimize.
[2024-05-20 14:00:29] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 2 ms to minimize.
[2024-05-20 14:00:29] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2024-05-20 14:00:29] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-05-20 14:00:30] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 2 ms to minimize.
[2024-05-20 14:00:30] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 2 ms to minimize.
SMT process timed out in 60502ms, After SMT, problems are : Problem set: 0 solved, 957 unsolved
Search for dead transitions found 0 dead transitions in 60513ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62598 ms. Remains : 500/500 places, 977/977 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 712 edges and 500 vertex of which 231 / 500 are part of one of the 12 SCC in 3 ms
Free SCC test removed 219 places
Drop transitions (Empty/Sink Transition effects.) removed 428 transitions
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 469 transitions.
Graph (complete) has 606 edges and 281 vertex of which 258 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.1 ms
Discarding 23 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 44 transitions
Reduce isomorphic transitions removed 44 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 128 rules applied. Total rules applied 130 place count 258 transition count 377
Reduce places removed 84 places and 0 transitions.
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Iterating post reduction 1 with 196 rules applied. Total rules applied 326 place count 174 transition count 265
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 2 with 62 rules applied. Total rules applied 388 place count 141 transition count 236
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 388 place count 141 transition count 232
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 396 place count 137 transition count 232
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 413 place count 120 transition count 200
Iterating global reduction 3 with 17 rules applied. Total rules applied 430 place count 120 transition count 200
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 447 place count 120 transition count 183
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 449 place count 119 transition count 182
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 451 place count 118 transition count 187
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 459 place count 118 transition count 179
Free-agglomeration rule applied 11 times.
Iterating global reduction 4 with 11 rules applied. Total rules applied 470 place count 118 transition count 168
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 481 place count 107 transition count 168
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 493 place count 107 transition count 168
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 499 place count 101 transition count 162
Iterating global reduction 5 with 6 rules applied. Total rules applied 505 place count 101 transition count 162
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 508 place count 98 transition count 159
Applied a total of 508 rules in 41 ms. Remains 98 /500 variables (removed 402) and now considering 159/977 (removed 818) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 159 rows 98 cols
[2024-05-20 14:00:30] [INFO ] Computed 2 invariants in 0 ms
[2024-05-20 14:00:30] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 14:00:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-20 14:00:30] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-20 14:00:30] [INFO ] After 88ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-20 14:00:30] [INFO ] After 159ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2024-05-20 14:00:30] [INFO ] Flatten gal took : 5 ms
[2024-05-20 14:00:30] [INFO ] Flatten gal took : 4 ms
[2024-05-20 14:00:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15329742567689396724.gal : 2 ms
[2024-05-20 14:00:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1232549459057941355.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15329742567689396724.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1232549459057941355.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality1232549459057941355.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 48
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :48 after 1152
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1152 after 36240
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :36240 after 414720
Reachability property CANConstruction-PT-020-ReachabilityCardinality-2024-15 is true.
Detected timeout of ITS tools.
[2024-05-20 14:00:45] [INFO ] Flatten gal took : 4 ms
[2024-05-20 14:00:45] [INFO ] Applying decomposition
[2024-05-20 14:00:45] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2129069764308492731.txt' '-o' '/tmp/graph2129069764308492731.bin' '-w' '/tmp/graph2129069764308492731.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2129069764308492731.bin' '-l' '-1' '-v' '-w' '/tmp/graph2129069764308492731.weights' '-q' '0' '-e' '0.001'
[2024-05-20 14:00:45] [INFO ] Decomposing Gal with order
[2024-05-20 14:00:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 14:00:45] [INFO ] Removed a total of 24 redundant transitions.
[2024-05-20 14:00:45] [INFO ] Flatten gal took : 53 ms
[2024-05-20 14:00:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 7 ms.
[2024-05-20 14:00:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5525730337814310209.gal : 3 ms
[2024-05-20 14:00:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2141663045944198339.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5525730337814310209.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2141663045944198339.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality2141663045944198339.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 48
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :48 after 2784
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2784 after 52848
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :52848 after 490320
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flatf,7.94017e+13,0.060306,5956,2,1307,11,10778,7,0,534,9532,0
Total reachable state count : 79401674096640

Verifying 1 reachability properties.
Invariant property CANConstruction-PT-020-ReachabilityCardinality-2024-12 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CANConstruction-PT-020-ReachabilityCardinality-2024-12,8.32458e+10,0.070339,6216,2,2061,11,10778,7,0,577,9532,0
Over-approximation ignoring read arcs solved 0 properties in 15702 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-20 14:00:46] [INFO ] Flatten gal took : 70 ms
[2024-05-20 14:00:46] [INFO ] Applying decomposition
[2024-05-20 14:00:46] [INFO ] Flatten gal took : 64 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11998281983375334115.txt' '-o' '/tmp/graph11998281983375334115.bin' '-w' '/tmp/graph11998281983375334115.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11998281983375334115.bin' '-l' '-1' '-v' '-w' '/tmp/graph11998281983375334115.weights' '-q' '0' '-e' '0.001'
[2024-05-20 14:00:46] [INFO ] Decomposing Gal with order
[2024-05-20 14:00:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 14:00:46] [INFO ] Removed a total of 1015 redundant transitions.
[2024-05-20 14:00:46] [INFO ] Flatten gal took : 138 ms
[2024-05-20 14:00:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 298 labels/synchronizations in 67 ms.
[2024-05-20 14:00:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11352962060069737966.gal : 23 ms
[2024-05-20 14:00:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2332147420708306463.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11352962060069737966.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2332147420708306463.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality2332147420708306463.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 13
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :13 after 23
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :23 after 29
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :29 after 31
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :31 after 35
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :35 after 58
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :58 after 109
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :109 after 1077
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1077 after 15200
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :15200 after 16594
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :16594 after 165000
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :165000 after 1.21799e+06
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :1.21799e+06 after 1.24799e+06
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :1.24799e+06 after 6.7279e+06
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :6.7279e+06 after 8.8024e+07
SDD proceeding with computation,2 properties remain. new max is 524288
SDD size :8.8024e+07 after 1.14062e+10
SDD proceeding with computation,2 properties remain. new max is 1048576
SDD size :1.14062e+10 after 1.59401e+10
SDD proceeding with computation,2 properties remain. new max is 2097152
SDD size :1.59401e+10 after 3.41877e+10
SDD proceeding with computation,2 properties remain. new max is 4194304
SDD size :3.41877e+10 after 9.69236e+10
Detected timeout of ITS tools.
[2024-05-20 14:30:47] [INFO ] Flatten gal took : 42 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin247787486458944144
[2024-05-20 14:30:47] [INFO ] Applying decomposition
[2024-05-20 14:30:47] [INFO ] Computing symmetric may disable matrix : 977 transitions.
[2024-05-20 14:30:47] [INFO ] Computation of Complete disable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 14:30:47] [INFO ] Computing symmetric may enable matrix : 977 transitions.
[2024-05-20 14:30:47] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 14:30:47] [INFO ] Flatten gal took : 60 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15278270997497839178.txt' '-o' '/tmp/graph15278270997497839178.bin' '-w' '/tmp/graph15278270997497839178.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15278270997497839178.bin' '-l' '-1' '-v' '-w' '/tmp/graph15278270997497839178.weights' '-q' '0' '-e' '0.001'
[2024-05-20 14:30:47] [INFO ] Decomposing Gal with order
[2024-05-20 14:30:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 14:30:47] [INFO ] Removed a total of 970 redundant transitions.
[2024-05-20 14:30:47] [INFO ] Flatten gal took : 98 ms
[2024-05-20 14:30:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 722 labels/synchronizations in 33 ms.
[2024-05-20 14:30:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6023611543699327657.gal : 8 ms
[2024-05-20 14:30:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality317354761555827065.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6023611543699327657.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality317354761555827065.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality317354761555827065.prop.
[2024-05-20 14:30:47] [INFO ] Computing Do-Not-Accords matrix : 977 transitions.
[2024-05-20 14:30:48] [INFO ] Computation of Completed DNA matrix. took 63 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 14:30:48] [INFO ] Built C files in 591ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin247787486458944144
Running compilation step : cd /tmp/ltsmin247787486458944144;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 36
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :36 after 47
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :47 after 61
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :61 after 527
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :527 after 726
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :726 after 20058
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :20058 after 123093
Compilation finished in 3347 ms.
Running link step : cd /tmp/ltsmin247787486458944144;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 74 ms.
Running LTSmin : cd /tmp/ltsmin247787486458944144;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'CANConstructionPT020ReachabilityCardinality202412==true'
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :123093 after 651949
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :651949 after 5.51753e+07
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin247787486458944144;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'CANConstructionPT020ReachabilityCardinality202412==true'
Running LTSmin : cd /tmp/ltsmin247787486458944144;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'CANConstructionPT020ReachabilityCardinality202415==true'

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//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//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="CANConstruction-PT-020"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is CANConstruction-PT-020, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r070-tall-171620505000022"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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