About the Execution of GreatSPN+red for FireWire-PT-09
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2070.676 | 211851.00 | 430444.00 | 462.40 | TFTTTFTFTFTTTTFF | 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.r549-tall-171734898100234.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 greatspnxred
Input is FireWire-PT-09, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r549-tall-171734898100234
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 7.4K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K 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.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K 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 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K 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 100K 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
here is the order used to build the result vector(from text file)
FORMULA_NAME FireWire-PT-09-CTLFireability-2024-00
FORMULA_NAME FireWire-PT-09-CTLFireability-2024-01
FORMULA_NAME FireWire-PT-09-CTLFireability-2024-02
FORMULA_NAME FireWire-PT-09-CTLFireability-2024-03
FORMULA_NAME FireWire-PT-09-CTLFireability-2024-04
FORMULA_NAME FireWire-PT-09-CTLFireability-2024-05
FORMULA_NAME FireWire-PT-09-CTLFireability-2024-06
FORMULA_NAME FireWire-PT-09-CTLFireability-2024-07
FORMULA_NAME FireWire-PT-09-CTLFireability-2024-08
FORMULA_NAME FireWire-PT-09-CTLFireability-2024-09
FORMULA_NAME FireWire-PT-09-CTLFireability-2024-10
FORMULA_NAME FireWire-PT-09-CTLFireability-2024-11
FORMULA_NAME FireWire-PT-09-CTLFireability-2024-12
FORMULA_NAME FireWire-PT-09-CTLFireability-2024-13
FORMULA_NAME FireWire-PT-09-CTLFireability-2024-14
FORMULA_NAME FireWire-PT-09-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717366725212
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 22:18:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 22:18:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:18:46] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2024-06-02 22:18:46] [INFO ] Transformed 130 places.
[2024-06-02 22:18:46] [INFO ] Transformed 408 transitions.
[2024-06-02 22:18:46] [INFO ] Found NUPN structural information;
[2024-06-02 22:18:46] [INFO ] Parsed PT model containing 130 places and 408 transitions and 1525 arcs in 171 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 transitions.
Support contains 85 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 352/352 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 130 transition count 346
Applied a total of 6 rules in 22 ms. Remains 130 /130 variables (removed 0) and now considering 346/352 (removed 6) transitions.
[2024-06-02 22:18:46] [INFO ] Flow matrix only has 320 transitions (discarded 26 similar events)
// Phase 1: matrix 320 rows 130 cols
[2024-06-02 22:18:46] [INFO ] Computed 8 invariants in 16 ms
[2024-06-02 22:18:46] [INFO ] Implicit Places using invariants in 234 ms returned []
[2024-06-02 22:18:46] [INFO ] Flow matrix only has 320 transitions (discarded 26 similar events)
[2024-06-02 22:18:46] [INFO ] Invariant cache hit.
[2024-06-02 22:18:46] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 22:18:47] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
Running 345 sub problems to find dead transitions.
[2024-06-02 22:18:47] [INFO ] Flow matrix only has 320 transitions (discarded 26 similar events)
[2024-06-02 22:18:47] [INFO ] Invariant cache hit.
[2024-06-02 22:18:47] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 129/129 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (OVERLAPS) 1/130 variables, 8/137 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 345 unsolved
[2024-06-02 22:18:50] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 7 ms to minimize.
[2024-06-02 22:18:50] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 2 ms to minimize.
[2024-06-02 22:18:50] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 1 ms to minimize.
[2024-06-02 22:18:50] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:18:50] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 2 ms to minimize.
[2024-06-02 22:18:51] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-06-02 22:18:51] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 7/145 constraints. Problems are: Problem set: 0 solved, 345 unsolved
[2024-06-02 22:18:51] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
[2024-06-02 22:18:52] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 7 (OVERLAPS) 319/449 variables, 130/277 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/449 variables, 44/321 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/449 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 10 (OVERLAPS) 1/450 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/450 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 12 (OVERLAPS) 0/450 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 345 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 322 constraints, problems are : Problem set: 0 solved, 345 unsolved in 17646 ms.
Refiners :[Domain max(s): 130/130 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 130/130 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 345/345 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 129/129 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (OVERLAPS) 1/130 variables, 8/137 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 9/147 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 6 (OVERLAPS) 319/449 variables, 130/277 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/449 variables, 44/321 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/449 variables, 345/666 constraints. Problems are: Problem set: 0 solved, 345 unsolved
[2024-06-02 22:19:11] [INFO ] Deduced a trap composed of 55 places in 54 ms of which 0 ms to minimize.
[2024-06-02 22:19:12] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/449 variables, 2/668 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/449 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 11 (OVERLAPS) 1/450 variables, 1/669 constraints. Problems are: Problem set: 0 solved, 345 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 450/450 variables, and 669 constraints, problems are : Problem set: 0 solved, 345 unsolved in 30018 ms.
Refiners :[Domain max(s): 130/130 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 130/130 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 345/345 constraints, Known Traps: 11/11 constraints]
After SMT, in 48013ms problems are : Problem set: 0 solved, 345 unsolved
Search for dead transitions found 0 dead transitions in 48032ms
Starting structural reductions in LTL mode, iteration 1 : 130/130 places, 346/352 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48549 ms. Remains : 130/130 places, 346/352 transitions.
Support contains 85 out of 130 places after structural reductions.
[2024-06-02 22:19:35] [INFO ] Flatten gal took : 50 ms
[2024-06-02 22:19:35] [INFO ] Flatten gal took : 25 ms
[2024-06-02 22:19:35] [INFO ] Input system was already deterministic with 346 transitions.
Support contains 83 out of 130 places (down from 85) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 89 to 87
RANDOM walk for 40000 steps (2198 resets) in 1577 ms. (25 steps per ms) remains 47/87 properties
BEST_FIRST walk for 4001 steps (9 resets) in 32 ms. (121 steps per ms) remains 42/47 properties
BEST_FIRST walk for 4002 steps (65 resets) in 43 ms. (90 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (108 resets) in 32 ms. (121 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (55 resets) in 23 ms. (166 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (10 resets) in 37 ms. (105 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (14 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 37/42 properties
BEST_FIRST walk for 4004 steps (99 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (55 resets) in 19 ms. (200 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (10 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (119 resets) in 16 ms. (235 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (9 resets) in 13 ms. (286 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (9 resets) in 14 ms. (266 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (49 resets) in 20 ms. (190 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (65 resets) in 34 ms. (114 steps per ms) remains 36/37 properties
BEST_FIRST walk for 4004 steps (12 resets) in 10 ms. (364 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (60 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (47 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (38 resets) in 12 ms. (308 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (62 resets) in 28 ms. (138 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (63 resets) in 13 ms. (285 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (52 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (63 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (55 resets) in 25 ms. (154 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (48 resets) in 12 ms. (307 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (9 resets) in 10 ms. (363 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (105 resets) in 25 ms. (153 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (60 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (14 resets) in 10 ms. (364 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (107 resets) in 13 ms. (285 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (68 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (97 resets) in 13 ms. (285 steps per ms) remains 36/36 properties
[2024-06-02 22:19:36] [INFO ] Flow matrix only has 320 transitions (discarded 26 similar events)
[2024-06-02 22:19:36] [INFO ] Invariant cache hit.
[2024-06-02 22:19:36] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 36 unsolved
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp84 is UNSAT
At refinement iteration 2 (OVERLAPS) 80/126 variables, 7/53 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 80/133 constraints. Problems are: Problem set: 3 solved, 33 unsolved
[2024-06-02 22:19:36] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2024-06-02 22:19:36] [INFO ] Deduced a trap composed of 44 places in 32 ms of which 1 ms to minimize.
[2024-06-02 22:19:36] [INFO ] Deduced a trap composed of 36 places in 27 ms of which 0 ms to minimize.
[2024-06-02 22:19:36] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 4/137 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/137 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 2/128 variables, 1/138 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 2/140 constraints. Problems are: Problem set: 3 solved, 33 unsolved
[2024-06-02 22:19:36] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 1/141 constraints. Problems are: Problem set: 3 solved, 33 unsolved
[2024-06-02 22:19:37] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 1/142 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 0/142 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 11 (OVERLAPS) 319/447 variables, 128/270 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/447 variables, 44/314 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/447 variables, 0/314 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 14 (OVERLAPS) 2/449 variables, 2/316 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/449 variables, 2/318 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/449 variables, 0/318 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 17 (OVERLAPS) 1/450 variables, 1/319 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/450 variables, 0/319 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 19 (OVERLAPS) 0/450 variables, 0/319 constraints. Problems are: Problem set: 3 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 319 constraints, problems are : Problem set: 3 solved, 33 unsolved in 2183 ms.
Refiners :[Domain max(s): 130/130 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 130/130 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 3 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 43/43 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/43 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 83/126 variables, 7/50 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 83/133 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 5/138 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/138 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 2/128 variables, 1/139 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 2/141 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 1/142 constraints. Problems are: Problem set: 3 solved, 33 unsolved
[2024-06-02 22:19:38] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 1/143 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 0/143 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 11 (OVERLAPS) 319/447 variables, 128/271 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/447 variables, 44/315 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/447 variables, 32/347 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/447 variables, 0/347 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 15 (OVERLAPS) 2/449 variables, 2/349 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/449 variables, 2/351 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/449 variables, 1/352 constraints. Problems are: Problem set: 3 solved, 33 unsolved
[2024-06-02 22:19:40] [INFO ] Deduced a trap composed of 55 places in 42 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/449 variables, 1/353 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/449 variables, 0/353 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 20 (OVERLAPS) 1/450 variables, 1/354 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/450 variables, 0/354 constraints. Problems are: Problem set: 3 solved, 33 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 450/450 variables, and 354 constraints, problems are : Problem set: 3 solved, 33 unsolved in 5008 ms.
Refiners :[Domain max(s): 130/130 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 130/130 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 33/36 constraints, Known Traps: 8/8 constraints]
After SMT, in 7242ms problems are : Problem set: 3 solved, 33 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 43 out of 130 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 346/346 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 130 transition count 343
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 128 transition count 339
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 128 transition count 339
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 128 transition count 338
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 2 with 2 rules applied. Total rules applied 10 place count 127 transition count 337
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 125 transition count 341
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 18 place count 125 transition count 337
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 125 transition count 335
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 124 transition count 334
Applied a total of 21 rules in 65 ms. Remains 124 /130 variables (removed 6) and now considering 334/346 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 124/130 places, 334/346 transitions.
RANDOM walk for 40000 steps (2198 resets) in 636 ms. (62 steps per ms) remains 32/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (56 resets) in 21 ms. (181 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (108 resets) in 12 ms. (307 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (9 resets) in 13 ms. (285 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (63 resets) in 25 ms. (154 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (10 resets) in 12 ms. (307 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (50 resets) in 8 ms. (444 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (91 resets) in 8 ms. (444 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (9 resets) in 9 ms. (400 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (61 resets) in 13 ms. (286 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (53 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (10 resets) in 8 ms. (444 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (64 resets) in 12 ms. (307 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (80 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (44 resets) in 51 ms. (76 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (56 resets) in 12 ms. (307 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (59 resets) in 12 ms. (307 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (57 resets) in 23 ms. (166 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (52 resets) in 12 ms. (308 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (55 resets) in 13 ms. (285 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (10 resets) in 10 ms. (363 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (94 resets) in 9 ms. (400 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (11 resets) in 10 ms. (363 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (111 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (70 resets) in 12 ms. (307 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (103 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
Interrupted probabilistic random walk after 501669 steps, run timeout after 3001 ms. (steps per millisecond=167 ) properties seen :19 out of 32
Probabilistic random walk after 501669 steps, saw 118327 distinct states, run finished after 3017 ms. (steps per millisecond=166 ) properties seen :19
[2024-06-02 22:19:46] [INFO ] Flow matrix only has 308 transitions (discarded 26 similar events)
// Phase 1: matrix 308 rows 124 cols
[2024-06-02 22:19:46] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 22:19:46] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 78/98 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-02 22:19:46] [INFO ] Deduced a trap composed of 43 places in 29 ms of which 1 ms to minimize.
[2024-06-02 22:19:47] [INFO ] Deduced a trap composed of 35 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 285/383 variables, 98/106 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 33/139 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 47/430 variables, 24/163 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/430 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/430 variables, 12/176 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/430 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 2/432 variables, 2/178 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/432 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/432 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 0/432 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 179 constraints, problems are : Problem set: 0 solved, 13 unsolved in 616 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 78/98 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 285/383 variables, 98/106 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 33/139 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 47/430 variables, 24/163 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/430 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/430 variables, 12/176 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/430 variables, 13/189 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/430 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 2/432 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/432 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/432 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (OVERLAPS) 0/432 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 432/432 variables, and 192 constraints, problems are : Problem set: 0 solved, 13 unsolved in 1044 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 2/2 constraints]
After SMT, in 1683ms problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 5200 ms.
Support contains 20 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 334/334 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 122 transition count 330
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 122 transition count 330
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 122 transition count 328
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 121 transition count 330
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 10 place count 121 transition count 328
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 121 transition count 327
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 121 transition count 329
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 15 place count 120 transition count 327
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 120 transition count 325
Applied a total of 17 rules in 50 ms. Remains 120 /124 variables (removed 4) and now considering 325/334 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 120/124 places, 325/334 transitions.
RANDOM walk for 40000 steps (2330 resets) in 195 ms. (204 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (77 resets) in 115 ms. (344 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (61 resets) in 165 ms. (240 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (66 resets) in 51 ms. (769 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (579 resets) in 56 ms. (701 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (1065 resets) in 52 ms. (754 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (585 resets) in 47 ms. (833 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (565 resets) in 41 ms. (952 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (537 resets) in 38 ms. (1025 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (563 resets) in 48 ms. (816 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (590 resets) in 50 ms. (784 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (68 resets) in 37 ms. (1052 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (563 resets) in 41 ms. (952 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (1074 resets) in 56 ms. (701 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 584536 steps, run timeout after 3001 ms. (steps per millisecond=194 ) properties seen :0 out of 13
Probabilistic random walk after 584536 steps, saw 126225 distinct states, run finished after 3001 ms. (steps per millisecond=194 ) properties seen :0
[2024-06-02 22:19:57] [INFO ] Flow matrix only has 296 transitions (discarded 29 similar events)
// Phase 1: matrix 296 rows 120 cols
[2024-06-02 22:19:57] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:19:57] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 74/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-02 22:19:57] [INFO ] Deduced a trap composed of 40 places in 27 ms of which 1 ms to minimize.
[2024-06-02 22:19:57] [INFO ] Deduced a trap composed of 32 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 273/367 variables, 94/102 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/367 variables, 33/135 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 47/414 variables, 24/159 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 12/172 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 2/416 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/416 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/416 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 0/416 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 416/416 variables, and 175 constraints, problems are : Problem set: 0 solved, 13 unsolved in 574 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 120/120 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 74/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 273/367 variables, 94/102 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/367 variables, 33/135 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 47/414 variables, 24/159 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 12/172 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 13/185 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/414 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 2/416 variables, 2/187 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/416 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-02 22:19:58] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/416 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/416 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (OVERLAPS) 0/416 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 416/416 variables, and 189 constraints, problems are : Problem set: 0 solved, 13 unsolved in 1309 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 120/120 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 3/3 constraints]
After SMT, in 1906ms problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 16681 ms.
Support contains 20 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 325/325 transitions.
Applied a total of 0 rules in 15 ms. Remains 120 /120 variables (removed 0) and now considering 325/325 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 120/120 places, 325/325 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 325/325 transitions.
Applied a total of 0 rules in 6 ms. Remains 120 /120 variables (removed 0) and now considering 325/325 (removed 0) transitions.
[2024-06-02 22:20:15] [INFO ] Flow matrix only has 296 transitions (discarded 29 similar events)
[2024-06-02 22:20:15] [INFO ] Invariant cache hit.
[2024-06-02 22:20:15] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-02 22:20:15] [INFO ] Flow matrix only has 296 transitions (discarded 29 similar events)
[2024-06-02 22:20:15] [INFO ] Invariant cache hit.
[2024-06-02 22:20:15] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 22:20:16] [INFO ] Implicit Places using invariants and state equation in 155 ms returned [36]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 220 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 119/120 places, 325/325 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 119 transition count 324
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 118 transition count 324
Applied a total of 2 rules in 16 ms. Remains 118 /119 variables (removed 1) and now considering 324/325 (removed 1) transitions.
[2024-06-02 22:20:16] [INFO ] Flow matrix only has 295 transitions (discarded 29 similar events)
// Phase 1: matrix 295 rows 118 cols
[2024-06-02 22:20:16] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 22:20:16] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-02 22:20:16] [INFO ] Flow matrix only has 295 transitions (discarded 29 similar events)
[2024-06-02 22:20:16] [INFO ] Invariant cache hit.
[2024-06-02 22:20:16] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 22:20:16] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 118/120 places, 324/325 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 452 ms. Remains : 118/120 places, 324/325 transitions.
RANDOM walk for 40000 steps (2282 resets) in 163 ms. (243 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (77 resets) in 36 ms. (1081 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (50 resets) in 40 ms. (975 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (80 resets) in 45 ms. (869 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (612 resets) in 42 ms. (930 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (1094 resets) in 46 ms. (851 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (610 resets) in 46 ms. (851 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (570 resets) in 42 ms. (930 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (505 resets) in 41 ms. (952 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (583 resets) in 42 ms. (930 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (586 resets) in 48 ms. (816 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (61 resets) in 41 ms. (952 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (598 resets) in 45 ms. (869 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (1118 resets) in 45 ms. (869 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 592016 steps, run timeout after 3001 ms. (steps per millisecond=197 ) properties seen :0 out of 13
Probabilistic random walk after 592016 steps, saw 127747 distinct states, run finished after 3001 ms. (steps per millisecond=197 ) properties seen :0
[2024-06-02 22:20:19] [INFO ] Flow matrix only has 295 transitions (discarded 29 similar events)
[2024-06-02 22:20:19] [INFO ] Invariant cache hit.
[2024-06-02 22:20:19] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 74/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-02 22:20:19] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 0 ms to minimize.
[2024-06-02 22:20:19] [INFO ] Deduced a trap composed of 32 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 273/367 variables, 94/102 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/367 variables, 33/135 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 46/413 variables, 24/159 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/413 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/413 variables, 12/172 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/413 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 0/413 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 172 constraints, problems are : Problem set: 0 solved, 13 unsolved in 536 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 118/118 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 74/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 273/367 variables, 94/102 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/367 variables, 33/135 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 46/413 variables, 24/159 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/413 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/413 variables, 12/172 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/413 variables, 13/185 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/413 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 0/413 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 413/413 variables, and 185 constraints, problems are : Problem set: 0 solved, 13 unsolved in 862 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 118/118 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 2/2 constraints]
After SMT, in 1412ms problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 12 different solutions.
Parikh walk visited 1 properties in 17383 ms.
Support contains 17 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 324/324 transitions.
Applied a total of 0 rules in 7 ms. Remains 118 /118 variables (removed 0) and now considering 324/324 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 118/118 places, 324/324 transitions.
RANDOM walk for 40000 steps (2381 resets) in 164 ms. (242 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (86 resets) in 43 ms. (909 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (70 resets) in 37 ms. (1052 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (71 resets) in 37 ms. (1052 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (575 resets) in 57 ms. (689 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1107 resets) in 78 ms. (506 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (564 resets) in 43 ms. (909 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (547 resets) in 41 ms. (952 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (556 resets) in 62 ms. (634 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (607 resets) in 48 ms. (816 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (66 resets) in 37 ms. (1052 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (613 resets) in 57 ms. (689 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (1115 resets) in 63 ms. (625 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 617680 steps, run timeout after 3001 ms. (steps per millisecond=205 ) properties seen :0 out of 12
Probabilistic random walk after 617680 steps, saw 133101 distinct states, run finished after 3001 ms. (steps per millisecond=205 ) properties seen :0
[2024-06-02 22:20:41] [INFO ] Flow matrix only has 295 transitions (discarded 29 similar events)
[2024-06-02 22:20:41] [INFO ] Invariant cache hit.
[2024-06-02 22:20:41] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 74/91 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 273/364 variables, 91/96 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 33/129 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 49/413 variables, 27/156 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/413 variables, 12/170 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/413 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/413 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 170 constraints, problems are : Problem set: 0 solved, 12 unsolved in 504 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 118/118 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 74/91 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 273/364 variables, 91/96 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 33/129 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 49/413 variables, 27/156 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/413 variables, 12/170 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/413 variables, 12/182 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/413 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 0/413 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 413/413 variables, and 182 constraints, problems are : Problem set: 0 solved, 12 unsolved in 705 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 118/118 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 1222ms problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 4989 ms.
Support contains 17 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 324/324 transitions.
Applied a total of 0 rules in 6 ms. Remains 118 /118 variables (removed 0) and now considering 324/324 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 118/118 places, 324/324 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 324/324 transitions.
Applied a total of 0 rules in 7 ms. Remains 118 /118 variables (removed 0) and now considering 324/324 (removed 0) transitions.
[2024-06-02 22:20:47] [INFO ] Flow matrix only has 295 transitions (discarded 29 similar events)
[2024-06-02 22:20:47] [INFO ] Invariant cache hit.
[2024-06-02 22:20:47] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 22:20:47] [INFO ] Flow matrix only has 295 transitions (discarded 29 similar events)
[2024-06-02 22:20:47] [INFO ] Invariant cache hit.
[2024-06-02 22:20:47] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 22:20:47] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2024-06-02 22:20:48] [INFO ] Redundant transitions in 20 ms returned []
Running 322 sub problems to find dead transitions.
[2024-06-02 22:20:48] [INFO ] Flow matrix only has 295 transitions (discarded 29 similar events)
[2024-06-02 22:20:48] [INFO ] Invariant cache hit.
[2024-06-02 22:20:48] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 322 unsolved
[2024-06-02 22:20:48] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 0 ms to minimize.
[2024-06-02 22:20:49] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:20:49] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 0 ms to minimize.
[2024-06-02 22:20:49] [INFO ] Deduced a trap composed of 32 places in 25 ms of which 1 ms to minimize.
[2024-06-02 22:20:49] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:20:49] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:20:49] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-06-02 22:20:50] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 1 ms to minimize.
[2024-06-02 22:20:50] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 322 unsolved
[2024-06-02 22:20:50] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (OVERLAPS) 295/412 variables, 117/134 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/412 variables, 45/179 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 7 (OVERLAPS) 1/413 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 322 unsolved
[2024-06-02 22:20:56] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/413 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/413 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 10 (OVERLAPS) 0/413 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 322 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 181 constraints, problems are : Problem set: 0 solved, 322 unsolved in 15365 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 118/118 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 322 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (OVERLAPS) 295/412 variables, 117/135 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/412 variables, 45/180 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/412 variables, 322/502 constraints. Problems are: Problem set: 0 solved, 322 unsolved
[2024-06-02 22:21:06] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-06-02 22:21:08] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 2/504 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/412 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 8 (OVERLAPS) 1/413 variables, 1/505 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/413 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 10 (OVERLAPS) 0/413 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 322 unsolved
No progress, stopping.
After SMT solving in domain Int declared 413/413 variables, and 505 constraints, problems are : Problem set: 0 solved, 322 unsolved in 25072 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 118/118 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 13/13 constraints]
After SMT, in 40636ms problems are : Problem set: 0 solved, 322 unsolved
Search for dead transitions found 0 dead transitions in 40639ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40869 ms. Remains : 118/118 places, 324/324 transitions.
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2024-06-02 22:21:28] [INFO ] Flatten gal took : 20 ms
[2024-06-02 22:21:28] [INFO ] Flatten gal took : 20 ms
[2024-06-02 22:21:28] [INFO ] Input system was already deterministic with 346 transitions.
Computed a total of 22 stabilizing places and 47 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 346/346 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 127 transition count 340
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 127 transition count 340
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 9 place count 127 transition count 337
Applied a total of 9 rules in 3 ms. Remains 127 /130 variables (removed 3) and now considering 337/346 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 127/130 places, 337/346 transitions.
[2024-06-02 22:21:28] [INFO ] Flatten gal took : 16 ms
[2024-06-02 22:21:28] [INFO ] Flatten gal took : 16 ms
[2024-06-02 22:21:28] [INFO ] Input system was already deterministic with 337 transitions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 346/346 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 126 transition count 338
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 126 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 126 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 125 transition count 332
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 125 transition count 332
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 124 transition count 330
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 124 transition count 330
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 123 transition count 327
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 123 transition count 327
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 122 transition count 325
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 122 transition count 325
Applied a total of 19 rules in 9 ms. Remains 122 /130 variables (removed 8) and now considering 325/346 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 122/130 places, 325/346 transitions.
[2024-06-02 22:21:28] [INFO ] Flatten gal took : 14 ms
[2024-06-02 22:21:28] [INFO ] Flatten gal took : 16 ms
[2024-06-02 22:21:28] [INFO ] Input system was already deterministic with 325 transitions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 346/346 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 127 transition count 340
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 127 transition count 340
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 127 transition count 338
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 126 transition count 335
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 126 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 125 transition count 333
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 125 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 124 transition count 330
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 124 transition count 330
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 123 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 123 transition count 328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 122 transition count 325
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 122 transition count 325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 121 transition count 323
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 121 transition count 323
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 120 transition count 320
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 120 transition count 320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 119 transition count 318
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 119 transition count 318
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 118 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 118 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 117 transition count 313
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 115 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 115 transition count 309
Applied a total of 32 rules in 14 ms. Remains 115 /130 variables (removed 15) and now considering 309/346 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 115/130 places, 309/346 transitions.
[2024-06-02 22:21:28] [INFO ] Flatten gal took : 12 ms
[2024-06-02 22:21:28] [INFO ] Flatten gal took : 13 ms
[2024-06-02 22:21:28] [INFO ] Input system was already deterministic with 309 transitions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 346/346 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 127 transition count 340
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 127 transition count 340
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 127 transition count 338
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 126 transition count 335
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 126 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 125 transition count 333
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 125 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 124 transition count 330
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 124 transition count 330
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 123 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 123 transition count 328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 122 transition count 325
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 122 transition count 325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 121 transition count 323
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 121 transition count 323
Applied a total of 20 rules in 7 ms. Remains 121 /130 variables (removed 9) and now considering 323/346 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 121/130 places, 323/346 transitions.
[2024-06-02 22:21:28] [INFO ] Flatten gal took : 12 ms
[2024-06-02 22:21:29] [INFO ] Flatten gal took : 13 ms
[2024-06-02 22:21:29] [INFO ] Input system was already deterministic with 323 transitions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 346/346 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 126 transition count 338
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 126 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 126 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 125 transition count 332
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 125 transition count 332
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 124 transition count 330
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 124 transition count 330
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 123 transition count 327
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 123 transition count 327
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 122 transition count 325
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 122 transition count 325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 121 transition count 322
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 121 transition count 322
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 120 transition count 320
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 120 transition count 320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 119 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 119 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 118 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 118 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 117 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 117 transition count 312
Applied a total of 29 rules in 10 ms. Remains 117 /130 variables (removed 13) and now considering 312/346 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 117/130 places, 312/346 transitions.
[2024-06-02 22:21:29] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:21:29] [INFO ] Flatten gal took : 12 ms
[2024-06-02 22:21:29] [INFO ] Input system was already deterministic with 312 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 130/130 places, 346/346 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 125 transition count 337
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 125 transition count 337
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 125 transition count 334
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 124 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 124 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 123 transition count 329
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 123 transition count 329
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 122 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 122 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 121 transition count 324
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 121 transition count 324
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 120 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 120 transition count 321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 119 transition count 319
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 119 transition count 319
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 118 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 118 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 117 transition count 314
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 117 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 115 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 115 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 114 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 114 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 113 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 113 transition count 305
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 1 with 2 rules applied. Total rules applied 37 place count 112 transition count 304
Applied a total of 37 rules in 38 ms. Remains 112 /130 variables (removed 18) and now considering 304/346 (removed 42) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38 ms. Remains : 112/130 places, 304/346 transitions.
[2024-06-02 22:21:29] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:21:29] [INFO ] Flatten gal took : 12 ms
[2024-06-02 22:21:29] [INFO ] Input system was already deterministic with 304 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 130/130 places, 346/346 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 125 transition count 337
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 125 transition count 337
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 125 transition count 334
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 124 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 124 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 123 transition count 329
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 123 transition count 329
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 122 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 122 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 121 transition count 324
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 121 transition count 324
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 120 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 120 transition count 321
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 1 with 2 rules applied. Total rules applied 23 place count 119 transition count 320
Applied a total of 23 rules in 22 ms. Remains 119 /130 variables (removed 11) and now considering 320/346 (removed 26) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 119/130 places, 320/346 transitions.
[2024-06-02 22:21:29] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:21:29] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:21:29] [INFO ] Input system was already deterministic with 320 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 130/130 places, 346/346 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 125 transition count 337
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 125 transition count 337
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 125 transition count 334
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 124 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 124 transition count 331
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 1 with 2 rules applied. Total rules applied 15 place count 123 transition count 330
Applied a total of 15 rules in 13 ms. Remains 123 /130 variables (removed 7) and now considering 330/346 (removed 16) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 123/130 places, 330/346 transitions.
[2024-06-02 22:21:29] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:21:29] [INFO ] Flatten gal took : 12 ms
[2024-06-02 22:21:29] [INFO ] Input system was already deterministic with 330 transitions.
RANDOM walk for 33657 steps (1990 resets) in 228 ms. (146 steps per ms) remains 0/1 properties
FORMULA FireWire-PT-09-CTLFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 346/346 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 127 transition count 340
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 127 transition count 340
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 127 transition count 338
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 126 transition count 335
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 126 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 125 transition count 333
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 125 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 124 transition count 330
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 124 transition count 330
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 123 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 123 transition count 328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 122 transition count 325
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 122 transition count 325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 121 transition count 323
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 121 transition count 323
Applied a total of 20 rules in 12 ms. Remains 121 /130 variables (removed 9) and now considering 323/346 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 121/130 places, 323/346 transitions.
[2024-06-02 22:21:29] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:21:29] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:21:29] [INFO ] Input system was already deterministic with 323 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 130/130 places, 346/346 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 126 transition count 339
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 126 transition count 339
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 126 transition count 337
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 125 transition count 334
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 125 transition count 334
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 124 transition count 332
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 124 transition count 332
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 123 transition count 329
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 123 transition count 329
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 122 transition count 327
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 122 transition count 327
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 121 transition count 324
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 121 transition count 324
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 120 transition count 322
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 120 transition count 322
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 119 transition count 319
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 119 transition count 319
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 118 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 118 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 117 transition count 314
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 117 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 116 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 116 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 115 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 114 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 114 transition count 308
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 1 with 2 rules applied. Total rules applied 34 place count 113 transition count 307
Applied a total of 34 rules in 29 ms. Remains 113 /130 variables (removed 17) and now considering 307/346 (removed 39) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29 ms. Remains : 113/130 places, 307/346 transitions.
[2024-06-02 22:21:29] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:21:29] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:21:29] [INFO ] Input system was already deterministic with 307 transitions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 346/346 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 127 transition count 340
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 127 transition count 340
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 127 transition count 338
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 126 transition count 335
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 126 transition count 335
Applied a total of 10 rules in 3 ms. Remains 126 /130 variables (removed 4) and now considering 335/346 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 126/130 places, 335/346 transitions.
[2024-06-02 22:21:29] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:21:29] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:21:29] [INFO ] Input system was already deterministic with 335 transitions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 346/346 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 127 transition count 340
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 127 transition count 340
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 127 transition count 338
Applied a total of 8 rules in 2 ms. Remains 127 /130 variables (removed 3) and now considering 338/346 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 127/130 places, 338/346 transitions.
[2024-06-02 22:21:29] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:21:29] [INFO ] Flatten gal took : 18 ms
[2024-06-02 22:21:29] [INFO ] Input system was already deterministic with 338 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 130/130 places, 346/346 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 125 transition count 337
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 125 transition count 337
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 125 transition count 334
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 124 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 124 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 123 transition count 329
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 123 transition count 329
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 122 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 122 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 121 transition count 324
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 121 transition count 324
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 120 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 120 transition count 321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 119 transition count 319
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 119 transition count 319
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 118 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 118 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 117 transition count 314
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 117 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 115 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 115 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 114 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 114 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 113 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 113 transition count 305
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 1 with 2 rules applied. Total rules applied 37 place count 112 transition count 304
Applied a total of 37 rules in 25 ms. Remains 112 /130 variables (removed 18) and now considering 304/346 (removed 42) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 112/130 places, 304/346 transitions.
[2024-06-02 22:21:29] [INFO ] Flatten gal took : 8 ms
[2024-06-02 22:21:29] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:21:29] [INFO ] Input system was already deterministic with 304 transitions.
RANDOM walk for 40000 steps (2336 resets) in 225 ms. (176 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1110 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 94611 steps, run visited all 1 properties in 155 ms. (steps per millisecond=610 )
Probabilistic random walk after 94611 steps, saw 19864 distinct states, run finished after 158 ms. (steps per millisecond=598 ) properties seen :1
FORMULA FireWire-PT-09-CTLFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 130/130 places, 346/346 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 125 transition count 337
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 125 transition count 337
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 125 transition count 334
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 124 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 124 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 123 transition count 329
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 123 transition count 329
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 122 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 122 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 121 transition count 324
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 121 transition count 324
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 120 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 120 transition count 321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 119 transition count 319
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 119 transition count 319
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 118 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 118 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 117 transition count 314
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 117 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 115 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 115 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 114 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 114 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 113 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 113 transition count 305
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 1 with 2 rules applied. Total rules applied 37 place count 112 transition count 304
Applied a total of 37 rules in 27 ms. Remains 112 /130 variables (removed 18) and now considering 304/346 (removed 42) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 112/130 places, 304/346 transitions.
[2024-06-02 22:21:29] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:21:29] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:21:29] [INFO ] Input system was already deterministic with 304 transitions.
RANDOM walk for 40000 steps (2365 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (605 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 373261 steps, run visited all 1 properties in 564 ms. (steps per millisecond=661 )
Probabilistic random walk after 373261 steps, saw 79488 distinct states, run finished after 564 ms. (steps per millisecond=661 ) properties seen :1
FORMULA FireWire-PT-09-CTLFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 346/346 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 126 transition count 338
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 126 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 126 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 125 transition count 332
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 125 transition count 332
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 124 transition count 330
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 124 transition count 330
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 123 transition count 327
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 123 transition count 327
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 122 transition count 325
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 122 transition count 325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 121 transition count 322
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 121 transition count 322
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 120 transition count 320
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 120 transition count 320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 119 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 119 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 118 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 118 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 117 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 117 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 116 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 116 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 114 transition count 306
Applied a total of 35 rules in 9 ms. Remains 114 /130 variables (removed 16) and now considering 306/346 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 114/130 places, 306/346 transitions.
[2024-06-02 22:21:30] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:21:30] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:21:30] [INFO ] Input system was already deterministic with 306 transitions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 346/346 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 126 transition count 338
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 126 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 126 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 125 transition count 332
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 125 transition count 332
Applied a total of 13 rules in 2 ms. Remains 125 /130 variables (removed 5) and now considering 332/346 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 125/130 places, 332/346 transitions.
[2024-06-02 22:21:30] [INFO ] Flatten gal took : 8 ms
[2024-06-02 22:21:30] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:21:30] [INFO ] Input system was already deterministic with 332 transitions.
[2024-06-02 22:21:30] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:21:30] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:21:30] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-06-02 22:21:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 130 places, 346 transitions and 1287 arcs took 2 ms.
Total runtime 164483 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running FireWire-PT-09
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 130
TRANSITIONS: 346
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.007s, Sys 0.001s]
SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 744
MODEL NAME: /home/mcc/execution/413/model
130 places, 346 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA FireWire-PT-09-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-09-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-09-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-09-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-09-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-09-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-09-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-09-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-09-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-09-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-09-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-09-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-09-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1717366937063
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-09"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is FireWire-PT-09, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r549-tall-171734898100234"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-09.tgz
mv FireWire-PT-09 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;