About the Execution of LTSMin+red for Anderson-PT-12
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
721.504 | 116886.00 | 164512.00 | 396.90 | ?FF??TF????????? | 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.r464-smll-171620118400377.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is Anderson-PT-12, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r464-smll-171620118400377
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.6M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 180K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 2.1M May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Anderson-PT-12-CTLCardinality-2024-00
FORMULA_NAME Anderson-PT-12-CTLCardinality-2024-01
FORMULA_NAME Anderson-PT-12-CTLCardinality-2024-02
FORMULA_NAME Anderson-PT-12-CTLCardinality-2024-03
FORMULA_NAME Anderson-PT-12-CTLCardinality-2024-04
FORMULA_NAME Anderson-PT-12-CTLCardinality-2024-05
FORMULA_NAME Anderson-PT-12-CTLCardinality-2024-06
FORMULA_NAME Anderson-PT-12-CTLCardinality-2024-07
FORMULA_NAME Anderson-PT-12-CTLCardinality-2024-08
FORMULA_NAME Anderson-PT-12-CTLCardinality-2024-09
FORMULA_NAME Anderson-PT-12-CTLCardinality-2024-10
FORMULA_NAME Anderson-PT-12-CTLCardinality-2024-11
FORMULA_NAME Anderson-PT-12-CTLCardinality-2023-12
FORMULA_NAME Anderson-PT-12-CTLCardinality-2023-13
FORMULA_NAME Anderson-PT-12-CTLCardinality-2023-14
FORMULA_NAME Anderson-PT-12-CTLCardinality-2023-15
=== Now, execution of the tool begins
BK_START 1717261614461
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-12
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 17:06:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 17:06:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 17:06:56] [INFO ] Load time of PNML (sax parser for PT used): 374 ms
[2024-06-01 17:06:56] [INFO ] Transformed 889 places.
[2024-06-01 17:06:56] [INFO ] Transformed 4152 transitions.
[2024-06-01 17:06:56] [INFO ] Found NUPN structural information;
[2024-06-01 17:06:56] [INFO ] Parsed PT model containing 889 places and 4152 transitions and 16080 arcs in 576 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 29 ms.
FORMULA Anderson-PT-12-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-12-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 136 out of 889 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 889/889 places, 4152/4152 transitions.
Discarding 207 places :
Symmetric choice reduction at 0 with 207 rule applications. Total rules 207 place count 682 transition count 1701
Iterating global reduction 0 with 207 rules applied. Total rules applied 414 place count 682 transition count 1701
Applied a total of 414 rules in 193 ms. Remains 682 /889 variables (removed 207) and now considering 1701/4152 (removed 2451) transitions.
// Phase 1: matrix 1701 rows 682 cols
[2024-06-01 17:06:57] [INFO ] Computed 27 invariants in 123 ms
[2024-06-01 17:06:58] [INFO ] Implicit Places using invariants in 1689 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1770 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 681/889 places, 1701/4152 transitions.
Applied a total of 0 rules in 26 ms. Remains 681 /681 variables (removed 0) and now considering 1701/1701 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2022 ms. Remains : 681/889 places, 1701/4152 transitions.
Support contains 136 out of 681 places after structural reductions.
[2024-06-01 17:06:59] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 17:06:59] [INFO ] Flatten gal took : 246 ms
FORMULA Anderson-PT-12-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 17:06:59] [INFO ] Flatten gal took : 159 ms
[2024-06-01 17:07:00] [INFO ] Input system was already deterministic with 1701 transitions.
Support contains 135 out of 681 places (down from 136) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2640 ms. (15 steps per ms) remains 15/73 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (8 resets) in 53 ms. (74 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 13/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 13/13 properties
// Phase 1: matrix 1701 rows 681 cols
[2024-06-01 17:07:01] [INFO ] Computed 26 invariants in 55 ms
[2024-06-01 17:07:01] [INFO ] State equation strengthened by 132 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 619/658 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/658 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 23/681 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/681 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 1701/2382 variables, 681/707 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2382 variables, 132/839 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2382 variables, 0/839 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 0/2382 variables, 0/839 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2382/2382 variables, and 839 constraints, problems are : Problem set: 0 solved, 13 unsolved in 2900 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 681/681 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 619/658 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/658 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem AtomicPropp45 is UNSAT
At refinement iteration 3 (OVERLAPS) 23/681 variables, 13/26 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-06-01 17:07:05] [INFO ] Deduced a trap composed of 211 places in 656 ms of which 63 ms to minimize.
[2024-06-01 17:07:06] [INFO ] Deduced a trap composed of 398 places in 731 ms of which 7 ms to minimize.
[2024-06-01 17:07:07] [INFO ] Deduced a trap composed of 356 places in 761 ms of which 7 ms to minimize.
[2024-06-01 17:07:08] [INFO ] Deduced a trap composed of 386 places in 637 ms of which 6 ms to minimize.
[2024-06-01 17:07:08] [INFO ] Deduced a trap composed of 293 places in 799 ms of which 7 ms to minimize.
[2024-06-01 17:07:09] [INFO ] Deduced a trap composed of 342 places in 748 ms of which 7 ms to minimize.
SMT process timed out in 8307ms, After SMT, problems are : Problem set: 1 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 35 out of 681 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 681/681 places, 1701/1701 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 0 with 125 rules applied. Total rules applied 125 place count 681 transition count 1576
Reduce places removed 125 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 131 rules applied. Total rules applied 256 place count 556 transition count 1570
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 262 place count 550 transition count 1570
Performed 119 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 119 Pre rules applied. Total rules applied 262 place count 550 transition count 1451
Deduced a syphon composed of 119 places in 1 ms
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 3 with 238 rules applied. Total rules applied 500 place count 431 transition count 1451
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 539 place count 392 transition count 928
Iterating global reduction 3 with 39 rules applied. Total rules applied 578 place count 392 transition count 928
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 598 place count 382 transition count 918
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 604 place count 382 transition count 912
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 610 place count 376 transition count 912
Applied a total of 610 rules in 264 ms. Remains 376 /681 variables (removed 305) and now considering 912/1701 (removed 789) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 265 ms. Remains : 376/681 places, 912/1701 transitions.
RANDOM walk for 40000 steps (8 resets) in 503 ms. (79 steps per ms) remains 10/12 properties
BEST_FIRST walk for 40001 steps (8 resets) in 163 ms. (243 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40001 steps (8 resets) in 213 ms. (186 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 180 ms. (221 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 185 ms. (215 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 180 ms. (221 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 125 ms. (317 steps per ms) remains 7/8 properties
// Phase 1: matrix 912 rows 376 cols
[2024-06-01 17:07:10] [INFO ] Computed 26 invariants in 8 ms
[2024-06-01 17:07:10] [INFO ] State equation strengthened by 132 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 347/362 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/362 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 2/364 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 12/376 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 912/1288 variables, 376/402 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1288 variables, 132/534 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1288 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/1288 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1288/1288 variables, and 534 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1285 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 376/376 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 347/362 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/362 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 2/364 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 12/376 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 17:07:12] [INFO ] Deduced a trap composed of 97 places in 392 ms of which 5 ms to minimize.
[2024-06-01 17:07:13] [INFO ] Deduced a trap composed of 131 places in 315 ms of which 4 ms to minimize.
[2024-06-01 17:07:13] [INFO ] Deduced a trap composed of 79 places in 407 ms of which 5 ms to minimize.
[2024-06-01 17:07:13] [INFO ] Deduced a trap composed of 77 places in 394 ms of which 4 ms to minimize.
[2024-06-01 17:07:14] [INFO ] Deduced a trap composed of 103 places in 393 ms of which 4 ms to minimize.
[2024-06-01 17:07:14] [INFO ] Deduced a trap composed of 104 places in 397 ms of which 4 ms to minimize.
[2024-06-01 17:07:15] [INFO ] Deduced a trap composed of 88 places in 394 ms of which 4 ms to minimize.
[2024-06-01 17:07:15] [INFO ] Deduced a trap composed of 67 places in 375 ms of which 4 ms to minimize.
[2024-06-01 17:07:15] [INFO ] Deduced a trap composed of 172 places in 394 ms of which 4 ms to minimize.
[2024-06-01 17:07:16] [INFO ] Deduced a trap composed of 148 places in 365 ms of which 4 ms to minimize.
[2024-06-01 17:07:16] [INFO ] Deduced a trap composed of 132 places in 277 ms of which 4 ms to minimize.
[2024-06-01 17:07:16] [INFO ] Deduced a trap composed of 105 places in 374 ms of which 5 ms to minimize.
[2024-06-01 17:07:17] [INFO ] Deduced a trap composed of 93 places in 371 ms of which 4 ms to minimize.
[2024-06-01 17:07:17] [INFO ] Deduced a trap composed of 94 places in 364 ms of which 4 ms to minimize.
[2024-06-01 17:07:18] [INFO ] Deduced a trap composed of 115 places in 360 ms of which 4 ms to minimize.
[2024-06-01 17:07:18] [INFO ] Deduced a trap composed of 116 places in 370 ms of which 5 ms to minimize.
[2024-06-01 17:07:18] [INFO ] Deduced a trap composed of 87 places in 268 ms of which 3 ms to minimize.
[2024-06-01 17:07:19] [INFO ] Deduced a trap composed of 117 places in 368 ms of which 4 ms to minimize.
[2024-06-01 17:07:19] [INFO ] Deduced a trap composed of 94 places in 324 ms of which 4 ms to minimize.
[2024-06-01 17:07:19] [INFO ] Deduced a trap composed of 87 places in 370 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 17:07:20] [INFO ] Deduced a trap composed of 89 places in 279 ms of which 3 ms to minimize.
[2024-06-01 17:07:20] [INFO ] Deduced a trap composed of 74 places in 365 ms of which 4 ms to minimize.
[2024-06-01 17:07:20] [INFO ] Deduced a trap composed of 130 places in 360 ms of which 4 ms to minimize.
[2024-06-01 17:07:21] [INFO ] Deduced a trap composed of 54 places in 352 ms of which 4 ms to minimize.
[2024-06-01 17:07:21] [INFO ] Deduced a trap composed of 63 places in 361 ms of which 4 ms to minimize.
[2024-06-01 17:07:22] [INFO ] Deduced a trap composed of 84 places in 376 ms of which 4 ms to minimize.
[2024-06-01 17:07:22] [INFO ] Deduced a trap composed of 50 places in 379 ms of which 4 ms to minimize.
[2024-06-01 17:07:22] [INFO ] Deduced a trap composed of 104 places in 357 ms of which 4 ms to minimize.
[2024-06-01 17:07:23] [INFO ] Deduced a trap composed of 134 places in 362 ms of which 4 ms to minimize.
[2024-06-01 17:07:23] [INFO ] Deduced a trap composed of 156 places in 334 ms of which 4 ms to minimize.
[2024-06-01 17:07:23] [INFO ] Deduced a trap composed of 115 places in 371 ms of which 4 ms to minimize.
[2024-06-01 17:07:24] [INFO ] Deduced a trap composed of 109 places in 370 ms of which 3 ms to minimize.
[2024-06-01 17:07:24] [INFO ] Deduced a trap composed of 174 places in 368 ms of which 4 ms to minimize.
[2024-06-01 17:07:25] [INFO ] Deduced a trap composed of 138 places in 375 ms of which 5 ms to minimize.
[2024-06-01 17:07:25] [INFO ] Deduced a trap composed of 132 places in 393 ms of which 4 ms to minimize.
[2024-06-01 17:07:25] [INFO ] Deduced a trap composed of 134 places in 327 ms of which 4 ms to minimize.
[2024-06-01 17:07:26] [INFO ] Deduced a trap composed of 133 places in 379 ms of which 4 ms to minimize.
[2024-06-01 17:07:26] [INFO ] Deduced a trap composed of 108 places in 311 ms of which 3 ms to minimize.
[2024-06-01 17:07:26] [INFO ] Deduced a trap composed of 83 places in 393 ms of which 4 ms to minimize.
[2024-06-01 17:07:27] [INFO ] Deduced a trap composed of 152 places in 390 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 17:07:27] [INFO ] Deduced a trap composed of 139 places in 387 ms of which 4 ms to minimize.
[2024-06-01 17:07:28] [INFO ] Deduced a trap composed of 105 places in 382 ms of which 4 ms to minimize.
[2024-06-01 17:07:28] [INFO ] Deduced a trap composed of 174 places in 376 ms of which 4 ms to minimize.
[2024-06-01 17:07:29] [INFO ] Deduced a trap composed of 97 places in 380 ms of which 4 ms to minimize.
[2024-06-01 17:07:29] [INFO ] Deduced a trap composed of 106 places in 384 ms of which 4 ms to minimize.
[2024-06-01 17:07:29] [INFO ] Deduced a trap composed of 95 places in 379 ms of which 4 ms to minimize.
[2024-06-01 17:07:30] [INFO ] Deduced a trap composed of 91 places in 382 ms of which 4 ms to minimize.
[2024-06-01 17:07:30] [INFO ] Deduced a trap composed of 176 places in 382 ms of which 4 ms to minimize.
[2024-06-01 17:07:31] [INFO ] Deduced a trap composed of 105 places in 399 ms of which 5 ms to minimize.
[2024-06-01 17:07:31] [INFO ] Deduced a trap composed of 115 places in 360 ms of which 4 ms to minimize.
[2024-06-01 17:07:31] [INFO ] Deduced a trap composed of 100 places in 381 ms of which 4 ms to minimize.
[2024-06-01 17:07:32] [INFO ] Deduced a trap composed of 147 places in 387 ms of which 4 ms to minimize.
[2024-06-01 17:07:32] [INFO ] Deduced a trap composed of 126 places in 303 ms of which 3 ms to minimize.
[2024-06-01 17:07:32] [INFO ] Deduced a trap composed of 107 places in 384 ms of which 4 ms to minimize.
[2024-06-01 17:07:33] [INFO ] Deduced a trap composed of 93 places in 374 ms of which 4 ms to minimize.
[2024-06-01 17:07:33] [INFO ] Deduced a trap composed of 118 places in 301 ms of which 4 ms to minimize.
[2024-06-01 17:07:34] [INFO ] Deduced a trap composed of 109 places in 381 ms of which 4 ms to minimize.
[2024-06-01 17:07:34] [INFO ] Deduced a trap composed of 97 places in 374 ms of which 4 ms to minimize.
[2024-06-01 17:07:34] [INFO ] Deduced a trap composed of 106 places in 375 ms of which 5 ms to minimize.
[2024-06-01 17:07:35] [INFO ] Deduced a trap composed of 88 places in 384 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 17:07:35] [INFO ] Deduced a trap composed of 133 places in 388 ms of which 4 ms to minimize.
[2024-06-01 17:07:36] [INFO ] Deduced a trap composed of 126 places in 374 ms of which 4 ms to minimize.
[2024-06-01 17:07:36] [INFO ] Deduced a trap composed of 170 places in 379 ms of which 4 ms to minimize.
[2024-06-01 17:07:37] [INFO ] Deduced a trap composed of 105 places in 377 ms of which 4 ms to minimize.
[2024-06-01 17:07:37] [INFO ] Deduced a trap composed of 109 places in 372 ms of which 4 ms to minimize.
[2024-06-01 17:07:37] [INFO ] Deduced a trap composed of 146 places in 387 ms of which 4 ms to minimize.
[2024-06-01 17:07:38] [INFO ] Deduced a trap composed of 158 places in 376 ms of which 4 ms to minimize.
[2024-06-01 17:07:38] [INFO ] Deduced a trap composed of 143 places in 372 ms of which 4 ms to minimize.
[2024-06-01 17:07:39] [INFO ] Deduced a trap composed of 137 places in 356 ms of which 4 ms to minimize.
[2024-06-01 17:07:39] [INFO ] Deduced a trap composed of 144 places in 394 ms of which 4 ms to minimize.
[2024-06-01 17:07:39] [INFO ] Deduced a trap composed of 106 places in 368 ms of which 4 ms to minimize.
[2024-06-01 17:07:40] [INFO ] Deduced a trap composed of 102 places in 365 ms of which 4 ms to minimize.
[2024-06-01 17:07:40] [INFO ] Deduced a trap composed of 92 places in 371 ms of which 4 ms to minimize.
[2024-06-01 17:07:40] [INFO ] Deduced a trap composed of 95 places in 377 ms of which 4 ms to minimize.
[2024-06-01 17:07:41] [INFO ] Deduced a trap composed of 103 places in 382 ms of which 4 ms to minimize.
[2024-06-01 17:07:41] [INFO ] Deduced a trap composed of 101 places in 374 ms of which 4 ms to minimize.
[2024-06-01 17:07:42] [INFO ] Deduced a trap composed of 85 places in 358 ms of which 4 ms to minimize.
[2024-06-01 17:07:42] [INFO ] Deduced a trap composed of 91 places in 358 ms of which 4 ms to minimize.
[2024-06-01 17:07:43] [INFO ] Deduced a trap composed of 103 places in 375 ms of which 4 ms to minimize.
[2024-06-01 17:07:43] [INFO ] Deduced a trap composed of 90 places in 387 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 17:07:44] [INFO ] Deduced a trap composed of 71 places in 358 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 17:07:44] [INFO ] Deduced a trap composed of 155 places in 388 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/376 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/376 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 912/1288 variables, 376/484 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1288 variables, 132/616 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1288 variables, 7/623 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1288 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 0/1288 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1288/1288 variables, and 623 constraints, problems are : Problem set: 0 solved, 7 unsolved in 40264 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 376/376 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 82/82 constraints]
After SMT, in 41586ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 0 properties in 1921 ms.
Support contains 15 out of 376 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 376/376 places, 912/912 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 376 transition count 909
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 5 rules applied. Total rules applied 8 place count 373 transition count 907
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 371 transition count 907
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 10 place count 371 transition count 906
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 12 place count 370 transition count 906
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 20 place count 362 transition count 722
Iterating global reduction 3 with 8 rules applied. Total rules applied 28 place count 362 transition count 722
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 36 place count 358 transition count 718
Applied a total of 36 rules in 78 ms. Remains 358 /376 variables (removed 18) and now considering 718/912 (removed 194) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 358/376 places, 718/912 transitions.
RANDOM walk for 40000 steps (8 resets) in 211 ms. (188 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (8 resets) in 108 ms. (366 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (8 resets) in 180 ms. (221 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 87 ms. (454 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 85 ms. (465 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 81 ms. (487 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 88 ms. (449 steps per ms) remains 6/6 properties
// Phase 1: matrix 718 rows 358 cols
[2024-06-01 17:07:54] [INFO ] Computed 26 invariants in 27 ms
[2024-06-01 17:07:54] [INFO ] State equation strengthened by 132 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 329/343 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/343 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 3/346 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/346 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 12/358 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 718/1076 variables, 358/384 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1076 variables, 132/516 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1076 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/1076 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1076/1076 variables, and 516 constraints, problems are : Problem set: 0 solved, 6 unsolved in 762 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 358/358 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 329/343 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/343 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 3/346 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/346 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 12/358 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 718/1076 variables, 358/384 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1076 variables, 132/516 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1076 variables, 6/522 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1076 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 17:07:57] [INFO ] Deduced a trap composed of 114 places in 316 ms of which 4 ms to minimize.
[2024-06-01 17:07:57] [INFO ] Deduced a trap composed of 85 places in 304 ms of which 3 ms to minimize.
[2024-06-01 17:07:57] [INFO ] Deduced a trap composed of 80 places in 343 ms of which 3 ms to minimize.
[2024-06-01 17:07:58] [INFO ] Deduced a trap composed of 99 places in 322 ms of which 4 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/1076 variables, 4/526 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 17:07:58] [INFO ] Deduced a trap composed of 73 places in 327 ms of which 4 ms to minimize.
[2024-06-01 17:07:59] [INFO ] Deduced a trap composed of 74 places in 325 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1076 variables, 2/528 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1076 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/1076 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1076/1076 variables, and 528 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4206 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 358/358 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 6/6 constraints]
After SMT, in 5013ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 1110 ms.
Support contains 14 out of 358 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 358/358 places, 718/718 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 357 transition count 717
Applied a total of 2 rules in 56 ms. Remains 357 /358 variables (removed 1) and now considering 717/718 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 357/358 places, 717/718 transitions.
RANDOM walk for 40000 steps (8 resets) in 173 ms. (229 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 135 ms. (294 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 127 ms. (312 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 120 ms. (330 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 124 ms. (320 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 132 ms. (300 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (8 resets) in 84 ms. (470 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 203571 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :2 out of 6
Probabilistic random walk after 203571 steps, saw 161370 distinct states, run finished after 3007 ms. (steps per millisecond=67 ) properties seen :2
// Phase 1: matrix 717 rows 357 cols
[2024-06-01 17:08:04] [INFO ] Computed 26 invariants in 6 ms
[2024-06-01 17:08:04] [INFO ] State equation strengthened by 132 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 329/341 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/341 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 4/345 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/345 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 12/357 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 717/1074 variables, 357/383 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1074 variables, 132/515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1074 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/1074 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1074/1074 variables, and 515 constraints, problems are : Problem set: 0 solved, 4 unsolved in 595 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 357/357 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 329/341 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/341 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 4/345 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/345 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 12/357 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 17:08:05] [INFO ] Deduced a trap composed of 147 places in 328 ms of which 4 ms to minimize.
[2024-06-01 17:08:05] [INFO ] Deduced a trap composed of 106 places in 314 ms of which 3 ms to minimize.
[2024-06-01 17:08:06] [INFO ] Deduced a trap composed of 108 places in 307 ms of which 3 ms to minimize.
[2024-06-01 17:08:06] [INFO ] Deduced a trap composed of 88 places in 313 ms of which 4 ms to minimize.
[2024-06-01 17:08:06] [INFO ] Deduced a trap composed of 171 places in 357 ms of which 3 ms to minimize.
[2024-06-01 17:08:07] [INFO ] Deduced a trap composed of 130 places in 320 ms of which 3 ms to minimize.
[2024-06-01 17:08:07] [INFO ] Deduced a trap composed of 111 places in 273 ms of which 4 ms to minimize.
[2024-06-01 17:08:07] [INFO ] Deduced a trap composed of 165 places in 319 ms of which 3 ms to minimize.
[2024-06-01 17:08:08] [INFO ] Deduced a trap composed of 131 places in 349 ms of which 4 ms to minimize.
[2024-06-01 17:08:08] [INFO ] Deduced a trap composed of 167 places in 309 ms of which 4 ms to minimize.
[2024-06-01 17:08:08] [INFO ] Deduced a trap composed of 127 places in 342 ms of which 3 ms to minimize.
[2024-06-01 17:08:09] [INFO ] Deduced a trap composed of 100 places in 325 ms of which 3 ms to minimize.
[2024-06-01 17:08:09] [INFO ] Deduced a trap composed of 115 places in 327 ms of which 4 ms to minimize.
[2024-06-01 17:08:09] [INFO ] Deduced a trap composed of 152 places in 325 ms of which 4 ms to minimize.
[2024-06-01 17:08:10] [INFO ] Deduced a trap composed of 80 places in 342 ms of which 4 ms to minimize.
[2024-06-01 17:08:10] [INFO ] Deduced a trap composed of 128 places in 300 ms of which 4 ms to minimize.
[2024-06-01 17:08:10] [INFO ] Deduced a trap composed of 118 places in 323 ms of which 4 ms to minimize.
[2024-06-01 17:08:11] [INFO ] Deduced a trap composed of 98 places in 333 ms of which 3 ms to minimize.
[2024-06-01 17:08:11] [INFO ] Deduced a trap composed of 77 places in 280 ms of which 3 ms to minimize.
[2024-06-01 17:08:11] [INFO ] Deduced a trap composed of 135 places in 316 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 17:08:12] [INFO ] Deduced a trap composed of 122 places in 251 ms of which 4 ms to minimize.
[2024-06-01 17:08:12] [INFO ] Deduced a trap composed of 133 places in 332 ms of which 4 ms to minimize.
[2024-06-01 17:08:12] [INFO ] Deduced a trap composed of 90 places in 320 ms of which 3 ms to minimize.
[2024-06-01 17:08:13] [INFO ] Deduced a trap composed of 89 places in 325 ms of which 4 ms to minimize.
[2024-06-01 17:08:13] [INFO ] Deduced a trap composed of 71 places in 320 ms of which 4 ms to minimize.
[2024-06-01 17:08:13] [INFO ] Deduced a trap composed of 105 places in 320 ms of which 3 ms to minimize.
[2024-06-01 17:08:14] [INFO ] Deduced a trap composed of 125 places in 235 ms of which 3 ms to minimize.
[2024-06-01 17:08:14] [INFO ] Deduced a trap composed of 101 places in 324 ms of which 4 ms to minimize.
[2024-06-01 17:08:14] [INFO ] Deduced a trap composed of 106 places in 324 ms of which 4 ms to minimize.
[2024-06-01 17:08:15] [INFO ] Deduced a trap composed of 102 places in 320 ms of which 4 ms to minimize.
[2024-06-01 17:08:15] [INFO ] Deduced a trap composed of 123 places in 318 ms of which 4 ms to minimize.
[2024-06-01 17:08:15] [INFO ] Deduced a trap composed of 64 places in 240 ms of which 4 ms to minimize.
[2024-06-01 17:08:15] [INFO ] Deduced a trap composed of 90 places in 322 ms of which 4 ms to minimize.
[2024-06-01 17:08:16] [INFO ] Deduced a trap composed of 69 places in 323 ms of which 4 ms to minimize.
[2024-06-01 17:08:16] [INFO ] Deduced a trap composed of 95 places in 320 ms of which 3 ms to minimize.
[2024-06-01 17:08:16] [INFO ] Deduced a trap composed of 79 places in 323 ms of which 4 ms to minimize.
[2024-06-01 17:08:17] [INFO ] Deduced a trap composed of 140 places in 335 ms of which 6 ms to minimize.
[2024-06-01 17:08:17] [INFO ] Deduced a trap composed of 97 places in 452 ms of which 4 ms to minimize.
[2024-06-01 17:08:18] [INFO ] Deduced a trap composed of 134 places in 318 ms of which 4 ms to minimize.
[2024-06-01 17:08:18] [INFO ] Deduced a trap composed of 94 places in 327 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/357 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 17:08:18] [INFO ] Deduced a trap composed of 72 places in 320 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/357 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 17:08:19] [INFO ] Deduced a trap composed of 131 places in 335 ms of which 4 ms to minimize.
[2024-06-01 17:08:19] [INFO ] Deduced a trap composed of 131 places in 334 ms of which 4 ms to minimize.
[2024-06-01 17:08:19] [INFO ] Deduced a trap composed of 134 places in 336 ms of which 4 ms to minimize.
[2024-06-01 17:08:20] [INFO ] Deduced a trap composed of 102 places in 333 ms of which 3 ms to minimize.
[2024-06-01 17:08:20] [INFO ] Deduced a trap composed of 183 places in 333 ms of which 5 ms to minimize.
[2024-06-01 17:08:20] [INFO ] Deduced a trap composed of 145 places in 340 ms of which 4 ms to minimize.
[2024-06-01 17:08:21] [INFO ] Deduced a trap composed of 125 places in 328 ms of which 3 ms to minimize.
[2024-06-01 17:08:21] [INFO ] Deduced a trap composed of 124 places in 258 ms of which 4 ms to minimize.
[2024-06-01 17:08:21] [INFO ] Deduced a trap composed of 88 places in 332 ms of which 4 ms to minimize.
[2024-06-01 17:08:22] [INFO ] Deduced a trap composed of 64 places in 331 ms of which 4 ms to minimize.
[2024-06-01 17:08:22] [INFO ] Deduced a trap composed of 173 places in 348 ms of which 4 ms to minimize.
[2024-06-01 17:08:23] [INFO ] Deduced a trap composed of 144 places in 329 ms of which 3 ms to minimize.
[2024-06-01 17:08:23] [INFO ] Deduced a trap composed of 99 places in 337 ms of which 4 ms to minimize.
[2024-06-01 17:08:23] [INFO ] Deduced a trap composed of 117 places in 327 ms of which 4 ms to minimize.
[2024-06-01 17:08:24] [INFO ] Deduced a trap composed of 116 places in 338 ms of which 4 ms to minimize.
[2024-06-01 17:08:24] [INFO ] Deduced a trap composed of 59 places in 328 ms of which 3 ms to minimize.
[2024-06-01 17:08:24] [INFO ] Deduced a trap composed of 137 places in 332 ms of which 4 ms to minimize.
[2024-06-01 17:08:25] [INFO ] Deduced a trap composed of 94 places in 338 ms of which 4 ms to minimize.
[2024-06-01 17:08:25] [INFO ] Deduced a trap composed of 123 places in 312 ms of which 3 ms to minimize.
[2024-06-01 17:08:25] [INFO ] Deduced a trap composed of 55 places in 332 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/357 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/357 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 717/1074 variables, 357/444 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1074 variables, 132/576 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1074 variables, 4/580 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 17:08:28] [INFO ] Deduced a trap composed of 86 places in 350 ms of which 4 ms to minimize.
[2024-06-01 17:08:28] [INFO ] Deduced a trap composed of 87 places in 327 ms of which 3 ms to minimize.
[2024-06-01 17:08:29] [INFO ] Deduced a trap composed of 83 places in 334 ms of which 3 ms to minimize.
[2024-06-01 17:08:29] [INFO ] Deduced a trap composed of 87 places in 335 ms of which 4 ms to minimize.
[2024-06-01 17:08:29] [INFO ] Deduced a trap composed of 76 places in 330 ms of which 3 ms to minimize.
[2024-06-01 17:08:30] [INFO ] Deduced a trap composed of 68 places in 329 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1074 variables, 6/586 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1074 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/1074 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1074/1074 variables, and 586 constraints, problems are : Problem set: 0 solved, 4 unsolved in 26632 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 357/357 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 67/67 constraints]
After SMT, in 27249ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 742 ms.
Support contains 12 out of 357 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 717/717 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 357 transition count 716
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 356 transition count 716
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 355 transition count 715
Applied a total of 4 rules in 49 ms. Remains 355 /357 variables (removed 2) and now considering 715/717 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 355/357 places, 715/717 transitions.
RANDOM walk for 40000 steps (8 resets) in 181 ms. (219 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 75 ms. (526 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 84 ms. (470 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 102 ms. (388 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 115 ms. (344 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 276289 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :1 out of 4
Probabilistic random walk after 276289 steps, saw 217413 distinct states, run finished after 3001 ms. (steps per millisecond=92 ) properties seen :1
// Phase 1: matrix 715 rows 355 cols
[2024-06-01 17:08:35] [INFO ] Computed 26 invariants in 8 ms
[2024-06-01 17:08:35] [INFO ] State equation strengthened by 132 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 328/339 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 4/343 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 12/355 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 715/1070 variables, 355/381 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1070 variables, 132/513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1070 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1070 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1070/1070 variables, and 513 constraints, problems are : Problem set: 0 solved, 3 unsolved in 524 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 355/355 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 328/339 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 4/343 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 12/355 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 17:08:36] [INFO ] Deduced a trap composed of 120 places in 320 ms of which 4 ms to minimize.
[2024-06-01 17:08:37] [INFO ] Deduced a trap composed of 87 places in 316 ms of which 3 ms to minimize.
[2024-06-01 17:08:37] [INFO ] Deduced a trap composed of 126 places in 330 ms of which 4 ms to minimize.
[2024-06-01 17:08:37] [INFO ] Deduced a trap composed of 96 places in 349 ms of which 4 ms to minimize.
[2024-06-01 17:08:38] [INFO ] Deduced a trap composed of 76 places in 326 ms of which 4 ms to minimize.
[2024-06-01 17:08:38] [INFO ] Deduced a trap composed of 102 places in 307 ms of which 4 ms to minimize.
[2024-06-01 17:08:38] [INFO ] Deduced a trap composed of 60 places in 313 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 7/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 17:08:39] [INFO ] Deduced a trap composed of 96 places in 462 ms of which 6 ms to minimize.
[2024-06-01 17:08:39] [INFO ] Deduced a trap composed of 122 places in 419 ms of which 4 ms to minimize.
[2024-06-01 17:08:40] [INFO ] Deduced a trap composed of 120 places in 337 ms of which 3 ms to minimize.
[2024-06-01 17:08:40] [INFO ] Deduced a trap composed of 123 places in 315 ms of which 4 ms to minimize.
[2024-06-01 17:08:40] [INFO ] Deduced a trap composed of 77 places in 338 ms of which 4 ms to minimize.
[2024-06-01 17:08:41] [INFO ] Deduced a trap composed of 93 places in 331 ms of which 4 ms to minimize.
[2024-06-01 17:08:41] [INFO ] Deduced a trap composed of 107 places in 343 ms of which 4 ms to minimize.
[2024-06-01 17:08:41] [INFO ] Deduced a trap composed of 91 places in 320 ms of which 3 ms to minimize.
[2024-06-01 17:08:42] [INFO ] Deduced a trap composed of 90 places in 312 ms of which 4 ms to minimize.
[2024-06-01 17:08:42] [INFO ] Deduced a trap composed of 84 places in 314 ms of which 3 ms to minimize.
[2024-06-01 17:08:42] [INFO ] Deduced a trap composed of 101 places in 312 ms of which 3 ms to minimize.
[2024-06-01 17:08:43] [INFO ] Deduced a trap composed of 75 places in 315 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 12/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 715/1070 variables, 355/400 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1070 variables, 132/532 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1070 variables, 3/535 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1070 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 17:08:44] [INFO ] Deduced a trap composed of 145 places in 226 ms of which 4 ms to minimize.
[2024-06-01 17:08:45] [INFO ] Deduced a trap composed of 98 places in 323 ms of which 4 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/1070 variables, 2/537 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 17:08:45] [INFO ] Deduced a trap composed of 68 places in 310 ms of which 4 ms to minimize.
[2024-06-01 17:08:46] [INFO ] Deduced a trap composed of 71 places in 317 ms of which 4 ms to minimize.
[2024-06-01 17:08:46] [INFO ] Deduced a trap composed of 57 places in 318 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1070 variables, 3/540 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1070 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/1070 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1070/1070 variables, and 540 constraints, problems are : Problem set: 0 solved, 3 unsolved in 10784 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 355/355 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 24/24 constraints]
After SMT, in 11332ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 346 ms.
Support contains 11 out of 355 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 355/355 places, 715/715 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 354 transition count 714
Applied a total of 2 rules in 26 ms. Remains 354 /355 variables (removed 1) and now considering 714/715 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 354/355 places, 714/715 transitions.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2024-06-01 17:08:47] [INFO ] Flatten gal took : 93 ms
[2024-06-01 17:08:47] [INFO ] Flatten gal took : 99 ms
[2024-06-01 17:08:47] [INFO ] Input system was already deterministic with 1701 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 681/681 places, 1701/1701 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 137 transitions
Trivial Post-agglo rules discarded 137 transitions
Performed 137 trivial Post agglomeration. Transition count delta: 137
Iterating post reduction 0 with 137 rules applied. Total rules applied 137 place count 681 transition count 1564
Reduce places removed 137 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 139 rules applied. Total rules applied 276 place count 544 transition count 1562
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 278 place count 542 transition count 1562
Performed 125 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 125 Pre rules applied. Total rules applied 278 place count 542 transition count 1437
Deduced a syphon composed of 125 places in 1 ms
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 3 with 250 rules applied. Total rules applied 528 place count 417 transition count 1437
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 580 place count 365 transition count 747
Iterating global reduction 3 with 52 rules applied. Total rules applied 632 place count 365 transition count 747
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 640 place count 361 transition count 743
Applied a total of 640 rules in 105 ms. Remains 361 /681 variables (removed 320) and now considering 743/1701 (removed 958) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 107 ms. Remains : 361/681 places, 743/1701 transitions.
[2024-06-01 17:08:47] [INFO ] Flatten gal took : 35 ms
[2024-06-01 17:08:47] [INFO ] Flatten gal took : 38 ms
[2024-06-01 17:08:48] [INFO ] Input system was already deterministic with 743 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 681/681 places, 1701/1701 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 143 transitions
Trivial Post-agglo rules discarded 143 transitions
Performed 143 trivial Post agglomeration. Transition count delta: 143
Iterating post reduction 0 with 143 rules applied. Total rules applied 143 place count 681 transition count 1558
Reduce places removed 143 places and 0 transitions.
Iterating post reduction 1 with 143 rules applied. Total rules applied 286 place count 538 transition count 1558
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 132 Pre rules applied. Total rules applied 286 place count 538 transition count 1426
Deduced a syphon composed of 132 places in 0 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 264 rules applied. Total rules applied 550 place count 406 transition count 1426
Discarding 57 places :
Symmetric choice reduction at 2 with 57 rule applications. Total rules 607 place count 349 transition count 709
Iterating global reduction 2 with 57 rules applied. Total rules applied 664 place count 349 transition count 709
Applied a total of 664 rules in 64 ms. Remains 349 /681 variables (removed 332) and now considering 709/1701 (removed 992) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 64 ms. Remains : 349/681 places, 709/1701 transitions.
[2024-06-01 17:08:48] [INFO ] Flatten gal took : 31 ms
[2024-06-01 17:08:48] [INFO ] Flatten gal took : 33 ms
[2024-06-01 17:08:48] [INFO ] Input system was already deterministic with 709 transitions.
RANDOM walk for 8337 steps (1 resets) in 33 ms. (245 steps per ms) remains 0/1 properties
FORMULA Anderson-PT-12-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 681/681 places, 1701/1701 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 628 transition count 1032
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 628 transition count 1032
Applied a total of 106 rules in 34 ms. Remains 628 /681 variables (removed 53) and now considering 1032/1701 (removed 669) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 628/681 places, 1032/1701 transitions.
[2024-06-01 17:08:48] [INFO ] Flatten gal took : 38 ms
[2024-06-01 17:08:48] [INFO ] Flatten gal took : 43 ms
[2024-06-01 17:08:48] [INFO ] Input system was already deterministic with 1032 transitions.
Starting structural reductions in LTL mode, iteration 0 : 681/681 places, 1701/1701 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 629 transition count 1033
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 629 transition count 1033
Applied a total of 104 rules in 36 ms. Remains 629 /681 variables (removed 52) and now considering 1033/1701 (removed 668) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 629/681 places, 1033/1701 transitions.
[2024-06-01 17:08:48] [INFO ] Flatten gal took : 37 ms
[2024-06-01 17:08:48] [INFO ] Flatten gal took : 40 ms
[2024-06-01 17:08:48] [INFO ] Input system was already deterministic with 1033 transitions.
Starting structural reductions in LTL mode, iteration 0 : 681/681 places, 1701/1701 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 624 transition count 984
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 624 transition count 984
Applied a total of 114 rules in 31 ms. Remains 624 /681 variables (removed 57) and now considering 984/1701 (removed 717) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 624/681 places, 984/1701 transitions.
[2024-06-01 17:08:48] [INFO ] Flatten gal took : 35 ms
[2024-06-01 17:08:48] [INFO ] Flatten gal took : 39 ms
[2024-06-01 17:08:49] [INFO ] Input system was already deterministic with 984 transitions.
Starting structural reductions in LTL mode, iteration 0 : 681/681 places, 1701/1701 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 626 transition count 1008
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 626 transition count 1008
Applied a total of 110 rules in 31 ms. Remains 626 /681 variables (removed 55) and now considering 1008/1701 (removed 693) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 626/681 places, 1008/1701 transitions.
[2024-06-01 17:08:49] [INFO ] Flatten gal took : 46 ms
[2024-06-01 17:08:49] [INFO ] Flatten gal took : 39 ms
[2024-06-01 17:08:49] [INFO ] Input system was already deterministic with 1008 transitions.
Starting structural reductions in LTL mode, iteration 0 : 681/681 places, 1701/1701 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 628 transition count 1054
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 628 transition count 1054
Applied a total of 106 rules in 39 ms. Remains 628 /681 variables (removed 53) and now considering 1054/1701 (removed 647) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40 ms. Remains : 628/681 places, 1054/1701 transitions.
[2024-06-01 17:08:49] [INFO ] Flatten gal took : 38 ms
[2024-06-01 17:08:49] [INFO ] Flatten gal took : 40 ms
[2024-06-01 17:08:49] [INFO ] Input system was already deterministic with 1054 transitions.
Starting structural reductions in LTL mode, iteration 0 : 681/681 places, 1701/1701 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 624 transition count 984
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 624 transition count 984
Applied a total of 114 rules in 38 ms. Remains 624 /681 variables (removed 57) and now considering 984/1701 (removed 717) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40 ms. Remains : 624/681 places, 984/1701 transitions.
[2024-06-01 17:08:49] [INFO ] Flatten gal took : 34 ms
[2024-06-01 17:08:49] [INFO ] Flatten gal took : 37 ms
[2024-06-01 17:08:49] [INFO ] Input system was already deterministic with 984 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 681/681 places, 1701/1701 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 133 transitions
Trivial Post-agglo rules discarded 133 transitions
Performed 133 trivial Post agglomeration. Transition count delta: 133
Iterating post reduction 0 with 133 rules applied. Total rules applied 133 place count 681 transition count 1568
Reduce places removed 133 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 134 rules applied. Total rules applied 267 place count 548 transition count 1567
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 268 place count 547 transition count 1567
Performed 128 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 128 Pre rules applied. Total rules applied 268 place count 547 transition count 1439
Deduced a syphon composed of 128 places in 1 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 256 rules applied. Total rules applied 524 place count 419 transition count 1439
Discarding 48 places :
Symmetric choice reduction at 3 with 48 rule applications. Total rules 572 place count 371 transition count 863
Iterating global reduction 3 with 48 rules applied. Total rules applied 620 place count 371 transition count 863
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 626 place count 368 transition count 860
Applied a total of 626 rules in 84 ms. Remains 368 /681 variables (removed 313) and now considering 860/1701 (removed 841) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 84 ms. Remains : 368/681 places, 860/1701 transitions.
[2024-06-01 17:08:49] [INFO ] Flatten gal took : 34 ms
[2024-06-01 17:08:49] [INFO ] Flatten gal took : 35 ms
[2024-06-01 17:08:49] [INFO ] Input system was already deterministic with 860 transitions.
Starting structural reductions in LTL mode, iteration 0 : 681/681 places, 1701/1701 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 636 transition count 1150
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 636 transition count 1150
Applied a total of 90 rules in 58 ms. Remains 636 /681 variables (removed 45) and now considering 1150/1701 (removed 551) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59 ms. Remains : 636/681 places, 1150/1701 transitions.
[2024-06-01 17:08:50] [INFO ] Flatten gal took : 37 ms
[2024-06-01 17:08:50] [INFO ] Flatten gal took : 40 ms
[2024-06-01 17:08:50] [INFO ] Input system was already deterministic with 1150 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 681/681 places, 1701/1701 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 142 transitions
Trivial Post-agglo rules discarded 142 transitions
Performed 142 trivial Post agglomeration. Transition count delta: 142
Iterating post reduction 0 with 142 rules applied. Total rules applied 142 place count 681 transition count 1559
Reduce places removed 142 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 144 rules applied. Total rules applied 286 place count 539 transition count 1557
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 288 place count 537 transition count 1557
Performed 131 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 131 Pre rules applied. Total rules applied 288 place count 537 transition count 1426
Deduced a syphon composed of 131 places in 0 ms
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 3 with 262 rules applied. Total rules applied 550 place count 406 transition count 1426
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 606 place count 350 transition count 710
Iterating global reduction 3 with 56 rules applied. Total rules applied 662 place count 350 transition count 710
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 664 place count 349 transition count 709
Applied a total of 664 rules in 66 ms. Remains 349 /681 variables (removed 332) and now considering 709/1701 (removed 992) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 68 ms. Remains : 349/681 places, 709/1701 transitions.
[2024-06-01 17:08:50] [INFO ] Flatten gal took : 26 ms
[2024-06-01 17:08:50] [INFO ] Flatten gal took : 27 ms
[2024-06-01 17:08:50] [INFO ] Input system was already deterministic with 709 transitions.
Starting structural reductions in LTL mode, iteration 0 : 681/681 places, 1701/1701 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 633 transition count 1103
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 633 transition count 1103
Applied a total of 96 rules in 37 ms. Remains 633 /681 variables (removed 48) and now considering 1103/1701 (removed 598) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38 ms. Remains : 633/681 places, 1103/1701 transitions.
[2024-06-01 17:08:50] [INFO ] Flatten gal took : 33 ms
[2024-06-01 17:08:50] [INFO ] Flatten gal took : 37 ms
[2024-06-01 17:08:50] [INFO ] Input system was already deterministic with 1103 transitions.
Starting structural reductions in LTL mode, iteration 0 : 681/681 places, 1701/1701 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 631 transition count 1057
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 631 transition count 1057
Applied a total of 100 rules in 39 ms. Remains 631 /681 variables (removed 50) and now considering 1057/1701 (removed 644) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39 ms. Remains : 631/681 places, 1057/1701 transitions.
[2024-06-01 17:08:50] [INFO ] Flatten gal took : 32 ms
[2024-06-01 17:08:50] [INFO ] Flatten gal took : 47 ms
[2024-06-01 17:08:50] [INFO ] Input system was already deterministic with 1057 transitions.
[2024-06-01 17:08:50] [INFO ] Flatten gal took : 59 ms
[2024-06-01 17:08:50] [INFO ] Flatten gal took : 61 ms
[2024-06-01 17:08:50] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 6 ms.
[2024-06-01 17:08:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 681 places, 1701 transitions and 6198 arcs took 14 ms.
Total runtime 114768 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
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="Anderson-PT-12"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is Anderson-PT-12, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r464-smll-171620118400377"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-12.tgz
mv Anderson-PT-12 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;