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.r553-tall-171734901200218.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is FireWire-PT-07, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r553-tall-171734901200218
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 8.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 8.9K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K 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 97K 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-07-CTLFireability-2024-00
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-01
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-02
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-03
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-04
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-05
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-06
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-07
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-08
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-09
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-10
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-11
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-12
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-13
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-14
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717354325123

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:52:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 18:52:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:52:06] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2024-06-02 18:52:06] [INFO ] Transformed 126 places.
[2024-06-02 18:52:06] [INFO ] Transformed 396 transitions.
[2024-06-02 18:52:06] [INFO ] Found NUPN structural information;
[2024-06-02 18:52:06] [INFO ] Parsed PT model containing 126 places and 396 transitions and 1471 arcs in 178 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Ensure Unique test removed 53 transitions
Reduce redundant transitions removed 53 transitions.
Support contains 73 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 343/343 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 124 transition count 339
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 124 transition count 339
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 124 transition count 338
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 11 place count 124 transition count 332
Applied a total of 11 rules in 32 ms. Remains 124 /126 variables (removed 2) and now considering 332/343 (removed 11) transitions.
[2024-06-02 18:52:06] [INFO ] Flow matrix only has 306 transitions (discarded 26 similar events)
// Phase 1: matrix 306 rows 124 cols
[2024-06-02 18:52:06] [INFO ] Computed 8 invariants in 16 ms
[2024-06-02 18:52:06] [INFO ] Implicit Places using invariants in 219 ms returned []
[2024-06-02 18:52:06] [INFO ] Flow matrix only has 306 transitions (discarded 26 similar events)
[2024-06-02 18:52:06] [INFO ] Invariant cache hit.
[2024-06-02 18:52:06] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 18:52:06] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 444 ms to find 0 implicit places.
Running 331 sub problems to find dead transitions.
[2024-06-02 18:52:06] [INFO ] Flow matrix only has 306 transitions (discarded 26 similar events)
[2024-06-02 18:52:06] [INFO ] Invariant cache hit.
[2024-06-02 18:52:06] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-06-02 18:52:09] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 10 ms to minimize.
[2024-06-02 18:52:09] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 0 ms to minimize.
[2024-06-02 18:52:09] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 2 ms to minimize.
[2024-06-02 18:52:09] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 1 ms to minimize.
[2024-06-02 18:52:09] [INFO ] Deduced a trap composed of 35 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:52:09] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-06-02 18:52:10] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 4 (OVERLAPS) 305/429 variables, 124/139 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/429 variables, 44/183 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/429 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 7 (OVERLAPS) 1/430 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/430 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 9 (OVERLAPS) 0/430 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 331 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 184 constraints, problems are : Problem set: 0 solved, 331 unsolved in 13968 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 331/331 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 331 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 4 (OVERLAPS) 305/429 variables, 124/139 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/429 variables, 44/183 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/429 variables, 331/514 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/429 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 8 (OVERLAPS) 1/430 variables, 1/515 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/430 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-06-02 18:52:39] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/430 variables, 1/516 constraints. Problems are: Problem set: 0 solved, 331 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/430 variables, and 516 constraints, problems are : Problem set: 0 solved, 331 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 331/331 constraints, Known Traps: 8/8 constraints]
After SMT, in 44329ms problems are : Problem set: 0 solved, 331 unsolved
Search for dead transitions found 0 dead transitions in 44347ms
Starting structural reductions in LTL mode, iteration 1 : 124/126 places, 332/343 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44844 ms. Remains : 124/126 places, 332/343 transitions.
Support contains 73 out of 124 places after structural reductions.
[2024-06-02 18:52:51] [INFO ] Flatten gal took : 52 ms
[2024-06-02 18:52:51] [INFO ] Flatten gal took : 26 ms
[2024-06-02 18:52:51] [INFO ] Input system was already deterministic with 332 transitions.
RANDOM walk for 40000 steps (2272 resets) in 1860 ms. (21 steps per ms) remains 37/69 properties
BEST_FIRST walk for 4004 steps (13 resets) in 32 ms. (121 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (55 resets) in 66 ms. (59 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (108 resets) in 28 ms. (138 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (10 resets) in 35 ms. (111 steps per ms) remains 32/37 properties
BEST_FIRST walk for 4002 steps (147 resets) in 52 ms. (75 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (75 resets) in 36 ms. (108 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (16 resets) in 22 ms. (174 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (18 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (57 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (57 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (114 resets) in 36 ms. (108 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (57 resets) in 22 ms. (174 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (107 resets) in 30 ms. (129 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (65 resets) in 12 ms. (307 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (16 resets) in 13 ms. (286 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (14 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (99 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (52 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (82 resets) in 23 ms. (166 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (9 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (105 resets) in 33 ms. (117 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (51 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (63 resets) in 12 ms. (307 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (108 resets) in 13 ms. (285 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (58 resets) in 13 ms. (285 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (138 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (59 resets) in 13 ms. (285 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (8 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (14 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (9 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (150 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (48 resets) in 13 ms. (285 steps per ms) remains 32/32 properties
[2024-06-02 18:52:52] [INFO ] Flow matrix only has 306 transitions (discarded 26 similar events)
[2024-06-02 18:52:52] [INFO ] Invariant cache hit.
[2024-06-02 18:52:52] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
At refinement iteration 1 (OVERLAPS) 77/119 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 4/123 variables, 2/8 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 305/428 variables, 123/131 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/428 variables, 44/175 constraints. Problems are: Problem set: 2 solved, 30 unsolved
[2024-06-02 18:52:53] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/428 variables, 1/176 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/428 variables, 0/176 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 9 (OVERLAPS) 1/429 variables, 1/177 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/429 variables, 0/177 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 11 (OVERLAPS) 1/430 variables, 1/178 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/430 variables, 0/178 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 13 (OVERLAPS) 0/430 variables, 0/178 constraints. Problems are: Problem set: 2 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 178 constraints, problems are : Problem set: 2 solved, 30 unsolved in 1415 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 79/119 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 1/7 constraints. Problems are: Problem set: 2 solved, 30 unsolved
[2024-06-02 18:52:54] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 1 ms to minimize.
[2024-06-02 18:52:54] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 2/9 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 4/123 variables, 2/11 constraints. Problems are: Problem set: 2 solved, 30 unsolved
[2024-06-02 18:52:54] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 1/12 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 305/428 variables, 123/135 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/428 variables, 44/179 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/428 variables, 28/207 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/428 variables, 0/207 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 12 (OVERLAPS) 1/429 variables, 1/208 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/429 variables, 2/210 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/429 variables, 0/210 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 15 (OVERLAPS) 1/430 variables, 1/211 constraints. Problems are: Problem set: 2 solved, 30 unsolved
[2024-06-02 18:52:56] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/430 variables, 1/212 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/430 variables, 0/212 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 18 (OVERLAPS) 0/430 variables, 0/212 constraints. Problems are: Problem set: 2 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 430/430 variables, and 212 constraints, problems are : Problem set: 2 solved, 30 unsolved in 5006 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 30/32 constraints, Known Traps: 5/5 constraints]
After SMT, in 6472ms problems are : Problem set: 2 solved, 30 unsolved
Fused 30 Parikh solutions to 21 different solutions.
Parikh walk visited 4 properties in 2933 ms.
Support contains 36 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 332/332 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 124 transition count 329
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 122 transition count 324
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 122 transition count 324
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 122 transition count 323
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 121 transition count 322
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 120 transition count 324
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 120 transition count 322
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 120 transition count 321
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 16 place count 120 transition count 323
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 3 with 3 rules applied. Total rules applied 19 place count 119 transition count 321
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 21 place count 119 transition count 319
Applied a total of 21 rules in 74 ms. Remains 119 /124 variables (removed 5) and now considering 319/332 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 119/124 places, 319/332 transitions.
RANDOM walk for 40000 steps (2147 resets) in 463 ms. (86 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4002 steps (57 resets) in 12 ms. (307 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (104 resets) in 12 ms. (307 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (146 resets) in 24 ms. (160 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (63 resets) in 13 ms. (285 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (55 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (61 resets) in 13 ms. (285 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (113 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (62 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (109 resets) in 12 ms. (308 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (46 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (14 resets) in 12 ms. (308 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (17 resets) in 12 ms. (308 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (116 resets) in 30 ms. (129 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (50 resets) in 13 ms. (285 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (103 resets) in 13 ms. (285 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (44 resets) in 12 ms. (307 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (53 resets) in 12 ms. (307 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (110 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (124 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (67 resets) in 13 ms. (285 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (23 resets) in 12 ms. (308 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (70 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
Interrupted probabilistic random walk after 610265 steps, run timeout after 3001 ms. (steps per millisecond=203 ) properties seen :17 out of 25
Probabilistic random walk after 610265 steps, saw 137486 distinct states, run finished after 3009 ms. (steps per millisecond=202 ) properties seen :17
[2024-06-02 18:53:05] [INFO ] Flow matrix only has 294 transitions (discarded 25 similar events)
// Phase 1: matrix 294 rows 119 cols
[2024-06-02 18:53:05] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 18:53:05] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 75/93 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 25/118 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 294/412 variables, 118/126 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 45/171 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/412 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 1/413 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/413 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/413 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 172 constraints, problems are : Problem set: 0 solved, 8 unsolved in 324 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 119/119 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 75/93 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 18:53:05] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 2 ms to minimize.
[2024-06-02 18:53:05] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 25/118 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 294/412 variables, 118/128 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/412 variables, 45/173 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/412 variables, 6/179 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/412 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 1/413 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/413 variables, 2/182 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 18:53:06] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/413 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/413 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 0/413 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 413/413 variables, and 183 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1149 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 119/119 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 3/3 constraints]
After SMT, in 1492ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 0 properties in 8780 ms.
Support contains 18 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 319/319 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 116 transition count 312
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 116 transition count 312
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 115 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 115 transition count 309
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 114 transition count 311
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 13 place count 114 transition count 309
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 14 place count 114 transition count 308
Applied a total of 14 rules in 29 ms. Remains 114 /119 variables (removed 5) and now considering 308/319 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 114/119 places, 308/319 transitions.
RANDOM walk for 40000 steps (2167 resets) in 951 ms. (42 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (527 resets) in 62 ms. (634 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (587 resets) in 37 ms. (1052 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (553 resets) in 40 ms. (975 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (65 resets) in 44 ms. (888 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1086 resets) in 46 ms. (851 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (529 resets) in 41 ms. (952 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (505 resets) in 40 ms. (975 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 578598 steps, run timeout after 3001 ms. (steps per millisecond=192 ) properties seen :0 out of 8
Probabilistic random walk after 578598 steps, saw 129868 distinct states, run finished after 3001 ms. (steps per millisecond=192 ) properties seen :0
[2024-06-02 18:53:19] [INFO ] Flow matrix only has 281 transitions (discarded 27 similar events)
// Phase 1: matrix 281 rows 114 cols
[2024-06-02 18:53:19] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 18:53:19] [INFO ] State equation strengthened by 44 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 73/91 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 22/113 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 281/394 variables, 113/121 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 44/165 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 1/395 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/395 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 395/395 variables, and 166 constraints, problems are : Problem set: 0 solved, 8 unsolved in 312 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 114/114 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 73/91 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 18:53:19] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
[2024-06-02 18:53:19] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 22/113 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 18:53:19] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 281/394 variables, 113/124 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 44/168 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/394 variables, 6/174 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/394 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 1/395 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/395 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/395 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 0/395 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 395/395 variables, and 177 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1066 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 114/114 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 3/3 constraints]
After SMT, in 1391ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 0 properties in 5352 ms.
Support contains 18 out of 114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 308/308 transitions.
Applied a total of 0 rules in 19 ms. Remains 114 /114 variables (removed 0) and now considering 308/308 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 114/114 places, 308/308 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 308/308 transitions.
Applied a total of 0 rules in 7 ms. Remains 114 /114 variables (removed 0) and now considering 308/308 (removed 0) transitions.
[2024-06-02 18:53:25] [INFO ] Flow matrix only has 281 transitions (discarded 27 similar events)
[2024-06-02 18:53:25] [INFO ] Invariant cache hit.
[2024-06-02 18:53:25] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-02 18:53:25] [INFO ] Flow matrix only has 281 transitions (discarded 27 similar events)
[2024-06-02 18:53:25] [INFO ] Invariant cache hit.
[2024-06-02 18:53:26] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-02 18:53:26] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2024-06-02 18:53:26] [INFO ] Redundant transitions in 18 ms returned []
Running 307 sub problems to find dead transitions.
[2024-06-02 18:53:26] [INFO ] Flow matrix only has 281 transitions (discarded 27 similar events)
[2024-06-02 18:53:26] [INFO ] Invariant cache hit.
[2024-06-02 18:53:26] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 18:53:27] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 1 ms to minimize.
[2024-06-02 18:53:27] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:53:27] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 2 ms to minimize.
[2024-06-02 18:53:28] [INFO ] Deduced a trap composed of 42 places in 32 ms of which 1 ms to minimize.
[2024-06-02 18:53:28] [INFO ] Deduced a trap composed of 34 places in 30 ms of which 1 ms to minimize.
[2024-06-02 18:53:28] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-06-02 18:53:28] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:53:28] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-06-02 18:53:28] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 281/395 variables, 114/131 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/395 variables, 44/175 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (OVERLAPS) 0/395 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 307 unsolved
No progress, stopping.
After SMT solving in domain Real declared 395/395 variables, and 175 constraints, problems are : Problem set: 0 solved, 307 unsolved in 9672 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 114/114 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 281/395 variables, 114/131 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/395 variables, 44/175 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 307/482 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 18:53:42] [INFO ] Deduced a trap composed of 45 places in 42 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 9 (OVERLAPS) 0/395 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 307 unsolved
No progress, stopping.
After SMT solving in domain Int declared 395/395 variables, and 483 constraints, problems are : Problem set: 0 solved, 307 unsolved in 22907 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 114/114 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 10/10 constraints]
After SMT, in 32799ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 32803ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33057 ms. Remains : 114/114 places, 308/308 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 77 edges and 114 vertex of which 16 / 114 are part of one of the 3 SCC in 2 ms
Free SCC test removed 13 places
Drop transitions (Empty/Sink Transition effects.) removed 40 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 17 place count 101 transition count 220
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 101 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 101 transition count 219
Applied a total of 19 rules in 22 ms. Remains 101 /114 variables (removed 13) and now considering 219/308 (removed 89) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 219 rows 101 cols
[2024-06-02 18:53:58] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 18:53:59] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 18:53:59] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-06-02 18:53:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 18:53:59] [INFO ] After 132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-06-02 18:53:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 18:53:59] [INFO ] After 83ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :8
TRAPS : Iteration 0
[2024-06-02 18:53:59] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:53:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2024-06-02 18:53:59] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2024-06-02 18:53:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
TRAPS : Iteration 1
[2024-06-02 18:53:59] [INFO ] After 439ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
[2024-06-02 18:53:59] [INFO ] After 718ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Over-approximation ignoring read arcs solved 0 properties in 815 ms.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2024-06-02 18:53:59] [INFO ] Flatten gal took : 18 ms
[2024-06-02 18:53:59] [INFO ] Flatten gal took : 20 ms
[2024-06-02 18:53:59] [INFO ] Input system was already deterministic with 332 transitions.
Computed a total of 21 stabilizing places and 45 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 332/332 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 119 transition count 319
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 119 transition count 319
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 119 transition count 317
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 116 transition count 311
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 114 transition count 306
Applied a total of 22 rules in 9 ms. Remains 114 /124 variables (removed 10) and now considering 306/332 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 114/124 places, 306/332 transitions.
[2024-06-02 18:53:59] [INFO ] Flatten gal took : 15 ms
[2024-06-02 18:53:59] [INFO ] Flatten gal took : 16 ms
[2024-06-02 18:53:59] [INFO ] Input system was already deterministic with 306 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 332/332 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 120 transition count 322
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 120 transition count 322
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 120 transition count 320
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 118 transition count 316
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 118 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 117 transition count 313
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 113 transition count 303
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 26 place count 112 transition count 302
Applied a total of 26 rules in 29 ms. Remains 112 /124 variables (removed 12) and now considering 302/332 (removed 30) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29 ms. Remains : 112/124 places, 302/332 transitions.
[2024-06-02 18:53:59] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:54:00] [INFO ] Flatten gal took : 15 ms
[2024-06-02 18:54:00] [INFO ] Input system was already deterministic with 302 transitions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 332/332 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 119 transition count 319
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 119 transition count 319
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 119 transition count 317
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 116 transition count 311
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 107 transition count 289
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 107 transition count 289
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 106 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 106 transition count 287
Applied a total of 38 rules in 15 ms. Remains 106 /124 variables (removed 18) and now considering 287/332 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 106/124 places, 287/332 transitions.
[2024-06-02 18:54:00] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:54:00] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:54:00] [INFO ] Input system was already deterministic with 287 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 332/332 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 118 transition count 318
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 118 transition count 318
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 118 transition count 316
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 115 transition count 310
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 114 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 114 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 113 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 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 24 place count 112 transition count 304
Applied a total of 24 rules in 20 ms. Remains 112 /124 variables (removed 12) and now considering 304/332 (removed 28) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 112/124 places, 304/332 transitions.
[2024-06-02 18:54:00] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:54:00] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:54:00] [INFO ] Input system was already deterministic with 304 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 332/332 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 119 transition count 320
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 119 transition count 320
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 119 transition count 319
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 117 transition count 315
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 117 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 116 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 116 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 115 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 115 transition count 310
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 114 transition count 309
Applied a total of 19 rules in 19 ms. Remains 114 /124 variables (removed 10) and now considering 309/332 (removed 23) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 114/124 places, 309/332 transitions.
[2024-06-02 18:54:00] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:54:00] [INFO ] Flatten gal took : 17 ms
[2024-06-02 18:54:00] [INFO ] Input system was already deterministic with 309 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 332/332 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 119 transition count 319
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 119 transition count 319
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 119 transition count 317
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 117 transition count 313
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 116 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 116 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 114 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 114 transition count 305
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 112 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 112 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 110 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 110 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 107 transition count 289
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 107 transition count 289
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 38 place count 106 transition count 288
Applied a total of 38 rules in 33 ms. Remains 106 /124 variables (removed 18) and now considering 288/332 (removed 44) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33 ms. Remains : 106/124 places, 288/332 transitions.
[2024-06-02 18:54:00] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:54:00] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:54:00] [INFO ] Input system was already deterministic with 288 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 332/332 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 119 transition count 321
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 119 transition count 321
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 119 transition count 319
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 117 transition count 315
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 117 transition count 315
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 16 place count 116 transition count 314
Applied a total of 16 rules in 13 ms. Remains 116 /124 variables (removed 8) and now considering 314/332 (removed 18) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 116/124 places, 314/332 transitions.
[2024-06-02 18:54:00] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:54:00] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:54:00] [INFO ] Input system was already deterministic with 314 transitions.
RANDOM walk for 40000 steps (2332 resets) in 399 ms. (100 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (638 resets) in 172 ms. (231 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2221915 steps, run timeout after 3001 ms. (steps per millisecond=740 ) properties seen :0 out of 1
Probabilistic random walk after 2221915 steps, saw 401135 distinct states, run finished after 3003 ms. (steps per millisecond=739 ) properties seen :0
[2024-06-02 18:54:03] [INFO ] Flow matrix only has 288 transitions (discarded 26 similar events)
// Phase 1: matrix 288 rows 116 cols
[2024-06-02 18:54:03] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 18:54:03] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 63/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 231/296 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 23/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 98/394 variables, 44/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 3/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 18/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/394 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/395 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/395 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/395 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/403 variables, 6/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/403 variables, 2/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/403 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/403 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 403/404 variables, and 165 constraints, problems are : Problem set: 0 solved, 1 unsolved in 120 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 116/116 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 63/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 231/296 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 23/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 98/394 variables, 44/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 3/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 18/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/394 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/394 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/395 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/395 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/395 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/403 variables, 6/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/403 variables, 2/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/403 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/403 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 403/404 variables, and 166 constraints, problems are : Problem set: 0 solved, 1 unsolved in 161 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 116/116 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 292ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 314/314 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 116 transition count 311
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 9 place count 113 transition count 317
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 15 place count 113 transition count 311
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 18 place count 113 transition count 308
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 113 transition count 310
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 22 place count 112 transition count 308
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 24 place count 112 transition count 306
Applied a total of 24 rules in 24 ms. Remains 112 /116 variables (removed 4) and now considering 306/314 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 112/116 places, 306/314 transitions.
RANDOM walk for 4000000 steps (231632 resets) in 7219 ms. (554 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000003 steps (57152 resets) in 2021 ms. (1978 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 4435802 steps, run timeout after 6001 ms. (steps per millisecond=739 ) properties seen :0 out of 1
Probabilistic random walk after 4435802 steps, saw 824181 distinct states, run finished after 6001 ms. (steps per millisecond=739 ) properties seen :0
[2024-06-02 18:54:12] [INFO ] Flow matrix only has 277 transitions (discarded 29 similar events)
// Phase 1: matrix 277 rows 112 cols
[2024-06-02 18:54:12] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 18:54:12] [INFO ] State equation strengthened by 43 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 61/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 225/288 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 23/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 92/380 variables, 42/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 3/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/381 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/381 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/381 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/389 variables, 6/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/389 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/389 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/389 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 163 constraints, problems are : Problem set: 0 solved, 1 unsolved in 115 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 61/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 225/288 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 23/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 92/380 variables, 42/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 3/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/380 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/381 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/381 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/381 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/389 variables, 6/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/389 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/389 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/389 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 389/389 variables, and 164 constraints, problems are : Problem set: 0 solved, 1 unsolved in 159 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 290ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 306/306 transitions.
Applied a total of 0 rules in 5 ms. Remains 112 /112 variables (removed 0) and now considering 306/306 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 112/112 places, 306/306 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 306/306 transitions.
Applied a total of 0 rules in 5 ms. Remains 112 /112 variables (removed 0) and now considering 306/306 (removed 0) transitions.
[2024-06-02 18:54:12] [INFO ] Flow matrix only has 277 transitions (discarded 29 similar events)
[2024-06-02 18:54:12] [INFO ] Invariant cache hit.
[2024-06-02 18:54:12] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-02 18:54:12] [INFO ] Flow matrix only has 277 transitions (discarded 29 similar events)
[2024-06-02 18:54:12] [INFO ] Invariant cache hit.
[2024-06-02 18:54:12] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-02 18:54:12] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
[2024-06-02 18:54:12] [INFO ] Redundant transitions in 5 ms returned []
Running 304 sub problems to find dead transitions.
[2024-06-02 18:54:12] [INFO ] Flow matrix only has 277 transitions (discarded 29 similar events)
[2024-06-02 18:54:12] [INFO ] Invariant cache hit.
[2024-06-02 18:54:12] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-06-02 18:54:13] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 1 ms to minimize.
[2024-06-02 18:54:13] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:54:14] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 2 ms to minimize.
[2024-06-02 18:54:14] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-06-02 18:54:14] [INFO ] Deduced a trap composed of 40 places in 27 ms of which 0 ms to minimize.
[2024-06-02 18:54:14] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:54:14] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:54:14] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-06-02 18:54:14] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:54:14] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-06-02 18:54:15] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 0 ms to minimize.
[2024-06-02 18:54:15] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (OVERLAPS) 277/388 variables, 111/131 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 43/174 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-06-02 18:54:18] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 7 (OVERLAPS) 1/389 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-06-02 18:54:24] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/389 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/389 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 11 (OVERLAPS) 0/389 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 304 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 177 constraints, problems are : Problem set: 0 solved, 304 unsolved in 17777 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 304 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (OVERLAPS) 277/388 variables, 111/133 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 43/176 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 304/480 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 7 (OVERLAPS) 1/389 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 9 (OVERLAPS) 0/389 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 304 unsolved
No progress, stopping.
After SMT solving in domain Int declared 389/389 variables, and 481 constraints, problems are : Problem set: 0 solved, 304 unsolved in 17339 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 14/14 constraints]
After SMT, in 35300ms problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 35305ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35585 ms. Remains : 112/112 places, 306/306 transitions.
RANDOM walk for 400000 steps (23275 resets) in 1582 ms. (252 steps per ms) remains 1/2 properties
Running SMT prover for 1 properties.
[2024-06-02 18:54:48] [INFO ] Flow matrix only has 277 transitions (discarded 29 similar events)
[2024-06-02 18:54:48] [INFO ] Invariant cache hit.
[2024-06-02 18:54:48] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 18:54:48] [INFO ] After 48ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-02 18:54:48] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-02 18:54:48] [INFO ] After 7ms SMT Verify possible using 43 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 18:54:48] [INFO ] After 20ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 18:54:48] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 18:54:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-06-02 18:54:48] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 18:54:48] [INFO ] After 16ms SMT Verify possible using 43 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 18:54:48] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 18:54:48] [INFO ] After 113ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 4000000 steps (231420 resets) in 5734 ms. (697 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000003 steps (57596 resets) in 2006 ms. (1993 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2117801 steps, run timeout after 3001 ms. (steps per millisecond=705 ) properties seen :0 out of 1
Probabilistic random walk after 2117801 steps, saw 428041 distinct states, run finished after 3001 ms. (steps per millisecond=705 ) properties seen :0
[2024-06-02 18:54:53] [INFO ] Flow matrix only has 277 transitions (discarded 29 similar events)
[2024-06-02 18:54:53] [INFO ] Invariant cache hit.
[2024-06-02 18:54:53] [INFO ] State equation strengthened by 43 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 61/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 225/288 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 23/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 92/380 variables, 42/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 3/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/381 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/381 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/381 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/389 variables, 6/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/389 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/389 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/389 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 163 constraints, problems are : Problem set: 0 solved, 1 unsolved in 109 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 61/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 225/288 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 23/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 92/380 variables, 42/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 3/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/380 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/381 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/381 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/381 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/389 variables, 6/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/389 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/389 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/389 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 389/389 variables, and 164 constraints, problems are : Problem set: 0 solved, 1 unsolved in 156 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 272ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 306/306 transitions.
Applied a total of 0 rules in 17 ms. Remains 112 /112 variables (removed 0) and now considering 306/306 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 112/112 places, 306/306 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 306/306 transitions.
Applied a total of 0 rules in 6 ms. Remains 112 /112 variables (removed 0) and now considering 306/306 (removed 0) transitions.
[2024-06-02 18:54:54] [INFO ] Flow matrix only has 277 transitions (discarded 29 similar events)
[2024-06-02 18:54:54] [INFO ] Invariant cache hit.
[2024-06-02 18:54:54] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-02 18:54:54] [INFO ] Flow matrix only has 277 transitions (discarded 29 similar events)
[2024-06-02 18:54:54] [INFO ] Invariant cache hit.
[2024-06-02 18:54:54] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-02 18:54:54] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
[2024-06-02 18:54:54] [INFO ] Redundant transitions in 9 ms returned []
Running 304 sub problems to find dead transitions.
[2024-06-02 18:54:54] [INFO ] Flow matrix only has 277 transitions (discarded 29 similar events)
[2024-06-02 18:54:54] [INFO ] Invariant cache hit.
[2024-06-02 18:54:54] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-06-02 18:54:55] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 1 ms to minimize.
[2024-06-02 18:54:55] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 0 ms to minimize.
[2024-06-02 18:54:55] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:54:55] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2024-06-02 18:54:55] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 0 ms to minimize.
[2024-06-02 18:54:55] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 2 ms to minimize.
[2024-06-02 18:54:55] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:54:56] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:54:56] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:54:56] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-06-02 18:54:56] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-06-02 18:54:56] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (OVERLAPS) 277/388 variables, 111/131 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 43/174 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-06-02 18:55:00] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 7 (OVERLAPS) 1/389 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-06-02 18:55:05] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/389 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/389 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 11 (OVERLAPS) 0/389 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 304 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 177 constraints, problems are : Problem set: 0 solved, 304 unsolved in 17438 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 304 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (OVERLAPS) 277/388 variables, 111/133 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 43/176 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 304/480 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 7 (OVERLAPS) 1/389 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 9 (OVERLAPS) 0/389 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 304 unsolved
No progress, stopping.
After SMT solving in domain Int declared 389/389 variables, and 481 constraints, problems are : Problem set: 0 solved, 304 unsolved in 17838 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 14/14 constraints]
After SMT, in 35456ms problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 35458ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35744 ms. Remains : 112/112 places, 306/306 transitions.
RANDOM walk for 400000 steps (23127 resets) in 699 ms. (571 steps per ms) remains 1/2 properties
Running SMT prover for 1 properties.
[2024-06-02 18:55:30] [INFO ] Flow matrix only has 277 transitions (discarded 29 similar events)
[2024-06-02 18:55:30] [INFO ] Invariant cache hit.
[2024-06-02 18:55:30] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 18:55:30] [INFO ] After 48ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-02 18:55:30] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-02 18:55:30] [INFO ] After 7ms SMT Verify possible using 43 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 18:55:30] [INFO ] After 21ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 18:55:30] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 18:55:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 18:55:30] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 18:55:30] [INFO ] After 23ms SMT Verify possible using 43 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 18:55:30] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 18:55:30] [INFO ] After 121ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 94 steps (2 resets) in 4 ms. (18 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (2328 resets) in 235 ms. (169 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (577 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2125931 steps, run timeout after 3001 ms. (steps per millisecond=708 ) properties seen :0 out of 1
Probabilistic random walk after 2125931 steps, saw 429458 distinct states, run finished after 3002 ms. (steps per millisecond=708 ) properties seen :0
[2024-06-02 18:55:33] [INFO ] Flow matrix only has 277 transitions (discarded 29 similar events)
[2024-06-02 18:55:33] [INFO ] Invariant cache hit.
[2024-06-02 18:55:33] [INFO ] State equation strengthened by 43 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 148/199 variables, 51/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 100/299 variables, 17/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 23/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/301 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/301 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/301 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 82/383 variables, 38/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/383 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/383 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/383 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/389 variables, 4/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/389 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/389 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/389 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 163 constraints, problems are : Problem set: 0 solved, 1 unsolved in 115 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 148/199 variables, 51/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 100/299 variables, 17/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 23/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/299 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/301 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/301 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/301 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 82/383 variables, 38/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/383 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/383 variables, 20/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/383 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/389 variables, 4/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/389 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/389 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/389 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 389/389 variables, and 164 constraints, problems are : Problem set: 0 solved, 1 unsolved in 146 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 279ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 306/306 transitions.
Applied a total of 0 rules in 5 ms. Remains 112 /112 variables (removed 0) and now considering 306/306 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 112/112 places, 306/306 transitions.
RANDOM walk for 40000 steps (2368 resets) in 96 ms. (412 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (579 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2039587 steps, run timeout after 3001 ms. (steps per millisecond=679 ) properties seen :0 out of 1
Probabilistic random walk after 2039587 steps, saw 414595 distinct states, run finished after 3001 ms. (steps per millisecond=679 ) properties seen :0
[2024-06-02 18:55:36] [INFO ] Flow matrix only has 277 transitions (discarded 29 similar events)
[2024-06-02 18:55:36] [INFO ] Invariant cache hit.
[2024-06-02 18:55:36] [INFO ] State equation strengthened by 43 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 148/199 variables, 51/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 100/299 variables, 17/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 23/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/301 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/301 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/301 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 82/383 variables, 38/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/383 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/383 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/383 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/389 variables, 4/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/389 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/389 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/389 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 163 constraints, problems are : Problem set: 0 solved, 1 unsolved in 106 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 148/199 variables, 51/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 100/299 variables, 17/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 23/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/299 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/301 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/301 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/301 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 82/383 variables, 38/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/383 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/383 variables, 20/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/383 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/389 variables, 4/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/389 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/389 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/389 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 389/389 variables, and 164 constraints, problems are : Problem set: 0 solved, 1 unsolved in 158 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 271ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 306/306 transitions.
Applied a total of 0 rules in 5 ms. Remains 112 /112 variables (removed 0) and now considering 306/306 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 112/112 places, 306/306 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 306/306 transitions.
Applied a total of 0 rules in 6 ms. Remains 112 /112 variables (removed 0) and now considering 306/306 (removed 0) transitions.
[2024-06-02 18:55:37] [INFO ] Flow matrix only has 277 transitions (discarded 29 similar events)
[2024-06-02 18:55:37] [INFO ] Invariant cache hit.
[2024-06-02 18:55:37] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-02 18:55:37] [INFO ] Flow matrix only has 277 transitions (discarded 29 similar events)
[2024-06-02 18:55:37] [INFO ] Invariant cache hit.
[2024-06-02 18:55:37] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-02 18:55:37] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2024-06-02 18:55:37] [INFO ] Redundant transitions in 2 ms returned []
Running 304 sub problems to find dead transitions.
[2024-06-02 18:55:37] [INFO ] Flow matrix only has 277 transitions (discarded 29 similar events)
[2024-06-02 18:55:37] [INFO ] Invariant cache hit.
[2024-06-02 18:55:37] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-06-02 18:55:38] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:55:38] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2024-06-02 18:55:38] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:55:38] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 0 ms to minimize.
[2024-06-02 18:55:38] [INFO ] Deduced a trap composed of 40 places in 28 ms of which 1 ms to minimize.
[2024-06-02 18:55:38] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:55:38] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-02 18:55:39] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-06-02 18:55:39] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-06-02 18:55:39] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-06-02 18:55:39] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
[2024-06-02 18:55:39] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (OVERLAPS) 277/388 variables, 111/131 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 43/174 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-06-02 18:55:43] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 7 (OVERLAPS) 1/389 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-06-02 18:55:49] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/389 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/389 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 11 (OVERLAPS) 0/389 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 304 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 177 constraints, problems are : Problem set: 0 solved, 304 unsolved in 17808 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 304 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (OVERLAPS) 277/388 variables, 111/133 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 43/176 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 304/480 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 7 (OVERLAPS) 1/389 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 9 (OVERLAPS) 0/389 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 304 unsolved
No progress, stopping.
After SMT solving in domain Int declared 389/389 variables, and 481 constraints, problems are : Problem set: 0 solved, 304 unsolved in 17389 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 14/14 constraints]
After SMT, in 35369ms problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 35373ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35640 ms. Remains : 112/112 places, 306/306 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 113 edges and 112 vertex of which 29 / 112 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 119 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 126 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 86 transition count 179
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 86 transition count 176
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 85 transition count 175
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 85 transition count 174
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 84 transition count 173
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 12 place count 83 transition count 146
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 83 transition count 146
Free-agglomeration rule applied 3 times with reduction of 2 identical transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 83 transition count 141
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 80 transition count 140
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 80 transition count 140
Applied a total of 22 rules in 23 ms. Remains 80 /112 variables (removed 32) and now considering 140/306 (removed 166) transitions.
Running SMT prover for 1 properties.
[2024-06-02 18:56:12] [INFO ] Flow matrix only has 138 transitions (discarded 2 similar events)
// Phase 1: matrix 138 rows 80 cols
[2024-06-02 18:56:12] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:56:12] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 18:56:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 18:56:13] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 18:56:13] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 0 ms to minimize.
[2024-06-02 18:56:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
TRAPS : Iteration 1
[2024-06-02 18:56:13] [INFO ] After 149ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 18:56:13] [INFO ] After 201ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 335 ms.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 112 edges and 112 vertex of which 29 / 112 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 119 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 126 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 86 transition count 179
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 86 transition count 176
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 85 transition count 175
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 85 transition count 174
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 84 transition count 173
Free-agglomeration rule applied 3 times with reduction of 2 identical transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 84 transition count 168
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 18 place count 81 transition count 167
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 81 transition count 167
Applied a total of 20 rules in 20 ms. Remains 81 /112 variables (removed 31) and now considering 167/306 (removed 139) transitions.
Running SMT prover for 1 properties.
[2024-06-02 18:56:13] [INFO ] Flow matrix only has 165 transitions (discarded 2 similar events)
// Phase 1: matrix 165 rows 81 cols
[2024-06-02 18:56:13] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:56:13] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 18:56:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 18:56:13] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 18:56:13] [INFO ] After 44ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 18:56:13] [INFO ] After 76ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 163 ms.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 332/332 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 119 transition count 319
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 119 transition count 319
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 119 transition count 317
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 116 transition count 311
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 107 transition count 289
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 107 transition count 289
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 106 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 106 transition count 287
Applied a total of 38 rules in 18 ms. Remains 106 /124 variables (removed 18) and now considering 287/332 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 106/124 places, 287/332 transitions.
[2024-06-02 18:56:13] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:56:13] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:56:13] [INFO ] Input system was already deterministic with 287 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 332/332 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 118 transition count 318
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 118 transition count 318
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 118 transition count 316
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 116 transition count 312
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 116 transition count 312
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 18 place count 115 transition count 311
Applied a total of 18 rules in 11 ms. Remains 115 /124 variables (removed 9) and now considering 311/332 (removed 21) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 115/124 places, 311/332 transitions.
[2024-06-02 18:56:13] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:56:13] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:56:13] [INFO ] Input system was already deterministic with 311 transitions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 332/332 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 119 transition count 319
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 119 transition count 319
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 119 transition count 317
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 116 transition count 311
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 113 transition count 303
Applied a total of 24 rules in 7 ms. Remains 113 /124 variables (removed 11) and now considering 303/332 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 113/124 places, 303/332 transitions.
[2024-06-02 18:56:13] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:56:13] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:56:13] [INFO ] Input system was already deterministic with 303 transitions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 332/332 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 120 transition count 322
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 120 transition count 322
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 120 transition count 320
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 118 transition count 316
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 118 transition count 316
Applied a total of 14 rules in 3 ms. Remains 118 /124 variables (removed 6) and now considering 316/332 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 118/124 places, 316/332 transitions.
[2024-06-02 18:56:13] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:56:13] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:56:13] [INFO ] Input system was already deterministic with 316 transitions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 332/332 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 119 transition count 319
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 119 transition count 319
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 119 transition count 317
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 116 transition count 311
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 107 transition count 289
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 107 transition count 289
Applied a total of 36 rules in 13 ms. Remains 107 /124 variables (removed 17) and now considering 289/332 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 107/124 places, 289/332 transitions.
[2024-06-02 18:56:13] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:56:13] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:56:13] [INFO ] Input system was already deterministic with 289 transitions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 332/332 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 119 transition count 319
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 119 transition count 319
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 119 transition count 317
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 116 transition count 311
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 107 transition count 289
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 107 transition count 289
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 106 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 106 transition count 287
Applied a total of 38 rules in 14 ms. Remains 106 /124 variables (removed 18) and now considering 287/332 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 106/124 places, 287/332 transitions.
[2024-06-02 18:56:13] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:56:13] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:56:13] [INFO ] Input system was already deterministic with 287 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 332/332 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 118 transition count 318
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 118 transition count 318
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 118 transition count 316
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 115 transition count 310
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 114 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 114 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 113 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 113 transition count 305
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 112 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 112 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 111 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 111 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 110 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 110 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 109 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 109 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 108 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 108 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 107 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 107 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 106 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 106 transition count 288
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 105 transition count 286
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 105 transition count 286
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 40 place count 104 transition count 285
Applied a total of 40 rules in 25 ms. Remains 104 /124 variables (removed 20) and now considering 285/332 (removed 47) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 104/124 places, 285/332 transitions.
[2024-06-02 18:56:13] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:56:13] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:56:13] [INFO ] Input system was already deterministic with 285 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 332/332 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 118 transition count 318
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 118 transition count 318
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 118 transition count 316
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 115 transition count 310
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 114 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 114 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 113 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 113 transition count 305
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 112 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 112 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 111 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 111 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 110 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 110 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 109 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 109 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 108 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 108 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 107 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 107 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 106 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 106 transition count 288
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 105 transition count 286
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 105 transition count 286
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 40 place count 104 transition count 285
Applied a total of 40 rules in 24 ms. Remains 104 /124 variables (removed 20) and now considering 285/332 (removed 47) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 104/124 places, 285/332 transitions.
[2024-06-02 18:56:13] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:56:13] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:56:13] [INFO ] Input system was already deterministic with 285 transitions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 332/332 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 121 transition count 324
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 121 transition count 324
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 121 transition count 323
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 119 transition count 319
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 119 transition count 319
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 118 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 118 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 117 transition count 314
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 117 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 115 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 115 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 113 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 113 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 111 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 111 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 110 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 110 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 109 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 109 transition count 295
Applied a total of 31 rules in 13 ms. Remains 109 /124 variables (removed 15) and now considering 295/332 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 109/124 places, 295/332 transitions.
[2024-06-02 18:56:13] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:56:13] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:56:13] [INFO ] Input system was already deterministic with 295 transitions.
[2024-06-02 18:56:13] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:56:13] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:56:13] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-06-02 18:56:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 124 places, 332 transitions and 1227 arcs took 4 ms.
Total runtime 247653 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : FireWire-PT-07-CTLFireability-2024-00
Could not compute solution for formula : FireWire-PT-07-CTLFireability-2024-01
Could not compute solution for formula : FireWire-PT-07-CTLFireability-2024-02
Could not compute solution for formula : FireWire-PT-07-CTLFireability-2024-03
Could not compute solution for formula : FireWire-PT-07-CTLFireability-2024-04
Could not compute solution for formula : FireWire-PT-07-CTLFireability-2024-05
Could not compute solution for formula : FireWire-PT-07-CTLFireability-2024-06
Could not compute solution for formula : FireWire-PT-07-CTLFireability-2024-07
Could not compute solution for formula : FireWire-PT-07-CTLFireability-2024-08
Could not compute solution for formula : FireWire-PT-07-CTLFireability-2024-09
Could not compute solution for formula : FireWire-PT-07-CTLFireability-2024-10
Could not compute solution for formula : FireWire-PT-07-CTLFireability-2024-11
Could not compute solution for formula : FireWire-PT-07-CTLFireability-2024-12
Could not compute solution for formula : FireWire-PT-07-CTLFireability-2024-13
Could not compute solution for formula : FireWire-PT-07-CTLFireability-2024-14
Could not compute solution for formula : FireWire-PT-07-CTLFireability-2024-15

BK_STOP 1717354574259

--------------------
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
mcc2024
ctl formula name FireWire-PT-07-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/912/ctl_0_
ctl formula name FireWire-PT-07-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/912/ctl_1_
ctl formula name FireWire-PT-07-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/912/ctl_2_
ctl formula name FireWire-PT-07-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/912/ctl_3_
ctl formula name FireWire-PT-07-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/912/ctl_4_
ctl formula name FireWire-PT-07-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/912/ctl_5_
ctl formula name FireWire-PT-07-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/912/ctl_6_
ctl formula name FireWire-PT-07-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/912/ctl_7_
ctl formula name FireWire-PT-07-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/912/ctl_8_
ctl formula name FireWire-PT-07-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/912/ctl_9_
ctl formula name FireWire-PT-07-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/912/ctl_10_
ctl formula name FireWire-PT-07-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/912/ctl_11_
ctl formula name FireWire-PT-07-CTLFireability-2024-12
ctl formula formula --ctl=/tmp/912/ctl_12_
ctl formula name FireWire-PT-07-CTLFireability-2024-13
ctl formula formula --ctl=/tmp/912/ctl_13_
ctl formula name FireWire-PT-07-CTLFireability-2024-14
ctl formula formula --ctl=/tmp/912/ctl_14_
ctl formula name FireWire-PT-07-CTLFireability-2024-15
ctl formula formula --ctl=/tmp/912/ctl_15_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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-07"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is FireWire-PT-07, 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 r553-tall-171734901200218"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-07.tgz
mv FireWire-PT-07 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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;