About the Execution of ITS-Tools for ShieldPPPt-PT-100B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16192.388 | 3600000.00 | 11602050.00 | 2815.70 | ?FT?F??F??????F? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r356-tall-171683761700703.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 ShieldPPPt-PT-100B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683761700703
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.9M May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-2023-00
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717031627157
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-100B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-30 01:13:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 01:13:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 01:13:48] [INFO ] Load time of PNML (sax parser for PT used): 371 ms
[2024-05-30 01:13:48] [INFO ] Transformed 7803 places.
[2024-05-30 01:13:49] [INFO ] Transformed 7103 transitions.
[2024-05-30 01:13:49] [INFO ] Found NUPN structural information;
[2024-05-30 01:13:49] [INFO ] Parsed PT model containing 7803 places and 7103 transitions and 17806 arcs in 796 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 2935 ms. (13 steps per ms) remains 12/16 properties
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 327 ms. (121 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 209 ms. (190 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 12/12 properties
[2024-05-30 01:13:50] [INFO ] Flatten gal took : 836 ms
BEST_FIRST walk for 40004 steps (8 resets) in 876 ms. (45 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 224 ms. (177 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 167 ms. (238 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 110 ms. (360 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 118 ms. (336 steps per ms) remains 12/12 properties
[2024-05-30 01:13:51] [INFO ] Flatten gal took : 349 ms
BEST_FIRST walk for 40003 steps (8 resets) in 152 ms. (261 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 221 ms. (180 steps per ms) remains 12/12 properties
[2024-05-30 01:13:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15505077236013069842.gal : 109 ms
[2024-05-30 01:13:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1752939487405069543.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/ReachabilityCardinality15505077236013069842.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1752939487405069543.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
// Phase 1: matrix 7103 rows 7803 cols
[2024-05-30 01:13:51] [INFO ] Computed 1101 invariants in 77 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 154/154 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Loading property file /tmp/ReachabilityCardinality1752939487405069543.prop.
At refinement iteration 2 (OVERLAPS) 4720/4874 variables, 650/804 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4874 variables, 4720/5524 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4874 variables, 0/5524 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 2929/7803 variables, 451/5975 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7803 variables, 2929/8904 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/7803 variables, 0/8904 constraints. Problems are: Problem set: 0 solved, 12 unsolved
SMT process timed out in 5320ms, After SMT, problems are : Problem set: 0 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 154 out of 7803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7803/7803 places, 7103/7103 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1772 transitions
Trivial Post-agglo rules discarded 1772 transitions
Performed 1772 trivial Post agglomeration. Transition count delta: 1772
Iterating post reduction 0 with 1772 rules applied. Total rules applied 1772 place count 7803 transition count 5331
Reduce places removed 1772 places and 0 transitions.
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Iterating post reduction 1 with 1823 rules applied. Total rules applied 3595 place count 6031 transition count 5280
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 2 with 51 rules applied. Total rules applied 3646 place count 5980 transition count 5280
Performed 413 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 413 Pre rules applied. Total rules applied 3646 place count 5980 transition count 4867
Deduced a syphon composed of 413 places in 23 ms
Reduce places removed 413 places and 0 transitions.
Iterating global reduction 3 with 826 rules applied. Total rules applied 4472 place count 5567 transition count 4867
Discarding 667 places :
Symmetric choice reduction at 3 with 667 rule applications. Total rules 5139 place count 4900 transition count 4200
Iterating global reduction 3 with 667 rules applied. Total rules applied 5806 place count 4900 transition count 4200
Performed 273 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 273 Pre rules applied. Total rules applied 5806 place count 4900 transition count 3927
Deduced a syphon composed of 273 places in 51 ms
Reduce places removed 273 places and 0 transitions.
Iterating global reduction 3 with 546 rules applied. Total rules applied 6352 place count 4627 transition count 3927
Performed 1636 Post agglomeration using F-continuation condition.Transition count delta: 1636
Deduced a syphon composed of 1636 places in 10 ms
Reduce places removed 1636 places and 0 transitions.
Iterating global reduction 3 with 3272 rules applied. Total rules applied 9624 place count 2991 transition count 2291
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 11 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9826 place count 2890 transition count 2291
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 9 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 10028 place count 2789 transition count 2291
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 64 places in 7 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 10156 place count 2725 transition count 2291
Free-agglomeration rule applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 10164 place count 2725 transition count 2283
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 10172 place count 2717 transition count 2283
Partial Free-agglomeration rule applied 286 times.
Drop transitions (Partial Free agglomeration) removed 286 transitions
Iterating global reduction 4 with 286 rules applied. Total rules applied 10458 place count 2717 transition count 2283
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 10459 place count 2716 transition count 2282
Applied a total of 10459 rules in 3633 ms. Remains 2716 /7803 variables (removed 5087) and now considering 2282/7103 (removed 4821) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3643 ms. Remains : 2716/7803 places, 2282/7103 transitions.
RANDOM walk for 40000 steps (8 resets) in 1554 ms. (25 steps per ms) remains 11/12 properties
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 886 ms. (45 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 605 ms. (66 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 692 ms. (57 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 654 ms. (61 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 548 ms. (72 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 489 ms. (81 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 535 ms. (74 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 616 ms. (64 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 518 ms. (77 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 545 ms. (73 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 604 ms. (66 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 111900 steps, run timeout after 6001 ms. (steps per millisecond=18 ) properties seen :0 out of 11
Probabilistic random walk after 111900 steps, saw 84542 distinct states, run finished after 6006 ms. (steps per millisecond=18 ) properties seen :0
// Phase 1: matrix 2282 rows 2716 cols
[2024-05-30 01:14:08] [INFO ] Computed 1101 invariants in 9 ms
[2024-05-30 01:14:08] [INFO ] State equation strengthened by 541 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 1519/1654 variables, 641/641 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1654 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 865/2519 variables, 374/1015 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2519 variables, 0/1015 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 2139/4658 variables, 2519/3534 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4658 variables, 541/4075 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4658 variables, 0/4075 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 98/4756 variables, 54/4129 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4756 variables, 19/4148 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4756 variables, 0/4148 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 6/4762 variables, 6/4154 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4762 variables, 6/4160 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4762 variables, 0/4160 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 12/4774 variables, 6/4166 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4774 variables, 0/4166 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (OVERLAPS) 82/4856 variables, 52/4218 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4856 variables, 14/4232 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4856 variables, 0/4232 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (OVERLAPS) 4/4860 variables, 5/4237 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/4860 variables, 4/4241 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/4860 variables, 0/4241 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 22 (OVERLAPS) 6/4866 variables, 3/4244 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/4866 variables, 0/4244 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 24 (OVERLAPS) 70/4936 variables, 41/4285 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/4936 variables, 13/4298 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/4936 variables, 0/4298 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 27 (OVERLAPS) 4/4940 variables, 4/4302 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/4940 variables, 4/4306 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/4940 variables, 0/4306 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 30 (OVERLAPS) 8/4948 variables, 4/4310 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/4948 variables, 0/4310 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 32 (OVERLAPS) 33/4981 variables, 26/4336 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/4981 variables, 8/4344 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/4981 variables, 0/4344 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 35 (OVERLAPS) 14/4995 variables, 8/4352 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/4995 variables, 3/4355 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/4995 variables, 0/4355 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 38 (OVERLAPS) 2/4997 variables, 1/4356 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/4997 variables, 0/4356 constraints. Problems are: Problem set: 0 solved, 11 unsolved
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :10 after 19
At refinement iteration 40 (OVERLAPS) 1/4998 variables, 2/4358 constraints. Problems are: Problem set: 0 solved, 11 unsolved
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :69 after 118
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :118 after 5935
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :5935 after 9.17035e+07
SDD proceeding with computation,12 properties remain. new max is 1024
SDD size :9.17035e+07 after 4.01557e+14
At refinement iteration 41 (INCLUDED_ONLY) 0/4998 variables, 0/4358 constraints. Problems are: Problem set: 0 solved, 11 unsolved
SDD proceeding with computation,12 properties remain. new max is 2048
SDD size :4.01557e+14 after 4.83162e+30
SDD proceeding with computation,12 properties remain. new max is 4096
SDD size :4.83162e+30 after 6.79827e+72
At refinement iteration 42 (OVERLAPS) 0/4998 variables, 0/4358 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4998/4998 variables, and 4358 constraints, problems are : Problem set: 0 solved, 11 unsolved in 26320 ms.
Refiners :[Positive P Invariants (semi-flows): 1101/1101 constraints, State Equation: 2716/2716 constraints, ReadFeed: 541/541 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 1519/1654 variables, 641/641 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-30 01:14:35] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 14 ms to minimize.
[2024-05-30 01:14:35] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 2 ms to minimize.
[2024-05-30 01:14:35] [INFO ] Deduced a trap composed of 6 places in 119 ms of which 2 ms to minimize.
[2024-05-30 01:14:36] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 2 ms to minimize.
[2024-05-30 01:14:36] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 2 ms to minimize.
[2024-05-30 01:14:36] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 8 ms to minimize.
[2024-05-30 01:14:36] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 3 ms to minimize.
[2024-05-30 01:14:36] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 1 ms to minimize.
[2024-05-30 01:14:36] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 2 ms to minimize.
[2024-05-30 01:14:36] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
[2024-05-30 01:14:36] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 2 ms to minimize.
[2024-05-30 01:14:36] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 2 ms to minimize.
[2024-05-30 01:14:37] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 1 ms to minimize.
[2024-05-30 01:14:37] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-05-30 01:14:37] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-30 01:14:37] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 1 ms to minimize.
[2024-05-30 01:14:37] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 2 ms to minimize.
[2024-05-30 01:14:37] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 2 ms to minimize.
[2024-05-30 01:14:37] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 2 ms to minimize.
[2024-05-30 01:14:37] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1654 variables, 20/661 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-30 01:14:37] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 2 ms to minimize.
[2024-05-30 01:14:37] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 1 ms to minimize.
[2024-05-30 01:14:38] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 2 ms to minimize.
[2024-05-30 01:14:38] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 2 ms to minimize.
[2024-05-30 01:14:38] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 2 ms to minimize.
[2024-05-30 01:14:38] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 2 ms to minimize.
[2024-05-30 01:14:38] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 2 ms to minimize.
[2024-05-30 01:14:38] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 2 ms to minimize.
[2024-05-30 01:14:38] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 2 ms to minimize.
[2024-05-30 01:14:39] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 2 ms to minimize.
[2024-05-30 01:14:39] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1654 variables, 11/672 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1654 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 865/2519 variables, 374/1046 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-30 01:14:39] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 2 ms to minimize.
[2024-05-30 01:14:39] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-05-30 01:14:40] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 5 ms to minimize.
[2024-05-30 01:14:40] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 1 ms to minimize.
[2024-05-30 01:14:40] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
[2024-05-30 01:14:40] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-05-30 01:14:40] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 1 ms to minimize.
[2024-05-30 01:14:40] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 2 ms to minimize.
[2024-05-30 01:14:40] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 3 ms to minimize.
[2024-05-30 01:14:40] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-05-30 01:14:40] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2024-05-30 01:14:41] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 4 ms to minimize.
[2024-05-30 01:14:41] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 2 ms to minimize.
[2024-05-30 01:14:41] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2519 variables, 14/1060 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2519 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 2139/4658 variables, 2519/3579 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4658 variables, 541/4120 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4658 variables, 8/4128 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-30 01:14:49] [INFO ] Deduced a trap composed of 6 places in 308 ms of which 6 ms to minimize.
[2024-05-30 01:14:49] [INFO ] Deduced a trap composed of 6 places in 270 ms of which 5 ms to minimize.
[2024-05-30 01:14:50] [INFO ] Deduced a trap composed of 6 places in 290 ms of which 6 ms to minimize.
[2024-05-30 01:14:50] [INFO ] Deduced a trap composed of 8 places in 298 ms of which 6 ms to minimize.
[2024-05-30 01:14:51] [INFO ] Deduced a trap composed of 8 places in 299 ms of which 5 ms to minimize.
[2024-05-30 01:14:51] [INFO ] Deduced a trap composed of 6 places in 299 ms of which 6 ms to minimize.
[2024-05-30 01:14:51] [INFO ] Deduced a trap composed of 9 places in 282 ms of which 5 ms to minimize.
[2024-05-30 01:14:52] [INFO ] Deduced a trap composed of 11 places in 277 ms of which 5 ms to minimize.
[2024-05-30 01:14:52] [INFO ] Deduced a trap composed of 8 places in 277 ms of which 5 ms to minimize.
[2024-05-30 01:14:53] [INFO ] Deduced a trap composed of 8 places in 280 ms of which 5 ms to minimize.
[2024-05-30 01:14:53] [INFO ] Deduced a trap composed of 9 places in 287 ms of which 15 ms to minimize.
[2024-05-30 01:14:53] [INFO ] Deduced a trap composed of 8 places in 275 ms of which 5 ms to minimize.
[2024-05-30 01:14:54] [INFO ] Deduced a trap composed of 9 places in 274 ms of which 6 ms to minimize.
[2024-05-30 01:14:54] [INFO ] Deduced a trap composed of 12 places in 269 ms of which 5 ms to minimize.
[2024-05-30 01:14:55] [INFO ] Deduced a trap composed of 9 places in 391 ms of which 7 ms to minimize.
[2024-05-30 01:14:55] [INFO ] Deduced a trap composed of 7 places in 365 ms of which 7 ms to minimize.
[2024-05-30 01:14:56] [INFO ] Deduced a trap composed of 8 places in 354 ms of which 7 ms to minimize.
[2024-05-30 01:14:56] [INFO ] Deduced a trap composed of 9 places in 344 ms of which 6 ms to minimize.
[2024-05-30 01:14:57] [INFO ] Deduced a trap composed of 7 places in 340 ms of which 7 ms to minimize.
[2024-05-30 01:14:57] [INFO ] Deduced a trap composed of 12 places in 353 ms of which 8 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/4658 variables, 20/4148 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-30 01:15:00] [INFO ] Deduced a trap composed of 7 places in 255 ms of which 4 ms to minimize.
[2024-05-30 01:15:01] [INFO ] Deduced a trap composed of 10 places in 252 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/4658 variables, 2/4150 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4658 variables, 0/4150 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 98/4756 variables, 54/4204 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4756 variables, 19/4223 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4756 variables, 3/4226 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-30 01:15:14] [INFO ] Deduced a trap composed of 5 places in 233 ms of which 4 ms to minimize.
[2024-05-30 01:15:15] [INFO ] Deduced a trap composed of 5 places in 240 ms of which 4 ms to minimize.
[2024-05-30 01:15:15] [INFO ] Deduced a trap composed of 3 places in 235 ms of which 5 ms to minimize.
[2024-05-30 01:15:15] [INFO ] Deduced a trap composed of 6 places in 224 ms of which 4 ms to minimize.
[2024-05-30 01:15:16] [INFO ] Deduced a trap composed of 6 places in 219 ms of which 4 ms to minimize.
[2024-05-30 01:15:16] [INFO ] Deduced a trap composed of 5 places in 209 ms of which 4 ms to minimize.
[2024-05-30 01:15:16] [INFO ] Deduced a trap composed of 9 places in 202 ms of which 4 ms to minimize.
[2024-05-30 01:15:17] [INFO ] Deduced a trap composed of 7 places in 207 ms of which 4 ms to minimize.
[2024-05-30 01:15:17] [INFO ] Deduced a trap composed of 10 places in 212 ms of which 4 ms to minimize.
[2024-05-30 01:15:19] [INFO ] Deduced a trap composed of 7 places in 303 ms of which 6 ms to minimize.
[2024-05-30 01:15:20] [INFO ] Deduced a trap composed of 6 places in 294 ms of which 5 ms to minimize.
SMT process timed out in 71547ms, After SMT, problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 35206 ms.
Support contains 135 out of 2716 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2716/2716 places, 2282/2282 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 2716 transition count 2272
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 2706 transition count 2272
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 20 place count 2706 transition count 2270
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 2704 transition count 2270
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 5 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 60 place count 2686 transition count 2252
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 66 place count 2683 transition count 2252
Applied a total of 66 rules in 347 ms. Remains 2683 /2716 variables (removed 33) and now considering 2252/2282 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 347 ms. Remains : 2683/2716 places, 2252/2282 transitions.
RANDOM walk for 40000 steps (8 resets) in 1057 ms. (37 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 738 ms. (54 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 515 ms. (77 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 534 ms. (74 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 497 ms. (80 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 567 ms. (70 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 533 ms. (74 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 527 ms. (75 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 558 ms. (71 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 519 ms. (76 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 544 ms. (73 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 577 ms. (69 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 122523 steps, run timeout after 6001 ms. (steps per millisecond=20 ) properties seen :0 out of 11
Probabilistic random walk after 122523 steps, saw 102433 distinct states, run finished after 6001 ms. (steps per millisecond=20 ) properties seen :0
// Phase 1: matrix 2252 rows 2683 cols
[2024-05-30 01:16:04] [INFO ] Computed 1101 invariants in 7 ms
[2024-05-30 01:16:04] [INFO ] State equation strengthened by 548 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 1498/1633 variables, 641/641 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1633 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 855/2488 variables, 374/1015 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2488 variables, 0/1015 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 2110/4598 variables, 2488/3503 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4598 variables, 548/4051 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4598 variables, 0/4051 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 98/4696 variables, 54/4105 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4696 variables, 19/4124 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4696 variables, 0/4124 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 6/4702 variables, 6/4130 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4702 variables, 6/4136 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4702 variables, 0/4136 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 12/4714 variables, 6/4142 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4714 variables, 0/4142 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (OVERLAPS) 82/4796 variables, 52/4194 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4796 variables, 14/4208 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4796 variables, 0/4208 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (OVERLAPS) 4/4800 variables, 5/4213 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/4800 variables, 4/4217 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/4800 variables, 0/4217 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 22 (OVERLAPS) 6/4806 variables, 3/4220 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/4806 variables, 0/4220 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 24 (OVERLAPS) 70/4876 variables, 41/4261 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/4876 variables, 13/4274 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/4876 variables, 0/4274 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 27 (OVERLAPS) 4/4880 variables, 4/4278 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/4880 variables, 4/4282 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/4880 variables, 0/4282 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 30 (OVERLAPS) 8/4888 variables, 4/4286 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/4888 variables, 0/4286 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 32 (OVERLAPS) 35/4923 variables, 26/4312 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/4923 variables, 8/4320 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/4923 variables, 0/4320 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 35 (OVERLAPS) 12/4935 variables, 8/4328 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/4935 variables, 4/4332 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/4935 variables, 0/4332 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 38 (OVERLAPS) 0/4935 variables, 0/4332 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4935/4935 variables, and 4332 constraints, problems are : Problem set: 0 solved, 11 unsolved in 22020 ms.
Refiners :[Positive P Invariants (semi-flows): 1101/1101 constraints, State Equation: 2683/2683 constraints, ReadFeed: 548/548 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 1498/1633 variables, 641/641 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-30 01:16:26] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 1 ms to minimize.
[2024-05-30 01:16:26] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 2 ms to minimize.
[2024-05-30 01:16:26] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 1 ms to minimize.
[2024-05-30 01:16:26] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 2 ms to minimize.
[2024-05-30 01:16:26] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 2 ms to minimize.
[2024-05-30 01:16:27] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2024-05-30 01:16:27] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2024-05-30 01:16:27] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2024-05-30 01:16:27] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-05-30 01:16:27] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 2 ms to minimize.
[2024-05-30 01:16:27] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-05-30 01:16:27] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
[2024-05-30 01:16:27] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-30 01:16:27] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2024-05-30 01:16:27] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
[2024-05-30 01:16:27] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
[2024-05-30 01:16:28] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 2 ms to minimize.
[2024-05-30 01:16:28] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 1 ms to minimize.
[2024-05-30 01:16:28] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1633 variables, 19/660 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-30 01:16:28] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-30 01:16:28] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1633 variables, 2/662 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1633 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 855/2488 variables, 374/1036 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-30 01:16:29] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 1 ms to minimize.
[2024-05-30 01:16:29] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 1 ms to minimize.
[2024-05-30 01:16:29] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 1 ms to minimize.
[2024-05-30 01:16:29] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 1 ms to minimize.
[2024-05-30 01:16:30] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 2 ms to minimize.
[2024-05-30 01:16:30] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 1 ms to minimize.
[2024-05-30 01:16:30] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 2 ms to minimize.
[2024-05-30 01:16:30] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 2 ms to minimize.
[2024-05-30 01:16:30] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 1 ms to minimize.
[2024-05-30 01:16:30] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 2 ms to minimize.
[2024-05-30 01:16:30] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2488 variables, 11/1047 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2488 variables, 0/1047 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 2110/4598 variables, 2488/3535 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4598 variables, 548/4083 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4598 variables, 8/4091 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-30 01:16:37] [INFO ] Deduced a trap composed of 9 places in 239 ms of which 4 ms to minimize.
[2024-05-30 01:16:38] [INFO ] Deduced a trap composed of 6 places in 238 ms of which 5 ms to minimize.
[2024-05-30 01:16:38] [INFO ] Deduced a trap composed of 8 places in 243 ms of which 4 ms to minimize.
[2024-05-30 01:16:38] [INFO ] Deduced a trap composed of 9 places in 234 ms of which 4 ms to minimize.
[2024-05-30 01:16:39] [INFO ] Deduced a trap composed of 5 places in 240 ms of which 5 ms to minimize.
[2024-05-30 01:16:39] [INFO ] Deduced a trap composed of 8 places in 234 ms of which 4 ms to minimize.
[2024-05-30 01:16:40] [INFO ] Deduced a trap composed of 14 places in 238 ms of which 4 ms to minimize.
[2024-05-30 01:16:40] [INFO ] Deduced a trap composed of 10 places in 239 ms of which 4 ms to minimize.
[2024-05-30 01:16:40] [INFO ] Deduced a trap composed of 7 places in 237 ms of which 4 ms to minimize.
[2024-05-30 01:16:41] [INFO ] Deduced a trap composed of 10 places in 233 ms of which 5 ms to minimize.
[2024-05-30 01:16:41] [INFO ] Deduced a trap composed of 8 places in 240 ms of which 5 ms to minimize.
[2024-05-30 01:16:41] [INFO ] Deduced a trap composed of 6 places in 232 ms of which 4 ms to minimize.
[2024-05-30 01:16:43] [INFO ] Deduced a trap composed of 8 places in 231 ms of which 5 ms to minimize.
[2024-05-30 01:16:43] [INFO ] Deduced a trap composed of 9 places in 241 ms of which 5 ms to minimize.
[2024-05-30 01:16:43] [INFO ] Deduced a trap composed of 8 places in 227 ms of which 4 ms to minimize.
[2024-05-30 01:16:44] [INFO ] Deduced a trap composed of 9 places in 227 ms of which 4 ms to minimize.
[2024-05-30 01:16:44] [INFO ] Deduced a trap composed of 10 places in 220 ms of which 4 ms to minimize.
[2024-05-30 01:16:45] [INFO ] Deduced a trap composed of 8 places in 220 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/4598 variables, 18/4109 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-30 01:16:47] [INFO ] Deduced a trap composed of 10 places in 211 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/4598 variables, 1/4110 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-30 01:16:50] [INFO ] Deduced a trap composed of 9 places in 215 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/4598 variables, 1/4111 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4598 variables, 0/4111 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 98/4696 variables, 54/4165 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4696 variables, 19/4184 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4696 variables, 3/4187 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-30 01:16:59] [INFO ] Deduced a trap composed of 6 places in 196 ms of which 4 ms to minimize.
[2024-05-30 01:16:59] [INFO ] Deduced a trap composed of 9 places in 196 ms of which 4 ms to minimize.
[2024-05-30 01:17:00] [INFO ] Deduced a trap composed of 6 places in 199 ms of which 4 ms to minimize.
[2024-05-30 01:17:00] [INFO ] Deduced a trap composed of 7 places in 190 ms of which 3 ms to minimize.
[2024-05-30 01:17:00] [INFO ] Deduced a trap composed of 5 places in 182 ms of which 4 ms to minimize.
[2024-05-30 01:17:01] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/4696 variables, 6/4193 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-30 01:17:05] [INFO ] Deduced a trap composed of 8 places in 160 ms of which 4 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/4696 variables, 1/4194 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-30 01:17:10] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/4696 variables, 1/4195 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/4696 variables, 0/4195 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 22 (OVERLAPS) 6/4702 variables, 6/4201 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/4702 variables, 6/4207 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/4702 variables, 0/4207 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 25 (OVERLAPS) 12/4714 variables, 6/4213 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-30 01:17:20] [INFO ] Deduced a trap composed of 10 places in 178 ms of which 3 ms to minimize.
[2024-05-30 01:17:22] [INFO ] Deduced a trap composed of 10 places in 167 ms of which 3 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/4714 variables, 2/4215 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/4714 variables, 0/4215 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 28 (OVERLAPS) 82/4796 variables, 52/4267 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/4796 variables, 14/4281 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/4796 variables, 0/4281 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 31 (OVERLAPS) 4/4800 variables, 5/4286 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/4800 variables, 4/4290 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/4800 variables, 0/4290 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 34 (OVERLAPS) 6/4806 variables, 3/4293 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/4806 variables, 0/4293 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 36 (OVERLAPS) 70/4876 variables, 41/4334 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/4876 variables, 13/4347 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4876/4935 variables, and 4347 constraints, problems are : Problem set: 0 solved, 11 unsolved in 75016 ms.
Refiners :[Positive P Invariants (semi-flows): 1081/1101 constraints, State Equation: 2645/2683 constraints, ReadFeed: 548/548 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 62/62 constraints]
After SMT, in 97087ms problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 135 out of 2683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2683/2683 places, 2252/2252 transitions.
Applied a total of 0 rules in 120 ms. Remains 2683 /2683 variables (removed 0) and now considering 2252/2252 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 2683/2683 places, 2252/2252 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2683/2683 places, 2252/2252 transitions.
Applied a total of 0 rules in 114 ms. Remains 2683 /2683 variables (removed 0) and now considering 2252/2252 (removed 0) transitions.
[2024-05-30 01:17:41] [INFO ] Invariant cache hit.
[2024-05-30 01:17:43] [INFO ] Implicit Places using invariants in 1506 ms returned []
[2024-05-30 01:17:43] [INFO ] Invariant cache hit.
[2024-05-30 01:17:44] [INFO ] State equation strengthened by 548 read => feed constraints.
[2024-05-30 01:18:04] [INFO ] Implicit Places using invariants and state equation in 21475 ms returned []
Implicit Place search using SMT with State Equation took 22995 ms to find 0 implicit places.
[2024-05-30 01:18:04] [INFO ] Redundant transitions in 165 ms returned []
Running 2245 sub problems to find dead transitions.
[2024-05-30 01:18:04] [INFO ] Invariant cache hit.
[2024-05-30 01:18:04] [INFO ] State equation strengthened by 548 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2678 variables, 89/89 constraints. Problems are: Problem set: 0 solved, 2245 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2678/4935 variables, and 89 constraints, problems are : Problem set: 0 solved, 2245 unsolved in 30097 ms.
Refiners :[Positive P Invariants (semi-flows): 89/1101 constraints, State Equation: 0/2683 constraints, ReadFeed: 0/548 constraints, PredecessorRefiner: 2245/2245 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2245 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2678 variables, 89/89 constraints. Problems are: Problem set: 0 solved, 2245 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2678/4935 variables, and 89 constraints, problems are : Problem set: 0 solved, 2245 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 89/1101 constraints, State Equation: 0/2683 constraints, ReadFeed: 0/548 constraints, PredecessorRefiner: 0/2245 constraints, Known Traps: 0/0 constraints]
After SMT, in 61217ms problems are : Problem set: 0 solved, 2245 unsolved
Search for dead transitions found 0 dead transitions in 61244ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84543 ms. Remains : 2683/2683 places, 2252/2252 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 589 times.
Drop transitions (Partial Free agglomeration) removed 589 transitions
Iterating global reduction 0 with 589 rules applied. Total rules applied 589 place count 2683 transition count 2252
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 592 place count 2683 transition count 2249
Applied a total of 592 rules in 367 ms. Remains 2683 /2683 variables (removed 0) and now considering 2249/2252 (removed 3) transitions.
Running SMT prover for 11 properties.
// Phase 1: matrix 2249 rows 2683 cols
[2024-05-30 01:19:06] [INFO ] Computed 1101 invariants in 7 ms
[2024-05-30 01:19:07] [INFO ] [Real]Absence check using 1101 positive place invariants in 179 ms returned sat
[2024-05-30 01:19:07] [INFO ] After 893ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-30 01:19:08] [INFO ] [Nat]Absence check using 1101 positive place invariants in 251 ms returned sat
[2024-05-30 01:19:10] [INFO ] After 2362ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2024-05-30 01:19:11] [INFO ] State equation strengthened by 553 read => feed constraints.
[2024-05-30 01:19:22] [INFO ] After 11229ms SMT Verify possible using 553 Read/Feed constraints in natural domain returned unsat :0 sat :11
TRAPS : Iteration 0
[2024-05-30 01:19:23] [INFO ] Deduced a trap composed of 8 places in 1258 ms of which 12 ms to minimize.
[2024-05-30 01:19:24] [INFO ] Deduced a trap composed of 9 places in 678 ms of which 11 ms to minimize.
[2024-05-30 01:19:25] [INFO ] Deduced a trap composed of 6 places in 1085 ms of which 9 ms to minimize.
[2024-05-30 01:19:27] [INFO ] Deduced a trap composed of 5 places in 1026 ms of which 8 ms to minimize.
[2024-05-30 01:19:27] [INFO ] Deduced a trap composed of 7 places in 612 ms of which 8 ms to minimize.
[2024-05-30 01:19:28] [INFO ] Deduced a trap composed of 9 places in 608 ms of which 9 ms to minimize.
[2024-05-30 01:19:29] [INFO ] Deduced a trap composed of 8 places in 597 ms of which 9 ms to minimize.
[2024-05-30 01:19:29] [INFO ] Deduced a trap composed of 8 places in 593 ms of which 9 ms to minimize.
[2024-05-30 01:19:30] [INFO ] Deduced a trap composed of 6 places in 627 ms of which 8 ms to minimize.
[2024-05-30 01:19:31] [INFO ] Deduced a trap composed of 9 places in 638 ms of which 9 ms to minimize.
[2024-05-30 01:19:32] [INFO ] Deduced a trap composed of 8 places in 629 ms of which 9 ms to minimize.
[2024-05-30 01:19:32] [INFO ] Deduced a trap composed of 10 places in 620 ms of which 8 ms to minimize.
[2024-05-30 01:19:33] [INFO ] Deduced a trap composed of 8 places in 583 ms of which 8 ms to minimize.
[2024-05-30 01:19:34] [INFO ] Deduced a trap composed of 6 places in 567 ms of which 8 ms to minimize.
[2024-05-30 01:19:35] [INFO ] Deduced a trap composed of 6 places in 561 ms of which 8 ms to minimize.
[2024-05-30 01:19:35] [INFO ] Deduced a trap composed of 10 places in 572 ms of which 8 ms to minimize.
[2024-05-30 01:19:36] [INFO ] Deduced a trap composed of 6 places in 572 ms of which 8 ms to minimize.
[2024-05-30 01:19:37] [INFO ] Deduced a trap composed of 11 places in 540 ms of which 8 ms to minimize.
[2024-05-30 01:19:37] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 15059 ms
[2024-05-30 01:19:38] [INFO ] Deduced a trap composed of 12 places in 587 ms of which 8 ms to minimize.
[2024-05-30 01:19:39] [INFO ] Deduced a trap composed of 8 places in 596 ms of which 8 ms to minimize.
[2024-05-30 01:19:40] [INFO ] Deduced a trap composed of 11 places in 591 ms of which 9 ms to minimize.
[2024-05-30 01:19:40] [INFO ] Deduced a trap composed of 9 places in 577 ms of which 9 ms to minimize.
[2024-05-30 01:19:41] [INFO ] Deduced a trap composed of 8 places in 573 ms of which 8 ms to minimize.
[2024-05-30 01:19:42] [INFO ] Deduced a trap composed of 10 places in 592 ms of which 8 ms to minimize.
[2024-05-30 01:19:42] [INFO ] Deduced a trap composed of 6 places in 640 ms of which 8 ms to minimize.
[2024-05-30 01:19:43] [INFO ] Deduced a trap composed of 10 places in 556 ms of which 8 ms to minimize.
[2024-05-30 01:19:44] [INFO ] Deduced a trap composed of 9 places in 558 ms of which 8 ms to minimize.
[2024-05-30 01:19:44] [INFO ] Deduced a trap composed of 13 places in 546 ms of which 8 ms to minimize.
[2024-05-30 01:19:45] [INFO ] Deduced a trap composed of 8 places in 585 ms of which 8 ms to minimize.
[2024-05-30 01:19:46] [INFO ] Deduced a trap composed of 8 places in 549 ms of which 8 ms to minimize.
[2024-05-30 01:19:46] [INFO ] Deduced a trap composed of 10 places in 542 ms of which 8 ms to minimize.
[2024-05-30 01:19:47] [INFO ] Deduced a trap composed of 12 places in 533 ms of which 8 ms to minimize.
[2024-05-30 01:19:48] [INFO ] Deduced a trap composed of 10 places in 538 ms of which 8 ms to minimize.
[2024-05-30 01:19:48] [INFO ] Deduced a trap composed of 9 places in 527 ms of which 7 ms to minimize.
[2024-05-30 01:19:49] [INFO ] Deduced a trap composed of 8 places in 542 ms of which 7 ms to minimize.
[2024-05-30 01:19:49] [INFO ] Deduced a trap composed of 9 places in 528 ms of which 7 ms to minimize.
[2024-05-30 01:19:50] [INFO ] Deduced a trap composed of 9 places in 537 ms of which 8 ms to minimize.
[2024-05-30 01:19:51] [INFO ] Deduced a trap composed of 10 places in 534 ms of which 22 ms to minimize.
[2024-05-30 01:19:51] [INFO ] Deduced a trap composed of 8 places in 517 ms of which 17 ms to minimize.
[2024-05-30 01:19:52] [INFO ] Deduced a trap composed of 10 places in 533 ms of which 7 ms to minimize.
[2024-05-30 01:19:53] [INFO ] Deduced a trap composed of 6 places in 520 ms of which 8 ms to minimize.
[2024-05-30 01:19:53] [INFO ] Deduced a trap composed of 10 places in 534 ms of which 7 ms to minimize.
[2024-05-30 01:19:54] [INFO ] Deduced a trap composed of 8 places in 534 ms of which 7 ms to minimize.
[2024-05-30 01:19:55] [INFO ] Deduced a trap composed of 10 places in 551 ms of which 8 ms to minimize.
[2024-05-30 01:19:55] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 17115 ms
[2024-05-30 01:19:57] [INFO ] Deduced a trap composed of 6 places in 815 ms of which 12 ms to minimize.
[2024-05-30 01:19:58] [INFO ] Deduced a trap composed of 6 places in 837 ms of which 10 ms to minimize.
[2024-05-30 01:19:59] [INFO ] Deduced a trap composed of 10 places in 811 ms of which 10 ms to minimize.
[2024-05-30 01:19:59] [INFO ] Deduced a trap composed of 4 places in 796 ms of which 10 ms to minimize.
[2024-05-30 01:20:00] [INFO ] Deduced a trap composed of 8 places in 815 ms of which 11 ms to minimize.
[2024-05-30 01:20:01] [INFO ] Deduced a trap composed of 7 places in 794 ms of which 10 ms to minimize.
[2024-05-30 01:20:02] [INFO ] Deduced a trap composed of 17 places in 787 ms of which 10 ms to minimize.
[2024-05-30 01:20:03] [INFO ] Deduced a trap composed of 7 places in 788 ms of which 10 ms to minimize.
[2024-05-30 01:20:03] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 7369 ms
[2024-05-30 01:20:04] [INFO ] Deduced a trap composed of 8 places in 789 ms of which 11 ms to minimize.
[2024-05-30 01:20:05] [INFO ] Deduced a trap composed of 7 places in 773 ms of which 10 ms to minimize.
[2024-05-30 01:20:06] [INFO ] Deduced a trap composed of 10 places in 756 ms of which 9 ms to minimize.
[2024-05-30 01:20:07] [INFO ] Deduced a trap composed of 11 places in 770 ms of which 10 ms to minimize.
[2024-05-30 01:20:08] [INFO ] Deduced a trap composed of 8 places in 754 ms of which 9 ms to minimize.
[2024-05-30 01:20:09] [INFO ] Deduced a trap composed of 10 places in 745 ms of which 10 ms to minimize.
[2024-05-30 01:20:09] [INFO ] Deduced a trap composed of 7 places in 782 ms of which 9 ms to minimize.
[2024-05-30 01:20:10] [INFO ] Deduced a trap composed of 9 places in 785 ms of which 11 ms to minimize.
[2024-05-30 01:20:11] [INFO ] Deduced a trap composed of 16 places in 784 ms of which 10 ms to minimize.
[2024-05-30 01:20:12] [INFO ] Deduced a trap composed of 11 places in 733 ms of which 9 ms to minimize.
[2024-05-30 01:20:12] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 8798 ms
[2024-05-30 01:20:18] [INFO ] Deduced a trap composed of 6 places in 756 ms of which 10 ms to minimize.
[2024-05-30 01:20:18] [INFO ] Deduced a trap composed of 6 places in 744 ms of which 9 ms to minimize.
[2024-05-30 01:20:19] [INFO ] Deduced a trap composed of 6 places in 735 ms of which 9 ms to minimize.
[2024-05-30 01:20:20] [INFO ] Deduced a trap composed of 6 places in 734 ms of which 9 ms to minimize.
[2024-05-30 01:20:21] [INFO ] Deduced a trap composed of 8 places in 676 ms of which 9 ms to minimize.
[2024-05-30 01:20:22] [INFO ] Deduced a trap composed of 6 places in 698 ms of which 9 ms to minimize.
[2024-05-30 01:20:23] [INFO ] Deduced a trap composed of 8 places in 738 ms of which 9 ms to minimize.
[2024-05-30 01:20:23] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 5963 ms
[2024-05-30 01:20:24] [INFO ] Deduced a trap composed of 4 places in 685 ms of which 9 ms to minimize.
[2024-05-30 01:20:25] [INFO ] Deduced a trap composed of 8 places in 736 ms of which 9 ms to minimize.
[2024-05-30 01:20:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1718 ms
[2024-05-30 01:20:26] [INFO ] Deduced a trap composed of 6 places in 686 ms of which 9 ms to minimize.
[2024-05-30 01:20:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 874 ms
[2024-05-30 01:20:32] [INFO ] Deduced a trap composed of 6 places in 642 ms of which 8 ms to minimize.
[2024-05-30 01:20:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 856 ms
[2024-05-30 01:20:33] [INFO ] Deduced a trap composed of 9 places in 670 ms of which 9 ms to minimize.
[2024-05-30 01:20:34] [INFO ] Deduced a trap composed of 11 places in 644 ms of which 9 ms to minimize.
[2024-05-30 01:20:35] [INFO ] Deduced a trap composed of 10 places in 629 ms of which 8 ms to minimize.
[2024-05-30 01:20:36] [INFO ] Deduced a trap composed of 12 places in 652 ms of which 9 ms to minimize.
[2024-05-30 01:20:36] [INFO ] Deduced a trap composed of 10 places in 628 ms of which 8 ms to minimize.
[2024-05-30 01:20:37] [INFO ] Deduced a trap composed of 8 places in 647 ms of which 9 ms to minimize.
[2024-05-30 01:20:38] [INFO ] Deduced a trap composed of 8 places in 684 ms of which 10 ms to minimize.
[2024-05-30 01:20:39] [INFO ] Deduced a trap composed of 10 places in 648 ms of which 8 ms to minimize.
[2024-05-30 01:20:39] [INFO ] Deduced a trap composed of 11 places in 652 ms of which 9 ms to minimize.
[2024-05-30 01:20:40] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 6918 ms
[2024-05-30 01:20:40] [INFO ] Deduced a trap composed of 12 places in 654 ms of which 8 ms to minimize.
[2024-05-30 01:20:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 839 ms
[2024-05-30 01:20:42] [INFO ] Deduced a trap composed of 7 places in 644 ms of which 9 ms to minimize.
[2024-05-30 01:20:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 842 ms
TRAPS : Iteration 1
[2024-05-30 01:20:44] [INFO ] Deduced a trap composed of 7 places in 563 ms of which 8 ms to minimize.
[2024-05-30 01:20:45] [INFO ] Deduced a trap composed of 6 places in 533 ms of which 8 ms to minimize.
[2024-05-30 01:20:46] [INFO ] Deduced a trap composed of 11 places in 515 ms of which 7 ms to minimize.
[2024-05-30 01:20:46] [INFO ] Deduced a trap composed of 9 places in 523 ms of which 8 ms to minimize.
[2024-05-30 01:20:47] [INFO ] Deduced a trap composed of 8 places in 545 ms of which 7 ms to minimize.
[2024-05-30 01:20:48] [INFO ] Deduced a trap composed of 10 places in 524 ms of which 7 ms to minimize.
[2024-05-30 01:20:48] [INFO ] Deduced a trap composed of 11 places in 519 ms of which 7 ms to minimize.
[2024-05-30 01:20:49] [INFO ] Deduced a trap composed of 11 places in 580 ms of which 9 ms to minimize.
[2024-05-30 01:20:49] [INFO ] Deduced a trap composed of 8 places in 509 ms of which 7 ms to minimize.
[2024-05-30 01:20:50] [INFO ] Deduced a trap composed of 10 places in 519 ms of which 8 ms to minimize.
[2024-05-30 01:20:51] [INFO ] Deduced a trap composed of 11 places in 500 ms of which 8 ms to minimize.
[2024-05-30 01:20:51] [INFO ] Deduced a trap composed of 7 places in 478 ms of which 7 ms to minimize.
[2024-05-30 01:20:52] [INFO ] Deduced a trap composed of 5 places in 504 ms of which 7 ms to minimize.
[2024-05-30 01:20:52] [INFO ] Deduced a trap composed of 12 places in 477 ms of which 7 ms to minimize.
[2024-05-30 01:20:53] [INFO ] Deduced a trap composed of 7 places in 484 ms of which 7 ms to minimize.
[2024-05-30 01:20:54] [INFO ] Deduced a trap composed of 7 places in 486 ms of which 7 ms to minimize.
[2024-05-30 01:20:54] [INFO ] Deduced a trap composed of 10 places in 477 ms of which 7 ms to minimize.
[2024-05-30 01:20:55] [INFO ] Deduced a trap composed of 6 places in 486 ms of which 7 ms to minimize.
[2024-05-30 01:20:56] [INFO ] Deduced a trap composed of 13 places in 503 ms of which 7 ms to minimize.
[2024-05-30 01:20:56] [INFO ] Deduced a trap composed of 8 places in 473 ms of which 7 ms to minimize.
[2024-05-30 01:20:57] [INFO ] Deduced a trap composed of 10 places in 462 ms of which 7 ms to minimize.
[2024-05-30 01:20:57] [INFO ] Deduced a trap composed of 12 places in 458 ms of which 7 ms to minimize.
[2024-05-30 01:20:58] [INFO ] Deduced a trap composed of 6 places in 484 ms of which 6 ms to minimize.
[2024-05-30 01:20:58] [INFO ] Deduced a trap composed of 10 places in 458 ms of which 6 ms to minimize.
[2024-05-30 01:20:59] [INFO ] Deduced a trap composed of 12 places in 469 ms of which 9 ms to minimize.
[2024-05-30 01:21:00] [INFO ] Deduced a trap composed of 10 places in 467 ms of which 7 ms to minimize.
[2024-05-30 01:21:00] [INFO ] Deduced a trap composed of 8 places in 452 ms of which 7 ms to minimize.
[2024-05-30 01:21:00] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 16525 ms
[2024-05-30 01:21:02] [INFO ] Deduced a trap composed of 6 places in 449 ms of which 7 ms to minimize.
[2024-05-30 01:21:02] [INFO ] Deduced a trap composed of 8 places in 452 ms of which 6 ms to minimize.
[2024-05-30 01:21:03] [INFO ] Deduced a trap composed of 9 places in 434 ms of which 7 ms to minimize.
[2024-05-30 01:21:03] [INFO ] Deduced a trap composed of 8 places in 446 ms of which 6 ms to minimize.
[2024-05-30 01:21:04] [INFO ] Deduced a trap composed of 7 places in 478 ms of which 10 ms to minimize.
[2024-05-30 01:21:04] [INFO ] Deduced a trap composed of 8 places in 466 ms of which 7 ms to minimize.
[2024-05-30 01:21:05] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3472 ms
[2024-05-30 01:21:13] [INFO ] Deduced a trap composed of 8 places in 1186 ms of which 14 ms to minimize.
[2024-05-30 01:21:14] [INFO ] Deduced a trap composed of 6 places in 1155 ms of which 14 ms to minimize.
[2024-05-30 01:21:15] [INFO ] Deduced a trap composed of 6 places in 1170 ms of which 12 ms to minimize.
[2024-05-30 01:21:16] [INFO ] Deduced a trap composed of 14 places in 1129 ms of which 13 ms to minimize.
[2024-05-30 01:21:18] [INFO ] Deduced a trap composed of 6 places in 1127 ms of which 13 ms to minimize.
[2024-05-30 01:21:19] [INFO ] Deduced a trap composed of 8 places in 1161 ms of which 13 ms to minimize.
[2024-05-30 01:21:20] [INFO ] Deduced a trap composed of 6 places in 1156 ms of which 13 ms to minimize.
[2024-05-30 01:21:21] [INFO ] Deduced a trap composed of 7 places in 1124 ms of which 12 ms to minimize.
[2024-05-30 01:21:22] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 10125 ms
[2024-05-30 01:21:25] [INFO ] Deduced a trap composed of 5 places in 686 ms of which 10 ms to minimize.
[2024-05-30 01:21:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 896 ms
[2024-05-30 01:21:27] [INFO ] Deduced a trap composed of 10 places in 574 ms of which 8 ms to minimize.
[2024-05-30 01:21:27] [INFO ] Deduced a trap composed of 9 places in 577 ms of which 8 ms to minimize.
[2024-05-30 01:21:28] [INFO ] Deduced a trap composed of 7 places in 628 ms of which 8 ms to minimize.
[2024-05-30 01:21:29] [INFO ] Deduced a trap composed of 10 places in 563 ms of which 8 ms to minimize.
[2024-05-30 01:21:30] [INFO ] Deduced a trap composed of 9 places in 560 ms of which 8 ms to minimize.
[2024-05-30 01:21:30] [INFO ] Deduced a trap composed of 8 places in 574 ms of which 8 ms to minimize.
[2024-05-30 01:21:31] [INFO ] Deduced a trap composed of 8 places in 555 ms of which 8 ms to minimize.
[2024-05-30 01:21:32] [INFO ] Deduced a trap composed of 6 places in 554 ms of which 8 ms to minimize.
[2024-05-30 01:21:32] [INFO ] Deduced a trap composed of 10 places in 550 ms of which 8 ms to minimize.
[2024-05-30 01:21:32] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 6130 ms
[2024-05-30 01:21:35] [INFO ] Deduced a trap composed of 5 places in 591 ms of which 8 ms to minimize.
[2024-05-30 01:21:36] [INFO ] Deduced a trap composed of 8 places in 581 ms of which 8 ms to minimize.
[2024-05-30 01:21:37] [INFO ] Deduced a trap composed of 8 places in 585 ms of which 8 ms to minimize.
[2024-05-30 01:21:37] [INFO ] Deduced a trap composed of 6 places in 580 ms of which 9 ms to minimize.
[2024-05-30 01:21:38] [INFO ] Deduced a trap composed of 8 places in 581 ms of which 8 ms to minimize.
[2024-05-30 01:21:39] [INFO ] Deduced a trap composed of 6 places in 611 ms of which 8 ms to minimize.
[2024-05-30 01:21:39] [INFO ] Deduced a trap composed of 8 places in 577 ms of which 8 ms to minimize.
[2024-05-30 01:21:40] [INFO ] Deduced a trap composed of 6 places in 571 ms of which 8 ms to minimize.
[2024-05-30 01:21:41] [INFO ] Deduced a trap composed of 13 places in 567 ms of which 8 ms to minimize.
[2024-05-30 01:21:41] [INFO ] Deduced a trap composed of 6 places in 564 ms of which 8 ms to minimize.
[2024-05-30 01:21:42] [INFO ] Deduced a trap composed of 6 places in 553 ms of which 8 ms to minimize.
[2024-05-30 01:21:43] [INFO ] Deduced a trap composed of 9 places in 563 ms of which 7 ms to minimize.
[2024-05-30 01:21:43] [INFO ] Deduced a trap composed of 12 places in 523 ms of which 7 ms to minimize.
[2024-05-30 01:21:44] [INFO ] Deduced a trap composed of 10 places in 536 ms of which 7 ms to minimize.
[2024-05-30 01:21:45] [INFO ] Deduced a trap composed of 8 places in 543 ms of which 7 ms to minimize.
[2024-05-30 01:21:45] [INFO ] Deduced a trap composed of 10 places in 547 ms of which 11 ms to minimize.
[2024-05-30 01:21:46] [INFO ] Deduced a trap composed of 8 places in 530 ms of which 8 ms to minimize.
[2024-05-30 01:21:47] [INFO ] Deduced a trap composed of 8 places in 541 ms of which 7 ms to minimize.
[2024-05-30 01:21:47] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 12411 ms
TRAPS : Iteration 2
[2024-05-30 01:21:48] [INFO ] Deduced a trap composed of 5 places in 500 ms of which 7 ms to minimize.
[2024-05-30 01:21:49] [INFO ] Deduced a trap composed of 8 places in 495 ms of which 7 ms to minimize.
[2024-05-30 01:21:49] [INFO ] Deduced a trap composed of 8 places in 556 ms of which 7 ms to minimize.
[2024-05-30 01:21:50] [INFO ] Deduced a trap composed of 10 places in 498 ms of which 7 ms to minimize.
[2024-05-30 01:21:50] [INFO ] Deduced a trap composed of 8 places in 497 ms of which 7 ms to minimize.
[2024-05-30 01:21:51] [INFO ] Deduced a trap composed of 12 places in 492 ms of which 10 ms to minimize.
[2024-05-30 01:21:52] [INFO ] Deduced a trap composed of 12 places in 487 ms of which 7 ms to minimize.
[2024-05-30 01:21:52] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4332 ms
[2024-05-30 01:21:52] [INFO ] Deduced a trap composed of 11 places in 485 ms of which 7 ms to minimize.
[2024-05-30 01:21:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 688 ms
[2024-05-30 01:22:11] [INFO ] Deduced a trap composed of 7 places in 828 ms of which 10 ms to minimize.
[2024-05-30 01:22:12] [INFO ] Deduced a trap composed of 6 places in 835 ms of which 10 ms to minimize.
[2024-05-30 01:22:13] [INFO ] Deduced a trap composed of 6 places in 821 ms of which 10 ms to minimize.
[2024-05-30 01:22:14] [INFO ] Deduced a trap composed of 9 places in 766 ms of which 10 ms to minimize.
[2024-05-30 01:22:15] [INFO ] Deduced a trap composed of 8 places in 807 ms of which 10 ms to minimize.
[2024-05-30 01:22:16] [INFO ] Deduced a trap composed of 6 places in 798 ms of which 10 ms to minimize.
[2024-05-30 01:22:16] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 5605 ms
[2024-05-30 01:22:27] [INFO ] Deduced a trap composed of 9 places in 599 ms of which 8 ms to minimize.
[2024-05-30 01:22:28] [INFO ] Deduced a trap composed of 4 places in 592 ms of which 8 ms to minimize.
[2024-05-30 01:22:29] [INFO ] Deduced a trap composed of 8 places in 586 ms of which 8 ms to minimize.
[2024-05-30 01:22:29] [INFO ] Deduced a trap composed of 5 places in 601 ms of which 8 ms to minimize.
[2024-05-30 01:22:30] [INFO ] Deduced a trap composed of 7 places in 624 ms of which 7 ms to minimize.
[2024-05-30 01:22:31] [INFO ] Deduced a trap composed of 8 places in 603 ms of which 8 ms to minimize.
[2024-05-30 01:22:31] [INFO ] Deduced a trap composed of 8 places in 585 ms of which 8 ms to minimize.
[2024-05-30 01:22:32] [INFO ] Deduced a trap composed of 6 places in 596 ms of which 8 ms to minimize.
[2024-05-30 01:22:33] [INFO ] Deduced a trap composed of 8 places in 579 ms of which 8 ms to minimize.
[2024-05-30 01:22:34] [INFO ] Deduced a trap composed of 10 places in 578 ms of which 8 ms to minimize.
[2024-05-30 01:22:35] [INFO ] Deduced a trap composed of 11 places in 577 ms of which 7 ms to minimize.
[2024-05-30 01:22:35] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 8121 ms
[2024-05-30 01:22:35] [INFO ] Deduced a trap composed of 6 places in 571 ms of which 8 ms to minimize.
[2024-05-30 01:22:36] [INFO ] Deduced a trap composed of 6 places in 572 ms of which 7 ms to minimize.
[2024-05-30 01:22:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1434 ms
[2024-05-30 01:22:38] [INFO ] Deduced a trap composed of 6 places in 634 ms of which 9 ms to minimize.
[2024-05-30 01:22:39] [INFO ] Deduced a trap composed of 10 places in 615 ms of which 9 ms to minimize.
[2024-05-30 01:22:39] [INFO ] Deduced a trap composed of 6 places in 617 ms of which 9 ms to minimize.
[2024-05-30 01:22:40] [INFO ] Deduced a trap composed of 8 places in 609 ms of which 11 ms to minimize.
[2024-05-30 01:22:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3003 ms
TRAPS : Iteration 3
[2024-05-30 01:22:41] [INFO ] Deduced a trap composed of 6 places in 600 ms of which 8 ms to minimize.
[2024-05-30 01:22:42] [INFO ] Deduced a trap composed of 6 places in 597 ms of which 8 ms to minimize.
[2024-05-30 01:22:43] [INFO ] Deduced a trap composed of 10 places in 603 ms of which 7 ms to minimize.
[2024-05-30 01:22:43] [INFO ] Deduced a trap composed of 8 places in 597 ms of which 8 ms to minimize.
[2024-05-30 01:22:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2911 ms
[2024-05-30 01:22:44] [INFO ] Deduced a trap composed of 8 places in 534 ms of which 8 ms to minimize.
[2024-05-30 01:22:45] [INFO ] Deduced a trap composed of 10 places in 535 ms of which 8 ms to minimize.
[2024-05-30 01:22:46] [INFO ] Deduced a trap composed of 11 places in 535 ms of which 7 ms to minimize.
[2024-05-30 01:22:46] [INFO ] Deduced a trap composed of 10 places in 544 ms of which 7 ms to minimize.
[2024-05-30 01:22:47] [INFO ] Deduced a trap composed of 9 places in 550 ms of which 7 ms to minimize.
[2024-05-30 01:22:47] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3272 ms
[2024-05-30 01:22:49] [INFO ] Deduced a trap composed of 8 places in 493 ms of which 7 ms to minimize.
[2024-05-30 01:22:49] [INFO ] Deduced a trap composed of 8 places in 475 ms of which 7 ms to minimize.
[2024-05-30 01:22:50] [INFO ] Deduced a trap composed of 8 places in 478 ms of which 8 ms to minimize.
[2024-05-30 01:22:50] [INFO ] Deduced a trap composed of 9 places in 482 ms of which 7 ms to minimize.
[2024-05-30 01:22:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2478 ms
[2024-05-30 01:22:54] [INFO ] Deduced a trap composed of 7 places in 1288 ms of which 13 ms to minimize.
[2024-05-30 01:22:56] [INFO ] Deduced a trap composed of 7 places in 1303 ms of which 14 ms to minimize.
[2024-05-30 01:22:57] [INFO ] Deduced a trap composed of 7 places in 1313 ms of which 14 ms to minimize.
[2024-05-30 01:22:58] [INFO ] Deduced a trap composed of 10 places in 1302 ms of which 14 ms to minimize.
[2024-05-30 01:23:00] [INFO ] Deduced a trap composed of 12 places in 1306 ms of which 14 ms to minimize.
[2024-05-30 01:23:01] [INFO ] Deduced a trap composed of 6 places in 1322 ms of which 13 ms to minimize.
[2024-05-30 01:23:02] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 8753 ms
[2024-05-30 01:23:03] [INFO ] Deduced a trap composed of 6 places in 773 ms of which 10 ms to minimize.
[2024-05-30 01:23:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1003 ms
[2024-05-30 01:23:10] [INFO ] Deduced a trap composed of 13 places in 610 ms of which 9 ms to minimize.
[2024-05-30 01:23:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 807 ms
[2024-05-30 01:23:11] [INFO ] Deduced a trap composed of 13 places in 654 ms of which 8 ms to minimize.
[2024-05-30 01:23:12] [INFO ] Deduced a trap composed of 10 places in 605 ms of which 8 ms to minimize.
[2024-05-30 01:23:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1548 ms
[2024-05-30 01:23:14] [INFO ] Deduced a trap composed of 8 places in 536 ms of which 7 ms to minimize.
[2024-05-30 01:23:15] [INFO ] Deduced a trap composed of 6 places in 514 ms of which 7 ms to minimize.
[2024-05-30 01:23:15] [INFO ] Deduced a trap composed of 7 places in 518 ms of which 7 ms to minimize.
[2024-05-30 01:23:16] [INFO ] Deduced a trap composed of 6 places in 536 ms of which 19 ms to minimize.
[2024-05-30 01:23:16] [INFO ] Deduced a trap composed of 7 places in 510 ms of which 7 ms to minimize.
[2024-05-30 01:23:17] [INFO ] Deduced a trap composed of 9 places in 484 ms of which 8 ms to minimize.
[2024-05-30 01:23:18] [INFO ] Deduced a trap composed of 7 places in 494 ms of which 7 ms to minimize.
[2024-05-30 01:23:18] [INFO ] Deduced a trap composed of 6 places in 516 ms of which 8 ms to minimize.
[2024-05-30 01:23:19] [INFO ] Deduced a trap composed of 8 places in 505 ms of which 7 ms to minimize.
[2024-05-30 01:23:20] [INFO ] Deduced a trap composed of 6 places in 486 ms of which 7 ms to minimize.
[2024-05-30 01:23:20] [INFO ] Deduced a trap composed of 6 places in 488 ms of which 7 ms to minimize.
[2024-05-30 01:23:21] [INFO ] Deduced a trap composed of 12 places in 475 ms of which 7 ms to minimize.
[2024-05-30 01:23:21] [INFO ] Deduced a trap composed of 12 places in 468 ms of which 7 ms to minimize.
[2024-05-30 01:23:22] [INFO ] Deduced a trap composed of 10 places in 473 ms of which 7 ms to minimize.
[2024-05-30 01:23:22] [INFO ] Deduced a trap composed of 11 places in 482 ms of which 6 ms to minimize.
[2024-05-30 01:23:23] [INFO ] Deduced a trap composed of 15 places in 472 ms of which 7 ms to minimize.
[2024-05-30 01:23:24] [INFO ] Deduced a trap composed of 13 places in 461 ms of which 7 ms to minimize.
[2024-05-30 01:23:24] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 10360 ms
TRAPS : Iteration 4
[2024-05-30 01:23:25] [INFO ] Deduced a trap composed of 6 places in 463 ms of which 7 ms to minimize.
[2024-05-30 01:23:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 659 ms
[2024-05-30 01:23:29] [INFO ] Deduced a trap composed of 8 places in 1319 ms of which 12 ms to minimize.
[2024-05-30 01:23:30] [INFO ] Deduced a trap composed of 6 places in 1304 ms of which 13 ms to minimize.
[2024-05-30 01:23:32] [INFO ] Deduced a trap composed of 6 places in 1317 ms of which 13 ms to minimize.
[2024-05-30 01:23:33] [INFO ] Deduced a trap composed of 8 places in 1298 ms of which 14 ms to minimize.
[2024-05-30 01:23:33] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 5815 ms
[2024-05-30 01:23:39] [INFO ] Deduced a trap composed of 8 places in 555 ms of which 8 ms to minimize.
[2024-05-30 01:23:39] [INFO ] Deduced a trap composed of 12 places in 559 ms of which 8 ms to minimize.
[2024-05-30 01:23:40] [INFO ] Deduced a trap composed of 11 places in 545 ms of which 7 ms to minimize.
[2024-05-30 01:23:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2103 ms
[2024-05-30 01:23:41] [INFO ] Deduced a trap composed of 8 places in 552 ms of which 8 ms to minimize.
[2024-05-30 01:23:42] [INFO ] Deduced a trap composed of 8 places in 554 ms of which 8 ms to minimize.
[2024-05-30 01:23:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1389 ms
[2024-05-30 01:23:43] [INFO ] Deduced a trap composed of 9 places in 540 ms of which 8 ms to minimize.
[2024-05-30 01:23:44] [INFO ] Deduced a trap composed of 11 places in 547 ms of which 8 ms to minimize.
[2024-05-30 01:23:45] [INFO ] Deduced a trap composed of 7 places in 563 ms of which 8 ms to minimize.
[2024-05-30 01:23:45] [INFO ] Deduced a trap composed of 9 places in 550 ms of which 8 ms to minimize.
[2024-05-30 01:23:46] [INFO ] Deduced a trap composed of 8 places in 532 ms of which 7 ms to minimize.
[2024-05-30 01:23:47] [INFO ] Deduced a trap composed of 11 places in 534 ms of which 7 ms to minimize.
[2024-05-30 01:23:47] [INFO ] Deduced a trap composed of 11 places in 529 ms of which 8 ms to minimize.
[2024-05-30 01:23:48] [INFO ] Deduced a trap composed of 6 places in 533 ms of which 7 ms to minimize.
[2024-05-30 01:23:48] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 5310 ms
TRAPS : Iteration 5
[2024-05-30 01:23:49] [INFO ] Deduced a trap composed of 9 places in 496 ms of which 7 ms to minimize.
[2024-05-30 01:23:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 699 ms
[2024-05-30 01:23:56] [INFO ] Deduced a trap composed of 10 places in 738 ms of which 10 ms to minimize.
[2024-05-30 01:23:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 929 ms
[2024-05-30 01:24:03] [INFO ] Deduced a trap composed of 9 places in 572 ms of which 8 ms to minimize.
[2024-05-30 01:24:04] [INFO ] Deduced a trap composed of 9 places in 540 ms of which 8 ms to minimize.
[2024-05-30 01:24:05] [INFO ] Deduced a trap composed of 8 places in 504 ms of which 7 ms to minimize.
[2024-05-30 01:24:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2066 ms
[2024-05-30 01:24:07] [INFO ] Deduced a trap composed of 10 places in 517 ms of which 7 ms to minimize.
[2024-05-30 01:24:08] [INFO ] Deduced a trap composed of 10 places in 525 ms of which 7 ms to minimize.
[2024-05-30 01:24:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1381 ms
TRAPS : Iteration 6
[2024-05-30 01:24:09] [INFO ] Deduced a trap composed of 11 places in 525 ms of which 7 ms to minimize.
[2024-05-30 01:24:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 709 ms
[2024-05-30 01:24:11] [INFO ] Deduced a trap composed of 8 places in 794 ms of which 10 ms to minimize.
[2024-05-30 01:24:12] [INFO ] Deduced a trap composed of 6 places in 824 ms of which 11 ms to minimize.
[2024-05-30 01:24:13] [INFO ] Deduced a trap composed of 8 places in 818 ms of which 11 ms to minimize.
[2024-05-30 01:24:14] [INFO ] Deduced a trap composed of 6 places in 810 ms of which 11 ms to minimize.
[2024-05-30 01:24:15] [INFO ] Deduced a trap composed of 10 places in 810 ms of which 10 ms to minimize.
[2024-05-30 01:24:15] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 4869 ms
[2024-05-30 01:24:23] [INFO ] Deduced a trap composed of 9 places in 734 ms of which 10 ms to minimize.
[2024-05-30 01:24:24] [INFO ] Deduced a trap composed of 9 places in 719 ms of which 9 ms to minimize.
[2024-05-30 01:24:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1824 ms
[2024-05-30 01:24:26] [INFO ] Deduced a trap composed of 8 places in 726 ms of which 9 ms to minimize.
[2024-05-30 01:24:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 925 ms
[2024-05-30 01:24:34] [INFO ] Deduced a trap composed of 8 places in 657 ms of which 9 ms to minimize.
[2024-05-30 01:24:35] [INFO ] Deduced a trap composed of 12 places in 658 ms of which 9 ms to minimize.
[2024-05-30 01:24:35] [INFO ] Deduced a trap composed of 6 places in 641 ms of which 9 ms to minimize.
[2024-05-30 01:24:36] [INFO ] Deduced a trap composed of 6 places in 638 ms of which 9 ms to minimize.
[2024-05-30 01:24:37] [INFO ] Deduced a trap composed of 11 places in 615 ms of which 8 ms to minimize.
[2024-05-30 01:24:38] [INFO ] Deduced a trap composed of 8 places in 613 ms of which 9 ms to minimize.
[2024-05-30 01:24:39] [INFO ] Deduced a trap composed of 8 places in 617 ms of which 9 ms to minimize.
[2024-05-30 01:24:39] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 5518 ms
[2024-05-30 01:24:40] [INFO ] Deduced a trap composed of 9 places in 586 ms of which 9 ms to minimize.
[2024-05-30 01:24:41] [INFO ] Deduced a trap composed of 8 places in 579 ms of which 8 ms to minimize.
[2024-05-30 01:24:42] [INFO ] Deduced a trap composed of 12 places in 557 ms of which 8 ms to minimize.
[2024-05-30 01:24:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2172 ms
[2024-05-30 01:24:44] [INFO ] Deduced a trap composed of 9 places in 521 ms of which 7 ms to minimize.
[2024-05-30 01:24:44] [INFO ] Deduced a trap composed of 7 places in 504 ms of which 7 ms to minimize.
[2024-05-30 01:24:45] [INFO ] Deduced a trap composed of 10 places in 506 ms of which 8 ms to minimize.
[2024-05-30 01:24:46] [INFO ] Deduced a trap composed of 9 places in 505 ms of which 7 ms to minimize.
[2024-05-30 01:24:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2628 ms
TRAPS : Iteration 7
[2024-05-30 01:24:48] [INFO ] Deduced a trap composed of 9 places in 483 ms of which 8 ms to minimize.
[2024-05-30 01:24:48] [INFO ] Deduced a trap composed of 13 places in 464 ms of which 7 ms to minimize.
[2024-05-30 01:24:49] [INFO ] Deduced a trap composed of 13 places in 467 ms of which 7 ms to minimize.
[2024-05-30 01:24:50] [INFO ] Deduced a trap composed of 15 places in 460 ms of which 7 ms to minimize.
[2024-05-30 01:24:50] [INFO ] Deduced a trap composed of 8 places in 430 ms of which 7 ms to minimize.
[2024-05-30 01:24:51] [INFO ] Deduced a trap composed of 10 places in 413 ms of which 6 ms to minimize.
[2024-05-30 01:24:51] [INFO ] Deduced a trap composed of 8 places in 407 ms of which 6 ms to minimize.
[2024-05-30 01:24:51] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4173 ms
[2024-05-30 01:24:52] [INFO ] Deduced a trap composed of 8 places in 409 ms of which 6 ms to minimize.
[2024-05-30 01:24:52] [INFO ] Deduced a trap composed of 13 places in 386 ms of which 6 ms to minimize.
[2024-05-30 01:24:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1078 ms
[2024-05-30 01:25:00] [INFO ] Deduced a trap composed of 6 places in 1173 ms of which 13 ms to minimize.
[2024-05-30 01:25:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1369 ms
[2024-05-30 01:25:05] [INFO ] Deduced a trap composed of 8 places in 615 ms of which 9 ms to minimize.
[2024-05-30 01:25:06] [INFO ] Deduced a trap composed of 8 places in 613 ms of which 9 ms to minimize.
[2024-05-30 01:25:07] [INFO ] Deduced a trap composed of 6 places in 610 ms of which 9 ms to minimize.
[2024-05-30 01:25:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2229 ms
[2024-05-30 01:25:09] [INFO ] Deduced a trap composed of 8 places in 606 ms of which 8 ms to minimize.
[2024-05-30 01:25:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 806 ms
TRAPS : Iteration 8
[2024-05-30 01:25:10] [INFO ] Deduced a trap composed of 14 places in 571 ms of which 9 ms to minimize.
[2024-05-30 01:25:11] [INFO ] Deduced a trap composed of 8 places in 561 ms of which 7 ms to minimize.
[2024-05-30 01:25:11] [INFO ] Deduced a trap composed of 9 places in 563 ms of which 8 ms to minimize.
[2024-05-30 01:25:12] [INFO ] Deduced a trap composed of 9 places in 580 ms of which 7 ms to minimize.
[2024-05-30 01:25:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2794 ms
[2024-05-30 01:25:17] [INFO ] Deduced a trap composed of 7 places in 1277 ms of which 14 ms to minimize.
[2024-05-30 01:25:18] [INFO ] Deduced a trap composed of 5 places in 1283 ms of which 14 ms to minimize.
[2024-05-30 01:25:20] [INFO ] Deduced a trap composed of 6 places in 1250 ms of which 13 ms to minimize.
[2024-05-30 01:25:21] [INFO ] Deduced a trap composed of 7 places in 1271 ms of which 13 ms to minimize.
[2024-05-30 01:25:22] [INFO ] Deduced a trap composed of 10 places in 1296 ms of which 14 ms to minimize.
[2024-05-30 01:25:24] [INFO ] Deduced a trap composed of 5 places in 1261 ms of which 13 ms to minimize.
[2024-05-30 01:25:25] [INFO ] Deduced a trap composed of 6 places in 1258 ms of which 13 ms to minimize.
[2024-05-30 01:25:26] [INFO ] Deduced a trap composed of 3 places in 1250 ms of which 13 ms to minimize.
[2024-05-30 01:25:27] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 11042 ms
[2024-05-30 01:25:28] [INFO ] Deduced a trap composed of 6 places in 1102 ms of which 13 ms to minimize.
[2024-05-30 01:25:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1361 ms
[2024-05-30 01:25:35] [INFO ] Deduced a trap composed of 8 places in 509 ms of which 8 ms to minimize.
[2024-05-30 01:25:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 728 ms
[2024-05-30 01:25:36] [INFO ] Deduced a trap composed of 13 places in 487 ms of which 7 ms to minimize.
[2024-05-30 01:25:37] [INFO ] Deduced a trap composed of 17 places in 497 ms of which 7 ms to minimize.
[2024-05-30 01:25:37] [INFO ] Deduced a trap composed of 10 places in 493 ms of which 7 ms to minimize.
[2024-05-30 01:25:38] [INFO ] Deduced a trap composed of 8 places in 493 ms of which 7 ms to minimize.
[2024-05-30 01:25:38] [INFO ] Deduced a trap composed of 10 places in 515 ms of which 7 ms to minimize.
[2024-05-30 01:25:39] [INFO ] Deduced a trap composed of 9 places in 487 ms of which 7 ms to minimize.
[2024-05-30 01:25:40] [INFO ] Deduced a trap composed of 8 places in 502 ms of which 7 ms to minimize.
[2024-05-30 01:25:40] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4386 ms
TRAPS : Iteration 9
[2024-05-30 01:25:44] [INFO ] Deduced a trap composed of 14 places in 512 ms of which 7 ms to minimize.
[2024-05-30 01:25:44] [INFO ] Deduced a trap composed of 8 places in 493 ms of which 7 ms to minimize.
[2024-05-30 01:25:45] [INFO ] Deduced a trap composed of 12 places in 491 ms of which 7 ms to minimize.
[2024-05-30 01:25:46] [INFO ] Deduced a trap composed of 10 places in 489 ms of which 7 ms to minimize.
[2024-05-30 01:25:46] [INFO ] Deduced a trap composed of 17 places in 471 ms of which 7 ms to minimize.
[2024-05-30 01:25:47] [INFO ] Deduced a trap composed of 11 places in 470 ms of which 7 ms to minimize.
[2024-05-30 01:25:48] [INFO ] Deduced a trap composed of 10 places in 512 ms of which 8 ms to minimize.
[2024-05-30 01:25:48] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4384 ms
[2024-05-30 01:25:49] [INFO ] Deduced a trap composed of 8 places in 474 ms of which 7 ms to minimize.
[2024-05-30 01:25:50] [INFO ] Deduced a trap composed of 7 places in 499 ms of which 7 ms to minimize.
[2024-05-30 01:25:51] [INFO ] Deduced a trap composed of 7 places in 486 ms of which 8 ms to minimize.
[2024-05-30 01:25:51] [INFO ] Deduced a trap composed of 8 places in 492 ms of which 8 ms to minimize.
[2024-05-30 01:25:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2503 ms
[2024-05-30 01:25:53] [INFO ] Deduced a trap composed of 6 places in 719 ms of which 9 ms to minimize.
[2024-05-30 01:25:54] [INFO ] Deduced a trap composed of 12 places in 1295 ms of which 13 ms to minimize.
[2024-05-30 01:25:56] [INFO ] Deduced a trap composed of 18 places in 1198 ms of which 12 ms to minimize.
[2024-05-30 01:25:57] [INFO ] Deduced a trap composed of 7 places in 1209 ms of which 14 ms to minimize.
[2024-05-30 01:25:58] [INFO ] Deduced a trap composed of 6 places in 1293 ms of which 14 ms to minimize.
[2024-05-30 01:26:00] [INFO ] Deduced a trap composed of 6 places in 1310 ms of which 15 ms to minimize.
[2024-05-30 01:26:00] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 7833 ms
[2024-05-30 01:26:11] [INFO ] Deduced a trap composed of 5 places in 814 ms of which 10 ms to minimize.
[2024-05-30 01:26:12] [INFO ] Deduced a trap composed of 11 places in 795 ms of which 10 ms to minimize.
[2024-05-30 01:26:13] [INFO ] Deduced a trap composed of 6 places in 804 ms of which 14 ms to minimize.
[2024-05-30 01:26:14] [INFO ] Deduced a trap composed of 5 places in 804 ms of which 10 ms to minimize.
[2024-05-30 01:26:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3790 ms
[2024-05-30 01:26:15] [INFO ] Deduced a trap composed of 6 places in 771 ms of which 10 ms to minimize.
[2024-05-30 01:26:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 966 ms
[2024-05-30 01:26:24] [INFO ] Deduced a trap composed of 6 places in 573 ms of which 9 ms to minimize.
[2024-05-30 01:26:25] [INFO ] Deduced a trap composed of 6 places in 573 ms of which 8 ms to minimize.
[2024-05-30 01:26:26] [INFO ] Deduced a trap composed of 10 places in 556 ms of which 9 ms to minimize.
[2024-05-30 01:26:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2154 ms
[2024-05-30 01:26:27] [INFO ] Deduced a trap composed of 8 places in 449 ms of which 7 ms to minimize.
[2024-05-30 01:26:27] [INFO ] Deduced a trap composed of 10 places in 456 ms of which 7 ms to minimize.
[2024-05-30 01:26:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1225 ms
TRAPS : Iteration 10
[2024-05-30 01:26:31] [INFO ] Deduced a trap composed of 8 places in 349 ms of which 6 ms to minimize.
[2024-05-30 01:26:31] [INFO ] Deduced a trap composed of 6 places in 342 ms of which 6 ms to minimize.
[2024-05-30 01:26:32] [INFO ] Deduced a trap composed of 12 places in 324 ms of which 6 ms to minimize.
[2024-05-30 01:26:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1521 ms
[2024-05-30 01:26:34] [INFO ] Deduced a trap composed of 4 places in 329 ms of which 5 ms to minimize.
[2024-05-30 01:26:35] [INFO ] Deduced a trap composed of 6 places in 333 ms of which 6 ms to minimize.
[2024-05-30 01:26:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 975 ms
TRAPS : Iteration 11
[2024-05-30 01:26:37] [INFO ] After 446235ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
[2024-05-30 01:26:37] [INFO ] After 450029ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Over-approximation ignoring read arcs solved 0 properties in 451334 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-30 01:26:37] [INFO ] Flatten gal took : 227 ms
[2024-05-30 01:26:37] [INFO ] Applying decomposition
[2024-05-30 01:26:37] [INFO ] Flatten gal took : 180 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/graph1211494133819299742.txt' '-o' '/tmp/graph1211494133819299742.bin' '-w' '/tmp/graph1211494133819299742.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1211494133819299742.bin' '-l' '-1' '-v' '-w' '/tmp/graph1211494133819299742.weights' '-q' '0' '-e' '0.001'
[2024-05-30 01:26:38] [INFO ] Decomposing Gal with order
[2024-05-30 01:26:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 01:26:42] [INFO ] Removed a total of 600 redundant transitions.
[2024-05-30 01:26:42] [INFO ] Flatten gal took : 413 ms
[2024-05-30 01:26:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 33 ms.
[2024-05-30 01:26:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11657617124798085508.gal : 102 ms
[2024-05-30 01:26:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5870725998193499875.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/ReachabilityCardinality11657617124798085508.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5870725998193499875.prop' '--nowitness'
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 ...308
Loading property file /tmp/ReachabilityCardinality5870725998193499875.prop.
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :1 after 694724
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :694724 after 1.93113e+16
ITS-tools command line returned an error code 137
[2024-05-30 01:34:20] [INFO ] Flatten gal took : 101 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12934274347456995176
[2024-05-30 01:34:20] [INFO ] Too many transitions (2252) to apply POR reductions. Disabling POR matrices.
[2024-05-30 01:34:20] [INFO ] Applying decomposition
[2024-05-30 01:34:20] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12934274347456995176
Running compilation step : cd /tmp/ltsmin12934274347456995176;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '65' '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'
[2024-05-30 01:34:20] [INFO ] Flatten gal took : 107 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/graph17135643033058135805.txt' '-o' '/tmp/graph17135643033058135805.bin' '-w' '/tmp/graph17135643033058135805.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17135643033058135805.bin' '-l' '-1' '-v' '-w' '/tmp/graph17135643033058135805.weights' '-q' '0' '-e' '0.001'
[2024-05-30 01:34:21] [INFO ] Decomposing Gal with order
[2024-05-30 01:34:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 01:34:21] [INFO ] Removed a total of 1355 redundant transitions.
[2024-05-30 01:34:21] [INFO ] Flatten gal took : 127 ms
[2024-05-30 01:34:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 556 labels/synchronizations in 156 ms.
[2024-05-30 01:34:21] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability7189851902858261604.gal : 27 ms
[2024-05-30 01:34:21] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability13784508235186140522.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/ReachabilityFireability7189851902858261604.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability13784508235186140522.prop' '--nowitness'
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 ...308
Loading property file /tmp/ReachabilityFireability13784508235186140522.prop.
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :3 after 3
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :3 after 9
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :9 after 351
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :351 after 2943
Compilation finished in 7164 ms.
Running link step : cd /tmp/ltsmin12934274347456995176;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin12934274347456995176;'/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' 'ShieldPPPtPT100BReachabilityFireability202300==true'
WARNING : LTSmin timed out (>29 s) on command cd /tmp/ltsmin12934274347456995176;'/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' 'ShieldPPPtPT100BReachabilityFireability202300==true'
Running LTSmin : cd /tmp/ltsmin12934274347456995176;'/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' 'ShieldPPPtPT100BReachabilityFireability202403==true'
WARNING : LTSmin timed out (>29 s) on command cd /tmp/ltsmin12934274347456995176;'/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' 'ShieldPPPtPT100BReachabilityFireability202403==true'
Running LTSmin : cd /tmp/ltsmin12934274347456995176;'/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' 'ShieldPPPtPT100BReachabilityFireability202405==true'
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :2943 after 7.19971e+12
WARNING : LTSmin timed out (>29 s) on command cd /tmp/ltsmin12934274347456995176;'/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' 'ShieldPPPtPT100BReachabilityFireability202405==true'
Running LTSmin : cd /tmp/ltsmin12934274347456995176;'/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' 'ShieldPPPtPT100BReachabilityFireability202406==true'
WARNING : LTSmin timed out (>29 s) on command cd /tmp/ltsmin12934274347456995176;'/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' 'ShieldPPPtPT100BReachabilityFireability202406==true'
Running LTSmin : cd /tmp/ltsmin12934274347456995176;'/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' 'ShieldPPPtPT100BReachabilityFireability202408==true'
WARNING : LTSmin timed out (>29 s) on command cd /tmp/ltsmin12934274347456995176;'/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' 'ShieldPPPtPT100BReachabilityFireability202408==true'
Running LTSmin : cd /tmp/ltsmin12934274347456995176;'/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' 'ShieldPPPtPT100BReachabilityFireability202409==true'
WARNING : LTSmin timed out (>29 s) on command cd /tmp/ltsmin12934274347456995176;'/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' 'ShieldPPPtPT100BReachabilityFireability202409==true'
Running LTSmin : cd /tmp/ltsmin12934274347456995176;'/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' 'ShieldPPPtPT100BReachabilityFireability202410==true'
WARNING : LTSmin timed out (>29 s) on command cd /tmp/ltsmin12934274347456995176;'/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' 'ShieldPPPtPT100BReachabilityFireability202410==true'
Running LTSmin : cd /tmp/ltsmin12934274347456995176;'/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' 'ShieldPPPtPT100BReachabilityFireability202411==true'
WARNING : LTSmin timed out (>29 s) on command cd /tmp/ltsmin12934274347456995176;'/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' 'ShieldPPPtPT100BReachabilityFireability202411==true'
Running LTSmin : cd /tmp/ltsmin12934274347456995176;'/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' 'ShieldPPPtPT100BReachabilityFireability202412==true'
WARNING : LTSmin timed out (>29 s) on command cd /tmp/ltsmin12934274347456995176;'/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' 'ShieldPPPtPT100BReachabilityFireability202412==true'
Running LTSmin : cd /tmp/ltsmin12934274347456995176;'/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' 'ShieldPPPtPT100BReachabilityFireability202413==true'
WARNING : LTSmin timed out (>29 s) on command cd /tmp/ltsmin12934274347456995176;'/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' 'ShieldPPPtPT100BReachabilityFireability202413==true'
Running LTSmin : cd /tmp/ltsmin12934274347456995176;'/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' 'ShieldPPPtPT100BReachabilityFireability202415==true'
WARNING : LTSmin timed out (>29 s) on command cd /tmp/ltsmin12934274347456995176;'/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' 'ShieldPPPtPT100BReachabilityFireability202415==true'
Retrying LTSmin with larger timeout 2616 s
Running LTSmin : cd /tmp/ltsmin12934274347456995176;'/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' 'ShieldPPPtPT100BReachabilityFireability202300==true'
WARNING : LTSmin timed out (>237 s) on command cd /tmp/ltsmin12934274347456995176;'/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' 'ShieldPPPtPT100BReachabilityFireability202300==true'
Running LTSmin : cd /tmp/ltsmin12934274347456995176;'/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' 'ShieldPPPtPT100BReachabilityFireability202403==true'
WARNING : LTSmin timed out (>237 s) on command cd /tmp/ltsmin12934274347456995176;'/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' 'ShieldPPPtPT100BReachabilityFireability202403==true'
Running LTSmin : cd /tmp/ltsmin12934274347456995176;'/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' 'ShieldPPPtPT100BReachabilityFireability202405==true'
WARNING : LTSmin timed out (>237 s) on command cd /tmp/ltsmin12934274347456995176;'/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' 'ShieldPPPtPT100BReachabilityFireability202405==true'
Running LTSmin : cd /tmp/ltsmin12934274347456995176;'/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' 'ShieldPPPtPT100BReachabilityFireability202406==true'
WARNING : LTSmin timed out (>237 s) on command cd /tmp/ltsmin12934274347456995176;'/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' 'ShieldPPPtPT100BReachabilityFireability202406==true'
Running LTSmin : cd /tmp/ltsmin12934274347456995176;'/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' 'ShieldPPPtPT100BReachabilityFireability202408==true'
WARNING : LTSmin timed out (>237 s) on command cd /tmp/ltsmin12934274347456995176;'/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' 'ShieldPPPtPT100BReachabilityFireability202408==true'
Running LTSmin : cd /tmp/ltsmin12934274347456995176;'/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' 'ShieldPPPtPT100BReachabilityFireability202409==true'
Detected timeout of ITS tools.
[2024-05-30 02:01:13] [INFO ] Applying decomposition
[2024-05-30 02:01:13] [INFO ] Flatten gal took : 246 ms
[2024-05-30 02:01:13] [INFO ] Decomposing Gal with order
[2024-05-30 02:01:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:01:15] [INFO ] Removed a total of 1456 redundant transitions.
[2024-05-30 02:01:15] [INFO ] Flatten gal took : 324 ms
[2024-05-30 02:01:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 2076 labels/synchronizations in 1048 ms.
[2024-05-30 02:01:24] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability14012532165344488997.gal : 195 ms
[2024-05-30 02:01:24] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability11915645290988182570.prop : 3 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/ReachabilityFireability14012532165344488997.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability11915645290988182570.prop' '--nowitness'
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 ...309
Loading property file /tmp/ReachabilityFireability11915645290988182570.prop.
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :6 after 6
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :6 after 21
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :21 after 1515
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :1515 after 7.77568e+14
WARNING : LTSmin timed out (>237 s) on command cd /tmp/ltsmin12934274347456995176;'/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' 'ShieldPPPtPT100BReachabilityFireability202409==true'
Running LTSmin : cd /tmp/ltsmin12934274347456995176;'/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' 'ShieldPPPtPT100BReachabilityFireability202410==true'
WARNING : LTSmin timed out (>237 s) on command cd /tmp/ltsmin12934274347456995176;'/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' 'ShieldPPPtPT100BReachabilityFireability202410==true'
Running LTSmin : cd /tmp/ltsmin12934274347456995176;'/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' 'ShieldPPPtPT100BReachabilityFireability202411==true'
WARNING : LTSmin timed out (>237 s) on command cd /tmp/ltsmin12934274347456995176;'/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' 'ShieldPPPtPT100BReachabilityFireability202411==true'
Running LTSmin : cd /tmp/ltsmin12934274347456995176;'/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' 'ShieldPPPtPT100BReachabilityFireability202412==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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -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="ShieldPPPt-PT-100B"
export BK_EXAMINATION="ReachabilityFireability"
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 ShieldPPPt-PT-100B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r356-tall-171683761700703"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-100B.tgz
mv ShieldPPPt-PT-100B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;