About the Execution of ITS-Tools for FireWire-PT-12
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
3187.672 | 119079.00 | 340735.00 | 186.00 | T | 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.r561-tall-171734906300162.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 FireWire-PT-12, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r561-tall-171734906300162
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 125K Jun 2 16:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
FORMULA_NAME QuasiLiveness
=== Now, execution of the tool begins
BK_START 1717353801099
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=FireWire-PT-12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
QuasiLiveness PT
Running Version 202405141337
[2024-06-02 18:43:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2024-06-02 18:43:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:43:22] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2024-06-02 18:43:22] [INFO ] Transformed 169 places.
[2024-06-02 18:43:22] [INFO ] Transformed 508 transitions.
[2024-06-02 18:43:22] [INFO ] Found NUPN structural information;
[2024-06-02 18:43:22] [INFO ] Parsed PT model containing 169 places and 508 transitions and 1889 arcs in 186 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 169/169 places, 508/508 transitions.
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 169 transition count 440
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 68 place count 169 transition count 434
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 80 place count 163 transition count 434
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 86 place count 160 transition count 431
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 92 place count 157 transition count 437
Applied a total of 92 rules in 62 ms. Remains 157 /169 variables (removed 12) and now considering 437/508 (removed 71) transitions.
[2024-06-02 18:43:22] [INFO ] Flow matrix only has 389 transitions (discarded 48 similar events)
// Phase 1: matrix 389 rows 157 cols
[2024-06-02 18:43:22] [INFO ] Computed 10 invariants in 17 ms
[2024-06-02 18:43:22] [INFO ] Implicit Places using invariants in 297 ms returned []
[2024-06-02 18:43:22] [INFO ] Flow matrix only has 389 transitions (discarded 48 similar events)
[2024-06-02 18:43:22] [INFO ] Invariant cache hit.
[2024-06-02 18:43:23] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 18:43:23] [INFO ] Implicit Places using invariants and state equation in 348 ms returned [59, 107, 155]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 681 ms to find 3 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 154/169 places, 437/508 transitions.
Applied a total of 0 rules in 8 ms. Remains 154 /154 variables (removed 0) and now considering 437/437 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 767 ms. Remains : 154/169 places, 437/508 transitions.
Discarding 138 transitions out of 437. Remains 299
Initial state reduction rules removed 1 formulas.
[2024-06-02 18:43:24] [INFO ] Flatten gal took : 320 ms
RANDOM walk for 40000 steps (1270 resets) in 3239 ms. (12 steps per ms) remains 89/298 properties
BEST_FIRST walk for 4004 steps (27 resets) in 74 ms. (53 steps per ms) remains 89/89 properties
[2024-06-02 18:43:24] [INFO ] Flatten gal took : 126 ms
BEST_FIRST walk for 4003 steps (8 resets) in 64 ms. (61 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4003 steps (8 resets) in 82 ms. (48 steps per ms) remains 89/89 properties
[2024-06-02 18:43:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8509094473973085005.gal : 50 ms
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4003 steps (16 resets) in 51 ms. (76 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 87/89 properties
[2024-06-02 18:43:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9698922322585950646.prop : 4 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/ReachabilityCardinality8509094473973085005.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9698922322585950646.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 86/87 properties
BEST_FIRST walk for 4003 steps (27 resets) in 15 ms. (250 steps per ms) remains 85/86 properties
BEST_FIRST walk for 4004 steps (38 resets) in 19 ms. (200 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4004 steps (28 resets) in 14 ms. (266 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 83/85 properties
BEST_FIRST walk for 4003 steps (26 resets) in 15 ms. (250 steps per ms) remains 83/83 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 4003 steps (34 resets) in 42 ms. (93 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4003 steps (26 resets) in 14 ms. (266 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 80/83 properties
BEST_FIRST walk for 4003 steps (23 resets) in 14 ms. (266 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 79/80 properties
BEST_FIRST walk for 4004 steps (26 resets) in 13 ms. (286 steps per ms) remains 79/79 properties
Loading property file /tmp/ReachabilityCardinality9698922322585950646.prop.
BEST_FIRST walk for 4002 steps (34 resets) in 27 ms. (142 steps per ms) remains 79/79 properties
BEST_FIRST walk for 4004 steps (26 resets) in 18 ms. (210 steps per ms) remains 79/79 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 79/79 properties
BEST_FIRST walk for 4003 steps (29 resets) in 13 ms. (285 steps per ms) remains 79/79 properties
BEST_FIRST walk for 4004 steps (44 resets) in 22 ms. (174 steps per ms) remains 79/79 properties
BEST_FIRST walk for 4003 steps (28 resets) in 19 ms. (200 steps per ms) remains 79/79 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 79/79 properties
BEST_FIRST walk for 4003 steps (24 resets) in 14 ms. (266 steps per ms) remains 79/79 properties
BEST_FIRST walk for 4003 steps (39 resets) in 14 ms. (266 steps per ms) remains 79/79 properties
BEST_FIRST walk for 4001 steps (26 resets) in 14 ms. (266 steps per ms) remains 79/79 properties
BEST_FIRST walk for 4003 steps (9 resets) in 13 ms. (285 steps per ms) remains 78/79 properties
SDD proceeding with computation,87 properties remain. new max is 4
SDD size :1 after 3
BEST_FIRST walk for 4004 steps (23 resets) in 13 ms. (286 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (39 resets) in 13 ms. (286 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (25 resets) in 28 ms. (138 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (26 resets) in 14 ms. (266 steps per ms) remains 78/78 properties
SDD proceeding with computation,87 properties remain. new max is 8
SDD size :3 after 4
BEST_FIRST walk for 4004 steps (36 resets) in 14 ms. (266 steps per ms) remains 78/78 properties
SDD proceeding with computation,87 properties remain. new max is 16
SDD size :4 after 19
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (27 resets) in 14 ms. (266 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (30 resets) in 15 ms. (250 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (30 resets) in 14 ms. (266 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (25 resets) in 13 ms. (285 steps per ms) remains 78/78 properties
SDD proceeding with computation,87 properties remain. new max is 32
SDD size :19 after 34
BEST_FIRST walk for 4003 steps (9 resets) in 16 ms. (235 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (27 resets) in 15 ms. (250 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (37 resets) in 13 ms. (285 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (28 resets) in 11 ms. (333 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 77/78 properties
BEST_FIRST walk for 4003 steps (24 resets) in 12 ms. (307 steps per ms) remains 73/77 properties
BEST_FIRST walk for 4003 steps (37 resets) in 24 ms. (160 steps per ms) remains 73/73 properties
SDD proceeding with computation,87 properties remain. new max is 64
SDD size :34 after 49
BEST_FIRST walk for 4004 steps (27 resets) in 31 ms. (125 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 73/73 properties
SDD proceeding with computation,87 properties remain. new max is 128
SDD size :49 after 79
BEST_FIRST walk for 4004 steps (31 resets) in 17 ms. (222 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (35 resets) in 16 ms. (235 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (27 resets) in 17 ms. (222 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 73/73 properties
SDD proceeding with computation,87 properties remain. new max is 256
SDD size :79 after 119
BEST_FIRST walk for 4003 steps (37 resets) in 18 ms. (210 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (31 resets) in 24 ms. (160 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (32 resets) in 19 ms. (200 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 73/73 properties
Reachability property qltransition_407 is true.
BEST_FIRST walk for 4003 steps (26 resets) in 22 ms. (174 steps per ms) remains 73/73 properties
Reachability property qltransition_384 is true.
BEST_FIRST walk for 4003 steps (29 resets) in 19 ms. (200 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (22 resets) in 12 ms. (307 steps per ms) remains 73/73 properties
Reachability property qltransition_218 is true.
BEST_FIRST walk for 4003 steps (21 resets) in 17 ms. (222 steps per ms) remains 66/73 properties
SDD proceeding with computation,84 properties remain. new max is 256
SDD size :119 after 255
BEST_FIRST walk for 4003 steps (24 resets) in 19 ms. (200 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (23 resets) in 12 ms. (307 steps per ms) remains 65/66 properties
BEST_FIRST walk for 4004 steps (23 resets) in 12 ms. (308 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (20 resets) in 25 ms. (154 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (22 resets) in 17 ms. (222 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (28 resets) in 12 ms. (307 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (27 resets) in 16 ms. (235 steps per ms) remains 65/65 properties
SDD proceeding with computation,84 properties remain. new max is 512
SDD size :255 after 345
BEST_FIRST walk for 4003 steps (25 resets) in 22 ms. (174 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (27 resets) in 20 ms. (190 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (17 resets) in 21 ms. (181 steps per ms) remains 64/65 properties
BEST_FIRST walk for 4002 steps (31 resets) in 26 ms. (148 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (25 resets) in 21 ms. (181 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (23 resets) in 16 ms. (235 steps per ms) remains 64/64 properties
Reachability property qltransition_352 is true.
Reachability property qltransition_350 is true.
Reachability property qltransition_347 is true.
Reachability property qltransition_345 is true.
Reachability property qltransition_342 is true.
[2024-06-02 18:43:25] [INFO ] Flow matrix only has 389 transitions (discarded 48 similar events)
// Phase 1: matrix 389 rows 154 cols
SDD proceeding with computation,79 properties remain. new max is 512
SDD size :345 after 1290
[2024-06-02 18:43:25] [INFO ] Computed 7 invariants in 8 ms
[2024-06-02 18:43:25] [INFO ] State equation strengthened by 60 read => feed constraints.
Reachability property qltransition_397 is true.
Reachability property qltransition_388 is true.
Reachability property qltransition_387 is true.
Reachability property qltransition_183 is true.
Reachability property qltransition_181 is true.
Reachability property qltransition_179 is true.
Reachability property qltransition_177 is true.
Reachability property qltransition_84 is true.
SDD proceeding with computation,71 properties remain. new max is 512
SDD size :1290 after 2960
Reachability property qltransition_395 is true.
Reachability property qltransition_184 is true.
Reachability property qltransition_182 is true.
Reachability property qltransition_180 is true.
Reachability property qltransition_178 is true.
Reachability property qltransition_176 is true.
Reachability property qltransition_174 is true.
Reachability property qltransition_171 is true.
Reachability property qltransition_166 is true.
Reachability property qltransition_164 is true.
Reachability property qltransition_162 is true.
SDD proceeding with computation,60 properties remain. new max is 512
SDD size :2960 after 3641
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 56/56 constraints. Problems are: Problem set: 7 solved, 54 unsolved
SDD proceeding with computation,60 properties remain. new max is 1024
SDD size :3641 after 3855
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/56 constraints. Problems are: Problem set: 17 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 96/152 variables, 7/63 constraints. Problems are: Problem set: 17 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 96/159 constraints. Problems are: Problem set: 17 solved, 44 unsolved
[2024-06-02 18:43:25] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 8 ms to minimize.
SDD proceeding with computation,60 properties remain. new max is 2048
SDD size :3855 after 6900
[2024-06-02 18:43:25] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:43:25] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-06-02 18:43:26] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 1 ms to minimize.
SDD proceeding with computation,60 properties remain. new max is 4096
SDD size :6900 after 10431
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 4/163 constraints. Problems are: Problem set: 17 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 0/163 constraints. Problems are: Problem set: 17 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 388/540 variables, 152/315 constraints. Problems are: Problem set: 17 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 59/374 constraints. Problems are: Problem set: 17 solved, 44 unsolved
Reachability property qltransition_232 is true.
Reachability property qltransition_221 is true.
Reachability property qltransition_220 is true.
Reachability property qltransition_217 is true.
Reachability property qltransition_216 is true.
Reachability property qltransition_175 is true.
Reachability property qltransition_172 is true.
SDD proceeding with computation,53 properties remain. new max is 4096
SDD size :10431 after 36883
At refinement iteration 8 (INCLUDED_ONLY) 0/540 variables, 0/374 constraints. Problems are: Problem set: 20 solved, 41 unsolved
At refinement iteration 9 (OVERLAPS) 2/542 variables, 2/376 constraints. Problems are: Problem set: 20 solved, 41 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/542 variables, 2/378 constraints. Problems are: Problem set: 20 solved, 41 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/542 variables, 0/378 constraints. Problems are: Problem set: 20 solved, 41 unsolved
Reachability property qltransition_240 is true.
Reachability property qltransition_238 is true.
Reachability property qltransition_235 is true.
Reachability property qltransition_170 is true.
Reachability property qltransition_165 is true.
Reachability property qltransition_163 is true.
Reachability property qltransition_161 is true.
SDD proceeding with computation,46 properties remain. new max is 4096
SDD size :36883 after 55270
At refinement iteration 12 (OVERLAPS) 1/543 variables, 1/379 constraints. Problems are: Problem set: 20 solved, 41 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/543 variables, 0/379 constraints. Problems are: Problem set: 27 solved, 34 unsolved
SDD proceeding with computation,46 properties remain. new max is 8192
SDD size :55270 after 103534
At refinement iteration 14 (OVERLAPS) 0/543 variables, 0/379 constraints. Problems are: Problem set: 27 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 543/543 variables, and 379 constraints, problems are : Problem set: 27 solved, 34 unsolved in 3905 ms.
Refiners :[Domain max(s): 154/154 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 27 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 34/34 constraints. Problems are: Problem set: 27 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/34 constraints. Problems are: Problem set: 27 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 72/106 variables, 5/39 constraints. Problems are: Problem set: 27 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 72/111 constraints. Problems are: Problem set: 27 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 2/113 constraints. Problems are: Problem set: 27 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/113 constraints. Problems are: Problem set: 27 solved, 34 unsolved
At refinement iteration 6 (OVERLAPS) 44/150 variables, 2/115 constraints. Problems are: Problem set: 27 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 44/159 constraints. Problems are: Problem set: 27 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 2/161 constraints. Problems are: Problem set: 27 solved, 34 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/150 variables, 0/161 constraints. Problems are: Problem set: 27 solved, 34 unsolved
At refinement iteration 10 (OVERLAPS) 386/536 variables, 150/311 constraints. Problems are: Problem set: 27 solved, 34 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/536 variables, 58/369 constraints. Problems are: Problem set: 27 solved, 34 unsolved
SDD proceeding with computation,46 properties remain. new max is 16384
SDD size :103534 after 156362
At refinement iteration 12 (INCLUDED_ONLY) 0/536 variables, 33/402 constraints. Problems are: Problem set: 27 solved, 34 unsolved
[2024-06-02 18:43:30] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 1 ms to minimize.
[2024-06-02 18:43:31] [INFO ] Deduced a trap composed of 93 places in 134 ms of which 1 ms to minimize.
[2024-06-02 18:43:31] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/536 variables, 3/405 constraints. Problems are: Problem set: 27 solved, 34 unsolved
[2024-06-02 18:43:32] [INFO ] Deduced a trap composed of 58 places in 92 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/536 variables, 1/406 constraints. Problems are: Problem set: 27 solved, 34 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/536 variables, 0/406 constraints. Problems are: Problem set: 27 solved, 34 unsolved
At refinement iteration 16 (OVERLAPS) 6/542 variables, 4/410 constraints. Problems are: Problem set: 27 solved, 34 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/542 variables, 4/414 constraints. Problems are: Problem set: 27 solved, 34 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/542 variables, 1/415 constraints. Problems are: Problem set: 27 solved, 34 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 542/543 variables, and 416 constraints, problems are : Problem set: 27 solved, 34 unsolved in 5018 ms.
Refiners :[Domain max(s): 154/154 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, ReadFeed: 59/60 constraints, PredecessorRefiner: 34/61 constraints, Known Traps: 8/8 constraints]
After SMT, in 9043ms problems are : Problem set: 27 solved, 34 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 34 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 437/437 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 154 transition count 428
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 1 with 9 rules applied. Total rules applied 18 place count 154 transition count 419
SDD proceeding with computation,46 properties remain. new max is 32768
SDD size :156362 after 348526
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 154 transition count 426
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 33 place count 150 transition count 419
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 39 place count 150 transition count 413
Applied a total of 39 rules in 80 ms. Remains 150 /154 variables (removed 4) and now considering 413/437 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 150/154 places, 413/437 transitions.
RANDOM walk for 4000000 steps (124453 resets) in 24821 ms. (161 steps per ms) remains 9/34 properties
BEST_FIRST walk for 4000002 steps (26877 resets) in 4210 ms. (949 steps per ms) remains 8/9 properties
BEST_FIRST walk for 4000003 steps (27690 resets) in 4531 ms. (882 steps per ms) remains 7/8 properties
SDD proceeding with computation,46 properties remain. new max is 65536
SDD size :348526 after 675609
BEST_FIRST walk for 4000002 steps (27928 resets) in 4476 ms. (893 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000000 steps (60 resets) in 6308 ms. (634 steps per ms) remains 5/7 properties
BEST_FIRST walk for 4000004 steps (27153 resets) in 4389 ms. (911 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000003 steps (27156 resets) in 4144 ms. (965 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000002 steps (26176 resets) in 4005 ms. (998 steps per ms) remains 5/5 properties
[2024-06-02 18:43:55] [INFO ] Flow matrix only has 376 transitions (discarded 37 similar events)
// Phase 1: matrix 376 rows 150 cols
[2024-06-02 18:43:55] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 18:43:55] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 91/100 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 91/105 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 18:43:55] [INFO ] Deduced a trap composed of 34 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 42/142 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 42/150 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 372/514 variables, 142/292 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/514 variables, 57/349 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/514 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 12/526 variables, 8/357 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/526 variables, 8/365 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/526 variables, 2/367 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/526 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/526 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 526/526 variables, and 367 constraints, problems are : Problem set: 0 solved, 5 unsolved in 438 ms.
Refiners :[Domain max(s): 150/150 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 91/100 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 91/105 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 42/142 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 42/150 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 372/514 variables, 142/292 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/514 variables, 57/349 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/514 variables, 2/351 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 18:43:56] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/514 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/514 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 12/526 variables, 8/360 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/526 variables, 8/368 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/526 variables, 2/370 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/526 variables, 3/373 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/526 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 18:43:56] [INFO ] Deduced a trap composed of 40 places in 31 ms of which 1 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/526 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/526 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 0/526 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 526/526 variables, and 374 constraints, problems are : Problem set: 0 solved, 5 unsolved in 860 ms.
Refiners :[Domain max(s): 150/150 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 3/3 constraints]
After SMT, in 1321ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 782 ms.
Support contains 9 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 413/413 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 150 transition count 415
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 6 place count 148 transition count 413
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 147 transition count 412
Applied a total of 7 rules in 44 ms. Remains 147 /150 variables (removed 3) and now considering 412/413 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 147/150 places, 412/413 transitions.
RANDOM walk for 4000000 steps (128504 resets) in 12033 ms. (332 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000004 steps (23732 resets) in 5389 ms. (742 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000003 steps (26831 resets) in 4309 ms. (928 steps per ms) remains 4/5 properties
BEST_FIRST walk for 4000003 steps (27531 resets) in 3705 ms. (1079 steps per ms) remains 4/4 properties
Reachability property qltransition_402 is true.
Reachability property qltransition_394 is true.
Reachability property qltransition_292 is true.
Reachability property qltransition_291 is true.
Reachability property qltransition_290 is true.
Reachability property qltransition_289 is true.
Reachability property qltransition_288 is true.
SDD proceeding with computation,39 properties remain. new max is 65536
SDD size :675609 after 2.85295e+06
BEST_FIRST walk for 4000003 steps (27524 resets) in 3970 ms. (1007 steps per ms) remains 4/4 properties
BEST_FIRST walk for 4000003 steps (26574 resets) in 3203 ms. (1248 steps per ms) remains 3/4 properties
[2024-06-02 18:44:08] [INFO ] Flow matrix only has 375 transitions (discarded 37 similar events)
// Phase 1: matrix 375 rows 147 cols
[2024-06-02 18:44:08] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 18:44:08] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 90/96 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 90/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 18:44:08] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 328/424 variables, 96/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 36/234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 89/513 variables, 45/279 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/513 variables, 45/324 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/513 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/513 variables, 20/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/513 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 8/521 variables, 5/350 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/521 variables, 5/355 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/521 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/521 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 1/522 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/522 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/522 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/522 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 522/522 variables, and 358 constraints, problems are : Problem set: 0 solved, 3 unsolved in 466 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 90/96 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 90/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 328/424 variables, 96/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 36/234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 89/513 variables, 45/279 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/513 variables, 45/324 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/513 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/513 variables, 20/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/513 variables, 3/348 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 18:44:09] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/513 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/513 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 8/521 variables, 5/354 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/521 variables, 5/359 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/521 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/521 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 1/522 variables, 1/361 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/522 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/522 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 0/522 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 522/522 variables, and 362 constraints, problems are : Problem set: 0 solved, 3 unsolved in 461 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 938ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 211 ms.
Support contains 6 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 412/412 transitions.
Applied a total of 0 rules in 9 ms. Remains 147 /147 variables (removed 0) and now considering 412/412 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 147/147 places, 412/412 transitions.
RANDOM walk for 4000000 steps (128675 resets) in 10693 ms. (374 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000004 steps (27931 resets) in 3071 ms. (1302 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000003 steps (27447 resets) in 3698 ms. (1081 steps per ms) remains 2/3 properties
BEST_FIRST walk for 4000003 steps (27332 resets) in 3108 ms. (1286 steps per ms) remains 2/2 properties
[2024-06-02 18:44:16] [INFO ] Flow matrix only has 375 transitions (discarded 37 similar events)
[2024-06-02 18:44:16] [INFO ] Invariant cache hit.
[2024-06-02 18:44:16] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 50/54 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 18:44:16] [INFO ] Deduced a trap composed of 32 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 287/341 variables, 54/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 18/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 163/504 variables, 81/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/504 variables, 81/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/504 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/504 variables, 38/332 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/504 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 16/520 variables, 10/342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/520 variables, 10/352 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/520 variables, 2/354 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/520 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/522 variables, 2/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/522 variables, 2/358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/522 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/522 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 522/522 variables, and 358 constraints, problems are : Problem set: 0 solved, 2 unsolved in 363 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 50/54 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 287/341 variables, 54/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 18/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 163/504 variables, 81/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/504 variables, 81/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/504 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/504 variables, 38/332 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/504 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/504 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 16/520 variables, 10/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/520 variables, 10/354 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/520 variables, 2/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 18:44:17] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/520 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/520 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/522 variables, 2/359 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/522 variables, 2/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/522 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/522 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 522/522 variables, and 361 constraints, problems are : Problem set: 0 solved, 2 unsolved in 371 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 767ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 80 ms.
Support contains 4 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 412/412 transitions.
Applied a total of 0 rules in 8 ms. Remains 147 /147 variables (removed 0) and now considering 412/412 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 147/147 places, 412/412 transitions.
RANDOM walk for 4000000 steps (128696 resets) in 9901 ms. (403 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000004 steps (28051 resets) in 3108 ms. (1286 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000004 steps (27242 resets) in 3075 ms. (1300 steps per ms) remains 2/2 properties
Reachability property qltransition_406 is true.
Reachability property qltransition_324 is true.
Reachability property qltransition_323 is true.
Reachability property qltransition_287 is true.
Reachability property qltransition_286 is true.
Reachability property qltransition_285 is true.
Reachability property qltransition_284 is true.
Reachability property qltransition_283 is true.
Reachability property qltransition_282 is true.
Reachability property qltransition_281 is true.
Reachability property qltransition_279 is true.
Reachability property qltransition_278 is true.
Reachability property qltransition_277 is true.
Reachability property qltransition_273 is true.
Reachability property qltransition_272 is true.
Reachability property qltransition_271 is true.
Reachability property qltransition_270 is true.
Reachability property qltransition_269 is true.
Reachability property qltransition_268 is true.
Reachability property qltransition_160 is true.
Reachability property qltransition_159 is true.
Reachability property qltransition_158 is true.
Reachability property qltransition_157 is true.
Reachability property qltransition_154 is true.
Reachability property qltransition_152 is true.
Reachability property qltransition_151 is true.
Reachability property qltransition_150 is true.
Reachability property qltransition_149 is true.
Reachability property qltransition_140 is true.
Reachability property qltransition_87 is true.
SDD proceeding with computation,9 properties remain. new max is 65536
SDD size :2.85295e+06 after 7.6363e+06
Interrupted probabilistic random walk after 3038411 steps, run timeout after 12001 ms. (steps per millisecond=253 ) properties seen :0 out of 2
Probabilistic random walk after 3038411 steps, saw 815534 distinct states, run finished after 12005 ms. (steps per millisecond=253 ) properties seen :0
[2024-06-02 18:44:34] [INFO ] Flow matrix only has 375 transitions (discarded 37 similar events)
[2024-06-02 18:44:34] [INFO ] Invariant cache hit.
[2024-06-02 18:44:34] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 40/42 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 40/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 120/162 variables, 42/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 183/345 variables, 14/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 14/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 18/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/345 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/346 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/346 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/346 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/346 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 158/504 variables, 78/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/504 variables, 78/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/504 variables, 2/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/504 variables, 38/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/504 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 16/520 variables, 10/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/520 variables, 10/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/520 variables, 2/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/520 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/522 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/522 variables, 2/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/522 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/522 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 522/522 variables, and 357 constraints, problems are : Problem set: 0 solved, 1 unsolved in 206 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 40/42 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 40/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 120/162 variables, 42/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 183/345 variables, 14/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 14/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 18/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/345 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:44:34] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/345 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/346 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/346 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/346 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/346 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 158/504 variables, 78/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/504 variables, 78/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/504 variables, 2/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/504 variables, 38/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/504 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 16/520 variables, 10/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/520 variables, 10/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/520 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/520 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/522 variables, 2/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/522 variables, 2/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/522 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/522 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 522/522 variables, and 359 constraints, problems are : Problem set: 0 solved, 1 unsolved in 274 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 487ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 2 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 412/412 transitions.
Applied a total of 0 rules in 8 ms. Remains 147 /147 variables (removed 0) and now considering 412/412 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 147/147 places, 412/412 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 412/412 transitions.
Applied a total of 0 rules in 6 ms. Remains 147 /147 variables (removed 0) and now considering 412/412 (removed 0) transitions.
[2024-06-02 18:44:35] [INFO ] Flow matrix only has 375 transitions (discarded 37 similar events)
[2024-06-02 18:44:35] [INFO ] Invariant cache hit.
[2024-06-02 18:44:35] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-06-02 18:44:35] [INFO ] Flow matrix only has 375 transitions (discarded 37 similar events)
[2024-06-02 18:44:35] [INFO ] Invariant cache hit.
[2024-06-02 18:44:35] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 18:44:35] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
[2024-06-02 18:44:35] [INFO ] Redundant transitions in 26 ms returned []
Running 406 sub problems to find dead transitions.
[2024-06-02 18:44:35] [INFO ] Flow matrix only has 375 transitions (discarded 37 similar events)
[2024-06-02 18:44:35] [INFO ] Invariant cache hit.
[2024-06-02 18:44:35] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 147/147 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 7/154 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-06-02 18:44:37] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 2 ms to minimize.
[2024-06-02 18:44:37] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-06-02 18:44:37] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-06-02 18:44:37] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 12 ms to minimize.
[2024-06-02 18:44:37] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 1 ms to minimize.
[2024-06-02 18:44:38] [INFO ] Deduced a trap composed of 32 places in 160 ms of which 2 ms to minimize.
[2024-06-02 18:44:38] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 7/161 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 4 (OVERLAPS) 375/522 variables, 147/308 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/522 variables, 56/364 constraints. Problems are: Problem set: 0 solved, 406 unsolved
Reachability property qltransition_399 is true.
Reachability property qltransition_393 is true.
Reachability property qltransition_98 is true.
SDD proceeding with computation,6 properties remain. new max is 65536
SDD size :7.6363e+06 after 2.70418e+07
[2024-06-02 18:44:45] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:44:45] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2024-06-02 18:44:45] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 3/367 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/522 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 8 (OVERLAPS) 0/522 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 406 unsolved
No progress, stopping.
After SMT solving in domain Real declared 522/522 variables, and 367 constraints, problems are : Problem set: 0 solved, 406 unsolved in 20223 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 406/406 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 406 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 147/147 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 7/154 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 10/164 constraints. Problems are: Problem set: 0 solved, 406 unsolved
SDD proceeding with computation,6 properties remain. new max is 131072
SDD size :2.70418e+07 after 3.61118e+07
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 4 (OVERLAPS) 375/522 variables, 147/311 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/522 variables, 56/367 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 406/773 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/522 variables, 0/773 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 8 (OVERLAPS) 0/522 variables, 0/773 constraints. Problems are: Problem set: 0 solved, 406 unsolved
No progress, stopping.
After SMT solving in domain Int declared 522/522 variables, and 773 constraints, problems are : Problem set: 0 solved, 406 unsolved in 23878 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 406/406 constraints, Known Traps: 10/10 constraints]
After SMT, in 44515ms problems are : Problem set: 0 solved, 406 unsolved
Search for dead transitions found 0 dead transitions in 44520ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44951 ms. Remains : 147/147 places, 412/412 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query QuasiLiveness after proving 299 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK DECISION_DIAGRAMS COLLATERAL_PROCESSING BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 117871 ms.
BK_STOP 1717353920178
--------------------
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
+ [[ QuasiLiveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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 QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
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="FireWire-PT-12"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is FireWire-PT-12, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r561-tall-171734906300162"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-12.tgz
mv FireWire-PT-12 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "QuasiLiveness.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 [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;